Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Signal Processing

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 241 - 247 of 247

Full-Text Articles in Computer Engineering

Implementation Of Large Neural Networks Using Decomposition, Henry Selvaraj, H. Niewiadomski, P. Buciak, M. Pleban, Piotr Sapiecha, Tadeusz Luba, Venkatesan Muthukumar Jun 2002

Implementation Of Large Neural Networks Using Decomposition, Henry Selvaraj, H. Niewiadomski, P. Buciak, M. Pleban, Piotr Sapiecha, Tadeusz Luba, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

The article presents methods of dealing with huge data in the domain of neural networks. The decomposition of neural networks is introduced and its efficiency is proved by the authors’ experiments. The examinations of the effectiveness of argument reduction in the above filed, are presented. Authors indicate, that decomposition is capable of reducing the size and the complexity of the learned data, and thus it makes the learning process faster or, while dealing with large data, possible. According to the authors experiments, in some cases, argument reduction, makes the learning process harder.

Go to article

Wavelet Domain Communication System (Wdcs): Packet-Based Wavelet Spectral Estimation And M-Ary Signaling, Marion Jay F. Lee Mar 2002

Wavelet Domain Communication System (Wdcs): Packet-Based Wavelet Spectral Estimation And M-Ary Signaling, Marion Jay F. Lee

Theses and Dissertations

A recently proposed Wavelet Domain Communication System (WDCS) using transform domain processing demonstrated excellent interference avoidance capability under adverse environmental conditions. This work extends previous results by: 1) incorporating a wavelet packet decomposition technique, 2) demonstrating M-Ary signaling capability, and 3) providing increased adaptivity over a larger class of interference signals. The newly proposed packet-based WDCS is modeled and its performance characterized using MATLAB®. In addition, the WDCS response to two scenarios simulating Doppler effects and physical separation of transceivers are obtained. The fundamental metric for analysis and performance evaluation is bit error rate (Pb). Relative to …

Go to article

Joint Wavelet Transform Correlation With Separated Target And Reference Planes, Boon Yi Soon, Mohammad A. Karim, Russell C. Hardie, Mohammad S. Alam Mar 1998

Joint Wavelet Transform Correlation With Separated Target And Reference Planes, Boon Yi Soon, Mohammad A. Karim, Russell C. Hardie, Mohammad S. Alam

Electrical and Computer Engineering Faculty Publications

In recent years, we realize the usefulness of feature extraction for optical correlator and hereby, we investigate the capability of Laplace operator in feature extraction of multiple targets. The first-order terms and the false alarm terms in the correlation output would be removed using electronic power spectrum subtraction technique. Most importantly, the entire magneto-optic SLM is completely utilized for displaying only targets in the input scene. A new cost efficient hardware implementation is proposed and aforementioned result of the proposed system is evaluated through computer simulation.

Go to article

A Comparative Analysis Of Networks Of Workstations And Massively Parallel Processors For Signal Processing, David C. Gindhart Dec 1997

A Comparative Analysis Of Networks Of Workstations And Massively Parallel Processors For Signal Processing, David C. Gindhart

Theses and Dissertations

The traditional approach to parallel processing has been to use Massively Parallel Processors (MPPs). An alternative design is commercial-off-the-shelf (COTS) workstations connected to high-speed networks. These networks of workstations (NOWs) typically have faster processors, heterogeneous environments, and most importantly, offer a lower per node cost. This thesis compares the performance of MPPs and NOWs for the two-dimensional fast Fourier transform (2-D FFT). Three original, high-performance, portable 2-D FFTs have been implemented: the vector-radix, row-column and pipeline. The performance of these algorithms was measured on the Intel Paragon, IBM SP2 and the AFIT NOW, which consists of 6 Sun Ultra workstations …

Go to article

Detection For A Statistically-Known, Time-Varying Dispersive Channel, David W. Matolak, S. G. Wilson Dec 1996

Detection For A Statistically-Known, Time-Varying Dispersive Channel, David W. Matolak, S. G. Wilson

Faculty Publications

Detection for the statistically known channel (SKC) is aimed at obtaining good performance in situations where our statistical knowledge of a time-varying channel is good, and where other equalization/detection schemes are either too complex to implement, or their performance is limited due to the rapidity of channel fading, or where we are simply unable to perform channel estimation. By using a statistical characterization of the channel, we develop a new detector that performs maximum-likelihood sequence estimation (MLSE) (given the channel model) on blocks of N symbols. Both symbol-spaced and fractionally spaced samples are used, to obtain two different detectors, that …

Go to article

Linda Jacobson Interview Virtual Reality Evangelist, Loretta L. Lange Sep 1995

Linda Jacobson Interview Virtual Reality Evangelist, Loretta L. Lange

SWITCH

In the interview with Linda Jacobson, a Virtual Reality (VR) artist, Jacobson discusses the current and future state of VR technology’s role in the politics of the body, social identity, self, gender, class, and race. This article discusses the fact that barriers to access exist for a more diverse set of artists across race, class, and gender to engage with VR technology and the need to evolve the development platform, so artists can implement their ideas in a low-cost way. The author discusses Jaron Lanier’s ideas about using VR to explore other identities based on a theatrical model where the …

Go to article

A General Approach To Boolean Function Decomposition And Its Application In Fpgabased Synthesis, Tadeusz Luba, Henry Selvaraj Jan 1995

A General Approach To Boolean Function Decomposition And Its Application In Fpgabased Synthesis, Tadeusz Luba, Henry Selvaraj

Electrical & Computer Engineering Faculty Research

An effective logic synthesis procedure based on parallel and serial decomposition of a Boolean function is presented in this paper. The decomposition, carried out as the very first step of the .synthesis process, is based on an original representation of the function by a set of r-partitions over the set of minterms. Two different decomposition strategies, namely serial and parallel, are exploited by striking a balance between the two ideas. The presented procedure can be applied to completely or incompletely specified, single- or multiple-output functions and is suitable for different types of FPGAs including XILINX, ACTEL and ALGOTRONIX devices. The …

Go to article

First Prev