By Topic

IEEE Transactions on Acoustics, Speech, and Signal Processing

Issue 9 • Date Sep 1989

Filter Results

Displaying Results 1 - 22 of 22
  • A `systolic array' formulation of the optimal bounding ellipsoid algorithm

    Publication Year: 1989, Page(s):1432 - 1436
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    A previously published recursive estimation algorithm (ibid., vol.ASSP-34, p.1331-4, 1986), which updates the parameter vector for a linear system only when incoming data are sufficiently informative, is reformulated to be implementable using well-known systolic array processing schemes. In particular, the optimal bounding ellipsoid algorithm (OBE) for identifying an autoregressive moving-average ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Sanz-Huang conjecture on band-limited signal extrapolation with noise

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

    The authors prove that J. Sanz and T. Huang's (ibid., vol.ASSP-33, p.1338-41, Dec. 1983) conjecture on bandlimited signal extrapolation with noise is indeed true. All hypotheses and notations used in the proof are described in detail View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear smoothing filters based on rank estimates of location

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

    A class of nonlinear filters that are based on the rank estimates (R-estimates) of location parameters in statistical theory is introduced. It is shown how moving-window rank filters (R-filters) can be defined starting from rank estimates of location. These filters utilize the relative ranks of the observations in each window to produce an output value. The idea of rank Winsoriza... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial pseudorandom array processing

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

    A pseudorandom permuting procedure and the associated array signal processing are introduced for resolving multiple coherent signal sources. Conventional adaptive beamforming algorithms fail to operate in such a situation, as their performance will degrade. In addition, when applied to an irregularly spaced array or when background noise is colored, most existing adaptive algorithms do not work. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition of the LPC excitation using the zinc basis functions

    Publication Year: 1989, Page(s):1329 - 1341
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    A linear predictive coding (LPC) excitation signal composed of a set of orthogonal functions called zinc functions is introduced. These functions are shown to form a complete orthogonal set and have properties that are well suited for modeling the LPC residual signal. A benchmark comparison between Fourier series and zinc function modeling shows that the zinc function model for the residual is sup... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On error surfaces of sufficient order adaptive IIR filters: proofs and counterexamples to a unimodality conjecture

    Publication Year: 1989, Page(s):1436 - 1442
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    It is shown that although a conjecture proposed by S. Stearns (ibid., vol.ASSP-29, p.763-6, June 1981) concerning sufficient conditions to guarantee unimodality of error surfaces for adaptive pole-zero infinite-impulse-response (IIR) filters is valid for first- and second-order filters, it is not true in general without an additional constraint introduced by T. Soderstrom (Autom., vol.11, p.93-9, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The synthesis rules in a Chinese text-to-speech system

    Publication Year: 1989, Page(s):1309 - 1320
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    The synthesis rules developed for a successfully implemented Chinese text-to-speech system are described in detail. The design approach is based on a syllable concatenation that is rooted in the special characteristics of the Chinese language. Special attention given to the lexical tones and other prosodic rules, such as concatenation rules, sandhi rules, stress rules, intonation patterns, syllabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A signal processor for median-based algorithms

    Publication Year: 1989, Page(s):1406 - 1414
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    A sorter-based processor architecture is introduced for digital signal processing purposes. The processor has been optimized to implement sliding average-type linear structures and three- and five-sample sorting operations. The specialized processor can be used, for example, for the several variations of the finite-impulse-response (FIR) median hybrid (FMH) filters, as well as other types of ranke... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Highly parallel multichannel LS algorithms and application to decision-feedback equalizers

    Publication Year: 1989, Page(s):1380 - 1396
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The efficient least-squares (LS) design of multichannel causal finite-impulse-response (FIR) filters characterized by a different number of memory elements per input channel is discussed. A highly concurrent transversal algorithm for these filters, suitable for very large scale integration (VLSI) implementation, is derived. This batch algorithm is used in the efficient adaptive computation of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of the LAD (L1) AR parameter estimator when applied to stationary ARMA, MA, and higher order AR processes

    Publication Year: 1989, Page(s):1451 - 1454
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    It is shown that least absolute deviation (LAD) autoregressive (AR) estimates converge to the parameters of an nth-order finite-impulse-response (FIR) filter which minimizes the expectation of the absolute value of the prediction error. Examples are presented in which these parameters are calculated and the efficiencies of the LAD estimates are determined from a Monte Carlo simulation. Ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An exact solution of the analytic equation of image quality from optimum quantization of microwave imaging data

    Publication Year: 1989, Page(s):1442 - 1445
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    An exact solution is presented of the analytic equation of image quality in terms of the entropy of the quantized aperture data. Previously published work provides an optimum quantization scheme that obtains the best image quality for a given distribution of complex aperture data and a given number of bits into which each complex data sample is to be quantized. An extension is provided to determin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pitch synchronous spectral analysis scheme for voiced speech

    Publication Year: 1989, Page(s):1321 - 1328
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The problem of spectrum analysis of harmonic signals which are periodic or at least quasi-periodic, such as human voice, is addressed. An efficient and accurate pitch-synchronized spectral analysis scheme for obtaining the Fourier coefficients of a harmonic signal, sampled at an arbitrary rate above the Nyquist critical rate, is outlined. The pitch is derived from the sampled signal prior to the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The structure of vector radix fast Fourier transforms

    Publication Year: 1989, Page(s):1415 - 1424
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    A general form of the matrix representation for multidimensional, vector-radix, fast Fourier transform (FFT) algorithms using decimation-in-frequency is presented. A structure theorem is devised to construct systematically various vector-radix decimation-in-frequency FFT algorithms from their 1-D counterparts. Logic diagrams are provided to facilitate the software and hardware implementation of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programming the WFTA for two-dimensional data

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

    The author introduces a two-dimensional Winograd Fourier transform algorithm (WFTA) technique and compares it with more traditional fast Fourier transform (FFT) implementations. Techniques for programming the WFTA in two dimensions are introduced. For completeness, enumerations of the Winograd small-n transposes, required when applying these techniques, are included. It is found that the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The LMS algorithm with delayed coefficient adaptation

    Publication Year: 1989, Page(s):1397 - 1405
    Cited by:  Papers (168)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    The behavior of the delayed least-mean-square (DLMS) algorithm is studied. It is found that the step size in the coefficient update plays a key role in the convergence and stability of the algorithm. An upper bound for the step size is derived that ensures the stability of the DLMS. The relationship between the step size and the convergence speed, and the effect of the delay on the convergence spe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parametrized family of nonlinear image smoothing filters

    Publication Year: 1989, Page(s):1458 - 1462
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    A parameterized family of nonlinear image smoothers is developed which provides a range of tradeoffs between noise smoothing and edge retention. The presentation unifies many approaches to the problem of image smoothing where the estimate of the gray level of a pixel is taken as a nonlinear data-dependent weighted sum of the gray levels of the pixel's neighborhood. Local confidence measures are de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection algorithms for image sequence analysis

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

    The development of five single-stage and four multistage algorithms is reported. A comparison of the performance, for moving target identification applications, of 13 algorithms on a simulated infrared (IR) image database is included. Several of the algorithms show significant improvement in performance over the well-known algorithms in the area View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Instability in the solution of banded Toeplitz systems

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

    The author considers some algorithms for the solution of banded Toeplitz systems and calculates certain elements of the solution first and then the remaining elements by forward or backward substitution. It is shown that for symmetric matrices this method is almost always highly unstable. A numerical example is given to support the argument View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stabilizing the fast Kalman algorithms

    Publication Year: 1989, Page(s):1342 - 1348
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The fast Kalman algorithms are stabilized by introducing a quantity that measures the accumulation of the roundoff errors. This quantity is used to correct the variables of the algorithm at every time step. The correction is defined as the solution of a specific minimization problem. The resulting algorithm still has the nice complexity properties of the original algorithm (linear in the number of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of mixed transversal and ladder adaptive filters with pure order updates

    Publication Year: 1989, Page(s):1464 - 1468
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    A class of exact recursive-least-squares (RLS) adaptive filter structures with pure order updates, called mixed transversal and ladder (MITAL) filters, is presented in which the propagation of numerical errors along in time is limited to at most M sampling periods, so the long-term numerical stability can be guaranteed. The adaptive structures can be treated either as transversal forms or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interpolating autoregressive processes: a bound on the restoration error

    Publication Year: 1989, Page(s):1462 - 1464
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    An upper bound is obtained for the restoration error variance of a sample restoration method for autoregressive processes that was presented by A.J.E.M. Janssen et al. (ibid., vol.ASSP-34, p.317-30, Apr. 1986). The upper bound derived is lower if the autoregressive process has poles close to the unit circle of the complex plane. This situation corresponds to a peaky signal spectrum. The bound is v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for defining mixed radix FFT flow graphs

    Publication Year: 1989, Page(s):1349 - 1358
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    A unified set of algorithms is presented to define the intraconnection and phase rotation structure of flow graphs for arbitrary fast Fourier transforms (FFTs). The same set of basic equations is applied to arbitrary-length FFTs; mixed-radix FFTs; either decimation-in-time or decimation-in-frequency FFTs; and FFTs with ordered inputs, ordered outputs, or both. These equations, which define input a... 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