By Topic

IEEE Transactions on Acoustics, Speech, and Signal Processing

Issue 6 • Date December 1984

Filter Results

Displaying Results 1 - 25 of 32
  • [Front cover and table of contents]

    Publication Year: 1984, Page(s): 0
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE
  • Comments on "Bounds on the minimum number of data transfers in WFTA and FFT programs

    Publication Year: 1984, Page(s):1255 - 1257
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 KB)

    Reference [1] contains corrections to the arithmetical errors of the paper and to the part of the resulting concluding remarks (the concluding remarks concerning 1024-point FFT and 1008- point WFTA remain uncorrected). It seems, however, that the main problem with [1] concerns the fact that the proposed programs are not optimal from the point of view of the number of data transfers. The main limit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "Passive bearing estimation of a broad-band source"

    Publication Year: 1984, Page(s): 1257
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "N-dimensional stability margins computation and a variable transformation"

    Publication Year: 1984, Page(s): 1257
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Back cover]

    Publication Year: 1984, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (2360 KB)
    Freely Available from IEEE
  • Effect of signal bandwidth on the accuracy of signal reconstruction from its phase

    Publication Year: 1984, Page(s):1238 - 1239
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    Simulation results are presented to illustrate the effects of signal bandwidth on the accuracy of signal reconstruction from its phase samples using a direct method. It is shown that the reconstruction error increases by 8 dB (on average) as we go from high bandwidth signals to low bandwidth signals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speech enhancement using a minimum-mean square error short-time spectral amplitude estimator

    Publication Year: 1984, Page(s):1109 - 1121
    Cited by:  Papers (934)  |  Patents (130)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1504 KB)

    This paper focuses on the class of speech enhancement systems which capitalize on the major importance of the short-time spectral amplitude (STSA) of the speech signal in its perception. A system which utilizes a minimum mean-square error (MMSE) STSA estimator is proposed and then compared with other widely used systems which are based on Wiener filtering and the "spectral subtraction" algorithm. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-dimensional linear prediction and its application to adaptive predictive coding of images

    Publication Year: 1984, Page(s):1213 - 1229
    Cited by:  Papers (56)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4536 KB)

    This paper summarizes a study on two-dimensional linear prediction of images and its application to adaptive predictive coding of monochrome images. The study was focused on three major areas: two-dimensional linear prediction of images and its performance, implementation of an adaptive predictor and adaptive quantizer for use in image coding, and linear prediction and adaptive predictive coding o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A derivation of the complex fast Kalman algorithm

    Publication Year: 1984, Page(s):1230 - 1232
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    A derivation of a complex-domain recursive linear prediction algorithm with a reduced number of computations is presented. It is denoted the complex fast Kalman algorithm by virtue of its similarity to the real domain algorithm of that name. It is seen to be very similar to real domain fast Kalman, when complex conjugation is considered in formulating the error measure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral analysis using generalised cepstrum

    Publication Year: 1984, Page(s):1235 - 1238
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    In this paper, we present a generalization of the cepstral method from the viewpoint of spectral smoothing for speech. We use a natural generalization of the logarithmic function instead of the logarithmic function and we refer to the spectral representation parameter on the "generalized logarithmic" scale as the "generalized cepstrum," which corresponds to the cepstrum on the logarithmic scale. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of minimum-variance deconvolution filter

    Publication Year: 1984, Page(s):1145 - 1153
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    Recently, we observed zero phase and undershoot patterns in data processed by a minimum-variance deconvolution (MVD) filter. These observations motivated a careful analysis of the MVD filter, which, as we demonstrate in this paper, explains both the zero phase and undershoot patterns. This analysis also connects the MVD filter with the well-known prediction-error filter [6], and Berkhout's two-sid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Slowness araising in the discrete radon transform:A multirate system approach to beamforming

    Publication Year: 1984, Page(s):1160 - 1165
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Time-domain beamforming with an array of space-time samples is equivalent to performing a discrete Radon transform (DRT). The result is a function of slowness (inverse velocity) and time intercept. As a function of slowness, beamforming decimates each channel in proportion to its distance from the beamformer reference channel. This viewpoint allows the slowness bandwidth to be expressed as a funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Amplitude scaling of arbitary linear digital networks

    Publication Year: 1984, Page(s):1240 - 1242
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    Two matrix expressions for the computation of the amplitude scaling factors at the delay and signal nodes of a one-dimensional arbitrary linear digital network are derived. These expressions are applicable to all digital networks including state-space digital filters and wave digital filters. Moreover, they are convenient and efficient to use. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the uniqueness of the maximum-likeliwood estimate of structured covariance matrices

    Publication Year: 1984, Page(s):1249 - 1251
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    A generalized Burg technique has been developed recently by Burg, Luenberger, and Wenger for maximum likelihood estimation of structured covariance matrices. Uniqueness of the estimate in the restricted subset of the class of nonnegative definite symmetric matrices is not known. In this paper it is shown that the positive definite estimate over the class of nonnegative definite, doubly symmetric (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Jaynes' principle and maximum entropy spectral estimation

    Publication Year: 1984, Page(s):1176 - 1183
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    This paper makes use of Jaynes' principle to include prior information into a maximum entropy spectral estimate. Such information is often available, but is not included in the usual maximum entropy method. The paper develops an algorithm which is particularly simple to implement for equispaced correlation lags. A numerical example demonstrates the effectiveness of the technique, and its superiori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast O(n) complexity algorithms for diagonal innovation matrices

    Publication Year: 1984, Page(s):1189 - 1194
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    In general, the direct solution of an n dimensional system of linear equations requires O(n3) arithmetic operations. Frequently in high data rate signal processing, fast algorithms of complexity lower than O(n3) are required to solve a large system of linear equations. In several interesting applications, the specific structure of the coefficient matrix associated with the li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Median filtering by threshold decomposition

    Publication Year: 1984, Page(s):1183 - 1188
    Cited by:  Papers (165)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Median filters are a special class of ranked order filters used for smoothing signals. Repeated application of the filter on a quantized signal of finite length ultimately results in a sequence, termed a root signal, which is invariant to further passes of the median filter. In this paper, it is shown that median filtering an arbitrary level signal to its root is equivalent to decomposing the sign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vocal tract area functions from two point acoustic measurements with formant frequency constraints

    Publication Year: 1984, Page(s):1122 - 1135
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1400 KB)

    A formulation is presented by which the cross-sectional areas of the vocal tract can be computed from the pressure spectrum. The pressure spectrum is the magnitude squared of the transfer function relating acoustic pressure at the glottis to pressure measured in the acoustic radiation field beyond the lips. Two correction parameters are determined using an iterative procedure. One parameter relate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new algorithm to compute the discrete cosine Transform

    Publication Year: 1984, Page(s):1243 - 1245
    Cited by:  Papers (299)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    A new algorithm is introduced for the 2m-point discrete cosine transform. This algorithm reduces the number of multiplications to about half of those required by the existing efficient algorithms, and it makes the system simpler. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on iterative fourier transform phase reconstruction from magnitude

    Publication Year: 1984, Page(s):1251 - 1254
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    In this correspondence, a well-known iterative procedure for Fourier transform phase reconstruction from magnitude (usually referred to as the Gerchberg-Saxton-Fienup procedure) is revisited. The convergence of this algorithm has raised some controversy in the recent literature. In this correspondence we first point out a potential source of error in the numerical implementation of the algorithm. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the joint characteristic function of the complex scalar LMS adaptive weight

    Publication Year: 1984, Page(s):1166 - 1175
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    In this paper, the joint characteristic function of the single weight complex scalar LMS adaptive algorithm is studied. An integral equation is derived for the joint characteristic function of the real and imaginary parts of the weight. This integral equation is used to obtain the weight moments and is approximately solved for a sufficiently small adaptation parameter μ. It is shown that, for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic speech recognition error/no decision tradeoff curves

    Publication Year: 1984, Page(s):1232 - 1235
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    This paper analyzes the tradeoff between ASR recognition error probability (PE) and percent of no decisions (ND). The tradeoff characteristic of PE versus ND is first studied by means of a simple model of the use of the ratio of the best to the next-to-best scores as decision variable. The robustness of the tradeoff curves with respect to modeling assumptions is displayed. More insight into the tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital filters with equiripple magnitude and group delay

    Publication Year: 1984, Page(s):1194 - 1200
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    This paper introduces a class of recursive digital filters having equiripple behavior in both the magnitude and group delay responses. The filters consist of an all-pole IIR component cascaded with a linear phase FIR component. The IIR component is synthesized so that its group delay exhibits an equiripple variation in the passband, whereas the FIR component is used to obtain the desired equirippl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the use of singular value decomposition and decimation in discrete-time band-limited signal extrapolation

    Publication Year: 1984, Page(s):1201 - 1212
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    The problem of extrapolating a band-limited signal in discrete time is viewed as one of solving an underdetermined system of linear equations. Choosing the minimum norm least-squares (MNLS) solution is one criterion for singling out an extrapolation from all the possible solutions to the linear system. Use of the Moore-Penrose inverse yields the MNLS solution, and singular value decomposition (SVD... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalised test for discrete system stability

    Publication Year: 1984, Page(s):1242 - 1243
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    In this correspondence we show that by using the continued fraction expansion [8] twice, we can determine whether the discrete system is stable or not and, if yes, the number of real and complex roots appearing inside the unit circle. 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