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
  • 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.
  • Fast Hadamard transform based on a simple matrix factorization

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

    This correspondence presents a simple factorization of the Hadamard matrix which is used to develop a fast algorithm for the Hadamard transform. The matrix decomposition is of the form of the Kronecker products of identity matrices and successively lower order Hadamard matrices. This decomposition leads very clearly to a sparse-matrix factorization of the Hadamard matrix. 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.
  • Zero-tracking adaptive filters

    Publication Year: 1986, Page(s):1566 - 1572
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    A new type of adaptive filter is proposed which can directly estimate and track its own zeros. The adaptation algorithm adapts the zeros of the filter and hence, indirectly, the filter coefficients. To first order in the adaptation parameter, the new algorithm is equivalent to the usual LMS algorithm, and thus it shares the same convergence properties with the latter. The cases of adaptive predict... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal technique for constraint-based image restoration and reconstruction

    Publication Year: 1986, Page(s):1629 - 1642
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1760 KB)

    A new technique for finding an optimal feasible solution to the general image reconstruction and restoration problem is described. This method allows the use of prior knowledge of the properties of both the solution and any noise present on the data. The problem is formulated as the optimization of a cost function over the intersection of a number of convex constraint sets; each set being defined ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • Bias in the cross spectrum and time delay estimates due to misalignment

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

    The effect of misalignment in the weighted, overlapped segment averaging method used for estimating time delay is investigated. With nonwhite input, it is shown that the phase of the cross spectrum and the location of the peak in the cross correlator are biased. 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Sequences with positive semidefinite Fourier transforms

    Publication Year: 1986, Page(s):1502 - 1510
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    A sequence is said to be positive if its Fourier transform exclusively takes on real nonnegative values as a function of frequency. Positive sequences play a prominent role in contemporary signal processing and system theory. To illustrate this point, it is well known that the factorization theorem is extensively used in studies related to wide-sense stationary random signals and linear systems. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of the LMS algorithm with a tapped delay line (two-dimensional case)

    Publication Year: 1986, Page(s):1542 - 1549
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    This paper presents exact analytical results of the LMS performances on correlated data vectors. The case addressed here is of data vectors constructed from a tapped delay line. While the results are for the two-dimensional case, they do provide indications of the effect this structure of data vectors, so common to LMS applications, has on LMS performance. They show conclusively the possibility of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive equalizer using finite-bit power-of-two quantizer

    Publication Year: 1986, Page(s):1603 - 1611
    Cited by:  Papers (27)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    The stochastic gradient algorithm using a simplified arithmetic is analyzed in this paper. A power-of-two quantizer is used for the input of the multiplier to reduce the multiplication to at most a simple shift. In spite of its simple implementation, the performance is shown to be comparable to the classical LMS algorithm. A linearized approximation to the quantizer is first derived, followed by t... 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.
  • 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.
  • 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.

Aims & Scope

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

Full Aims & Scope