By Topic

IEEE Transactions on Acoustics, Speech, and Signal Processing

Issue 3 • Date June 1986

Filter Results

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

    Publication Year: 1986, Page(s): 0
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE
  • Correction to "Fast Hankel transform algorithm"

    Publication Year: 1986, Page(s):623 - 624
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 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.
  • Corrections to "The statistical performance of the MUSIC and the minimum-norm algorithms in resolving plane waves in noise"

    Publication Year: 1986, Page(s): 633
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (141 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 (789 KB)
    Freely Available from IEEE
  • The discrete Gerchberg algorithm

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

    The discrete version of the Gerchberg algorithm for iterative restoration of a time-constrained function from only partial knowledge of its spectrum (or vice versa) is analyzed. Although convergence is guaranteed, eigenvalues close to unity inhibit iteration to the limit. Identification of these large eigenvalues, allowing extrapolation to the limit, is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of phase angles from the cross-spectral matrix

    Publication Year: 1986, Page(s):405 - 422
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1784 KB)

    The so-called signal subspace methods in spatial signal processing have been used up to now in the case of steering vectors depending upon very few parameters. For instance, they are used currently for steering vectors of the form (1, e, e2iθ, ... , ei(N-1)θ)Twhich occur in the case of plane waves and a linear array of N equispaced senso... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MEM and ARMA estimators of signal carrier frequency

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

    Two estimators for the carrier frequency of different classes of signals are proposed. These estimators are based on modeling the signal with either an autoregressive AR (2) model, or a mixed autoregressive, moving-average, ARMA (2, 2) model. In addition, an equation is derived to obtain the spectrum peak frequencies directly from the model parameters, thus eliminating the step of calculating the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact reconstruction techniques for tree-structured subband coders

    Publication Year: 1986, Page(s):434 - 441
    Cited by:  Papers (355)  |  Patents (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    In recent years, tree-structured analysis/reconstruction systems have been extensively studied for use in subband coders for speech. In such systems, it is imperative that the individual channel signals be decimated in such a way that the number of samples coded and transmitted do not exceed the number of samples in the original speech signal. Under this constraint, the systems presented in the pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection performance of the circular correlation coefficient receiver

    Publication Year: 1986, Page(s):399 - 404
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    The complex circular correlation detector is analyzed for the case of one complex sinusoid in complex white Gaussian noise. The distribution function of the squared modulus of the circular serial correlation coefficient is found when no signal is present, allowing computation of the detection threshold. For small data records, as is typical in radar applications, the performance of the correlation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modal decomposition signal subspace algorithms

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

    A new method of estimating the locations of multiple wide-band emitters arriving at an array of sensors is presented in this paper. The wide-band emitter location problem is treated as a separable multidimensional spectrum estimation problem by modal decomposition of the estimated spectral factor or spectral density matrix at the poles of the emitters. This modal decomposition method extends conve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of transform-domain LMS adaptive digital filters

    Publication Year: 1986, Page(s):499 - 510
    Cited by:  Papers (154)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1224 KB)

    In this paper we analyze the performance, particularly the convergence behavior, of the transform-domain least mean-square (LMS) adaptive digital filter (ADF) using the discrete Fourier transform and discrete orthogonal transforms such as discrete cosine and sine transforms. We first obtain the optimum Wiener solution and the minimum mean-squared error (MSE) in the transform domain. It is shown th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some properties of a class of rank order smoothers

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

    A class of rank order smoothers, which operate by minimizing a piecewise linear objective function, is considered. Nonrecursive versions have many properties similar to repeated median smoothing, and most of these properties are relevant, with qualifications, to recursive versions of the class. Smoothed values are medians in their neighborhoods. A root signal is obtained, but advantageously in onl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive identification of a time-varying ARMA speech model

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

    We propose an adaptive algorithm to estimate time-varying ARMA parameters for speech signals. It estimates both input excitations and underlying system parameters. The proposed algorithm is an extended form of the Kalman filter algorithm. We assume the input is either a white Gaussian process or a pseudoperiodical pulse-train as commonly adopted in LPC processing. The time variation of parameters ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A recursive algorithm for linear system identification

    Publication Year: 1986, Page(s):492 - 498
    Cited by:  Papers (1)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    This paper deals with the pole-zero identification of a linear system from a measured input-output record. It is shown that the minimization of a modified version of the squared Kalman equation error can be implemented by an order recursive algorithm in the time domain. The algorithm is based on the Gram-Schmidt orthogonalization of intertwined Krylov sequences involving a skew self-adjoint linear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for pole-zero modeling and spectral analysis

    Publication Year: 1986, Page(s):637 - 640
    Cited by:  Papers (122)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    An explicit connection between fitting exponential models and pole-zero models to observed data is made. The fitting problem is formulated as a constrained nonlinear minimization problem. This problem is then solved using a simplified iterative algorithm. The algorithm is applied to simulated data, and the performance of the algorithm is compared to previous results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive nonlinear digital filters using distributed arithmetic

    Publication Year: 1986, Page(s):518 - 526
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    A nonlinear adaptive filter structure, based upon the theory of the truncated discrete Volterra series, is presented. A memory-oriented implementation exploiting distributed arithmetic is considered, and the conventional LMS adaptation algorithms are suitably modified. Memory-size reduction methods are developed to obtain simpler actual realizations. Computer simulation results are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An all-digital realization of a baseband DLL implemented as a dynamical state estimator

    Publication Year: 1986, Page(s):535 - 545
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    The delay-locked-loop (DLL) is a device that automatically adjusts a local delay estimate to the time delay between two versions of an incoming signal. It has been shown that, in the sense of local variance, this device performs equally as well as the maximum-likelihood estimator, whereas the implementation cost can be reduced considerably. Several publications describe digital or hybrid implement... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast algorithms for the DFT and other sinusoidal transforms

    Publication Year: 1986, Page(s):642 - 644
    Cited by:  Papers (46)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    A new matrix factorization is proposed for DCT-IV, which is the basis of fast algorithms for many sinusoidal transforms. The new fast algorithm for DFT, based on the new factorization, requires the same number of multiplications and far fewer additions than the Preuss algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new algorithm for speech fundamental frequency estimation

    Publication Year: 1986, Page(s):626 - 630
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    In this correspondence, we present a method of detecting the fundamental frequency based on the recognition of "fundamental peaks" of a low-pass filtered (fc= 0.7 kHz) speech signal. Average overall recognition accuracy of approximately 99 percent for the training speech sample and 97.5 percent for a test speech sample were achieved. The experimental verification of the developed FPR (f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear mean filters in image processing

    Publication Year: 1986, Page(s):573 - 584
    Cited by:  Papers (71)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1424 KB)

    The use of nonlinear means in image processing is introduced. The properties of these means in the presence of different types of noise are investigated. It is shown that nonlinear filters based on these means behave well for both additive and impulse noise. Their performance in the presence of signal dependent noise is satisfactory. They preserve the edges better than linear filters, and they rej... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic approach to system identification

    Publication Year: 1986, Page(s):462 - 469
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    A variety of identification procedures exists for estimating the parameters of an autoregressive moving-average (ARMA) process from noise-free excitation and noise-contaminated response data. In this paper, an identification procedure is proposed for the more realistic situation in which both the excitation and response are contaminated by white noises. The method is based upon the null space char... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VLSI architecture for dynamic time-warp recognition of handwritten symbols

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

    The method of dynamic time warping is a well-established technique for time alignment and comparison of speech and image patterns. It has found extensive application in speech recognition and related areas of pattern matching. Comparing the handwritten symbol to the set of training symbols (called reference symbols), we can recognize the input handwritten symbol by computing the distances among th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The split Levinson algorithm

    Publication Year: 1986, Page(s):470 - 478
    Cited by:  Papers (156)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    The classical Levinson algorithm for computing the predictor polynomial relative to a real positive definite Toeplitz matrix is shown to be redundant in complexity. It can be broken down into two simpler algorithms, either of which needs only to be processed. This result can be interpreted in the framework of the theory of orthogonal polynomials on the real line as follows: the symmetric and antis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the evaluation of double square integral in the (s1, s2) complex biplane

    Publication Year: 1986, Page(s):630 - 632
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    In this correspondence, a method of evaluating the double square integral \int_{0}^{\infty} \int_{0}^{\infty} [h(t_{1}, t_{2})]^{2} dt_{1} dt_{2} = {1 \over (2\pi j)^{2}} \int_{-j \infty}^{j \infty} \int_{-j \infty}^{j \infty} H(s_{1}, s_{2}) H(-s_{1}, -s_{2}) ds_{1} ds_{2} where h...
						<a href= View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-varying filtering and signal estimation using Wigner distribution synthesis techniques

    Publication Year: 1986, Page(s):442 - 451
    Cited by:  Papers (172)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    The short-time Fourier transform (STFT), the ambiguity function (AF), and the Wigner distribution (WD) are mixed time-frequency signal representations that use Fourier transform techniques to map a one-dimensional function of time into a two-dimensional function of time and frequency. These mixed time-frequency mappings have been used to analyze the local frequency characteristics of a variety of ... 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