By Topic

IEEE Transactions on Acoustics, Speech, and Signal Processing

Issue 6 • December 1986

Filter Results

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

    Publication Year: 1986, Page(s): 0
    Request permission for commercial reuse | PDF file iconPDF (324 KB)
    Freely Available from IEEE
  • Shape-gain matrix quantizers for LPC speech

    Publication Year: 1986, Page(s):1427 - 1439
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1297 KB)

    It has been recently demonstrated that the principles of vector quantization for LPC speech can be simply extended to encompass matrices of LPC vectors with significant savings in bit rate. Unfortunately, however, such locally optimal matrix quantizers have prohibitively high complexity and memory requirements when implemented in a speech vocoder at bit rates giving acceptable quality speech. One ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated-circuit-based speech recognition system

    Publication Year: 1986, Page(s):1465 - 1472
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (845 KB)

    A high-performance, flexible, and potentially inexpensive speech recognition system is described. The system is based on two special-purpose integrated circuits that perform the speech recognition algorithms very efficiently. One of these integrated circuits is the front-end processor, which computes spectral coefficients from incoming speech. The second integrated circuit computes a dynamic-time-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • L1deconvolution and its application to seismic signal processing

    Publication Year: 1986, Page(s):1655 - 1658
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB)

    This correspondence reviews fast iterative reweighted least squares (IRLS) and residual steepest descent (RSD) algorithms for Lp,1 leq p leq 2, deconvolution. The timing aspects and the implementation of the IRLS algorithm on an array processor are discussed. The effectiveness of L1deconvolution and its insensitivity to noise bursts are illustrated using simple syn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive estimation and time-series analysis

    Publication Year: 1986, Page(s): 1678
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (150 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: 1986, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (3369 KB)
    Freely Available from IEEE
  • Speech transformations based on a sinusoidal representation

    Publication Year: 1986, Page(s):1449 - 1464
    Cited by:  Papers (71)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1528 KB)

    In this paper a new speech analysis/synthesis technique is presented which provides the basis for a general class of speech transformations including time-scale modification, frequency scaling, and pitch modification. These modifications can be performed with a time-varying change, permitting continuous adjustment of a speaker's fundamental frequency and rate of articulation. The method is based o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The relation between maximum likelihood estimation of structured covariance matrices and periodograms

    Publication Year: 1986, Page(s):1661 - 1662
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    A generalized Burg technique has been developed recently by Burg, Luenberger, and Wegner for maximum likelihood estimation of structured covariance matrices. In this correspondence, the unique solution for the positive definite estimate over a class of nonnegative definite, symmetric matrices with known eigenvectors is presented. This solution coincides with the Karhunen-Loève expansion, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandpass and bandstop recursive filters with low sensitivity

    Publication Year: 1986, Page(s):1485 - 1492
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    In a sharp cutoff bandpass or bandstop recursive digital filter, the poles and zeros are expected to be clustered around the band edges, and in close proximity of the unit circle in the z-plane. Implementation of such filters with low sensitivity could be achieved by cascading second-order sections, with appropriate low sensitivity structures chosen for individual sections depending on the locatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An unconstrained partitioned realization for derivative constrained broad-band antenna array processors

    Publication Year: 1986, Page(s):1376 - 1379
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    This paper presents an orthogonal decomposition approach for realizing the derivative constrained broad-band processor as an unconstrained partitioned form. The structure presented is similar to the generalized sidelobe canceller (GSC) structure described in the literature. Furthermore, the paper also examines the components of the unconstrained partitioned structure for the first-order case in de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Waveform substitution techniques for recovering missing speech segments in packet voice communications

    Publication Year: 1986, Page(s):1440 - 1448
    Cited by:  Papers (100)  |  Patents (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    Packet communication systems cannot, in general, guarantee accurate and prompt delivery of every packet. The effect of network congestion and transmission impairments on data packets is extended delay; in voice communications these problems lead to lost packets. When some speech packets are not available, the simplest response of a receiving terminal is to substitute silence for the missing speech... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WMMSE design of digital filter banks with specified composite response

    Publication Year: 1986, Page(s):1529 - 1541
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1408 KB)

    A new method for designing uniform and nonuniform digital filter banks with a specified composite response is presented. The composite response of the filter bank can be met either exactly or to within a given tolerance. We focus on filter banks in which the individual filters are finite impulse response (FIR) digital filters of possibly nonequal length, although the new method is applicable even ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the relation between the maximum entropy probability density function and the autoregressive model

    Publication Year: 1986, Page(s):1659 - 1661
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    The problem of maximizing the entropy of an n-variate random vector subject to constraints on the first p + 1 autocovariance terms is examined. It is shown that the maximum is achieved by the Gaussian autoregressive process of order p satisfying the autocovariance constraints. This solution provides Burg's theorem about the maximum entropy spectral density as a special case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Form-invariant linear filtering: Theory and applications

    Publication Year: 1986, Page(s):1612 - 1628
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2840 KB)

    The form-invariant filters are, by definition, those shift-variant filters such that their output, for any given input, turns out to be linearly scaled (implying that its "form" does not change) whenever the input is linearly scaled. In this paper the most general classes of 1- D and 2-D linear form-invariant filters are derived and their properties are discussed, together with their implementatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On averaging burg spectral estimators for segments

    Publication Year: 1986, Page(s):1473 - 1484
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1120 KB)

    The Burg spectral estimator (BSE) exhibits better peak resolution than conventional linear spectral estimators, particularly for short data records. Based on this property, the quality of the BSE is investigated with the available data record segmented and the relevant parameters or functions associated with each segment averaged. Averaging of autoregressive coefficients, reflection coefficients, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design and implementation of shift-varying filters

    Publication Year: 1986, Page(s):1665 - 1666
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    This correspondence concerns a particular method for the design and implementation of shift-varying filters for the purpose of approximating, from a finite segment of a data sequence, the response of a shift-invariant filter to the infinite length data sequence. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A convergence analysis of a passive underwater tracking system with nonlinear feedback

    Publication Year: 1986, Page(s):1401 - 1409
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The basic signal processing structure of a new passive underwater tracking system incorporating nonlinear feedback [1], [2] is modeled, and its ability to converge to an unbiased estimate of target range is examined. Target measurements are derived using difference of arrival times between passive sensor systems geometrically separated. The range tracking system utilizes a nonlinear signal process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rotational search methods for adaptive Pisarenko harmonic retrieval

    Publication Year: 1986, Page(s):1550 - 1565
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1272 KB)

    Two adaptation algorithms for adaptive Pisarenko harmonic retrieval are described. They are derived by considering the associated minimum eigenvalue problem as an optimization problem which seeks the minimum of a quadratic cost function given a hyperspherical constraint. An iterative search procedure is used in which each search path is constrained to lie on the unit hypersphere. Computational com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the number of signals resolvable by a uniform linear array

    Publication Year: 1986, Page(s):1361 - 1375
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1448 KB)

    An algebraic limitation on the maximum number of directions of arrival of plane waves that can be resolved by a uniform linear sensor array is studied. Achievable lower and upper bounds are derived on that number as a function of the number of elements in the array, number of snapshots, and the rank of the source sample-correlation matrix. The signals are assumed narrow-band and of identical and k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of numerator estimators for ARMA spectra

    Publication Year: 1986, Page(s):1668 - 1671
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    This correspondence investigates the problems of estimating the numerator spectrum corresponding to an ARMA time series model once the denominator spectrum (i.e., the AR coefficients) has been estimated. A general form for an estimator of the numerator spectral (NS) coefficients is developed first. Six NS estimators from the recent literature are then compared by fitting them into this general fra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The computation of line spectral frequencies using Chebyshev polynomials

    Publication Year: 1986, Page(s):1419 - 1426
    Cited by:  Papers (107)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    Line spectral frequencies provide an alternate parameterization of the analysis and synthesis filters used in linear predictive coding (LPC) of speech. In this paper, a new method of converting between the direct form predictor coefficients and line spectral frequencies is presented. The system polynomial for the analysis filter is converted to two even-order symmetric polynomial with interlacing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient implementations of quadratic digital filters

    Publication Year: 1986, Page(s):1511 - 1528
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB)

    Efficient implementation structures of quadratic filters are introduced in this paper using systolic arrays, distributed arithmetic, and linear convolutions with multipliers. The implementations are based on matrix decompositions and consist of a set of parallel 1-D FIR filters in cascade with a set of sequential square-in add-out type of operations. The structures are compared using various reali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On an adaptive noise cancellation application for radar

    Publication Year: 1986, Page(s):1654 - 1655
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    The purpose of this correspondence is to introduce a novel application of adaptive noise cancellation related to a class of radar signals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rearranged DFT algorithm requiring N2/6 multiplications

    Publication Year: 1986, Page(s):1658 - 1659
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    We consider the problem of computing the DFT and present two reductions over the standard formula. In the special case of an N-point sequence with N = 2l, the number of multiplications per output point required by this algorithm is, at most, N/4 - 1 and, on the average, N/6 - 1. Each output point requires no more than N - 1 additions. In applications requiring only some of the output po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complex residue arithmetic system (CRNS)

    Publication Year: 1986, Page(s):1675 - 1677
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    Recently, a number of papers has been published on the subject of performing complex arithmetic in the residue number system. Methods have been proposed which reduce the arithmetic complexity of a complex multiply by more than 50 percent. In this correspondence it is shown that these methods achieve Winograd's lower bound, and how these efficient mappings can be derived in terms of polynomial ring... 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