IEEE Transactions on Signal Processing

Issue 1 • Jan 1991

Filter Results

Displaying Results 1 - 25 of 42
  • An eigenanalysis interference canceler

    Publication Year: 1991, Page(s):76 - 84
    Cited by:  Papers (187)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (848 KB)

    Eigenanalysis methods are applied to interference cancellation problems. While with common array processing methods the cancellation is effected by global optimization procedures that include the interferences and the background noise, the proposed technique focuses on the interferences only, resulting in superior cancellation performance. Furthermore, the method achieves full effectiveness even f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The application of core functions to residue number systems

    Publication Year: 1991, Page(s):69 - 75
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (492 KB)

    A theory of core functions is presented, and the application of this theory to the difficult residue number system (RNS) operations is described. Potential applications for special-purpose core-based RNS processors include adaptive array processing, Kalman filtering, fast-Fourier transforms, and image processing. The theoretical developments are motivated by the assumption that look-up tables are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linear, time-varying system framework for noniterative discrete-time band-limited signal extrapolation

    Publication Year: 1991, Page(s):55 - 68
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1184 KB)

    A technique for the analysis and design of noniterative algorithms for discrete-time, band-limited signal extrapolation is described. The approach involves modeling the extrapolation process as a linear, time-varying (LTV) system, or filter. Together with a previously developed Fourier theory for LTV systems, this model provides a frequency-domain transfer function representation for the extrapola... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complex Chebyshev approximation for FIR digital filters

    Publication Year: 1991, Page(s):49 - 54
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (512 KB)

    An adaptive approach to FIR (finite impulse response) filter design is applied to a fully general complex specification, showing it to be capable of giving an optimum Chebyshev solution. It is thought to be one of the first practical approaches to achieve this in the case of a complex function. Design examples include a bandpass filter with nearly linear phase and all-pass filters with general sha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Super resolution pitch determination of speech signals

    Publication Year: 1991, Page(s):40 - 48
    Cited by:  Papers (90)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (776 KB)

    Based on a new similarity model for the voice excitation process, a novel pitch determination procedure is derived. The unique features of the proposed algorithm are infinite (super) resolution, better accuracy than the difference limen for F0, robustness to noise, reliability, and modest computational complexity. The algorithm is instrumental to speech processing applications ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive triangular array ladder algorithms

    Publication Year: 1991, Page(s):122 - 136
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1212 KB)

    Two recursive-least-squares ladder algorithms for implementation on triangular systolic arrays are presented. The first algorithm computes transversal forward/backward predictor coefficients, ladder reflection coefficients, and forward/backward residual energies. This algorithm has a complexity of three multiplications and additions per rotational (triangular array) element. A second algorithm is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systolic array designs for Kalman filtering

    Publication Year: 1991, Page(s):171 - 182
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (952 KB)

    Systolic Kalman filter (SKF) designs based on a triangular array (triarray) configuration are presented. A least squares formulation, which is an expanded matrix representation of the state space iteration, is adopted to develop an efficient iterative QR triangularization and consecutive data prewhitening formulations. This formulation has advantages in both numerical accuracy and processor utiliz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of an acoustic-phonetic hidden Markov model for continuous speech recognition

    Publication Year: 1991, Page(s):29 - 39
    Cited by:  Papers (38)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (908 KB)

    The techniques used to develop an acoustic-phonetic hidden Markov model, the problems associated with representing the whole acoustic-phonetic structure, the characteristics of the model, and how it performs as a phonetic decoder for recognition of fluent speech are discussed. The continuous variable duration model was trained using 450 sentences of fluent speech, each of which was spoken by a sin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extension of the sampling theorem to exponentially decaying causal functions

    Publication Year: 1991, Page(s):189 - 190
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (172 KB)

    A simple extension of the sampling theorem to nonbandlimited exponentially decaying functions is reported. After an immediate transformation, logarithmically spaced samples are used to reconstruct the original function. One of the most interesting properties of this method is that it enables measuring the time delay introduced by narrowband systems very accurately View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified systolic array for discrete cosine and sine transforms

    Publication Year: 1991, Page(s):192 - 194
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (264 KB)

    A linear systolic array for the discrete cosine transform, discrete sine transform, and their inverses is developed. It generates the transform kernel values recursively. Compared to the scheme with the transform kernel values prestored in memory either inside or outside each processing element, the clock period is shortened by a memory access time. In addition, the array pays no cost for prestora... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the convergence of the estimated posterior density weighted algorithm

    Publication Year: 1991, Page(s):254 - 255
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (168 KB)

    Sufficient conditions are established for the convergence of the algorithm when applied to the problem of radar imaging as suggested by D.L. Snyder and H.J. Whitehouse (1985), and the problem of enhancement of nonstationary spectrum estimators based on L. Cohen's (1966) class of time-frequency distributions, as proposed by L.B. White (1989). In the latter case, a regularization step must be includ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multistep size (MSS) frequency domain adaptive filter

    Publication Year: 1991, Page(s):115 - 121
    Cited by:  Papers (24)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (620 KB)

    A multistep size frequency-domain adaptive filter capable of tracking both stationary and nonstationary signals is proposed. This algorithm makes use of the simple structure of the least mean square error algorithm to update the filter coefficients and process the signal. It then proceeds further by incorporating a set of three step sizes and a knowledge-based strategy to select the best set of fi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A concurrent implementation of the prime factor algorithm on hypercube

    Publication Year: 1991, Page(s):160 - 170
    Cited by:  Papers (10)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (988 KB)

    The prime factor algorithm (PFA) is an efficient discrete Fourier transform (DFT) computation algorithm in which a one-dimensional DFT is tuned into a multidimensional DFT, consisting of a few short DFTs whose lengths are mutually prime, and then an efficient algorithm is used for the short DFTs. The PFA was implemented on a hypercube using CrOS III communication routines, taking 120 ms to compute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive technique for determining a reduced model for a system

    Publication Year: 1991, Page(s):200 - 202
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (220 KB)

    A reduced or sparse system model is discussed that will contain only the most significant components, as opposed to a complete finite impulse response (FIR) model which may not be very accurate with the requirement of only a few components. The technique presented uses an adaptive delay filter to provide the sparse model and compares it to the model obtained with the standard adaptive filter View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image compression by variable block truncation coding with optimal threshold

    Publication Year: 1991, Page(s):208 - 212
    Cited by:  Papers (38)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1256 KB)

    A variable block truncation coding (BTC) algorithm is proposed for image compression. It is shown that there exists an optimal threshold for the quantization in BTC algorithms (fixed and variable) that minimizes the errors. Compared to the fixed BTC (fBTC), the variable BTC (vBTC) gives better performance on all the tested images. The use of vBTC with optimal threshold leads to a reduction of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A grammar compiler for connected speech recognition

    Publication Year: 1991, Page(s):17 - 28
    Cited by:  Papers (8)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1096 KB)

    A compiler for constructing optimized syntactic digraphs from easily written grammar specifications is described. These are written in a language called grammar specification language (GSL). The compiler has a preprocessing (macroexpansion) phase, a parse phase, graph code generation and compilation phases, and three optimization phases. Digraphs can also be linked together by a graph linker to fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transform-based covariance differencing approach to the array with spatially nonstationary noise

    Publication Year: 1991, Page(s):219 - 221
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (268 KB)

    The problem of bearing estimation in a situation where the additive white noise is assumed to be spatially nonstationary, i.e uncorrelated and of unequal power from sensor to sensor, is discussed. In this condition, the resolution of the standard methods decreases and the problem of source enumeration becomes more involved. A transform-based covariance differencing approach is proposed to resolve ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Hartley transform pruning

    Publication Year: 1991, Page(s):230 - 233
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (324 KB)

    The discrete Hartley transform (DHT) is discussed as a tool for the processing of real signals. Fast Hartley transform (FHT) algorithms which compute the DHT in a time proportional to N log2 N exist. In many applications, such as interpolation and convolution of signals, a significant number of zeros are padded to the nonzero valued samples before the transform is com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensitivity of color LMMSE restoration of images to the spectral estimate

    Publication Year: 1991, Page(s):248 - 252
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (536 KB)

    The sensitivity to the spectral estimate of the original image of linear minimum mean-square error (LMMSE) color image restoration methods is determined. It is concluded that (i) sensitivity of the full-correlation Wiener restoration to the spectral estimate is higher than that of the independent-channel Wiener restoration, and the full-correlation restoration is extremely sensitive to windowing, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of adaptive filters equipped with the dual sign algorithm

    Publication Year: 1991, Page(s):85 - 91
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (524 KB)

    A convergence analysis for stochastic gradient adaptive filters equipped with the dual sign algorithm (DSA) is presented. Expressions for the mean and mean-squared values of the coefficient misalignment vector are derived under the assumption that the input signal is Gaussian. The main differences between the current analysis and previous analyses are: (1) the present analysis is valid for arbitra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel and sequential block Kalman filtering and their implementations using systolic arrays

    Publication Year: 1991, Page(s):137 - 147
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (800 KB)

    Two sets of block Kalman filtering equations that differ in the manner of generating the initial and updated estimates are derived. Parallel and sequential schemes for generating these estimates are adopted. It is shown that the parallel implementation inherently leads to a block Kalman estimator which provides filtered estimates at the vector (block) level and fixed-lag smoother estimates at the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral smoothing and recursion based on the nonstationarity of the autocorrelation function

    Publication Year: 1991, Page(s):183 - 185
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (244 KB)

    Averaging and recursion in short-time spectral analysis in view of the nature of the nonstationarity of the random process is addressed. Using the Wigner spectrum estimator as a general model, this correspondence relates the selection of the time and lag windows to the stationary intervals of the autocorrelation at different lags. The lag-dependent time averaging for two types of commonly assumed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A derivation of the Gohberg-Semencul relation [signal analysis]

    Publication Year: 1991, Page(s):190 - 192
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (204 KB)

    A simple proof of the Gohberg-Semencul decomposition of the inverse of the correlation matrix of an autoregressive (AR) process is given. The proof is based on the Cholesky decomposition and the centrosymmetric property of symmetric Toeplitz matrices. The Gohberg-Semencul relation is derived in a simple way by doubling the size, but not the order, of the AR process View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bearing estimation without calibration for randomly perturbed arrays

    Publication Year: 1991, Page(s):194 - 197
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (312 KB)

    The bearing estimation problem of linearly periodic arrays with the presence of sensor position errors is discussed. Conventional approaches for solving this problem generally consist of two steps: calibrating sensor locations and then performing bearing estimation based on the calibrated sensor locations. Approaches to carrying out bearing estimation based on the Toeplitz and eigenstructure recon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A two step Burg algorithm [spectral analysis]

    Publication Year: 1991, Page(s):185 - 189
    Cited by:  Papers (4)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (424 KB)

    The problem of estimating the parameters of a real-valued, stationary, nondeterministic, autoregressive process of order p from a time series of finite length is discussed. Burg's algorithm estimates these parameters indirectly by sequentially estimating one reflection coefficient at a time. The proposed approach is to sequentially estimate the reflection coefficients in pairs. The new al... 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
Pier Luigi Dragotti
Imperial College London