IEEE Transactions on Acoustics, Speech, and Signal Processing

Issue 5 • October 1985

Filter Results

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

    Publication Year: 1985, Page(s): 0
    Request permission for commercial reuse | PDF file iconPDF (241 KB)
    Freely Available from IEEE
  • Spectral filtering using the fast Walsh transform

    Publication Year: 1985, Page(s):1246 - 1252
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    This paper describes a method of doing spectral filtering using the fast Walsh transform (FWT) rather than the fast Fourier transform (FFT). Rather than using the Walsh transform to find Fourier coefficients which can then be filtered by ordinary means, as was done in [2], we find a new filter function, expressed as a matrix, that does the same filtering operation in the Walsh domain as the filter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding the poles of the lattice filter

    Publication Year: 1985, Page(s):1328 - 1331
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB)

    The lattice filter is often used in spectral analysis problems. Once the reflection coefficients{c_{k}}are found, the task remains of extracting spectral information from them. Frequently this is done by DFT methods. An appealing alternative is to find the poles (modes) of the lattice directly. In this paper, we present an algorithm for computing the poles of the lattice directly from t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Design of inherently stable two-dimensional recursive filter from one-dimensional filters"

    Publication Year: 1985, Page(s):1337 - 1338
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB)

    In a recent paper, a method for designing a restricted class of stable two-dimensional recursive filters from one-dimensional filters was given. The class of filters considered are those with a second-order (in each variable) transfer function with some additional constraints. It was claimed that the method given can lead to all possible stable filters of the type considered there. The purpose of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional digital signal processing

    Publication Year: 1985, Page(s):1345 - 1346
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 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: 1985, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (989 KB)
    Freely Available from IEEE
  • Stacking of noisy seismic traces via maximum entropy with a correlation coefficient constraint

    Publication Year: 1985, Page(s):1331 - 1333
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    A method is developed for stacking a gather of seismic traces in cases where there is a wide variation in the noise power of the traces. Each trace in the stack is weighted by a probability. The entropy of the probability distribution is maximized subject to the constraint that the expected value of the correlation coefficient of each trace with respect to the rest of the gather is fixed. A simple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new discrete Fourier transform algorithm using butterfly structure fast convolution

    Publication Year: 1985, Page(s):1197 - 1208
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    This paper proposes a new approach to computing the discrete Fourier transform (DFT) with the power of 2 length using the butterfly structure number theoretic transform (NTT). An algorithm breaking down the DFT matrix into circular matrices with the power of 2 size is newly introduced. The fast circular convolution, which is implemented by the NTT based on the butterfly structure, can provide sign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive filters: Structures, algorithms, and applications

    Publication Year: 1985, Page(s): 1345
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 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.
  • Computing the ambiguity surface

    Publication Year: 1985, Page(s):1239 - 1245
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    The computation of the discrete ambiguity function is considered. Two straightforward methods are developed depending upon whether we write the discrete ambiguity as a filter or as a discrete Fourier transform. A modification of the transform method produces an approximation to the discrete ambiguity function, but has increased computational efficiency. This method is based on a recent work [1]. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A single modulus complex ALU for signal processing

    Publication Year: 1985, Page(s):1302 - 1315
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1560 KB)

    Fast complex arithmetic is essential to a wide class of real-time digital transform and filter operations. Traditional methods require a multiplicity of real multiplies and adds be performed on each complex product call. Recently, a new modular (residue) mathematical system has been proposed which more than halves this count. The system developed in this paper overcomes many of the classical weakn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Backward adaptive prediction as spectral analysis within a closed loop

    Publication Year: 1985, Page(s):1166 - 1174
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    Backward adaptive prediction in differential pulse code modulation (DPCM) systems is represented as a problem of spectral analysis within a closed loop. Using this spectral analysis approach, the backward adaptive all-pole predictor in classic DPCM is shown to perform well, given good initial conditions and a slowly varying DPCM system input. However, when it loses track, the all-pole predictor is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized processing in sensor arrays

    Publication Year: 1985, Page(s):1123 - 1129
    Cited by:  Papers (57)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    We present a new scheme for decentralized processing in passive sensor arrays based on communicating the sample-covariance matrices of the subarrays. The new scheme offers improved accuracy over the conventional triangulation scheme with only a modest increase in the communication load. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modified hybrid sign estimator for the normalized autocorrelation function of a Gaussian stationary process

    Publication Year: 1985, Page(s):1321 - 1324
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    Fast digital estimators based mainly on additions are of great interest for computing the normalized a.c.f. of Gaussian stationary discrete processes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing FIR filters with distributed arithmetic

    Publication Year: 1985, Page(s):1318 - 1321
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    A new approach for implementing FIR filters with distributed arithmetic is presented. This approach uses a RAM to store the input sequences, utilizes a partitioned ROM to store the combinational values of the filter coefficients, and provides the arrangement techniques for adders which are used for accumulating the partial product and the sum. The proposed approach results in a very low storage re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A recursive procedure for ARMA modeling

    Publication Year: 1985, Page(s):1188 - 1196
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    This paper presents a two-part fast recursive algorithm for ARMA modeling. The algorithm first obtains estimates of the p autoregressive coefficients from a set of p extended Yule-Walker equations. An exact recursive lattice algorithm for this estimator is then derived. The q + 1 numerator spectrum coefficients are then obtained by using one of the output data sequences of this lattice algorithm. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State reduction in hidden Markov chains used for speech recognition

    Publication Year: 1985, Page(s):1138 - 1145
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    This paper examines the problem of reducing the number of states in the Markov chain models used in speech recognition algorithms by statistical methods. It is shown that the equivalence requirements between the original and reduced model lead to entirely different reduction equations depending on whether the reduction occurs inside a word model or between the models of different words. In general... View full abstract»

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

    Publication Year: 1985, Page(s): 1346
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 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.
  • On computing the discrete Fourier and cosine transforms

    Publication Year: 1985, Page(s):1341 - 1344
    Cited by:  Papers (68)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    An efficient algorithm based on real matrix decomposition is developed for computing a class of sinusoidal transforms, that include the discrete Fourier and cosine transform. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast minimum variance deconvolution

    Publication Year: 1985, Page(s):1324 - 1326
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    We propose a statistical estimation approach to the deconvolution problem which is optimal in the minimum variance sense when the a priori knowledge on the signal to be restored is strictly limited to its first two moments. By viewing the estimation problem as a degenerate case of a Kalman filter applied to a static system with time-varying measurements and by developing the corresponding Chandras... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The two-dimensional differential cepstrum

    Publication Year: 1985, Page(s):1335 - 1337
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    The two-dimensional (2-D) differential cepstrum, which has no ambiguity in its phase relationship, is introduced as a new basis for homomorphic deconvolution. Its properties and implications are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On computing the discrete Hartley transform

    Publication Year: 1985, Page(s):1231 - 1238
    Cited by:  Papers (178)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    The discrete Hartley transform (DHT) is a real-valued transform closely related to the DFT of a real-valued sequence. Bracewell has recently demonstrated a radix-2 decimation-in-time fast Hartley transform (FHT) algorithm. In this paper a complete set of fast algorithms for computing the DHT is developed, including decimation-in-frequency, radix-4, split radix, prime factor, and Winograd transform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sectioned implementation of two-dimensional symmetric half-plane recursive filters

    Publication Year: 1985, Page(s):1272 - 1279
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    This paper concerns sectioning approaches for the implementation of two-dimensional recursive filters with symmetric half-plane support. Two new algorithms are presented and compared to the direct implementation as regards computational requirements. Procedures for choosing optimal sectioning parameters for both infinite and finite size rows are provided. This method has been implemented on a scie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst-case signal spectra for broadband detection

    Publication Year: 1985, Page(s):1296 - 1301
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    As a class, broadband detection problems are difficult to analyze because, even for a fixed noise spectrum and fixed broadband signal-to-noise ratio (SNR), a continuum of different signal spectrum choices exists, each resulting in a different receiver operating characteristic (ROC) point. This paper derives the asymptotically worst-case signal spectrum corresponding to a given noise spectrum and S... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A maximum likelihood approach to frequency-wavenumber analysis

    Publication Year: 1985, Page(s):1076 - 1085
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    This paper is concerned with the likelihood ratio detection and maximum likelihood estimation of plane waves traversing a small array on irregularly placed sensors. A new detection statistic is proposed. This statistic is related to the high resolution procedure of Capon, however it has a known null distribution in the case that no signal is present. Given that a wave is present, the asymptotic di... 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