By Topic

IEEE Transactions on Signal Processing

Issue 3 • Date Mar 1993

Filter Results

Displaying Results 1 - 25 of 51
  • The role of integer matrices in multidimensional multirate systems

    Publication Year: 1993, Page(s):1035 - 1047
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    Various theoretical issues in multidimensional (m-D) multirate signal processing are formulated and solved. In the problems considered, the decimation matrix and the expansion matrix are nondiagonal, so that extensions of 1-D results are nontrivial. The m -D polyphase implementation technique for rational sampling rate alterations, the perfect reconstruction properties for the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Wigner distribution of a linear signal space

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

    A time-frequency representation of linear signal spaces, called its Wigner distribution (WD), is introduced. Similar to the WD of a signal, the WD of a linear signal space describes the space's energy distribution over the time-frequency plane. It is shown that the WD of a signal space can be defined both in a deterministic and in a stochastic framework, and it can be expressed in a simple way in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified square-root-free approach for QRD-based recursive-least-squares estimation

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

    The generic formula for the Givens rotation, the most commonly used method for QR-decomposition (QRD) updating, requires explicit square-root (sqrt) computations, which constitute a computational bottleneck. A unified systematic approach for sqrt-free Givens rotations is provided. By properly choosing two parameters, all previously known, as well as new, sqrt-free methods are included in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new extrapolation algorithm for band-limited signals using the regularization method

    Publication Year: 1993, Page(s):1048 - 1060
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The ill-posedness of the extrapolation problem in the presence of noise is considered. A stable algorithm is constructed by solving a Fredholm equation based on a regularization method. The algorithm appears relatively robust, since the noise ηδ(t ) is taken as a function in L2[-T,T](T>0) such that the error energy &in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequency estimation performance of several weighted Burg algorithms

    Publication Year: 1993, Page(s):1237 - 1247
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The frequency estimation performance of a set of weighted Burg algorithms is investigated for single complex and real sinusoids in noise. It is demonstrated that in the complex case, an extension of Ibrahim's (1987, 1989) modification of Kaveh and Lipert's (1983) optimum tapered Burg algorithm meets the Cramer-Rao lower bound for a sufficiently high signal-to-noise ratio and a sufficiently large m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new technique for ARMA-system identification and rational approximation

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

    The fundamental problem of identifying a linear time-invariant system from measured samples of its output response to a known input is addressed, utilizing a new and simple deterministic theory founded on well-established passive network concepts. The analysis, together with documented numerical results, demonstrates that the proposed method achieves two goals: stable rational minimum-phase transf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved square-root forms of fast linear least squares estimation algorithms

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

    Improving the numerical stability of fast algorithms by square-root factorization generally requires the use of hypernormal transformations which do not always exhibit a satisfactory numerical behavior. An alternate approach, adapted from a paper by A.W. Bojanczyk and A. O. Steinhardt (see ibid., vol.37, p.1286-8, 1989), is proposed. It uses orthogonal transformations, which leads to more stable f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of orthonormal transforms to implementation of quasi-LMS/Newton algorithm

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

    An efficient implementation of the LMS/Newton (LMSN) algorithm is proposed. The scheme uses a quasi-inverse of the correlation matrix of the input instead of its exact inverse. The proposed algorithm, which is an alternative formulation of a class of transform domain adaptive filters (TDAFs), has some advantages over the TDAF. A feature of the scheme that greatly simplifies its implementations is ... View full abstract»

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

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

    Adaptive microstatistic filters are developed for applications in which the second-order statistics of the thresholded signals are not known or may be nonstationary. A multilevel threshold decomposition such that real-valued stochastic processes can be filtered is used, and the computational complexity of the algorithm can be arbitrarily specified by the designer. The adaptation uses the least-mea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Serial-parallel FFT array processor

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

    An array architecture for computing a fast Fourier transform (FFT) with a flexible number of identical processing elements is presented. The architecture is based on the symmetry of a constant geometry FFT. It allows an easy tradeoff between the hardware complexity and the computation time. A method for constructing a high-radix FFT with simple lower-radix hardware based on successive decompositio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The relationship between instantaneous frequency and time-frequency representations

    Publication Year: 1993, Page(s):1458 - 1461
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    The relationship between instantaneous frequency estimation based on the derivative of the phase of the analytic signal and the first moment of the general time-frequency representation from Cohen's (1989) class is given in the continuous- and discrete-time domains. Application of the standard linear definition of first moment to discrete-time-frequency representations leads to biased instantaneou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of the cross Wigner-Ville distribution for estimation of instantaneous frequency

    Publication Year: 1993, Page(s):1439 - 1445
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    An iterative instantaneous frequency (IF) estimation scheme is presented in which successive IF estimates are obtained from the peak of the cross Wigner-Ville distribution (XWVD), using a reference signal synthesized from an initial IF estimate. Theoretical and practical aspects of performance are discussed, and the performance is compared with that of other methods View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonuniform sampling and antialiasing in image representation

    Publication Year: 1993, Page(s):1223 - 1236
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    A unified approach to the representation and processing of a class of images which are not bandlimited but belong to the space of locally bandlimited signals is presented. A nonuniform sampling theorem (Clark et al, 1985) for functions belonging to this space is extended, and a class of nonstationary stochastic processes is considered. The space of locally bandlimited signals is shown to be a repr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive and iterative algorithms for computing eigenvalues of Hermitian Toeplitz matrices

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

    The numerical solution of the complete eigenspectrum for Hermitian Toeplitz matrices is presented. Trench's algorithm (1989), which employs bisection on contiguous intervals, and the Pegasus method are used to achieve estimates of distinct eigenvalues. Several modifications of Trench's algorithm are examined; the goals are an increase in the rate of convergence, even at some reduction in estimate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The poorman's transform: approximating the Fourier transform without multiplication

    Publication Year: 1993, Page(s):1413 - 1415
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    A time-domain to frequency-domain transformation for sampled signals which is computed with only additions and trivial complex multiplications is described. This poorman's transform is an approximation to the usual Fourier transform, obtained by quantizing the Fourier coefficients to the four values {±1, ±j}, and is especially useful when multiplication is expensive. For the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effects of phase on high-resolution frequency estimators

    Publication Year: 1993, Page(s):1319 - 1330
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB)

    Several different ways in which the initial phase differences between two closely spaced sinusoids manifests itself, e.g., in the singular values of the data matrix, the angles between signal vectors, and the Cramer-Rao bound, are described. A closed-form expression for the singular values of the data matrices used in subspace-based algorithms and an expression for the angle between the signal com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linearly constrained beamforming robust to array imperfections

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

    It has been shown that in the presence of array imperfections, the linearly constrained beamformer cancels the desired signal and the Duvall beamformer fails to null out interference. It is shown here that the problem of cancelling the desired signal can be remedied if the beamforming is done after effectively subtracting the desired signal component from the received signals. With the forward/bac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive pruning of the 2D DFT with 3D signal processing applications

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

    A recursively pruned radix-(2×2) two-dimensional (2D) fast Fourier transform (FFT) algorithm is proposed to reduce the number of operations involved in the calculation of the 2D discrete Fourier transform (DFT). It is able to compute input and output data points having multiple and possibly irregularly shaped (nonsquare) regions of support. The computational performance of the recursively pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alternate memory compression schemes for modular multiplication

    Publication Year: 1993, Page(s):1378 - 1385
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    A memory compression scheme which reduces the size of the lookup tables for modular multiplication by using a new symmetry property is presented. The compression ratio for a modulus p is equal to 4 and implies a 75% savings except if p is even and small. Although this compression ratio has been achieved before, the present scheme has the advantage of simpler peripheral hardware. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequency-wavenumber tracking using hidden Markov models

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

    Earlier work by the authors (see ibid., vol.39, no.12, p.2659 1991) on multiple frequency line tracking using hidden Markov models (HMMs) is extended to include wavenumber estimation. The main idea is to model the frequency and wavenumber of each target using HMM and then to track these signals using a Viterbi algorithm. The input measurements to the Viterbi algorithm are two-dimensional (2-D) Fou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logarithmic pruning of FFT frequencies

    Publication Year: 1993, Page(s):1398 - 1400
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A standard fast Fourier transform (FFT) computes the transform at evenly spaced points on a linear scale. A simple modification of the FFT algorithm that results in an efficient method for calculating the transform only at evenly spaced frequencies on a logarithmic scale is proposed. The saving in the number of operations, compared with a standard FFT, is approximately 60% for typical values View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hexagonal fast Fourier transform with rectangular output

    Publication Year: 1993, Page(s):1469 - 1472
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    Hexagonal sampling is the most efficient sampling pattern for a two-dimensional circularly bandlimited function. A separable fast discrete Fourier transform (DFT) algorithm for hexagonally sampled data that directly computes output points on a rectangular lattice is reported. No interpolation is required. The algorithm has computational complexity comparable to that of standard two-dimensional fas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast orthogonalization algorithm and parallel architecture for AR spectral estimation based on forward-backward linear prediction

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

    Truncated QR methods have been shown to be comparable to SVD-based methods for the sinusoidal frequency estimation based on the forward-backward linear prediction (FBLP) model. However, without exploiting the special structure of the FBLP matrix, the QR decomposition (QRD) of the FBLP matrix has a computational complexity on the order of 2(6m-n)n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Newton-based Ziskind-Wax alternating projection algorithm applied to spectral estimation

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

    A Newton-based alternating projection (AP) algorithm for estimating the parameters of exponential signals in noise is presented. Its performance is compared with that of modified forward-backward linear prediction/backward linear prediction (MFBLP/BLP) total least squares (TLS), and iterative quadratic maximum likelihood (IQML) methods using computer simulations. In the case of undamped sinusoids,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new class of nonlinear filters-neural filters

    Publication Year: 1993, Page(s):1201 - 1222
    Cited by:  Papers (86)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2772 KB)

    A class of nonlinear filters based on threshold decomposition and neural networks is defined. It is shown that these neural filters include all filters defined either by continuous functions, such as linear finite impulse response (FIR) filters, or by Boolean functions, such as generalized stack filters. Adaptive least-mean-absolute-error and adaptive least-mean-square-error algorithms are derived... 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