By Topic

IEEE Transactions on Acoustics, Speech, and Signal Processing

Issue 8 • Aug 1990

Filter Results

Displaying Results 1 - 22 of 22
  • Analysis/synthesis techniques for subband image coding

    Publication Year: 1990, Page(s):1446 - 1456
    Cited by:  Papers (232)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1272 KB)

    Analysis/synthesis systems designed for low bit rate image coding, their impact on overall system quality, and their computational complexity are discussed. The investigation focuses on the design of analysis/synthesis systems for image coding and the perceptual impact of these systems at low bit rates. Two objectives are emphasized in developing these systems: confining the total size of the subb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast methods for the CELP speech coding algorithm

    Publication Year: 1990, Page(s):1330 - 1342
    Cited by:  Papers (57)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1300 KB)

    Special fast procedures for the code excited linear predictive coding (CELP) algorithm have been developed to make implementation on modest hardware possible. The advantages, as well as the disadvantages, of the various fast procedures are discussed. A general formalism for the algorithm is developed, followed by the discussion of the individual procedures which are grouped according to their feat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved Burg-type recursive lattice method for autoregressive spectral analysis

    Publication Year: 1990, Page(s):1437 - 1445
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A new, efficient recursive lattice method for autoregressive spectral analysis is presented. This method is based on an estimate of the covariance matrix, which is Toeplitz, while allowing an unbiased estimation of the frequencies of sinusoidal signals. The algorithm works recursively similarly to Burg's (1975) algorithm for maximum entropy autoregressive spectral estimation. 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.
  • Code design and performance characterization for code multiplexed imaging

    Publication Year: 1990, Page(s):1321 - 1329
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    A new sonar imaging technique which uses coded waveforms to project different sound signals in different directions has bee proposed. In this context, the problem of creating a set of frequency-hopped code words that have mutually small correlation properties has arisen. The design and performance characterization of frequency-hopped signals for multibeam sonar imaging are discussed. The two speci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequency analysis and synthesis of a class of nonlinear filters

    Publication Year: 1990, Page(s):1363 - 1372
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Nonlinear filters are analyzed from a spectral point of view. The equivalent frequency behavior of a filter is described by its linear part, which represents the linear nonrecursive filter, that best matches, in the mean-square sense, the behavior of the filter. The class considered includes all the order statistic filters (L-filters) such as median, midrange, alpha-trim, and some new order statis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameter estimation of exponentially damped sinusoids using higher order statistics

    Publication Year: 1990, Page(s):1424 - 1436
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    A new approach for the estimation of the parameters of exponentially damped sinusoids is introduced based on third- or fourth-order statistics of the observation signal. The method may be seen as an extension of the minimum norm principal eigenvectors method to higher order statistics domains. The strong points and limitations of the method are discussed as well as sufficient conditions for the ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new bit reversal algorithm

    Publication Year: 1990, Page(s):1472 - 1473
    Cited by:  Papers (18)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    A new bit reversal permutation algorithm is described. Such algorithms are needed for radix 2 (or radix B) fast Fourier transforms (FFTs) or fast Hartley transforms (FHTs). This algorithm is an alternative to one described by Evans (1987). A BASIC version of this algorithm ran slightly faster than the BASIC version of Evans' algorithm given by Bracewell (1986), with some time savings for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison between two measures of convergence in recursive-window based spectrum estimation

    Publication Year: 1990, Page(s):1457 - 1459
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    It is shown that approximations of the infinite impulse response (IIR) of a single-pole filter by a rectangular finite impulse response (FIR) through either the effective window length approach or the least squares inverse filtering approach yield the same results. Both the least squares inverse filter method and the effective window length can be used as measures of convergence in recursive-windo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast adaptive filter algorithm using eigenvalue reciprocals as stepsizes

    Publication Year: 1990, Page(s):1343 - 1352
    Cited by:  Papers (9)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    It is shown that there exist finite optimum update positions in the gradient direction of the least-mean-square (LMS) algorithm. The optimum stepsizes to reach these positions are in a discrete set. On this basis, a new adaptive filter (ADF) algorithm is proposed. The discrete cosine transform, a fairly good approximation of the Karhunen-Loeve transform for a large number of signal classes, is use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of time-dependent adaptive filters for interference rejection

    Publication Year: 1990, Page(s):1373 - 1385
    Cited by:  Papers (28)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    Time-dependent adaptive filters (TDAFs) that allow for the cyclostationary nature of communication signals by periodically changing the filter and adaptation parameters are examined. The TDAF has an advantage over the conventional time-independent adaptive filter in achieving better performance, i.e. reduced mean square error (MSE), for signals with periodic statistics. The basic theory of the TDA... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the max/median filter

    Publication Year: 1990, Page(s):1473 - 1475
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    A max/min median filter, as an extension of the max/median filter, is presented. Theoretical analysis shows that the max/min median filter can give a smaller bias than the max/median filter. An example shows that the performance of the max/min median filter is better than that of the max/median filter in preserving the details of images View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonconvexity of the stability domain of digital filters

    Publication Year: 1990, Page(s):1459 - 1460
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    The stability of a causal digital filter with a rational transfer function H(z) is completely specified by the location of its poles with respect to the unit circle (UC). The set of points A corresponding to stable filters, i.e. to polynomials P with roots inside the UC, is called the stability domain Σ of digital filters. Results are established that con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HF channel estimation using a fast transversal filter algorithm

    Publication Year: 1990, Page(s):1353 - 1362
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    The estimation of the sampled impulse response of a time-varying HF channel using a fast transversal filter (FTF) algorithm is studied. The latter is a computationally efficient implementation of the recursive least squares (RLS) algorithm, developed from the conventional Kalman filter. The application is that of digital data transmission. A novel stabilization technique is proposed to overcome th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An RNS discrete Fourier transform implementation

    Publication Year: 1990, Page(s):1386 - 1394
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    A novel discrete Fourier transform (DFT) implementation is described. It is based on the union of number theoretic transforms, modular arithmetic, and distributed arithmetic. In order to achieve megahertz-class transform rates with a limited amount of hardware, several new technologies are integrated. To accelerate complex arithmetic speed, a new body of knowledge called the quadratic residue numb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite precision arithmetic and the Schur algorithm

    Publication Year: 1990, Page(s):1475 - 1478
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    The numerical behavior of the Schur algorithm under fixed-point arithmetic conditions is investigated. It was found that the variance of the reflection coefficient estimates is large when the autocorrelation coefficients used to obtain the estimates are obtained from a narrowband low-pass signal. This is because such signals yield ill-conditioned autocorrelation matrices and is not due to numerica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limit cycles due to roundoff in state-space digital filters

    Publication Year: 1990, Page(s):1460 - 1462
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    A deterministic analysis is presented for limit cycles due to roundoff in state-space digital filters. Two new sufficient conditions are established for the roundoff stability, i.e. suppression of limit cycles, in digital filters. Using these results, restrictions on the location of poles are found for various realizations to be free from roundoff limit cycles View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A frequency domain weighting function approach to extrapolation

    Publication Year: 1990, Page(s):1395 - 1402
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    A new extrapolation algorithm has been developed which is linear, noise tolerant, and computationally efficient. A bandwidth measure is defined in terms of a general frequency weighting function, and the extrapolated signal is calculated as the signal that minimizes this measure. The minimization involves the solution of a Toeplitz set of linear equations. Several properties of this technique are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive iterative algorithms for spiky deconvolution

    Publication Year: 1990, Page(s):1462 - 1466
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Considering the joint detection-estimation character that spiky deconvolution problems have, an adaptively contracted (projection) selection operator is introduced to detect the nonzero values of the solution, which can be combined with iterative algorithms to offer very efficient schemes for solving these problems. A number of gradient-type algorithms based on this principle are described, and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced-rank least squares channel estimation

    Publication Year: 1990, Page(s):1403 - 1410
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A reduced-rank least squares (RRLS) algorithm based on oversampling the channel output by an integer factor and singular value decomposition (SVD) of a data matrix is shown to have certain advantages over the nonparametric least-squares (LS) and the parametric Evans and Fischl (EF) alternative algorithm for estimating the pulse response of a truncated equivalent baseband communication channel. By ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive maximum likelihood estimation of complex autoregressive processes

    Publication Year: 1990, Page(s):1466 - 1467
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    The recursive maximum likelihood estimation (RMLE) algorithm conceived by Kay (see ibid., vol.ASSP-31, p.56, 1983) is extended to complex data sets. The complex version requires the same level of computation as that for real data. The original development was restricted to the case of realm data. The purpose is to extend RMLE to the more universal realm of complex data. The derivation is discussed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cumulant-based order determination of non-Gaussian ARMA models

    Publication Year: 1990, Page(s):1411 - 1423
    Cited by:  Papers (136)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    The objective is the order determination of non-Gaussian and nonminimum phase autoregressive moving average (ARMA) models, using higher-order cumulant statistics. The two methods developed assume knowledge of upper bounds on the ARMA orders. The first method performs a linear dependence search among the columns of a higher-order statistics matrix by means of the Gram-Schmidt orthogonalization proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of structured covariance matrices and multiple window spectrum analysis

    Publication Year: 1990, Page(s):1467 - 1472
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    A close relationship between low rank modeling and multiple window spectrum estimation is demonstrated by using maximum likelihood estimates of structured covariance matrices. The power in a narrow spectral band is estimated by estimating the variances in a low rank signal plus noise covariance model. This model is swept through the entire frequency band to obtain an estimate of power as a functio... 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