By Topic

IEEE Transactions on Signal Processing

Issue 8 • Aug 1992

Filter Results

Displaying Results 1 - 25 of 32
  • An optimal recovery approach to interpolation

    Publication Year: 1992, Page(s):1987 - 1996
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    A filter class is defined as a ball in an inner product space, and some standard results on inner product spaces are applied to filter classes. The filter design problem is addressed. The theory of optimal recovery is reviewed, and the interpolation problem is examined within an optimal recovery context. It is shown that the interpolation problem can be reduced to studying a hypercircle in an inne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast iterative algorithm for real-time array processing

    Publication Year: 1992, Page(s):2087 - 2089
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    An online iterative conjugate gradient algorithm for array processing is presented. The basic idea is to recast the array processing problem into a form so that the iterative method can be applied to compute the array weights vector recursively. To speed up the rate of convergence of the iterative process, the conjugate gradient method is used. Under moderate signal-to-noise ratios the algorithm c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust maximum likelihood bearing estimation in contaminated Gaussian noise

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

    A robust maximum likelihood (ML) direction-of-arrival (DOA) estimation method that is insensitive to outliers and distributional uncertainties in Gaussian noise is presented. The algorithm has been shown to perform much better than the Gaussian ML algorithm when the underlying noise distribution deviates even slightly from Gaussian while still performing almost as well in pure Gaussian noise. As w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and recovery of sample-and-hold and linearly interpolated signals with irregular samples

    Publication Year: 1992, Page(s):1884 - 1891
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    A modular method is suggested to recover a bandlimited signal from the sample-and-hold and linearly interpolated (or, in general, an n th-order hold) version of the irregular samples. The approach is an extension of work for the sample-and-hold signals with uniform samples. A coordinate transform technique is applied to show a practical way of finding an approximate inverse coordinate map... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New fast recursive algorithms for the computation of discrete cosine and sine transforms

    Publication Year: 1992, Page(s):2083 - 2086
    Cited by:  Papers (43)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    Fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed. An N-point discrete cosine transform (DCT) or discrete sine transform (DST) can be computed from two N/2-point DCTs or DSTs. Compared to the existing algorithms the algorithms have less multiplications by two, and add operations are better positioned, giving rise to faster comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Schur algorithm and linearly connected processor array for Toeplitz-plus-Hankel matrices

    Publication Year: 1992, Page(s):2065 - 2078
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    A Levinson-Durbin type algorithm for solving Toeplitz-plus-Hankel (T+H) linear systems of equations is used to induce a Schur-type algorithm for such systems. A Schur-type algorithm is defined as one which efficiently computes the LDU-decomposition of the matrix. On the other hand, Levinson-Durbin type algorithms are defined as those algorithms which efficiently compute the UDL-decomposition of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reverse formulation of the RISE algorithm

    Publication Year: 1992, Page(s):2105 - 2108
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    The recently developed recursive/iterative self-adjoint eigenspace (RISE) decomposition algorithm recursively computes the complete eigenspace decomposition of successively larger Hermitian matrices. However, some practical applications also require that the decomposition of successively smaller matrices be computed. A modification to the RISE algorithm is presented that makes it possible to run t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified approach to the STFT, TFDs, and instantaneous frequency

    Publication Year: 1992, Page(s):1971 - 1982
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    Cohen's class of time-frequency representations (TFRs) is reformulated into a discrete-time, discrete-frequency, computer-implementable form. It is shown how, in this form, many of the properties of the continuous-time, continuous-frequency formulation are either lost or altered. Intuitions applicable in the continuous-time case do not necessarily carry over to the discrete-time case examined. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiscale autoregressive processes. I. Schur-Levinson parametrizations

    Publication Year: 1992, Page(s):1915 - 1934
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1532 KB)

    In many applications it is of interest to analyze and recognize phenomena occurring at different scales. The recently introduced wavelet transforms provide a time-and-scale decomposition of signals that offers the possibility of such analysis. A corresponding statistical framework to support the development of optimal, multiscale statistical signal processing algorithms is described. The theory of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Nehari shuffle: FIR(q) filter design with guaranteed error bounds

    Publication Year: 1992, Page(s):1876 - 1883
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    An approach to the problem of designing a finite impulse response filter of specified length q which approximates in uniform frequency (L) norm a given desired (possibly infinite impulse response) causal, stable filter transfer function is presented. An algorithm-independent lower bound on the achievable approximation error is derived, and an approximation metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image compression with variable block size segmentation

    Publication Year: 1992, Page(s):2040 - 2060
    Cited by:  Papers (130)  |  Patents (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2604 KB)

    High-quality variable-rate image compression is achieved by segmenting an image into regions of different sizes, classifying each region into one of several perceptually distinct categories, and using a distinct coding procedure for each category. Segmentation is performed with a quadtree data structure by isolating the perceptually more important areas of the image into small regions and separate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating a covariance matrix from incomplete realizations of a random vector

    Publication Year: 1992, Page(s):2097 - 2100
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    It is desired to estimate the mean and the covariance matrix of a Gaussian random vector from a set of independent realizations, with the complication that not every component of each realization of the random vector is observed. Subject to some restrictions, the authors obtained an exact, noniterative solution for the maximum likelihood (ML) estimates of the mean and the covariance matrix. The ML... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wigner-space synthesis of discrete-time periodic signals

    Publication Year: 1992, Page(s):1997 - 2006
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    A procedure that facilitates at least-squares synthesis of periodic, discrete-time signals from Wigner quasi-distributions is proposed. The scheme is based on expanding the desired time sequence on a generally nonorthogonal, Gabor-type basis whose associated biorthogonal function presumably exists. The specific basis selection may crucially affect the efficiency and quality of the ensuing synthesi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A further analysis of decorrelation performance of spatial smoothing technique for real multipath sources

    Publication Year: 1992, Page(s):2109 - 2112
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    The authors analyze and discuss the decorrelation performance of the spatial smoothing technique based on a first-order prediction approximation applied to time-delay narrowband signals. The analysis reveals that the decorrelation effect varies with the frequency bandwidth, arrival angles, and the time delay of the multipath sources. The study of the decorrelation performance with the frequency ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A pipeline processor for mixed-size FFTs

    Publication Year: 1992, Page(s):1892 - 1900
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    A method for performing fast Fourier transforms (FFTs) of various sizes simultaneously in one pipeline processor is described. The processor consists of several stages of butterfly computational elements alternated with delay-switch-delay (DSD) modules that reorder the data between the butterfly stages. By properly ordering the input data to the pipeline and the butterfly twiddle factors, the DSD ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bit-level systolic array for median filter

    Publication Year: 1992, Page(s):2079 - 2083
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    A bit-level systolic array for median filters based on the majority of the bit strings of input samples is presented. The majority function can be implemented by a 1-b odd/even transposition network, which is regular and can be designed easily. If each input sample is represented by r bits, the systolic array contains r processor elements and requires time complexity O(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Negacyclic convolution using polynomial transforms on hypercubes

    Publication Year: 1992, Page(s):1845 - 1851
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    A polynomial-transform-based algorithm for calculating products modulo Zn+1 on a hypercube is presented. All interprocessor communication in this algorithm occurs over a Hamming distance of one; that is processors communicate only with their immediate neighbors. This algorithm has been implemented on a Connection Machine, and the performance results are discussed. Current figur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiscale autoregressive processes. II. Lattice structures for whitening and modeling

    Publication Year: 1992, Page(s):1935 - 1954
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1400 KB)

    For pt.I see ibid., vol.40, no.8, p.1915-34 (1992). Lattice structures for the whitening and modeling of isotropic processes on trees are developed, and a result relating the stability properties of these models to the reflection coefficient sequence introduced in pt.I is presented. This framework allows one to obtain a detailed analysis of the Wold decomposition of processes on trees. One interes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transform domain filtering based on pipelining structure

    Publication Year: 1992, Page(s):2061 - 2064
    Cited by:  Papers (35)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    The concept of transform domain filtering (TDF) is defined, and a pipelining structure is proposed as a means to implement it. TDF refers to filtering applied directly to transform domain data. The proposed structure consists of product blocks and an array of M adders, where M is the transform block length. The TDF output data can be obtained by summing the outputs of each produc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal detection via spectral theory of large dimensional random matrices

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

    Results on the spectral behavior of random matrices as the dimension increases are applied to the problem of detecting the number of sources impinging on an array of sensors. A common strategy to solve this problem is to estimate the multiplicity of the smallest eigenvalue of the spatial covariance matrix R of the sensed data. Existing approaches rely on the closeness of the noise eigenva... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of the directions of arrival of signals in unknown correlated noise. I. The MAP approach and its implementation

    Publication Year: 1992, Page(s):2007 - 2017
    Cited by:  Papers (61)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    The authors propose a method of direction of arrival (DOA) estimation of signals in the presence of noise whose covariance matrix is unknown and arbitrary, other than being positive definite. They examine the projection of the data onto the noise subspace. The conditional probability density function (PDF) of the projected data given the signal parameters and the unknown projected noise covariance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized sidelobe canceller with soft constraints

    Publication Year: 1992, Page(s):2112 - 2116
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    An efficient beamforming structure similar to a generalized sidelobe canceller is derived from the soft constrained minimum variance (SCMV) method of B. Van Veen (see ibid., vol.39, no.9, p.1964-72, 1991). The structure greatly reduces the computational load of the SCMV method and provides insight into the nature of SCMV beamforming View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • METEOR: a constraint-based FIR filter design program

    Publication Year: 1992, Page(s):1901 - 1909
    Cited by:  Papers (52)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    It is proposed to specify a filter only in terms of upper and lower limits on the response, find the shortest filter length which allows these constraints to be met, and then find a filter of that order which is farthest from the upper and lower constraint boundaries in a minimax sense. The simplex algorithm for linear programming is used to find a best linear-phase FIR filter of minimum length, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Can one evaluate the Gabor expansion using Gabor's iterative algorithm?

    Publication Year: 1992, Page(s):1852 - 1861
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    D. Gabor's original (1946) approach for calculation of expansion coefficients was examined and it was found that convergence of the suggested algorithm is conditional on the window function chosen. The method of analysis enables a process of synthesis, whereby eligible windows can be defined, ensuring convergence of the algorithm for every represented signal. For windows having a finite support of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strongly consistent identification algorithms and noise insensitive MSE criteria

    Publication Year: 1992, Page(s):1955 - 1970
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    Windowed cumulant projections of nonGaussian linear processes yield autocorrelation estimators which are immune to additive Gaussian noise of unknown covariance. By establishing strong consistency of these estimators, strongly consistent and noise insensitive recursive algorithms are developed for parameter estimation. These computationally attractive schemes are shown to be optimal with respect t... View full abstract»

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

Aims & Scope

IEEE Transactions on Signal Processing covers novel theory, algorithms, performance analyses and applications of techniques for the processing, understanding, learning, retrieval, mining, and extraction of information from signals

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Sergios Theodoridis
University of Athens