# IEEE Transactions on Signal Processing

## Filter Results

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

Publication Year: 1992
| |PDF (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»

• ### Polynomial array for F(z1, z 2) on |z1|=1 and 2-D filter stability test

Publication Year: 1992, Page(s):1579 - 1581
Cited by:  Papers (6)
| |PDF (188 KB)

A polynomial array for a complex polynomial F(z 1, z2) on |z1|=1 is developed to overcome the difficulty in the implementation of some algebraic methods for the 2-D filter stability test. A simple and systematic algorithm to construct this polynomial array is given. The algorithm removes the requirement for conjugate polynomials ... View full abstract»

• ### Spectral distortion in sampling rate conversion by zero-order polynomial interpolation

Publication Year: 1992, Page(s):1576 - 1579
Cited by:  Papers (4)
| |PDF (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»

• ### On prime factor mapping for the discrete Hartley transform

Publication Year: 1992, Page(s):1399 - 1411
Cited by:  Papers (11)
| |PDF (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»

• ### Fast algorithms for linear least squares smoothing problems in one and two dimensions using generalized discrete Bellman-Siegert-Krein resolvent identities

Publication Year: 1992, Page(s):1570 - 1575
Cited by:  Papers (2)
| |PDF (456 KB)

New fast algorithms for linear least square smoothing problems in one and two dimensions are derived. These are discrete and multidimensional generalizations of the Bellman-Siegert-Krein resolvent identity, which has been applied to the continuous, one-dimensional stationary smoothing problem by T. Kailath (1969). The new equations relate the linear least squares prediction filters associated with... View full abstract»

• ### Joint blind equalization, carrier recovery and timing recovery for high-order QAM signal constellations

Publication Year: 1992, Page(s):1383 - 1398
Cited by:  Papers (121)  |  Patents (48)
| |PDF (1160 KB)

Two existing blind equalization tap update recursions for 64-point and greater QAM (quadrature amplitude modulation) signal constellations are studied, along with existing and novel carrier and timing recovery techniques. It is determined that the superior tap update recursion is the one known as the constant modulus algorithm. Carrier recovery requires a modified second-order decision-directed di... View full abstract»

• ### The optimum scalar data nonlinearity in LMS adaptation for arbitrary IID inputs

Publication Year: 1992, Page(s):1566 - 1570
Cited by:  Papers (8)
| |PDF (396 KB)

The authors show that the optimum nonlinear scale operation upon the elements of the observation vector in the LMS algorithm is exactly x/(1+μx2) for any independent stochastic data input and any noise density. Moreover, use of such a nonlinearity can yield a significant performance improvement in fast adaptation situations View full abstract»

• ### Performance analysis of a split-path LMS adaptive filter for AR modeling

Publication Year: 1992, Page(s):1375 - 1382
Cited by:  Papers (18)
| |PDF (580 KB)

A split-path adaptive filter is proposed for extracting the model parameters of an autoregressive process. The structure is composed of two linear phase filters connected in parallel, one antisymmetric and the other symmetric. The two filters are adapted independently on a sample-by-sample basis using the least-mean-square (LMS) algorithm. The performance of the system in terms of convergence spee... View full abstract»

• ### On local maxima of the likelihood function for Toeplitz matrix estimation

Publication Year: 1992, Page(s):1563 - 1565
Cited by:  Papers (3)
| |PDF (228 KB)

It is shown that in estimating a Toeplitz covariance matrix, the likelihood function can present a local maximum close to the global maximum. An analytical proof is given for the matrices of order 3, and numerical examples are shown for orders 3, 4, and 5 View full abstract»

• ### Efficient order recursive algorithms for multichannel least squares filtering

Publication Year: 1992, Page(s):1354 - 1374
Cited by:  Papers (23)
| |PDF (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»

• ### Digital filters as absolute norm regularizers

Publication Year: 1992, Page(s):1548 - 1562
Cited by:  Papers (63)
| |PDF (1016 KB)

A variational formulation of the digital filtering problem, based on a certain regularizing functional, is presented. In particular, the special case where the regularizing functional is defined by means of l1-norm is considered and a characterization of its minima is presented. It is shown that, for a certain class of signals, one solution to the regularization problem can be ... View full abstract»

• ### Excursions of adaptive algorithms via the Poisson clumping heuristic

Publication Year: 1992, Page(s):1443 - 1451
Cited by:  Papers (3)
| |PDF (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»

• ### Calculating the FHT in hardware

Publication Year: 1992, Page(s):1341 - 1353
Cited by:  Papers (21)
| |PDF (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»

• ### On unique localization of constrained-signals sources

Publication Year: 1992, Page(s):1542 - 1547
Cited by:  Papers (17)
| |PDF (428 KB)

Conditions for unique localization of radiating sources by passive sensor arrays are presented. Unlike in previous analyses, the case wherein the signals are constrained to certain loci in the complex plane is addressed. Two types of constraints are considered. The first includes the case of constant-amplitude signals and the second includes the case of complex-exponential signals. The conditions ... View full abstract»

• ### 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)
| |PDF (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»

• ### Design of windows with steerable sidelobe dips

Publication Year: 1992, Page(s):1452 - 1459
Cited by:  Papers (11)
| |PDF (504 KB)

Based on the frequency sampling method, a novel and simple window design technique was established upon three theorems. The technique produces a set of windows which have simple expressions and the steerable sidelobe-dip (SSLD) property. By steering the dips in the sidelobes, it is easy to reduce the edge of the mainlobe, or to minimize the height of sidelobes, or to create a hole' in the sidelob... View full abstract»

• ### Least squared error FIR filter design with transition bands

Publication Year: 1992, Page(s):1327 - 1340
Cited by:  Papers (52)
| |PDF (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»

• ### An updating algorithm for subspace tracking

Publication Year: 1992, Page(s):1535 - 1541
Cited by:  Papers (180)  |  Patents (3)
| |PDF (492 KB)

In certain signal processing applications it is required to compute the null space of a matrix whose rows are samples of a signal with p components. The usual tool for doing this is the singular value decomposition. However, the singular value decomposition has the drawback that it requires O(p3) operations to recompute when a new sample arrives. It is shown t... View full abstract»

• ### A novel two-stage algorithm for DCT and IDCT

Publication Year: 1992, Page(s):1610 - 1612
Cited by:  Papers (4)
| |PDF (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»

• ### Cartesian hidden Markov models with applications

Publication Year: 1992, Page(s):1601 - 1604
Cited by:  Papers (9)
| |PDF (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»

• ### A neural network model for invariant pattern recognition

Publication Year: 1992, Page(s):1595 - 1599
Cited by:  Papers (10)  |  Patents (1)
| |PDF (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»

• ### Signal detection in a multiple time delay environment

Publication Year: 1992, Page(s):1587 - 1590
| |PDF (316 KB)

Signal detection methods for an uncertain multipath environment are described. The multipath transmission channel is modeled considering a different transfer function from the source to each hydrophone of the receiving array. The signal-to-noise ratio (SNR) is assumed to be low. Based on a simple example, which is given together with Monte Carlo simulation results, the statistical behavior of the ... View full abstract»

• ### Uniform approximation with doubly finite Volterra series

Publication Year: 1992, Page(s):1438 - 1442
Cited by:  Papers (23)
| |PDF (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»

• ### Adaptive code excited predictive coding

Publication Year: 1992, Page(s):1317 - 1326
Cited by:  Papers (7)  |  Patents (2)
| |PDF (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»

• ### Newton algorithms for conditional and unconditional maximum likelihood estimation of the parameters of exponential signals in noise

Publication Year: 1992, Page(s):1528 - 1534
Cited by:  Papers (28)
| |PDF (560 KB)

The authors present polynomial-based Newton algorithms for maximum likelihood estimation (MLE) of the parameters of multiple exponential signals in noise. This formulation can be used in the estimation, for example, of the directions of arrival of multiple noise-corrupted narrowband plane waves using uniform linear arrays and the frequencies of multiple noise-corrupted complex sine waves. The algo... View full abstract»

## 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
Pier Luigi Dragotti
Imperial College London