By Topic

IEEE Transactions on Signal Processing

Issue 6 • June 1992

Filter Results

Displaying Results 1 - 25 of 41
  • Correction to 'Comments on 'A curiosum concerning discrete time convolution',' plus a remark

    Publication Year: 1992
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (83 KB)

    In the author's comments to an article by Hall and Wise (see ibid., vol.38, no.6, p.1059, 1990) included a typographic error which is corrected. He also points out that the sequences used in the example become L/sub 1/ norm sequences.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital filters for attenuating interference arriving from a wide range of angles

    Publication Year: 1992, Page(s):1499 - 1507
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Digital filters for the offline multichannel processing of the signals recorded by an array of sensors are derived with the objective of extracting a desired signal arriving from a known direction. Both the desired signal and coherent interference have arbitrary waveforms. Since the direction of arrival of the interference is unknown, the array response to it is treated as a random variable, and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two methods for Toeplitz-plus-Hankel approximation to a data covariance matrix

    Publication Year: 1992, Page(s):1490 - 1498
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    Recently, fast algorithms have been developed for computing the optimal linear least squares prediction filters for nonstationary random processes (fields) whose covariances have (block) Toeplitz-Hankel form. If the covariance of the random process (field) must be estimated from the data, the following problem is presented: given a data covariance matrix, computer from the available data, find the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete fast algorithms for two-dimensional linear prediction on a polar raster

    Publication Year: 1992, Page(s):1480 - 1489
    Cited by:  Papers (3)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    New generalized split Levinson and Schur algorithms for the two-dimensional linear least squares prediction problem on a polar raster are derived. The algorithms compute the prediction filter for estimating a random field at the edge of a disk from noisy observations inside the disk. The covariance function of the random field is assumed to have a Toeplitz-plus-Hankel structure for both its radial... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear bispectrum of signals and identification of nonminimum phase FIR systems driven by colored input

    Publication Year: 1992, Page(s):1469 - 1479
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    The identification of non-minimum-phase finite-impulse-response (FIR) systems driven by third-order stationary colored signals that are not linear processes is addressed. Modeling the linear part of the bispectrum of a signal is discussed. The bispectrum of a signal is decomposed into two multiplicative factors. The linear bispectrum is defined as the factor of the bispectrum that can exactly be m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive detector for deterministic signals in noise of unknown spectra using the Rao test

    Publication Year: 1992, Page(s):1460 - 1468
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    An adaptive detector for a known deterministic signal of unknown amplitude in Gaussian noise of unknown spectra is described. The detector is based on the Rao test, which is asymptotically equivalent to the generalized likelihood ratio. The detector achieves constant false alarm probability in the presence of large changes in input noise bandwidth and variance while providing optimum detection per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient order recursive algorithms for multichannel least squares filtering

    Publication Year: 1992, Page(s):1354 - 1374
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1412 KB)

    Four efficient order-recursive algorithms for least-squares (LS) multichannel FIR filtering and multivariable system identification are developed. The need for such algorithms arises when the system model assigns an unequal number of delay elements to each input channel. All proposed schemes provide considerable improvements over overparametrization or the zero padding approach. First, a block-str... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uniform approximation with doubly finite Volterra series

    Publication Year: 1992, Page(s):1438 - 1442
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    The assumption that a system possesses a certain discrete-time Volterra series representation frequently forms the basis for studies in the areas of signal processing and communication theory. A further assumption often made, always without discussion, is that the representation can be suitably approximated by a corresponding `double finite' series. It is shown that, for a very large class of nonl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel two-stage algorithm for DCT and IDCT

    Publication Year: 1992, Page(s):1610 - 1612
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    On the basis of the Mobius function, a two-stage algorithm for the discrete cosine transform (DCT) and the inverse DCT (IDCT) is proposed. In this approach, the DCT matrix is factorized into the preprocessing and postprocessing matrices. The preprocessing matrix has elements of values 1 and -1, and the postprocessing matrix is a circular convolution/correlation matrix View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calculating the FHT in hardware

    Publication Year: 1992, Page(s):1341 - 1353
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB)

    A parallel, pipelined architecture for calculating the fast Hartley transform (FHT) is discussed. Hardware implementation of the FHT introduces two challenges: retrograde indexing and data scaling. A novel addressing scheme that permits the fast computation of FHT butterflies is proposed, and a hardware implementation of conditional block floating point scaling that reduces error due to data growt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the computation of running discrete cosine and sine transform

    Publication Year: 1992, Page(s):1430 - 1437
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Two algorithms are given for the computation of the updated discrete cosine transform-II (DCT-II), discrete sine transform-II (DST-II), discrete cosine transform-IV (DCT-IV), and discrete sine transform-IV (DST-IV). It is pointed out that the algorithm used for running DCT-IV can also be used for computation for running DST-IV without additional computational overhead. An architecture which is com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fully sigma-delta modulation encoded FIR filters

    Publication Year: 1992, Page(s):1605 - 1610
    Cited by:  Papers (34)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    The author suggests an FIR filter structure where both the input signal and the impulse response are encoded using sigma-delta modulation. As a result, the convolution can be obtained by summing a collection of binary or ternary numbers, depending on the quantizer in the sigma-delta modulator. This filter structure can accept analog input signals directly and can be built using modular hardware. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A neural network model for invariant pattern recognition

    Publication Year: 1992, Page(s):1595 - 1599
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    A neural network is proposed to achieve invariant pattern recognition to binary inputs based on a computation of the invariance net and the ART1 neural network. Computer simulations show that the new network is plastic to unfamiliar inputs and requires no explicit training of the inputs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context modeling with the stochastic segment model

    Publication Year: 1992, Page(s):1584 - 1587
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    An approach for context modeling in continuous speech recognition for models based on multivariate Gaussian distributions, specifically, the stochastic segment model, is described. Robust context models are obtained by typing distribution parameters across different classes of context. Experimental results in phoneme and word recognition are comparable to those achieved with discrete hidden Markov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Least squared error FIR filter design with transition bands

    Publication Year: 1992, Page(s):1327 - 1340
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    The authors propose the use of transition bands and transition functions in the ideal amplitude frequency response to allow the analytical design of optimal least-squared-error FIR digital filters with an explicit control of the transition band edges. Design formulas are derived for approximations to ideal frequency responses which use pth-order spline transition functions. A mixed analyt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-domain filter bank analysis: a new design theory

    Publication Year: 1992, Page(s):1412 - 1429
    Cited by:  Papers (123)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1440 KB)

    The authors present a new time-domain approach for the analysis and design of a broad class of general analysis/synthesis systems based on M-band filter banks. They derive a set of time-domain conditions for reconstruction which can be used directly in a filter bank design procedure. The general and unrestricted nature of this framework allows for the design of many useful banks. In addit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral distortion in sampling rate conversion by zero-order polynomial interpolation

    Publication Year: 1992, Page(s):1576 - 1579
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    For such applications as digital beamforming in sonar and sampling rate conversion in digital audio systems, there is interest in fast, approximate interpolation techniques. Computationally, the simplest of these is to approximate the desired time series sample by the available sample which is nearest in time. This procedure is variously known as sample-and-hold interpolation, zero-order polynomia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive autoregressive spectral estimation by minimization of the free energy

    Publication Year: 1992, Page(s):1518 - 1527
    Cited by:  Papers (10)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    A digital signal processing technique applicable to power spectrum estimation, designated as the minimum free energy method, is described. With no a priori model assumption and no attempt to extract special features such as sinusoids, one can obtain high resolution even with high noise contamination of the measured signal. The technique is demonstrated by modification of the Burg recursive method ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Excursions of adaptive algorithms via the Poisson clumping heuristic

    Publication Year: 1992, Page(s):1443 - 1451
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The authors detail the application of the Poisson clumping heuristic (PCH) to the least mean square (LMS) adaptive algorithm and its signed variants. Under certain conditions on the input and disturbance statistics, the parameter estimate errors form a Markov process. The PCH asserts that large excursions of the parameter estimates occur in clumps, and that these clumps are distributed in a Poisso... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cartesian hidden Markov models with applications

    Publication Year: 1992, Page(s):1601 - 1604
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    The author introduces the concept of a Cartesian hidden Markov model (CHMM), which consists of a Markov chain assuming values in the Cartesian product of a finite number of elementary state sets. The states are observed via a multivariable probabilistic mapping, again assuming values in a Cartesian product of finite sets of observables. The CHMM can be reduced to an ordinary (i.e., scalar) HMM by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Phonemic recognition using a large hidden Markov model

    Publication Year: 1992, Page(s):1590 - 1595
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    The authors present a novel method for using the state sequence output of a large hidden Markov model as input to a phonemic recognition system. It thereby demonstrates that a significant amount of speech information is preserved in the most likely state sequences produced by such a model. Two different system formulations are presented, both achieving recognitions results equivalent to those achi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive array robust to beam pointing error

    Publication Year: 1992, Page(s):1582 - 1584
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    The authors propose an algorithm that is robust to beam pointing error. In the algorithm, the weight vector of a beam steered adaptive array corresponds to the maximum eigenvector of a data covariance matrix which is filtered by the projection operator composed of the eigenvectors of noise subspace of the covariance matrix in which the desired signal is removed by subtractive preprocessing. The re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On focusing matrices for wide-band array processing

    Publication Year: 1992, Page(s):1295 - 1302
    Cited by:  Papers (81)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    A general class of transformation matrices for coherent signal-subspace processing is presented. These signal-subspace transformation (SST) matrices are shown to generate a sufficient statistic for maximum-likelihood bearing estimation. Two general forms for calculating SST matrices are presented, and the rotational signal-subspace (RSS) focusing matrices proposed by H. Hung and M. Kaveh (1988) ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive code excited predictive coding

    Publication Year: 1992, Page(s):1317 - 1326
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    A novel way to use the code excited linear prediction (CELP) concept that decreases the processing load while keeping the same speech quality is discussed. Rather than performing individual weighting of each candidate sequence, a global implementation of the perceptual weighting function at the codebook level is proposed. As a result, the analysis-by-synthesis procedure does not require the proces... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On prime factor mapping for the discrete Hartley transform

    Publication Year: 1992, Page(s):1399 - 1411
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    The authors propose a new prime factor mapping scheme, which requires no extra arithmetic operations for the realization of prime factor mapping, for the computation of the discrete Hartley transform (DHT). It is achieved by embedding all the extra arithmetic operations into the subsequent short-length computations, with the computational complexities of these embedded short lengths remaining unch... 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