By Topic

IEEE Transactions on Signal Processing

Issue 6 • June 1993

Filter Results

Displaying Results 1 - 25 of 27
  • Perfect reconstruction filter banks with rational sampling factors

    Publication Year: 1993, Page(s):2047 - 2066
    Cited by:  Papers (115)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1514 KB)

    An open problem, namely, how to construct perfect reconstruction filter banks with rational sampling factors, is solved. Such filter banks have N branches, each one having a sampling factor of p i/qi, and their sum equals one. In this way, the well-known theory of filter banks with uniform band splitting is extended to allow for nonuniform divisions of the spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling of DSP programs onto multiprocessors for maximum throughput

    Publication Year: 1993, Page(s):2225 - 2235
    Cited by:  Papers (56)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    A flow graph scheduling algorithm that simultaneously considers pipelining, retiming, parallelism, and hierarchical node decomposition is presented. The ability to simultaneously consider the many types of concurrency allows the scheduler to find efficient multiprocessor solutions for a wide range of DSP applications. It has been implemented as part of a software environment for scheduling DSP pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive lattice bilinear filters

    Publication Year: 1993, Page(s):2033 - 2046
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    Two fast least-squares lattice algorithms for adaptive nonlinear filters equipped with bilinear system models are presented. The lattice filter formulation transforms the nonlinear filtering problem into an equivalent multichannel linear filtering problem, thus using multichannel lattice filtering algorithms to solve the nonlinear filtering problem. The computational complexity of the algorithms i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The achievable accuracy in estimating the instantaneous phase and frequency of a constant amplitude signal

    Publication Year: 1993, Page(s):2216 - 2224
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    The approach is based on modeling the signal phase by a polynomial function of time on a finite interval. The phase polynomial is expressed as a linear combination of the Legendre basis polynomials. First, the Cramer-Rao bound (CRB) of the instantaneous phase and frequency of constant-amplitude polynomial-phase signals is derived. Then some properties of the CRBs are used to estimate the order of ... View full abstract»

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

    Publication Year: 1993, Page(s):2249 - 2253
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    Signal processing algorithms optimized for Gaussian noise may degrade significantly in a non-Gaussian noise environment. Therefore it is important to characterize the noise accurately before including its structure in the formulation of algorithms. A generic distribution suitable for modeling non-Gaussian ambient noise in the kurtosis range 1.8⩽β2⩽4.2 is derived View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gohberg-Semencul type formulas via embedding of Lyapunov equations [signal processing]

    Publication Year: 1993, Page(s):2208 - 2215
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    The authors present a new way of deriving Gohberg-Semencul-type inversion formulas for Hermitian Toeplitz and quasi-Toeplitz matrices. The approach is based on a certain Σ-lossless embedding of Lyapunov equations. It has been shown that if a nonsingular matrix R has Toeplitz displacement inertia {p, q}, then R-1 does not have the same Toeplitz ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determination of the MA order of an ARMA process using sample correlations

    Publication Year: 1993, Page(s):2277 - 2280
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    It is shown that autoregressive information and moving average information are implicitly contained in two different correlation matrices. An algorithm for MA order determination which adopts only autocorrelations and the AR order without requiring AR coefficients is proposed. Numerical simulations are presented to show the practical value of the proposed singular-value-decomposition (SVD)-based a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Numerical stability properties of a QR-based fast least squares algorithm

    Publication Year: 1993, Page(s):2096 - 2109
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1184 KB)

    The numerical stability of a recent QR-based fast least-squares algorithm is established from a backward stability perspective. A stability domain approach applicable to any least-squares algorithm, constructed from the set of reachable states in exact arithmetic, is presented. The error propagation question is shown to be subordinate to a backward consistency constraint, which requires t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two chi-square statistics for determining the orders p and q of an ARMA (p, q) process

    Publication Year: 1993, Page(s):2165 - 2176
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The θ, λ, and η functions have been previously proposed for use in choosing the autoregressive and moving-average orders of an ARMA (q, p) process visually. Two chi-square statistics associated with these three functions are presented and used here to determine the orders of an ARMA process statistically. It is shown that the two statistics are asymptotically equ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple derivation of the constrained multiple parameter Cramer-Rao bound

    Publication Year: 1993, Page(s):2247 - 2249
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    J.D. Gorman and A.O. Hero (1988) obtained a remarkable extension to the classical multiple parameter Cramer-Rao (CR) lower bound that accounts for deterministic nonlinear equality constraints on the parameters. The virtue of Gorman and Hero's result is that the constrained CR bound on all of the parameters is obtained by subtracting an easily computed nonnegative definite correction matrix from th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimal weight vector of a perceptron with Gaussian data and arbitrary nonlinearity

    Publication Year: 1993, Page(s):2257 - 2259
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    The authors investigate the solution to the following problem: find the optimal weighted sum of given signals when the optimality criterion is the expected value of a function of this sum and a given `training' signal. The optimality criterion can be a nonlinear function from a very large family of possible functions. A number of interesting cases fall under this general framework, such as a singl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive ARMA four-line lattice filter for spectral estimation with frequency weighting

    Publication Year: 1993, Page(s):2193 - 2207
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    A method for designing an adaptive four-line lattice filter which can perform frequency-weighting spectral estimation, which provides more accurate spectral estimation for some frequency bands than for others, is proposed. Using a suitable frequency-weighting function, denoted as an ARMA (autoregressive moving-average) model, an estimated spectrum is obtained by arbitrarily weighing some frequency... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear interpolation lattice for nonstationary signals

    Publication Year: 1993, Page(s):2262 - 2264
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    A ladder algorithm for linear interpolation of nonstationary signals is developed. The algorithm is based on the sliding-window least-squares method and can be implemented using a lattice structure. Furthermore, by assuming that the input signal is stationary, the number of parameters required to be calculated is reduced. The lattice structure in the case of stationary input is also presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantification of the difference between detection and resolution thresholds for multiple closely spaced emitters

    Publication Year: 1993, Page(s):2274 - 2277
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    The problem of estimating the parameters of multiple signals closely spaced in either space or frequency has been much researched because it is a difficult case for modern spectral analysis techniques. Based on empirical evidence, it has been noted by others that signal-to-noise ratio (SNR) detection thresholds typically are lower than resolution thresholds. That is, one can detect the occurrence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind convolution using signal reconstruction from partial higher order cepstral information

    Publication Year: 1993, Page(s):2088 - 2095
    Cited by:  Papers (31)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    A blind deconvolution scheme for the reconstruction of a signal that propagates in the presence of reverberation and additive noise is presented. The reconstruction employs data collected by two receivers placed well apart from each other. Each received sequence consists of the convolution of the transmitted signal with a channel. Applying the bicepstrum iterative reconstruction algorithm on the d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear prediction, maximum flatness, maximum entropy, and AR polyspectral estimation

    Publication Year: 1993, Page(s):2155 - 2164
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    The authors present a theoretical foundation for polyspectral estimation and modeling of non-Gaussian autoregressive (AR) processes which includes a new higher-order-statistics (HOS)-based linear prediction error filter and associated linear prediction polyspectral estimator, and a maximum higher order entropy polyspectral estimator, and considers the equivalences among these polyspectral estimato... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular VLSI architectures for computing the arithmetic Fourier transform

    Publication Year: 1993, Page(s):2236 - 2246
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    Modular, area-efficient VLSI architectures for computing the arithmetic Fourier transform (AFT) are proposed. By suitable design of PEs and I/O sequencing, nonuniform data dependencies in the AFT computation which require nonequidistant inputs and assignment of Mobius function values are resolved. The proposed design employs 2N+1 PEs to compute 2N+1 Fourier coefficients. Each PE ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a sign algorithm with delayed data

    Publication Year: 1993, Page(s):2253 - 2257
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    An adaptive filter whose weights are adapted using a sign algorithm with a delayed error signal is analyzed. For stationary environments it is proved that the excess average absolute estimation error is bounded for all values of the error signal delay and the algorithm step size. For the nonstationary case when the optimal filter weights are time varying, the optimum step size which minimizes the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthonormal and biorthonormal filter banks as convolvers, and convolutional coding gain

    Publication Year: 1993, Page(s):2110 - 2130
    Cited by:  Papers (38)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1620 KB)

    Convolution theorems for filter bank transformers are introduced. Both uniform and nonuniform decimation ratios are considered, and orthonormal as well as biorthonormal cases are addressed. All the theorems are such that the original convolution reduces to a sum of shorter, decoupled convolutions in the subbands. That is, there is no need to have cross convolution between subbands. For the orthono... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transient signal detection using prior information in the likelihood ratio test

    Publication Year: 1993, Page(s):2177 - 2192
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    A uniform approach to the problem of detecting a deterministic transient signal of unknown waveshape in Gaussian noise that is applicable for a general class of signals is provided. It is assumed that the vector representation consists of a group of zero coefficients plus a group of unknown nonzero coefficients, starting at a certain index. Performance indices for a likelihood-ratio-test detector ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the PQ theorem and the extrapolation of signals

    Publication Year: 1993, Page(s):2259 - 2261
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    The problem of determining a bandlimited function from its values on a finite interval is ill-conditioned in the sense that although the pertinent inverse map exists, it is discontinuous at every point. Whenever certain closely related general problems are well conditioned in the sense that the inverse operator is continuous, they can be solved using a special case of a known algorithm. In particu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum weighted smoothing in finite data

    Publication Year: 1993, Page(s):2265 - 2269
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    The authors consider a generalized smoothing problem and develop a procedure to obtain a set of optimum weights which gives minimum mean-squared error in the estimates of directions of arrival (DOAs) of signals in finite data when the signals are arbitrarily correlated. Using the optimum weights, they study the optimum tradeoff between the number of subarrays and the subarray size for a fixed tota... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wiener filter realization for target detection using group delay statistics

    Publication Year: 1993, Page(s):2067 - 2074
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Several techniques are demonstrated for Wiener filter realization based on group delay statistics. The theoretical analysis shows that an inverse relationship exists between the frequency-domain signal-to-noise ratio and the group delay moving standard deviation and/or group delay moving entropy. Therefore, an adaptive Wiener filter can be realized without a priori knowledge of the signal and nois... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In the optimum design of the block adaptive FIR digital filter

    Publication Year: 1993, Page(s):2131 - 2140
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    A general optimum block adaptive (GOBA) algorithm for adaptive FIR (finite impulse response) filtering is presented. In this algorithm, the correction terms for the filter coefficients in each block, instead of the convergence factors, are optimized in a least squares sense. There are no constraints on the block length L and the filter tap number N. It is shown that the GOBA algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Observation noise and zero loci of the time series model

    Publication Year: 1993, Page(s):2269 - 2273
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    The properties of zeros of time series models are examined in a linear stochastic system with white Gaussian observation noise. Each zero has a locus in the complex plane as the variance of observation noise changes from zero to infinity. An application of zero loci is presented for understanding the properties of the autoregressive model 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