By Topic

IEEE Transactions on Acoustics, Speech, and Signal Processing

Issue 5 • Date 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
  • Comments on "Design of inherently stable two-dimensional recursive filter from one-dimensional filters"

    Publication Year: 1985, Page(s):1337 - 1338
    Cited by:  Papers (1)
    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
  • Lower bounds on worst case probability of large error for two channel time delay estimation

    Publication Year: 1985, Page(s):1102 - 1110
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    A lower bound on the worst case probability of large error for two channel time delay estimation using random signals is developed. The bound is based on the minimum probability of error M-ary hypothesis test using a maximum likelihood estimator (MLE). The bound can only be evaluated approximately; however, it can be determined arbitrarily well via simulation if the MLE can be instrumented. The bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A QNAR-AGC estimator with reduced arithmetic complexity

    Publication Year: 1985, Page(s):1111 - 1113
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    This paper presents a simple method for drastic reduction of the computational requirement for realization of the quasi-noise alone reference (QNAR) estimation of noise power [1]. The new estimator does not bring forth performance degradation, as shown by extensive computer simulations, and is amenable to hardware implementation for certain real-time signal processing problems. 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.
  • 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.
  • Sectioned implementation of two-dimensional symmetric half-plane recursive filters

    Publication Year: 1985, Page(s):1272 - 1279
    Cited by:  Papers (1)
    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.
  • Second-order equivalence of rectangular and exponential windows in least-squares estimation of Gaussian autoregressive processes

    Publication Year: 1985, Page(s):1209 - 1212
    Cited by:  Papers (12)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    Exact least-squares algorithms for autoregressive signals can be made to track time-varying parameters by using sliding windows on the data. Two common choices for such windows are the exponential one and the rectangular one. In this paper, it is shown that for Gaussian autoregressive processes, the two types of windows yield approximately the same mean-square error if the windows' parameters are ... 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 (15)
    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.
  • Spectral filtering using the fast Walsh transform

    Publication Year: 1985, Page(s):1246 - 1252
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 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.
  • Direction determination of wideband signals

    Publication Year: 1985, Page(s):1114 - 1122
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    A computationally efficient sensor array processing method has been developed for estimating the bearings of multiple planewave sources with unknown frequency characteristics within a wideband. The method uses the zero-delay covariances of the complex analytic representations of the sensor signals of a planar array to estimate the wavenumber spectrum. This spectrum determines source bearings over ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient recursive in order least squares FIR filtering and prediction

    Publication Year: 1985, Page(s):1175 - 1187
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    This paper is concerned with the efficient determination of the optimum, in the least squares sense, FIR filter on the basis of data samples of the input and desired response signals, by procedures recursive in the filter order. This situation typically arises when no a priori statistics are available and the system order is not known. The general multiinput-multioutput (multichannel) case is cons... 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 (488 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... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a conjecture of J. L. C. Sanz and T. S. Huang

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

    In [1] J. L. C. Sanz and T. S. Huang conjectured that the DFT implementation of the Papoulis-Gerchberg algorithm for the extrapolation of band-limited signals does approach the continuous extrapolation. In this respect we prove a result on the approximation of band-limited functions by trigonometric polynomials, simultaneously increasing its degree and the period-length. This will imply that the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge-sensitive image restoration using order-constrained least squares methods

    Publication Year: 1985, Page(s):1253 - 1263
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1944 KB)

    In this paper we consider a novel technique for the restoration of noise corrupted images, using order-constrained least squares methods. The restoration process uses a moving cross-shaped filter window, within which two operations are combined. The first operation consists of simple hypothesis tests for the presence of an edge of some minimal height δ, crossing the center of the window. The ... 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 (41)  |  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 recursive procedure for ARMA modeling

    Publication Year: 1985, Page(s):1188 - 1196
    Cited by:  Papers (10)
    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.
  • Output distributions of two-dimensional median filters

    Publication Year: 1985, Page(s):1280 - 1295
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1360 KB)

    The output distribution for the separable two-dimensional median filter and the square window two-dimensional median filter are derived for several cases, including first-order and multivariate output distributions with white noise, signals plus white noise, and general multivariate input images. These are then used to compute some specific statistics in several illustrative examples. 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 (3)
    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.
  • Dynamic range and error dissipation of adaptive quantizers

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

    An analysis of backward estimating adaptive quantizers is presented. The algorithms studied are linear in logarithmic step size, which is the case for many quantizers presented in the literature. The dynamic range in terms of signal-to-distortion ratio and the effect of digital errors on the decoding process are investigated. It is shown that an unlimited dynamic range is possible only at the expe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bispectrum estimation: A parametric approach

    Publication Year: 1985, Page(s):1213 - 1230
    Cited by:  Papers (136)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1608 KB)

    Higher order spectra contain information about random processes that is not contained in the ordinary power spectrum such as the degree of nonlinearity and deviations from normality. Estimation of the bispectrum, which is a third-order spectrum, has been applied in various fields to obtain information regarding quadratic phase coupling among harmonic components and non-Gaussianness of processes. E... 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 (5)  |  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.
  • On computing the discrete Fourier and cosine transforms

    Publication Year: 1985, Page(s):1341 - 1344
    Cited by:  Papers (47)  |  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.

Aims & Scope

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

Full Aims & Scope