By Topic

IEEE Transactions on Acoustics, Speech, and Signal Processing

Issue 10 • Date Oct. 1989

Filter Results

Displaying Results 1 - 25 of 28
  • A survey of conjugate gradient algorithms for solution of extreme eigen-problems of a symmetric matrix

    Publication Year: 1989, Page(s):1550 - 1556
    Cited by:  Papers (45)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (585 KB)

    A survey of various conjugate gradient (CG) algorithms is presented for the minimum/maximum eigen-problems of a fixed symmetric matrix. The CG algorithms are compared to a commonly used conventional method found in IMSL. It is concluded that the CG algorithms are more flexible and efficient than some of the conventional methods used in adaptive spectrum analysis and signal processing.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The extrapolation of high-dimensional band-limited functions

    Publication Year: 1989, Page(s):1576 - 1580
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    The Papoulis (1975)-Gerchberg (1974) algorithm for the extrapolation of one-dimensional band-limited signals is extended to multidimensional band-limited signals. Thus, an extrapolation method for these signals is obtained. One- and two-dimensional cases are discussed. A theorem and detailed proof are provided View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Gaussian noise generator

    Publication Year: 1989, Page(s):1593 - 1597
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    Algorithm description, block diagram, and complete C source code for a fast Gaussian noise generator which uses only integer operations and table lookups are presented. The algorithm achieves its speed of computation by using table lookups to eliminate the need for evaluating transcendental functions. The lookup table requires only 32768 bytes of memory-a small size, even for a personal computer. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An error bound for a noise canceller

    Publication Year: 1989, Page(s):1513 - 1517
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    The degradation in performance of the least-mean-square estimation (LMSE) is evaluated after replacing the covariance matrices with estimates. Taking advantage of the statistical properties of the complex Wishart matrix and its inverse, the decrease in performance stemming from this substitution is investigated. The performance criterion is based on the computation of the final output error, which... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modified frequency-weighted Itakura spectral distortion measure

    Publication Year: 1989, Page(s):1614 - 1617
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    A modified frequency-weighted Itakura spectral distortion measure (FWIDM) for speech recognition in noise is described. It is shown that if noise is added to the test speech signal before preemphasis (such as would be the case with environment noise picked up at the microphone), the FWIDM method is not effective in reducing the distance between the noisy test spectrum and the clean reference spect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear quantization effects in the LMS and block LMS adaptive algorithms-a comparison

    Publication Year: 1989, Page(s):1504 - 1512
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Digital implementations of the least-mean-square (LMS) and block LMS (BLMS) algorithms are compared with respect to finite word effects. The algorithm stalling phenomenon is studied using Gaussian data models and conditional expectation arguments. It is shown that the BLMS algorithm requires (1/2 log2 L-K) fewer bits for the same stalling behavior (L=block len... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An iterative method to compensate for the interpolation distortion

    Publication Year: 1989, Page(s):1617 - 1621
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    The author shows that iterative techniques can be used to compensate for sample-and-hold or, in general, interpolation distortion. It is proven that this iterative method converges to the true signal in the limit. The simulation results of the iterative technique are compared to results of the modular method. Simulation results show that the iterative method is a powerful tool for reducing distort... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AR, ARMA, and AR-in-noise modeling by fitting windowed correlation data

    Publication Year: 1989, Page(s):1608 - 1612
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    A method for autoregressive (AR) modeling of stationary stochastic signals is extended to AR moving-average (ARMA) models, including the special case of AR signals in white noise. Both AR and ARMA examples are presented. The method differs from the well-known method of overdetermined normal equations in that fitting error, not equation error, is minimized, and significantly improved performance is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Phase improvement in IIR digital filters

    Publication Year: 1989, Page(s):1627 - 1631
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    A new technique is presented for improving the phase response of finite impulse-response (IIR) digital filters. In this technique, a measure of phase nonlinearity is developed. Given an IIR filter which has the desired amplitude response and it realized as a cascade of second-order sections, the measure is minimized by making some of the sections anticausal. Efficient implementation of this algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytical solutions for design of IIR equiripple filters

    Publication Year: 1989, Page(s):1518 - 1531
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    A purely analytical technique for the design of recursive digital filters with equiripple magnitude behavior is presented. The design is accomplished in a transformed variable denoted by w and defined as w=(z+1/z)/2. The method can be attributed to the class of rational Chebyshev approximations. It uses design steps corresponding to those for elliptical filters ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new vector quantization clustering algorithm

    Publication Year: 1989, Page(s):1568 - 1575
    Cited by:  Papers (143)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    The pairwise nearest neighbor (PNN) algorithm is presented as an alternative to the Linde-Buzo-Gray (1980, LBG) (generalized Lloyd, 1982) algorithm for vector quantization clustering. The PNN algorithm derives a vector quantization codebook in a diminishingly small fraction of the time previously required, without sacrificing performance. In addition, the time needed to generate a codebook grows o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An ARMA spectral analysis technique based on a fast Euclidean algorithm

    Publication Year: 1989, Page(s):1532 - 1536
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    An approach to high resolution spectral analysis using rational signal models is presented. This technique is based on a fast Euclidean algorithm for polynomials that has a computational complexity on the order of n log2 n. Some background material on Pade approximation and the Euclidean algorithm is presented. Some examples are presented, and the results are evaluated... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Higher-order spectrum factorization in one and two dimensions with applications in signal modeling and nonminimum phase system identification

    Publication Year: 1989, Page(s):1537 - 1549
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    The problem of modeling a given higher-order spectrum as that of the output of a linear time-invariant (LTI) system driven by a higher-order white random signal is discussed. This can be posed as a higher-order spectrum factorization problem. A theorem is provided to discuss the existence of such a factorization. A fast algorithm for efficient implementation of the higher-order spectrum factorizat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class-oriented replacement technique for lost speech

    Publication Year: 1989, Page(s):1597 - 1600
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    A replacement technique for lost speech packets is presented. This technique is based on the classification of the packets into four distinct classes. Different encoding schemes and lost packet replacement techniques are used for each class. Results of subjective tests indicate that giving preferential delivery treatment to packets based on class can improve subjective quality View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhanced ultrasonic imaging with split-spectrum processing and polarity thresholding

    Publication Year: 1989, Page(s):1590 - 1592
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    The polarity thresholding algorithm, which utilizes the frequency decorrelation principle based on the split-spectrum processing technique, is examined. Split-spectrum processing obtains an ensemble of frequency diverse signals from a wideband received signal by using a set of parallel bandpass filters with different center frequencies. Polarity thresholding acts as an on-off switch on the resulti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The role of the ±1 number system in multibit hardware correlators

    Publication Year: 1989, Page(s):1581 - 1589
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    The use of commercially available 1-bit large-scale integration (LSI) correlator chips whose main function is the correlation of sequences of plus ones and minus ones (rather than zeros and ones) as building blocks in the design of multibit correlators is investigated. A radix-2 number system in which the bit values are ±1 (no zero) is discussed. The development of a simple conversion algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speech recognition using noise-adaptive prototypes

    Publication Year: 1989, Page(s):1495 - 1503
    Cited by:  Papers (77)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    A probabilistic mixture mode is described for a frame (the short term spectrum) of speech to be used in speech recognition. Each component of the mixture is regarded as a prototype for the labeling phase of a hidden Markov model based speech recognition system. Since the ambient noise during recognition can differ from that present in the training data, the model is designed for convenient updatin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noncausal ARMA modeling of voiced speech

    Publication Year: 1989, Page(s):1606 - 1608
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    A noncausal autoregressive moving average (ARMA) source-filter model of voiced speech is proposed. Although the human speech-production mechanism is obviously causal, a noncausal model allows the simple source-filter approach to incorporate different parameters for the open-glottis and closed glottis portions of the pitch period (without explicit determination of the open- and closed-glottis regio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Superresolution through error function extrapolation

    Publication Year: 1989, Page(s):1603 - 1606
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    Using the constrained iterative algorithm, it is shown that superresolution can be achieved by extrapolating the error function in the image as well as by extrapolating the spectrum of a band-limited function. It is shown, on the basis of a single cycle of the constrained iterative algorithm, that the eigenvectors corresponding to an eigenvalue of 1 are easy to obtain and that these are the vector... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An FFT algorithm based fast algorithm for arbitrary polynomial transformation

    Publication Year: 1989, Page(s):1612 - 1614
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    A fast algorithm for the arbitrary polynomial transformation is described. This algorithm is based on the fast Fourier transform (FFT) algorithm and reduces the computational complexity of a recently proposed recursive algorithm by an order of magnitude View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical analysis of the performance of information theoretic criteria in the detection of the number of signals in array processing

    Publication Year: 1989, Page(s):1557 - 1567
    Cited by:  Papers (79)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The performances of the Akaike (1974) information criterion and the minimum descriptive length criterion methods are examined. The events which lead to erroneous decisions are considered, and, on the basis of these events, the probabilities of error for the two criteria are derived. The probabilities of the first two events are derived based on the asymptotic distribution of the sample eigenvalues... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalence between two-dimensional analytic and real signal Wigner distributions

    Publication Year: 1989, Page(s):1631 - 1634
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    A solution to the problem of undesired cross-terms in the Wigner distribution (WD) of two-dimensional real signals is presented. The solution is to introduce the notion of two-dimensional analytic signal in the WD. The relation between WDs of the two-dimensional real signal and those of its associated two-dimensional analytical signal is discussed and illustrated by an example View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bowtie factors of Toeplitz matrices by means of split algorithms

    Publication Year: 1989, Page(s):1601 - 1603
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    The bowtie factorization of a Toeplitz correlation matrix R and its inverse is introduced. The term bowtie describes the pattern of the factoring matrices. Several mathematical properties of bowtie matrices are described, including their close relation with block triangular matrices. The bowtie factors of the inverse R can be computed using a vector version of the split Levinson... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On fixed-point roundoff error analysis

    Publication Year: 1989
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    The author points out the existence of work published by the author (US Dept. of Commerce, Tech. Rep. AD-A086826, 57 pp., Apr. 1980) prior to the appearance of the paper by Barnes et al. (ibid., vol.ASSP-33, p.595-606, June 1985) covering the same subject View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A relationship between the z-transform and the Fourier transform

    Publication Year: 1989, Page(s):1626 - 1627
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    A relationship between the one-sided z-transform and the one-sided discrete-time Fourier transform is discussed. Every discrete-time function that can result from the sampling of a periodic continuous-time function is considered to be periodic. A simple general equation is presented and discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

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

Full Aims & Scope