Passive cascaded-lattice structures for low-sensitivity FIR filter design, with applications to filter banks

A class of nonrecursive cascaded-lattice structures is derived, for the implementation of finite-impulse response (FIR) digital filters. The building blocks are lossless and the transfer function can be implemented as a sequence of planar rotations. The structures can be used for the synthesis of any scalar FIR transfer function H(z) with no restriction on the location of zeros; at the same time, all the lattice coefficients have magnitude bounded above by unity. The structures have excellent passband sensitivity because of inherent passivity, and are automatically internally scaled, in an L_2 sense. The ideas are also extended for the realization of a bank of MFIR transfer functions as a cascaded lattice. Applications of these structures in subband coding and in multirate signal processing are outlined. Numerical design examples are included

Theory and design of uniform DFT, parallel, quadrature mirror filter banks

In this paper, the theory of uniform DFT, parallel, quadrature mirror filter (QMF) banks is developed. The QMF equations, i.e., equations that need to be satisfied for exact reconstruction of the input signal, are derived. The concept of decimated filters is introduced, and structures for both analysis and synthesis banks are derived using this concept. The QMF equations, as well as closed-form expressions for the synthesis filters needed for exact reconstruction of the input signalx(n), are also derived using this concept. In general, the reconstructed. signalhat{x}(n)suffers from three errors: aliasing, amplitude distortion, and phase distortion. Conditions for exact reconstruction (i.e., all three distortions are zero, andhat{x}(n)is equal to a delayed version ofx(n))of the input signal are derived in terms of the decimated filters. Aliasing distortion can always be completely canceled. Once aliasing is canceled, it is possible to completely eliminate amplitude distortion (if suitable IIR filters are employed) and completely eliminate phase distortion (if suitable FIR filters are employed). However, complete elimination of all three errors is possible only with some simple, pathalogical stable filter transfer functions. In general, once aliasing is canceled, the other distortions can be minimized rather than completely eliminated. Algorithms for this are presented. The properties of FIR filter banks are then investigated. Several aspects of IIR filter banks are also studied using the same framework

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

We propose 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

Circulant and skew-circulant matrices as new normal-form realization of IIR digital filters

Normal-form fixed-point state-space realization of IIR (infinite-impulse response) filters are known to be free from both overflow oscillations and roundoff limit cycles, provided magnitude truncation arithmetic is used together with two's-complement overflow features. Two normal-form realizations are derived that utilize circulant and skew-circulant matrices as their state transition matrices. The advantage of these realizations is that the A-matrix has only N (rather than N2) distinct elements and is amenable to efficient memory-oriented implementation. The problem of scaling the internal signals in these structures is addressed, and it is shown that an approximate solution can be obtained through a numerical optimization method. Several numerical examples are included

Efficient implementation of 90 degrees phase shifter in FPGA

In this article, we present an efficient way of implementing 90 phase shifter using Hilbert transformer with canonic signed digit (CSD) coefficients in FPGA. It is implemented using 27-tap symmetric finite impulse response (FIR) filter. Representing the filter coefficients by CSD eliminates the need for multipliers and the filter is implemented using shifters and adders/subtractors. The simulated results for the frequency response of the Hilbert transformer with infinite precision coefficients and CSD coefficients agree with each other. The proposed architecture requires less hardware as one adder is saved for the realization of every negative coefficient compared to convectional CSD FIR filter implementation. Also, it offers a high accuracy of phase shift

Two-channel perfect-reconstruction FIR QMF structures which yield linear-phase analysis and synthesis filters

Two perfect-reconstruction structures for the two-channel quadrature mirror filter (QMF) bank, free of aliasing and distortions of any kind, in which the analysis filters have linear phase, are described. The structure in the first case is related to the linear prediction lattice structure. For the second case, new structures are developed by propagating the perfect-reconstruction and linear-phase properties. Design examples, based on optimization of the parameters in the lattice structures, are presented for both cases

Towards low-latency real-time detection of gravitational waves from compact binary coalescences in the era of advanced detectors

Electromagnetic (EM) follow-up observations of gravitational wave (GW) events will help shed light on the nature of the sources, and more can be learned if the EM follow-ups can start as soon as the GW event becomes observable. In this paper, we propose a computationally efficient time-domain algorithm capable of detecting gravitational waves (GWs) from coalescing binaries of compact objects with nearly zero time delay. In case when the signal is strong enough, our algorithm also has the flexibility to trigger EM observation before the merger. The key to the efficiency of our algorithm arises from the use of chains of so-called Infinite Impulse Response (IIR) filters, which filter time-series data recursively. Computational cost is further reduced by a template interpolation technique that requires filtering to be done only for a much coarser template bank than otherwise required to sufficiently recover optimal signal-to-noise ratio. Towards future detectors with sensitivity extending to lower frequencies, our algorithm's computational cost is shown to increase rather insignificantly compared to the conventional time-domain correlation method. Moreover, at latencies of less than hundreds to thousands of seconds, this method is expected to be computationally more efficient than the straightforward frequency-domain method.Comment: 19 pages, 6 figures, for PR