By Topic

IEEE Transactions on Signal Processing

Issue 11 • Nov 1996

Filter Results

Displaying Results 1 - 25 of 29
  • Blind adaptive beamforming for cyclostationary signals

    Publication Year: 1996, Page(s):2757 - 2767
    Cited by:  Papers (63)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    In order to increase the capacity and to suppress co-channel interference in digital communication systems such as mobile cellular and mobile satellite communication systems, the employment of array beamforming techniques has been proposed. However, conventional beamforming methods are not suitable for such cases since these methods were mainly developed for signal detection and direction-of-arriv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On generalized-marginal time-frequency distributions

    Publication Year: 1996, Page(s):2882 - 2886
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    We introduce a family of time-frequency (TF) distributions with generalized marginals, i.e., beyond the time-domain and the frequency-domain marginals, in the sense that the projections of a TF distribution along one or more angles are equal to the magnitude squared of the fractional Fourier transforms of the signal. We present a necessary and sufficient condition for a TF distribution in Cohen's ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Which stochastic models allow Baum-Welch training?

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

    Since the introduction of hidden Markov models to the field of automatic speech recognition, a great number of variants to the original model have been proposed. This paper aims to provide a unifying framework for many of these models. By representing model assumptions in the form of a graph, we show that an algorithm similar to Baum's exists only if a certain graph-theoretical criterion-the chord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The generalized evolutionary spectrum

    Publication Year: 1996, Page(s):2877 - 2881
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    Evolutionary spectral theory defines a decomposition of signal energy jointly over time and frequency by assuming that processes are composed of sinusoidal components with time-dependent amplitudes. We expand this theory by allowing time variations in the frequency of the sinusoidal components. Examples are presented illustrating the advantages of this generalization View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static and dynamic convergence behavior of adaptive blind equalizers

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

    This paper presents a theoretical analysis of the static and dynamic convergence behavior for a general class of adaptive blind equalizers. We first study the properties of prediction error functions of blind equalization algorithms, and then, we use these properties to analyze the static and dynamic convergence behavior based on the independence assumption. We prove in this paper that with a smal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Running max/min calculation using a pruned ordered list

    Publication Year: 1996, Page(s):2872 - 2877
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    We present a novel algorithm for calculating the running maximum or minimum value of a 1-D sequence over a sliding data window. The new algorithm stores a pruned ordered list of data elements that have the potential to become maxima or minima across the data window at some future time instant. This algorithm has a number of advantages over competing algorithms, including balanced computational req... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Length- and cost-dependent local minima of unconstrained blind channel equalizers

    Publication Year: 1996, Page(s):2726 - 2735
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    Baud-rate linear blind equalizers may converge to undesirable stable equilibria due to different mechanisms. One such mechanism is the use of linear FIR filters as equalizers. It is shown that this type of local minima exist for all unconstrained blind equalizers whose cost functions satisfy two general conditions. The local minima generated by this mechanism are thus called length-dependent local... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of LMS-based adaptive filters in tracking a time-varying plant

    Publication Year: 1996, Page(s):2868 - 2871
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    The article gives a general analysis of the LMS-based adaptive filters when used for tracking a class of time varying plants. The algorithms covered are the conventional LMS, the transform-domain normalized LMS, and the LMS/Newton algorithm. An important fact that we observe is that in comparing these algorithms, better initial convergence does not necessarily mean better tracking. A few special c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive array detection of uncertain rank one waveforms

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

    Adaptive array detection of known (within a complex scaling) rank one space time waveforms in unknown spatial noise has received considerable attention. The two published solutions are the adaptive matched filter, and the GLRT. We expand on this work to consider the case of rank one waveforms that are uncertain, i.e., only partially known. More precisely, we model the space time steering vector as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A nonlinear analytical model for the quantized LMS algorithm-the power-of-two step size case

    Publication Year: 1996, Page(s):2895 - 2900
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Presents a study of the quantization effects in the finite precision LMS algorithm with power-of-two step sizes. Deterministic nonlinear recursions are presented for the mean and second-moment matrix of the weight vector about the Wiener weight for white Gaussian data models and small algorithm step size μ. The numerical solutions of these recursions are shown to agree very closely with the Mon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint estimation of time delay and frequency delay in impulsive noise using fractional lower order statistics

    Publication Year: 1996, Page(s):2669 - 2687
    Cited by:  Papers (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1364 KB)

    New methods for time delay estimation and joint estimation of time delay and frequency delay in the presence of impulsive noise are introduced. First, degradation of the conventional approaches based on second-order statistics is shown both theoretically and experimentally. Then, a new class of robust algorithms are developed using the theory of alpha-stable distributions, including the fractional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of structurally constrained second-order Volterra models

    Publication Year: 1996, Page(s):2837 - 2846
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    Continuing advances in industrial control hardware and software have increased interest in the identification of nonlinear dynamic models from chemical process data. Two practically important issues are those of nonlinear model structure selection and input sequence design for adequate model identification. While the “general nonlinear model identification problem” is intractably compl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of filter banks using cyclostationary spectral analysis

    Publication Year: 1996, Page(s):2718 - 2725
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    This paper proposes a design method of optimal biorthogonal FIR filter banks that minimize the time-averaged mean squared error (TAMSE) when the high-frequency subband signal is dropped. To study filter banks from a statistical point of view, cyclostationary spectral analysis is used since the output of the filter bank for a wide-sense stationary input is cyclostationary. First, the cyclic spectra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and efficient implementation of partitioned block LMS adaptive filters

    Publication Year: 1996, Page(s):2865 - 2868
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    The frequency domain block LMS (FBLMS) algorithm used for efficient implementation of adaptive filters whose length may exceed a few thousands of taps is explored further by Asharif et al. (1980). To reduce the latency of such filters, it has been proposed that the adaptive filter convolution sum be partitioned into a few smaller sums and then the FBLMS be applied. We show that the scheme proposed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection in correlated impulsive noise using fourth-order cumulants

    Publication Year: 1996, Page(s):2793 - 2800
    Cited by:  Papers (31)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    We consider detection and estimation in correlated impulsive noise. The non-Gaussian impulsive noise is modeled as the sum of two linear processes: a nominal part and an impulsive part. This model admits correlated impulsive bursts lasting many data samples. Identifiability of the noise model is established using fourth- and second-order cumulants. Under this model, the correlated time series can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional multirate DOA estimation in beamspace

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

    This paper presents a beamspace version of ESPRIT for uniform rectangular arrays that supports closed-form 2-D angle estimation, automatically couples the two components of the source directions, and works with any front end beamformer. The proposed algorithm is based on the observation that beamspace noise eigenvectors can be transformed to vectors that are bandpass and have spectral nulls at the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using multirate architectures in realizing quadratic Volterra kernels

    Publication Year: 1996, Page(s):2891 - 2895
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    Multirate architectures have been used for realizing linear FIR digital filters with reduced computational complexity. The Volterra kernel can be represented as a generalized convolution. It would thus be expected that multirate architectures could be used to advantage in realizing Volterra kernels as well. The quadratic Volterra kernel may be realized in the form of an “LDL structure.&rdquo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the robustness of parameter estimation of superimposed signals by dynamic programming

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

    We analyze a recently proposed dynamic programming algorithm (REDP) for maximum likelihood (ML) parameter estimation of superimposed signals in noise. We show that it degrades gracefully with deviations from the key assumption of a limited interaction signal model (LISMO), providing exact estimates when the LISMO assumption holds exactly. In particular, we show that the deviations of the REDP esti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the study of four-parallelogram filter banks

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

    The most commonly used 2-D filter banks are separable filter banks, which can be obtained by cascading two 1-D filter banks in the form of a tree. The supports of the analysis and synthesis filters in the separable systems are unions of four rectangles. The natural nonseparable generalization of such supports are those that are unions of four parallelograms. We study four parallelogram filter bank... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new multidimensional fast convolution algorithm

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

    The article introduces a new fast convolution-type technique for computing the multidimensional periodic convolutions of signals defined on generic lattices. The method presented does not evaluate multidimensional periodic convolutions via multidimensional FFTs but with an original algorithm. The major advantages of this technique are that it is more efficient than the well-known FFT-based fast co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of the parameters of a random amplitude sinusoid by correlation fitting

    Publication Year: 1996, Page(s):2911 - 2916
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    We consider the best asymptotic accuracy that can be achieved when estimating the parameters of a random-amplitude sinusoid from its sample covariances. An estimator based on matching in a weighted least-squares sense the sample correlation sequence to the theoretical sequence is presented. The asymptotic properties of the estimator are analyzed. A lower bound on the estimation of the parameters f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind separation of instantaneous mixture of sources via an independent component analysis

    Publication Year: 1996, Page(s):2768 - 2779
    Cited by:  Papers (92)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    In this paper, we introduce a procedure for separating a multivariate distribution into nearly independent components based on minimizing a criterion defined in terms of the Kullback-Leibner distance. By replacing the unknown density with a kernel estimate, we derive useful forms of this criterion when only a sample from that distribution is available. We also compute the gradient and Hessian of o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Downsampling versus folding in the DCT domain

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

    Signals can be split into subbands using ideal bandpass filters in the discrete cosine transform (DCT) domain. We show that decimation by band folding is not equivalent to downsampling but results in two convolution operations that involve both the odd and even samples of the signal View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explicit Ziv-Zakai lower bound for bearing estimation

    Publication Year: 1996, Page(s):2810 - 2824
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1140 KB)

    The extended Ziv-Zakai bound for vector parameters is used to develop a lower bound on the mean square error in estimating the 2-D bearing of a narrowband planewave signal using planar arrays of arbitrary geometry. The bound has a simple closed-form expression that is a function of the signal wavelength, the signal-to-noise ratio (SNR), the number of data snapshots, the number of sensors in the ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new method for AR order determination of an ARMA process

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

    Using a combination of the minimum description length (MDL) criterion and overdetermined instrumental variable method, a computationally efficient method for AR order determination of an ARMA process is proposed. It is shown that the well-known singular value decomposition (SVD) method for AR order determination is a special case of the proposed method. Numerical simulations are presented to show ... 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