# IEEE Transactions on Acoustics, Speech, and Signal Processing

## Filter Results

Displaying Results 1 - 25 of 28
• ### Comments on "Subband coding of images

Publication Year: 1988, Page(s):1089 - 1090
| |PDF (198 KB)

The commenter feels that an equation in the above named work by J.W. Woods and S. O'Neil (ibid., vol. ASSP-34, pp. 1278-1288, Oct. 1986) is incorrect as given. A corrected version is provided along with another equation, which together allow one to obtain another equation as originally stated. The analysis following the equation remains valid.<> View full abstract»

• ### Implementing neural nets with programmable logic

Publication Year: 1988, Page(s):1180 - 1190
Cited by:  Papers (20)  |  Patents (66)
| |PDF (1227 KB)

Networks of Boolean programmable logic modules are presented as one purely digital class of artificial neural nets. The approach contrasts with the continuous analog framework usually suggested. Programmable logic networks are capable of handling many neural net applications. They avoid some of the limitations of threshold logic networks and present distinct opportunities. The network nodes are ca... View full abstract»

• ### Finite limiting effects for a band-limited Gaussian random process with applications to A/D conversion

Publication Year: 1988, Page(s):1011 - 1016
Cited by:  Papers (12)  |  Patents (1)
| |PDF (524 KB)

The theory of finite limiting effects for a bandlimited Gaussian random process is reviewed and a mathematical expression for the asymptotic distortion spectrum is derived which is accurate for frequencies outside of the original bandwidth. An expression is also derived for the total distortion power which is shown to be useful for estimating the aliased distortion spectrum when sampling is used t... View full abstract»

• ### Layered neural nets for pattern recognition

Publication Year: 1988, Page(s):1109 - 1118
Cited by:  Papers (239)  |  Patents (27)
| |PDF (792 KB)

A pattern recognition concept involving first an invariance net' and second a trainable classifier' is proposed. The invariance net can be trained or designed to produce a set of outputs that are insensitive to translation, rotation, scale change, perspective change, etc., of the retinal input pattern. The outputs of the invariance net are scrambled, however. When these outputs are fed to a trai... View full abstract»

• ### Measurement of echo path response

Publication Year: 1988, Page(s):1008 - 1010
Cited by:  Papers (9)  |  Patents (1)
| |PDF (712 KB)

A method is presented to measure the echo path response using pseudonoise sequences. The autocorrelation properties of these sequences are shown to reduce the error in measurement. The optimal choice of taps to achieve echo cancellation is evaluated. This scheme is compared to the LMS adaptive algorithm. The LMS algorithm can achieve the same level of cancellation with proper choice of μ. Howev... View full abstract»

• ### Applications of neural-network (NN) signal processing in brain research

Publication Year: 1988, Page(s):1152 - 1161
Cited by:  Papers (36)  |  Patents (2)
| |PDF (808 KB)

The application is reviewed of neural-network (NN) signal processing methods to neurological waveform detection and pattern analysis. NN methods are shown to be an excellent way of incorporating expert knowledge about the brain into a mathematical framework with minimal assumptions about the statistics of signal and noise. Constrained by expert knowledge, NN algorithms can search for optimal and n... View full abstract»

• ### An efficient Fourier transform algorithm for frequency domains of several decades using logarithmically spaced time samples

Publication Year: 1988, Page(s):1096 - 1099
Cited by:  Papers (10)
| |PDF (252 KB)

Discrete Fourier transforms are derived which allow the use of nonequally spaced time-domain samples. It is shown that the use of equal spacings in the logarithmic time and frequency domains provides a very efficient transform algorithm. The applicability of this algorithm for the analysis of systems with moderate dynamic behavior over several frequency decades is demonstrated by examples. An erro... View full abstract»

• ### Phase reconstruction/unwrapping from amplitude for diffracted waves using a perturbation solution for the wave equation

Publication Year: 1988, Page(s):1076 - 1085
Cited by:  Papers (3)
| |PDF (848 KB)

A scheme is presented to recover the phase of a diffracted wave from the knowledge of its amplitude. The Helmholtz wave equation is utilized to relate the phase and amplitude of a diffracted wave; this relationship is the basis of a perturbation solution for the phase function. Signal processing issues associated with the implementation of the scheme are discussed. Applications of the method in ce... View full abstract»

• ### Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression

Publication Year: 1988, Page(s):1169 - 1179
Cited by:  Papers (916)  |  Patents (54)
| |PDF (1592 KB)

A three-layered neural network is described for transforming two-dimensional discrete signals into generalized nonorthogonal 2-D Gabor representations for image analysis, segmentation, and compression. These transforms are conjoint spatial/spectral representations, which provide a complete image description in terms of locally windowed 2-D spectral coordinates embedded within global 2-D spatial co... View full abstract»

• ### A note on the convergence analysis of LMS adaptive filters with Gaussian data

Publication Year: 1988, Page(s):1087 - 1089
Cited by:  Papers (20)
| |PDF (264 KB)

Necessary and sufficient conditions for the convergence of LMS (least-mean-squares) adaptive filters with Gaussian data have been established by L.L. Horowitz and K.D. Senne (1981), with the recent support of A. Feuer and E. Weinstein (1985). A feature of both of these studies is the necessity to investigate bounds on the roots of rather unwieldy characteristic equations. The authors show how such... View full abstract»

• ### A weighted normalized frequency domain LMS adaptive algorithm

Publication Year: 1988, Page(s):1002 - 1007
Cited by:  Papers (14)
| |PDF (416 KB)

A general filtering scheme is presented for obtaining an input power estimate for setting the convergence parameter μ separately in each frequency bin of a frequency-domain LMS adaptive filter (FDAF) algorithm. A linear filtering operation is performed on the magnitude square of the input data and incorporated directly into the algorithm as a data-dependent time-varying stochastic μ(n View full abstract»

• ### Image restoration using a neural network

Publication Year: 1988, Page(s):1141 - 1151
Cited by:  Papers (223)  |  Patents (5)
| |PDF (1004 KB)

An approach for restoration of gray level images degraded by a known shift invariant blur function and additive noise is presented using a neural computational network. A neural network model is used to represent a possibly nonstationary image whose gray level function is the simple sum of the neuron state variables. The restoration procedure consists of two stages: estimation of the parameters of... View full abstract»

• ### Unified derivation and initial convergence of three prewindowed fast transversal recursive least squares algorithms

Publication Year: 1988, Page(s):1091 - 1096
Cited by:  Papers (3)
| |PDF (448 KB)

Three prewindowed transversal fast RLS (recursive least-squares) algorithms, the FK (fast Kalman), FAEST (fast a posteriori estimation sequential technique), and FTF (fast transversal filter) algorithms, are derived in a unified approach. It is shown that their mathematical equivalence can be established only by properly choosing their initial conditions. It is confirmed by computer simulations th... View full abstract»

• ### Digital reconstruction of three-dimensional serially sectioned optical images

Publication Year: 1988, Page(s):1067 - 1075
Cited by:  Papers (15)
| |PDF (1412 KB)

The nature of out-of-focus noise is analyzed and linear filtering approaches are demonstrated for minimizing its effect. The analysis is based on concepts of geometrical optics, and takes into account the passage of light through the object. The object is assumed to be nondiffractive and to have low contrast. These assumptions, although not usually met in practice, are not overly restrictive. Expe... View full abstract»

• ### Hidden Markov model for Mandarin lexical tone recognition

Publication Year: 1988, Page(s):988 - 992
Cited by:  Papers (42)  |  Patents (16)
| |PDF (424 KB)

A case of lexical tone recognition for Mandarin speech is discussed using a combination of vector quantization and hidden Markov modelling techniques. The observation sequence was a sequence of vectorized parameters consisting of a logarithmic pitch interval and its first derivative. The vector quantization was applied to convert the observation sequence into a symbol sequence for Hidden Markov mo... View full abstract»

• ### Fast reconstruction of linearly distorted signals

Publication Year: 1988, Page(s):1017 - 1025
Cited by:  Papers (11)
| |PDF (788 KB)

A product expansion of the inverse operator is used to derive a class of iterative algorithms that have a pth-order rate of convergence. Compared to the linear algorithm, the number of iterations required to obtain a given reconstruction is reduced from pn to n. The primary difference between these algorithms and the linear algorithm is that they update both t... View full abstract»

• ### An analog electronic cochlea

Publication Year: 1988, Page(s):1119 - 1134
Cited by:  Papers (208)  |  Patents (6)
| |PDF (1584 KB)

An analog electronic cochlea has been built in CMOS VLSI technology using micropower techniques. The key point of the model and circuit is that a cascade of simple, nearly linear, second-order filter stages with controllable Q parameters suffices to capture the physics of the fluid-dynamic traveling-wave system in the cochlea, including the effects of adaptation and active gain involving ... View full abstract»

• ### Experiments on neural net recognition of spoken and written text

Publication Year: 1988, Page(s):1162 - 1168
Cited by:  Papers (153)  |  Patents (3)
| |PDF (628 KB)

The problems are discussed of the recognition of handprinted and spoken digits and the handprinted and spoken English alphabet. Four such experiments were conducted and the results were compared to a conventional nearest-neighbor classifier trained on the same data. Results indicate that neural networks and nearest-neighbor classifiers perform at near the same level of accuracy. For each task, a c... View full abstract»

• ### Unscrambling for fast DFT algorithms

Publication Year: 1988, Page(s):1086 - 1087
Cited by:  Papers (23)
| |PDF (196 KB)

Several methods are reviewed for removing the unscrambler in the prime factor algorithms (PFA) and the types of unscrambler necessary for the Cooley-Tukey FFT (fast Fourier transform) are discussed. It is shown that a radix-4, radix-8, radix-16, or any radix-2m FFT can be written to give the output in the same bit-reversed order as the radix-2 FFT. This applies to programs which mix rad... View full abstract»

• ### Comparison between some stability criteria of discrete-time filters

Publication Year: 1988, Page(s):993 - 1001
Cited by:  Papers (14)
| |PDF (656 KB)

Routh's algorithm is written in the form of polynomial recursion and transposed for testing stability in the wide sense of discrete-time linear systems. The algorithm obtained is a three-term recursion of symmetric polynomials. This recursion easily gives both the coefficients appearing in the continued fraction expansion associated to a given polynomial in the z-domain, and a computation... View full abstract»

• ### Perturbation analysis of an SVD-based linear prediction method for estimating the frequencies of multiple sinusoids

Publication Year: 1988, Page(s):1026 - 1035
Cited by:  Papers (37)
| |PDF (668 KB)

A linear prediction approach is studied for estimating the frequencies of sinusoids in white noise. It is shown that in the first step, the continuity of the generalized inverse and the concept of angle between subspaces play an important role. The continuity concept helps explain the need for a low rank approximation, and the quality of the approximation is appraised by using the notion of angle ... View full abstract»

• ### Learned classification of sonar targets using a massively parallel network

Publication Year: 1988, Page(s):1135 - 1140
Cited by:  Papers (150)  |  Patents (35)
| |PDF (532 KB)

Massively parallel learning networks are applied to the classification of sonar returns from two undersea targets and the ability of networks to correctly classify both training and testing examples is studied. Networks with an intermediate layer of hidden processing units achieved a classification accuracy as high as 100% on a training set of 104 returns. These networks correctly classified a tes... View full abstract»

• ### Broad-band signal-subspace spatial-spectrum (BASS-ALE) estimation

Publication Year: 1988, Page(s):953 - 964
Cited by:  Papers (98)
| |PDF (980 KB)

An approach to spatial-spectrum estimation of broadband sources is described. The approach, termed broadband signal-subspace spatial spectrum (BASS-ALE) estimation, is based on the eigenstructure of a broadband spatial/temporal covariance matrix and is justified by identifying the low-rank character of spatial/temporal observations of broadband sources. BASS-ALE estimators are described which inco... View full abstract»

• ### Separation of 2-D nonsingular MIMO digital filters into a cascade of 1-D filters

Publication Year: 1988, Page(s):1090 - 1091
Cited by:  Papers (1)
| |PDF (164 KB)

A simple algebraic criterion is presented to check if a given 2-D MIMO (multi-input/multioutput) filter described by a nonsingular transfer matrix is in fact a cascade of two 1-D filters with a minimal number of inputs and outputs. The criterion offers the advantage that whenever a filter is found to be separable, it is almost trivial to construct the two 1-D filters View full abstract»

• ### A new efficient algorithm to compute the two-dimensional discrete Fourier transform

Publication Year: 1988, Page(s):1036 - 1050
Cited by:  Papers (42)  |  Patents (2)
| |PDF (776 KB)

An algorithm is presented for computation of the two-dimensional discrete Fourier transform (DFT). The algorithm is based on geometric properties of the integers and exhibits symmetry and simplicity of realization. Only one-dimensional transformation of the input data is required. The transformations are independent; hence, parallel processing is feasible. It is shown that the number of distinct <... View full abstract»

## Aims & Scope

This Transactions ceased production in 1990. The current retitled publication is IEEE Transactions on Signal Processing.

Full Aims & Scope