By Topic

IEEE Transactions on Signal Processing

Issue 12 • Dec. 1996

Filter Results

Displaying Results 1 - 25 of 31
  • List of reviewers

    Publication Year: 1996, Page(s):3178 - 3181
    Request permission for commercial reuse | PDF file iconPDF (276 KB)
    Freely Available from IEEE
  • 1996 Index IEEE Transactions on Signal vol. 44

    Publication Year: 1996, Page(s):1 - 42
    Request permission for commercial reuse | PDF file iconPDF (6235 KB)
    Freely Available from IEEE
  • Difference equation representation of chirp signals and instantaneous frequency/amplitude estimation

    Publication Year: 1996, Page(s):2948 - 2958
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1088 KB)

    We present a time-varying coefficient difference equation representation for sinusoidal signals with time-varying amplitudes and frequencies. We first obtain a recursive equation for a single chirp signal. Then, using this result, we obtain time-varying coefficient difference equation representations for signals composed of multiple chirp signals. We analyze these equations using the skew-shift op... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence of the delayed normalized LMS algorithm with decreasing step size

    Publication Year: 1996, Page(s):3008 - 3016
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    In several practical applications of the LMS algorithm, including certain VLSI implementations, the coefficient adaptation can be performed only after some fixed delay. The resulting algorithm is known as the delayed LMS (DLMS) algorithm in the literature. Previous published analyses of this algorithm are based on mean and moment convergence under the independence assumption between successive inp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal supports for linear predictive models

    Publication Year: 1996, Page(s):3150 - 3153
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    The problem of finding the optimal set of causal pixels (support) for use in linear predictive models is addressed. After presenting counterexamples to popular intuitions about supports, a general result relating the distortion incurred with a small support to optimal coefficients of a larger support is derived. A geometrical interpretation is provided. Two algorithms that optimally increase/decre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum likelihood parameter and rank estimation in reduced-rank multivariate linear regressions

    Publication Year: 1996, Page(s):3069 - 3078
    Cited by:  Papers (69)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    This paper considers the problem of maximum likelihood (ML) estimation for reduced-rank linear regression equations with noise of arbitrary covariance. The rank-reduced matrix of regression coefficients is parameterized as the product of two full-rank factor matrices. This parameterization is essentially constraint free, but it is not unique, which renders the associated ML estimation problem rath... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new method for efficient convolution in frequency domain by nonuniform partitioning for adaptive filtering

    Publication Year: 1996, Page(s):3123 - 3129
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    By using block processing, partitioning, and fast Fourier transforms (FFTs), large filters perform efficiently in the frequency domain. For small processing delay the complexity can still be too large for implementation on a digital signal processor (DSP). A solution is to partition the filter into unequal-length subfilters. Application in adaptive filtering yields the nonuniform partitioned block... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-varying filters and filter banks: some basic principles

    Publication Year: 1996, Page(s):2971 - 2987
    Cited by:  Papers (23)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1768 KB)

    We study the fundamentals of time-varying filter banks (TVFB). Using a polyphase approach to TVFBs, we are able to show some unusual properties that are not exhibited by the conventional LTI filter banks. For example, we can show that for a perfect reconstruction (PR) TVFB, the losslessness of analysis bank does not always imply that of the synthesis bank, and replacing the delay z-1 in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient implementation of Koilpillai-Vaidyanathan pseudo quadrature mirror filter (PQMF) banks

    Publication Year: 1996, Page(s):3135 - 3138
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    An efficient implementation algorithm for the Koilpillai-Vaidyanathan (see ibid., vol.41, no.1, p.82-92, 1993) pseudo quadrature mirror filter (KVPQMF) bank, which is useful in audio compression schemes, is presented. The implementation employs a polyphase system with discrete cosine transforms (DCTs). Theoretical and practical results show a typical saving in computational load of 82% over the di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-rank adaptive filters

    Publication Year: 1996, Page(s):2932 - 2947
    Cited by:  Papers (132)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1548 KB)

    We introduce a class of adaptive filters based on sequential adaptive eigendecomposition (subspace tracking) of the data covariance matrix. These new algorithms are completely rank revealing, and hence, they can perfectly handle the following two relevant data cases where conventional recursive least squares (RLS) methods fail to provide satisfactory results: (1) highly oversampled “smooth&r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model based phase unwrapping of 2-D signals

    Publication Year: 1996, Page(s):2999 - 3007
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB)

    A parametric model and a corresponding parameter estimation algorithm for unwrapping 2-D phase functions are presented. The proposed algorithm performs global analysis of the observed signal. Since this analysis is based on parametric model fitting, the proposed phase unwrapping algorithm has low sensitivity to phase aliasing due to low sampling rates and noise, as well as to local errors. In its ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive beamforming for satellite communication with selective earth coverage and jammer nulling capability

    Publication Year: 1996, Page(s):3162 - 3166
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    An algorithm has been developed to control the antenna array beam pattern for satellite communication applications where the uplink received antenna is desired to provide beamforming capability for selective earth coverage and jamming protection. The problem can be formulated to determine the antenna weight to meet the user gain and jammer null requirements in their known directions, subject to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circular implementation of vector-channel lattices

    Publication Year: 1996, Page(s):3147 - 3149
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Discusses the circular (or periodic) implementation of vector-channel least-squares lattice filters. The resulting algorithm eliminates matrix inversions and greatly reduces matrix multiplications. Complete residual and AR coefficient algorithms are provided, as well as initialization and other implementation issues. A full treatment of the prediction error form of the lattices and its relationshi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating particles velocity from laser measurements: maximum likelihood and Cramer-Rao bounds

    Publication Year: 1996, Page(s):3056 - 3068
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    We address the problem of estimating particles velocity in the vicinity of an aircraft by means of a laser Doppler system. When a particle passes through the region of interference fringes generated by two coherent laser beams, the signal backscattered is of the form Aexp{-2α2·fd2t2 }cos{2πfdt}, where the Doppler frequency f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A global optimization technique for statistical classifier design

    Publication Year: 1996, Page(s):3108 - 3122
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1876 KB)

    A global optimization method is introduced that minimize the rate of misclassification. We first derive the theoretical basis for the method, on which we base the development of a novel design algorithm and demonstrate its effectiveness and superior performance in the design of practical classifiers for some of the most popular structures currently in use. The method, grounded in ideas from statis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalence of generalized joint signal representations of arbitrary variables

    Publication Year: 1996, Page(s):2959 - 2970
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1412 KB)

    Joint signal representations (JSRs) of arbitrary variables generalize time-frequency representations (TFRs) to a much broader class of nonstationary signal characteristics. Two main distributional approaches to JSRs of arbitrary variables have been proposed by Cohen (see Time-Frequency Analysis, Englewood Cliffs, NJ, Prentice Hall, 1995 and Proc. SPIE 1566, San Diego, 1991) and Baraniuk (see Proc.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivariant adaptive source separation

    Publication Year: 1996, Page(s):3017 - 3030
    Cited by:  Papers (727)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1588 KB)

    Source separation consists of recovering a set of independent signals when only mixtures with unknown coefficients are observed. This paper introduces a class of adaptive algorithms for source separation that implements an adaptive version of equivariant estimation and is henceforth called equivariant adaptive separation via independence (EASI). The EASI algorithms are based on the idea of serial ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind identification of digital communication channels with correlated noise

    Publication Year: 1996, Page(s):3154 - 3156
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    Blind identification consists of estimating the impulse response of a linear, time-invariant channel used for transmission of digital data by observing the channel output without knowledge of the transmitted symbol sequence. We show how a previously proposed algorithm (Moulines et al., 1995) based on second-order statistics of the received signal can be modified to account for correlated noise View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal linear detectors for additive noise channels

    Publication Year: 1996, Page(s):3079 - 3084
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    In an attempt to gain insight into the design of linear detectors for additive white noise channels (discrete-time case), we describe several procedures, both optimal and suboptimal. Using the Wiener representation for nonlinear systems, we derive an ad hoc suboptimal design procedure. Exact designs are found when the noise amplitude's probability distribution is stable and when the noise is Lapla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wigner-based formulation of the chirplet transform

    Publication Year: 1996, Page(s):3129 - 3135
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    Using the Wigner distribution, we derive and analyze a matrix formulation for the chirplet transform, a signal analysis tool that generalizes the wavelet and short-time Fourier transforms. The formulation expresses the translations, scalings, and shears of the chirplet transform in terms of affine matrix transformations on the time-frequency plane. Our approach leads naturally to several new signa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The discrete Laguerre transform: derivation and applications

    Publication Year: 1996, Page(s):2925 - 2931
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The discrete Laguerre transform (DLT) belongs to the family of unitary transforms known as Gauss-Jacobi transforms. Using classical methodology, the DLT is derived from the orthonormal set of Laguerre functions. By examining the basis vectors of the transform matrix, the types of signals that can be best represented by the DLT are determined. Simulation results are used to compare the DLT's effect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unsupervised deconvolution of sparse spike trains using stochastic approximation

    Publication Year: 1996, Page(s):2988 - 2998
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1316 KB)

    This paper presents an unsupervised method for restoration of sparse spike trains. These signals are modeled as random Bernoulli-Gaussian processes, and their unsupervised restoration requires (i) estimation of the hyperparameters that control the stochastic models of the input and noise signals and (ii) deconvolution of the pulse process. Classically, the problem is solved iteratively using a max... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable-block-size lapped transforms

    Publication Year: 1996, Page(s):3139 - 3142
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    A structure for implementing lapped transforms with time-varying block sizes that allows full orthogonality of the transient transforms is presented. The formulation is based on a factorization of the transfer matrix into orthogonal factors. Such an approach can be viewed as a sequence of stages with variable-block-size transforms separated by sample-shuffling (delay) stages. Details and design ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theorem in probability and its applications in multidimensional signal processing

    Publication Year: 1996, Page(s):3167 - 3169
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    In this correspondence, we present a result in probability that does not exist in the literature of probability theory. We show one application of this theorem in multidimensional signal processing, which generalizes some of the existing results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal quadratic detection and estimation using generalized joint signal representations

    Publication Year: 1996, Page(s):3031 - 3043
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1516 KB)

    Time-frequency analysis has significant advances in two main directions: statistically optimized methods that extend the scope of time-frequency-based techniques from merely exploratory data analysis to more quantitative application and generalized joint signal representations that extend time-frequency-based methods to a richer class of nonstationary signals. This paper fuses the two advances by ... 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