P. P. Vaidyanathan

Multirate digital filters, filter banks, polyphase networks, and applications: a tutorial

The basic concepts and building blocks in multirate digital signal processing (DSP), including the digital polyphase representation, are reviewed. Recent progress, as reported by several authors in this area, is discussed. Several applications are described, including subband coding of waveforms, voice privacy systems, integral and fractional sampling rate conversion (such as in digital audio), digital crossover networks, and multirate coding of narrowband filter coefficients. The M-band quadrature mirror filter (QMF) bank is discussed in considerable detail, including an analysis of various errors and imperfections. Recent techniques for perfect signal reconstruction in such systems are reviewed. The connection between QMF banks and other related topics, such as block digital filtering and periodically time-varying systems, is examined in a pseudo-circulant-matrix framework. Unconventional applications of the polyphase concept are discussed. >

Nested Arrays: A Novel Approach to Array Processing With Enhanced Degrees of Freedom

A new array geometry, which is capable of significantly increasing the degrees of freedom of linear arrays, is proposed. This structure is obtained by systematically nesting two or more uniform linear arrays and can provide O(N2) degrees of freedom using only N physical sensors when the second-order statistics of the received data is used. The concept of nesting is shown to be easily extensible to multiple stages and the structure of the optimally nested array is found analytically. It is possible to provide closed form expressions for the sensor locations and the exact degrees of freedom obtainable from the proposed array as a function of the total number of sensors. This cannot be done for existing classes of arrays like minimum redundancy arrays which have been used earlier for detecting more sources than the number of physical sensors. In minimum-input-minimum-output (MIMO) radar, the degrees of freedom are increased by constructing a longer virtual array through active sensing. The method proposed here, however, does not require active sensing and is capable of providing increased degrees of freedom in a completely passive setting. To utilize the degrees of freedom of the nested co-array, a novel spatial smoothing based approach to DOA estimation is also proposed, which does not require the inherent assumptions of the traditional techniques based on fourth-order cumulants or quasi stationary signals. As another potential application of the nested array, a new approach to beamforming based on a nonlinear preprocessing is also introduced, which can effectively utilize the degrees of freedom offered by the nested arrays. The usefulness of all the proposed methods is verified through extensive computer simulations.

A new class of two-channel biorthogonal filter banks and wavelet bases

Proposes a novel framework for a new class of two-channel biorthogonal filter banks. The framework covers two useful subclasses: i) causal stable IIR filter banks. ii) linear phase FIR filter banks. There exists a very efficient structurally perfect reconstruction implementation for such a class. Filter banks of high frequency selectivity can be achieved by using the proposed framework with low complexity. The properties of such a class are discussed in detail. The design of the analysis/synthesis systems reduces to the design of a single transfer function. Very simple design methods are given both for FIR and IIR cases. Zeros of arbitrary multiplicity at aliasing frequency can be easily imposed, for the purpose of generating wavelets with regularity property. In the IIR case, two new classes of IIR maximally flat filters different from Butterworth filters are introduced. The filter coefficients are given in closed form. The wavelet bases corresponding to the biorthogonal systems are generated. the authors also provide a novel mapping of the proposed 1-D framework into 2-D. The mapping preserves the following: i) perfect reconstruction; ii) stability in the IIR case; iii) linear phase in the FIR case; iv) zeros at aliasing frequency; v) frequency characteristic of the filters. >

Quadrature mirror filter banks, M-band extensions and perfect-reconstruction techniques

In this paper, quadrature mirror filters (QMF) are reviewed. After a brief introduction to multirate building blocks, the two-band QMF bank is discussed. Various distortions caused by the structure, and methods to eliminate these distortions are outlined. Perfect-reconstruction structures for the two-band case are reviewed, and the results are extended to the case of arbitrary number of channels. The relation between perfect-reconstruction QMF banks and the concept of losslessness in transfers-matrices is indicated. New lattice structures are presented, which perform the perfect reconstruction, sometimes even under coefficient quantization.

Sparse Sensing With Co-Prime Samplers and Arrays

This paper considers the sampling of temporal or spatial wide sense stationary (WSS) signals using a co-prime pair of sparse samplers. Several properties and applications of co-prime samplers are developed. First, for uniform spatial sampling with M and N sensors where M and N are co-prime with appropriate interelement spacings, the difference co-array has O(MN) freedoms which can be exploited in beamforming and in direction of arrival estimation. An M -point DFT filter bank and an N-point DFT filter bank can be used at the outputs of the two sensor arrays and their outputs combined in such a way that there are effectively MN bands (i.e., MN narrow beams with beamwidths proportional to 1/MN), a result following from co-primality. The ideas are applicable to both active and passive sensing, though the details and tradeoffs are different. Time domain sparse co-prime samplers also generate a time domain co-array with O(MN) freedoms, which can be used to estimate the autocorrelation at much finer lags than the sample spacings. This allows estimation of power spectrum of an arbitrary signal with a frequency resolution proportional to 2π/(MNT) even though the pairs of sampled sequences xc(NTn) and xc(MTn) in the time domain can be arbitrarily sparse - in fact from the sparse set of samples xc(NTn) and xc(MTn) one can estimate O(MN) frequencies in the range |ω| <; π/T. It will be shown that the co-array based method for estimating sinusoids in noise offers many advantages over methods based on the use of Chinese remainder theorem and its extensions. Examples are presented throughout to illustrate the various concepts.

Cosine-modulated FIR filter banks satisfying perfect reconstruction

The authors obtain a necessary and sufficient condition on the 2M (M=number of channels) polyphase components of a linear-phase prototype filter of length N=2 mM (where m=an arbitrary positive integer), such that the polyphase component matrix of the modulated filter is lossless. The losslessness of the polyphase component matrix, in turn, is sufficient to ensure that the analysis/synthesis system satisfies perfect reconstruction (PR). Using this result, a novel design procedure is presented based on the two-channel lossless lattice. This enables the design of a large class of FIR (finite impulse response)-PR filter banks, and includes the N=2M case. It is shown that this approach requires fewer parameters to be optimized than in the pseudo-QMF (quadrature mirror filter) designs and in the lossless lattice based PR-QMF designs (for equal length filters in the three designs). This advantage becomes significant when designing long filters for large M. The design procedure and its other advantages are described in detail. Design examples and comparisons are included. >

Theory and design of M-channel maximally decimated quadrature mirror filters with arbitrary M, having the perfect-reconstruction property

Based on the concept of losslessness in digital filter structures, this paper derives a general class of maximally decimated M-channel quadrature mirror filter banks that lead to perfect reconstruction. The perfect-reconstruction property guarantees that the reconstructed signal \hat{x} (n) is a delayed version of the input signal x (n), i.e., \hat{x} (n) = x (n - n_{0}) . It is shown that such a property can be satisfied if the alias component matrix (AC matrix for short) is unitary on the unit circle of the z plane. The number of channels M is arbitrary, and when M is two, the results reduce to certain recently reported 2-channel perfect-reconstruction QMF structures. A procedure, based on recently reported FIR cascaded-lattice structures, is presented for optimal design of such FIR M-channel filter banks. Design examples are included.

The digital all-pass filter: a versatile signal processing building block

The properties of digital all-pass filters are reviewed and a broad overview of the diversity of applications in digital filtering is provided. Starting with the definition and basic properties of a scalar all-pass function, a variety of structures satisfying the all-pass property are assembled, with emphasis placed on the concept of structural losslessness. Applications are then outlined in notch filtering, complementary filtering and filter banks, multirate filtering, spectrum and group-delay equalization, and Hilbert transformations. In all cases, the structural losslessness property induces very robust performance in the face of multiplier coefficient quantization. Finally, the state-space manifestations of the all-pass property are explored, and it is shown that many all-pass filter structures are devoid of limit cycle behavior and feature very low roundoff noise gain. >

Lattice structures for optimal design and robust implementation of two-channel perfect-reconstruction QMF banks

A lattice structure and an algorithm are presented for the design of two-channel QMF (quadrature mirror filter) banks, satisfying a sufficient condition for perfect reconstruction. The structure inherently has the perfect-reconstruction property, while the algorithm ensures a good stopband attenuation for each of the analysis filters. Implementations of such lattice structures are robust in the sense that the perfect-reconstruction property is preserved in spite of coefficient quantization. The lattice structure has the hierarchical property that a higher order perfect-reconstruction QMF bank can be obtained from a lower order perfect-reconstruction QMF bank, simply by adding more lattice sections. Several numerical examples are provided in the form of design tables. >

MIMO Radar Space–Time Adaptive Processing Using Prolate Spheroidal Wave Functions

In the traditional transmitting beamforming radar system, the transmitting antennas send coherent waveforms which form a highly focused beam. In the multiple-input multiple-output (MIMO) radar system, the transmitter sends noncoherent (possibly orthogonal) broad (possibly omnidirectional) waveforms. These waveforms can be extracted at the receiver by a matched filterbank. The extracted signals can be used to obtain more diversity or to improve the spatial resolution for clutter. This paper focuses on space-time adaptive processing (STAP) for MIMO radar systems which improves the spatial resolution for clutter. With a slight modification, STAP methods developed originally for the single-input multiple-output (SIMO) radar (conventional radar) can also be used in MIMO radar. However, in the MIMO radar, the rank of the jammer-and-clutter subspace becomes very large, especially the jammer subspace. It affects both the complexity and the convergence of the STAP algorithm. In this paper, the clutter space and its rank in the MIMO radar are explored. By using the geometry of the problem rather than data, the clutter subspace can be represented using prolate spheroidal wave functions (PSWF). A new STAP algorithm is also proposed. It computes the clutter space using the PSWF and utilizes the block-diagonal property of the jammer covariance matrix. Because of fully utilizing the geometry and the structure of the covariance matrix, the method has very good SINR performance and low computational complexity.