By Topic

IEEE Transactions on Signal Processing

Issue 7 • Date Jul 1993

Filter Results

Displaying Results 1 - 21 of 21
  • On the stability of sigma delta modulators

    Publication Year: 1993, Page(s):2322 - 2348
    Cited by:  Papers (62)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2164 KB)

    A framework for stability analysis of sigma-delta modulators is presented. It is argued that limit cycles for constant inputs are natural objects to investigate in this context. A number of analytical and approximate techniques to aid the stability analysis of the double loop and interpolative modulators are discussed and lead to ways of improving the design that explicitly take stability into acc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized parametric PR-QMF design technique based on Bernstein polynomial approximation

    Publication Year: 1993, Page(s):2314 - 2321
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    A generalized, parametric, perfect-reconstruction quadrature-mirror-filter (PR-QMF) design technique based on Bernstein polynomial approximation in the magnitude-square domain is presented. The parametric nature of this solution provides useful insights to the PR-QMF problem. Several well-known orthonormal wavelet filters, PR-QMFs, are shown to be the special cases of the proposed technique. Energ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast fault-tolerant digital convolution using a polynomial residue number system

    Publication Year: 1993, Page(s):2300 - 2313
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    A fault-tolerant convolution algorithm that is an extension of residue-number-system fault-tolerance schemes applied to polynomial rings is described. The algorithm is suitable for implementation on multiprocessor systems and is able to concurrently mask processor failures. A fast algorithm based on long division for detecting and correcting multiple processor failures is presented. Moduli polynom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The cross-bicepstrum: definition, properties, and application for simultaneous reconstruction of three nonminimum phase signals

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

    The recovery of three signals from their cross-bispectrum (or the identification of the impulse responses of three parallel linear time-invariant (LTI) systems from the cross-bispectrum of their system outputs) by computing the complex cepstrum of the cross-bispectrum, as long as the signals (or impulse responses) have no zeros on the unit circle, is discussed. It is shown that the three signals c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive time-delay estimation in nonstationary signal and/or noise power environments

    Publication Year: 1993, Page(s):2289 - 2299
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    A model for an adaptive time-delay estimator is proposed to improve its performance in estimating the difference in arrival time of a bandlimited random signal received by two spatially separated sensors in an environment where the signal and noise power are time varying. The system comprises two adaptive units: a filter to compensate time shift between the two receiver channels and a gain control... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient recursive algorithm for time-varying Fourier transform

    Publication Year: 1993, Page(s):2488 - 2490
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    An efficient recursive algorithm for computing the time-varying Fourier transform (TVFT) or short-time Fourier transform (STFT) of a time sequence is presented. In this approach, instead of excluding the old samples, their importance is diminished by using all-pole moving windows. This recursive algorithm requires about one half of the computation and storage of the Amin's algorithm. The resulting... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derivative constrained optimum broad-band antenna arrays

    Publication Year: 1993, Page(s):2376 - 2388
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    The optimization problem corresponding to the design of a presteered broadband processor with maximally flat second-order spatial response in the look direction is discussed. The constraints corresponding to necessary and sufficient conditions for second-order flatness are presented. The nonlinearly constrained optimization approach is unable to consistently locate the global minimum. An approach ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Georgia Tech digital signal multiprocessor

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

    Techniques for implementation of digital signal processing (DSP) algorithms on synchronous multiprocessors studied for the past ten years are discussed. This research is characterised as a theoretical investigation of optimality criteria for the implementation of DSP algorithms and the development of a unique approach that can achieve these optimality criteria. A result of this ongoing research pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some results in fixed point error analysis of the Bruun-FTT algorithm

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

    Results for a fixed-point error analysis of the Bruun-fast Fourier-transform (FFT) algorithm are presented. The noise-to-signal ratio of the Bruun algorithm is evaluated theoretically as well as experimentally and is compared to that of the decimation-in-time FFT. The noise-to-signal ratio of the Bruun-FFT is found to be significantly higher if safe scaling is applied in both cases View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical analysis for the convergence rate of signals to median filter roots

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

    The convergence behavior of the median filter is analyzed. A concept called convergence point is used to characterize the convergence rates. The results show that any independently and identically distributed (i.i.d) signal will become nearly stable after three or four passes of median filter with a large probability. Simulations are provided to illustrate the theoretical developments View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-SNR asymptotics for signal-subspace methods in sinusoidal frequency estimation

    Publication Year: 1993, Page(s):2448 - 2460
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    High-SNR-limit second-order properties of multiple signal classification (MUSIC), minimum-norm (MN), and subspace rotation (SUR) signal-subspace methods for sinusoidal frequency estimation are discussed. An alternative to large-sample analysis of the methods is presented. The two most important variants of these methods are considered in connection with the choice of the sample covariance matrix: ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast algorithms for close-to-Toeplitz-plus-Hankel systems and two-sided linear prediction

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

    The low-displacement-rank definition of close-to-Toeplitz (CT) matrices is extended to close-to-Toeplitz-plus-Hankel (CTPH) matrices. Fast algorithms for solving CTPH systems of equations are presented. A matrix is defined as CTPH if the sum of a CT matrix and a second CT matrix postmultiplied by an exchange matrix; an equivalent definition in terms of UV rank is also given. This definition is mot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System identification using a linear combination of cumulant slices

    Publication Year: 1993, Page(s):2405 - 2412
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    A linear approach to identifying the parameters of a moving-average (MA) model from the statistics of the output is presented. First, it is shown that, under some constraints, the impulse response of the system can be expressed as a linear combination of cumulant slices. Then, this result is used to obtain a well-conditioned linear method for estimating the MA parameters of a nonGaussian process. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Line search algorithms for adaptive filtering

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

    Line search algorithms for adaptive filtering that choose the convergence parameter so that the updated filter vector minimizes the sum of squared errors on a linear manifold are described. A shift invariant property of the sample covariance matrix is exploited to produce an adaptive filter stochastic line search algorithm for exponentially weighted adaptive equalization requiring 3N+5 mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beamspace Root-MUSIC for minimum redundancy linear arrays

    Publication Year: 1993, Page(s):2502 - 2507
    Cited by:  Papers (6)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    Beamspace Root-MUSIC, a computationally efficient beamspace implementation of Root-MUSIC developed recently for use in conjunction with a uniformly spaced linear array (ULA), is discussed. Computationally efficient methods for using beamspace Root-MUSIC in conjunction with a minimum redundancy linear array (MRLA) for both the narrowband and wideband cases are developed. The MRLA is attractive in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Waveform-preserving blind estimation of multiple independent sources

    Publication Year: 1993, Page(s):2461 - 2470
    Cited by:  Papers (131)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    The problem of blind estimation of source signals is to estimate the source signals without knowing the characteristics of the transmission channel. It is shown that the minimum-variance unbiased estimates can be obtained if and only if the transmission channel can be identified blindly. It is shown that the channel can be blindly identified if and only if there is not more than one Gaussian sourc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis for the realization of an in-place and in-order prime factor algorithm

    Publication Year: 1993, Page(s):2362 - 2370
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    It is shown that the prime factor algorithm (PFA) has an intrinsic property that allows it to be easily realized in an in-place and in-order form. In contrast to other approaches that use two equations for loading data from and returning the results to the memory, respectively, it is shown formally that in many cases only one equation is enough for both operations. Thus a truly in-place and in-ord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broad-band detection based on two-dimensional mixed autoregressive models

    Publication Year: 1993, Page(s):2413 - 2428
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    Two detectors for broadband plane waves in colored noise fields that use a linear array are described. The signal spectrum, arrival angle, and noise field coloration are not known a priori. Using a two-dimensional mixed autoregressive model, a generalized-likelihood-ratio test and its weak-signal equivalent, the Rao test, are derived. The performances of the proposed detectors are shown by compute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast radix-3/9 discrete Hartley transform

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

    An efficient algorithm for computing radix-3/9 discrete Hartley transforms (DHTs) is presented. It is shown that the radix-3/9 fast Hartley transform (FHT) algorithm reduces the number of multiplications required by a radix-3 FHT algorithm for nearly 50%. For the computation of real-valued discrete Fourier transforms (DFTs) with sequence lengths that are powers of 3, it is shown that the radix-3/9... View full abstract»

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

    Publication Year: 1993, Page(s):2429 - 2438
    Cited by:  Papers (175)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    A feasible algorithm for implementing the Gabor expansion, the coefficients of which are computed by the discrete Gabor transform (DGT), is presented. For a given synthesis window and sampling pattern, computing the auxiliary biorthogonal function of the DGT is nothing more than solving a linear system. The DGT presented applies for both finite as well as infinite sequences. By exploiting the nonu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal data-based kernel estimation of evolutionary spectra

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

    Complex demodulation of evolutionary spectra is formulated as a two-dimensional kernel smoother in the time-frequency domain. First, a tapered Fourier transform, yv(f, t), is calculated. Then the log-spectral estimate, is smoothed. As the characteristic widths of the kernel smoother increase, the bias from the temporal and frequency averaging increases while 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