Broadband Beamforming Using TDL-Form IIR Filters

Conventional broadband beamforming structures make use of finite-impulse-response (FIR) filters in each channel. Large numbers of coefficients are required to retain the desired signal-to-interference-plus-noise-ratio (SINR) performance as the operating bandwidth increases. It has been proven that the optimal frequency-dependent array weighting of broadband beamformers could be better approximated by infinite-impulse-response (IIR) filters. However, some potential problems, such as stability monitoring and sensitivity to quantization errors, of the IIR filters make the implementation of the IIR beamformers difficult. In this paper, new broadband IIR beamformers are proposed to solve these problems. The main contributions of this paper include 1) the Frost-based and generalized sidelobe canceller (GSC)-based broadband beamformers utilizing a kind of tapped-delay-line-form (TDL-form) IIR filters are proposed; 2) the combined recursive Gauss-Newton (RGN) algorithm is designed to compute the feedforward and feedback weights in the Frost-based implementation; and 3) in the GSC-based structure, the unconstrained RGN algorithm is customized for the TDL-form IIR filters in the adaptive beamforming part. Compared with the beamformer using direct-form IIR filters, the new IIR beamformers offer much easier stability monitoring and less sensitivity to the coefficient quantization, while comparable SINR improvement over the conventional FIR beamformer is achieved     

Design of IIR orthogonal wavelet filter banks using lifting scheme

The lifting scheme is well known to be an efficient tool for constructing second generation wavelets and is often used to design a class of biorthogonal wavelet filter banks. For its efficiency, the lifting implementation has been adopted in the international standard JPEG2000. It is known that the orthogonality of wavelets is an important property for many applications. This paper presents how to implement a class of infinite-impulse-response (IIR) orthogonal wavelet filter banks by using the lifting scheme with two lifting steps. It is shown that a class of IIR orthogonal wavelet filter banks can be realized by using allpass filters in the lifting steps. Then, the design of the proposed IIR orthogonal wavelet filter banks is discussed. The designed IIR orthogonal wavelet filter banks have approximately linear phase responses. Finally, the proposed IIR orthogonal wavelet filter banks are applied to the image compression, and then the coding performance of the proposed IIR filter banks is evaluated and compared with the conventional wavelet transforms.     

基于Laguerre滤波器等价设计的IIR宽带波束形成

常规IIR宽带波束形成器可以获得比FIR宽带波束形成器更好的性能,但其需要多极点的自适应调整过程,存在稳定性无法保证,计算复杂度较高等问题.本文提出一种新的基于IIR滤波器的宽带波束形成算法.该算法基于高阶Laguerre宽带波束形成器,利用双线性变换和函数束方法设计相应的低阶等价IIR宽带波束形成器.仿真实验及理论分析表明,该方法无需常规IIR宽带波束形成器的多极点自适应调整过程,在保证算法稳定性的同时,减少了计算复杂度,并提高了输出信干噪比(SINR).     

Closed-Form Design of Digital IIR Integrators Using Numerical Integration Rules and Fractional Sample Delays

In this paper, the numerical integration rules and fractional sample delays will be used to obtain the closed-form design of infinite-impulse response (IIR) digital integrators. There are two types of numerical integration rules to be investigated. One is Newton-Cotes quadrature rule, the other is Gauss-Legendre integration rule. Although the proposed IIR digital integrators will involve the implementation of fractional sample delays, this problem is easily solved by applying well-documented design techniques of the finite-impulse response Lagrange and IIR allpass fractional delay filters. Several design examples are illustrated to demonstrate the effectiveness of the proposed method     

A design of linear-phased IIR Nyquist filters

This paper discusses a new method of designing linear-phased IIR Nyquist filters with zero intersymbol interference. The filters designed by this method possess linear-phase characteristics and are lower in order than other Nyquist filters designed by existing methods. Expressions are derived for zero-phased IIR Nyquist filters and efficient design methods are examined for them. The opted design method is based on an iteration process, and in each iteration step a modified version of the Remez exchange algorithm is used. In addition, the implementation of the designed zero-phased IIR filters is considered. Finally, the proposed design method is demonstrated through various design examples     

IIR数字滤波器的粒子群优化设计方法

探讨了IIR（Infinite Impulse Response）数字滤波器的设计,重点研究了IIR数字滤波器设计的粒子群优化（Particle Swarm Optimization,PSO）算法及算法框图,总结了粒子群优化算法的实现步骤。这一算法的提出,避免了传统算法的缺点,所设计的滤波器达到了理想的性能。通过实验表明,IIR数字滤波器的粒子群优化算法优于遗传算法。     

A Systolic-Array Architecture for First-Order 3-D IIR Frequency-Planar Filters

A massively parallel systolic-array architecture is proposed for the implementation of real-time VLSI spatio-temporal 3-D IIR frequency-planar filters at a throughput of one-frame-per-clock-cycle (OFPCC). The architecture is based on a differential-form transfer function and is of low circuit complexity compared with the direct-form architecture. A 3-D look-ahead (LA) form of the transfer function is proposed for maximizing the speed of the implementation, which has a nonseparable 3-D transfer function. The systolic array enables real-time implementation of 3-D IIR frequency-planar filters at radio-frequency (RF) frame-rates and is therefore a suitable building block for 3-D IIR digital filters having beam- and cone-shaped passbands as required for smart-antenna-array beam-forming applications involving the broadband spatio-temporal filtering of plane-waves. The fixed-point systolic-array implementation have a throughput of OFPCC and the tested real-time prototype achieves frame (clock) sample frequencies of up to 90 MHz using one Xilinx Virtex-4 sx35-10ff668 FPGA device.      

A new adaptive recursive RLS-based fast-array IIR filter for active noise and vibration control systems

Infinite impulse response filters have not been used extensively in active noise and vibration control applications. The problems are mainly due to the multimodal error surface and instability of adaptive IIR filters used in such applications. Considering these, in this paper a new adaptive recursive RLS-based fast-array IIR filter for active noise and vibration control applications is proposed. At first an RLS-based adaptive IIR filter with computational complexity of order O(n²) is derived, and a sufficient condition for its stability is proposed by applying passivity theorem on the equivalent feedback representation of this adaptive algorithm. In the second step, to reduce the computational complexity of the algorithm to the order of O(n) as well as to improve its numerical stability, a fast array implementation of this adaptive IIR filter is derived. This is accomplished by extending the existing results of fast-array implementation of adaptive FIR filters to adaptive IIR filters. Comparison of the performance of the fast-array algorithm with that of Erikson’s FuLMS and SHARF algorithms confirms that the proposed algorithm has faster convergence rate and ability to reach a lower minimum mean square error which is of great importance in active noise and vibration control applications.     

Extending the concept of IIR filtering to array processing using approximate spatial IIR structure

Various array processing techniques applied to uniform linear arrays are involuntarily realized using structures that are analogous to finite impulse response filters. This observation leads to the following question: “can we extend infinite impulse response (IIR) filtering to array processing?”. In this paper, we introduce the concept of IIR array in spatial domain. Note that IIR array here does not mean time-domain IIR filtering for array beamforming which is commonly understood. This paper is dedicated to the study of an alternate approach for array signal processing which defines IIR structure in spatial domain. To illustrate the applicability of the concept of IIR array, we propose a new direction-of-arrival estimation technique as well as a beamformer with the spatial domain IIR array implementation. The performance of the proposed methods are comparable to the existing techniques. These illustrations are intended to introduce a new approach which potentially can offer more degrees of freedom to control the performance of the array and reduce the complexity of the system for a desired performance.     

A New Method for Designing Causal Stable IIR Variable Fractional Delay Digital Filters

This paper studies the design of causal stable Farrow-based infinite-impulse response (IIR) variable fractional delay digital filters (VFDDFs), whose subfilters have a common denominator. This structure has the advantages of reduced implementation complexity and avoiding undesirable transient response when tuning the spectral parameter in the Farrow structure. The design of such IIR VFDDFs is based on a new model reduction technique which is able to incorporate prescribed flatness and peak error constraints to the IIR VFDDF under the second order cone programming framework. Design example is given to demonstrate the effectiveness of the proposed approach.     

IIR filter design via Hankel-norm optimal approximation of FIRprototype filters: a streamlined approach

An improved algorithm for Hankel-norm optimal approximation of FIR by IIR discrete-time transfer functions is given which results in a straightforward and computationally efficient implementation which is less error-prone than previous approaches     

Fast Implementation of 3-D Digital Filters Via Systolic Array Processors

In this paper a fast implementation architecture of three-dimensional (3-D) FIR or IIR digital filters via systolic VLSI array processors is described. The modular structure presented is comprised of similar processing elements in a linear cascade configuration with local interconnections. High speed throughput rates are attained due to high concurrency, which is achieved by exploiting both pipelining and parallelism. The considered 3-D FIR and IIR filters may be used for the processing of reconstructed 3-D images and in medical imaging applications.     

Interpolated LIR Mth-band filter design with allpass subfilters

We propose a new allpass-based structure for the IIR Mth-and 2Mth-band filters. These filters consist of M allpass filters and an interpolation filter (sum of two allpasses). Consequently, the proposed structure is very efficient in implementation. By choosing the allpass phase appropriately, the resulting phase response of the IIR Mth-band filter becomes approximately linear. An example is designed and compared with FIR Mth-band filters     

Multidimensional IIR filters and robust rational interpolation

It is well-known that IIR filters can have a much lower order than FIR filters with the same performance. On the downside is that the implementation of an IIR filter is an iterative procedure while that of an FIR filter is a one-shot computation. But in higher dimensions IIR filters are definitely more attractive. We offer a technique where the filter’s performance specifications, stability constraints, its convergence speed and a protection against possible adverse effects of perturbations are all included in the design from the start. The technique only needs an off-the-shelf LP solver because the filter is obtained as a Chebyshev center of a convex polytope. The method deals with general non-causal non-separable filters.     

Design of M‐Channel IIR Uniform DFT Filter Banks Using Recursive Digital Filters

In this paper, we propose a method for designing a class of M‐channel, causal, stable, perfect reconstruction, infinite impulse response (IIR), and parallel uniform discrete Fourier transform (DFT) filter banks. It is based on a previously proposed structure by Martinez et al. [1] for IIR digital filter design for sampling rate reduction. The proposed filter bank has a modular structure and is therefore very well suited for VLSI implementation. Moreover, the current structure is more efficient in terms of computational complexity than the most general IIR DFT filter bank, and this results in a reduced computational complexity by more than 50% in both the critically sampled and oversampled cases. In the polyphase oversampled DFT filter bank case, we get flexible stop‐band attenuation, which is also taken care of in the proposed algorithm.     

Two Classes of Cosine-Modulated IIR/IIR and IIR/FIR NPR Filter Banks

This paper introduces two classes of cosine-modulated causal and stable filter banks (FBs) with near perfect reconstruction (NPR) and low implementation complexity. Both classes have the same infinite-length impulse response (IIR) analysis FB but different synthesis FBs utilizing IIR and finite-length impulse response (FIR) filters, respectively. The two classes are preferable for different types of specifications. The IIR/FIR FBs are preferred if small phase errors relative to the magnitude error are desired, and vice versa. The paper provides systematic design procedures so that PR can be approximated as closely as desired. It is demonstrated through several examples that the proposed FB classes, depending on the specification, can have a lower implementation complexity compared to existing FIR and IIR cosine-modulated FBs (CMFBs). The price to pay for the reduced complexity is generally an increased delay. Furthermore, two additional attractive features of the proposed FBs are that they are asymmetric in the sense that one of the analysis and synthesis banks has a lower computational complexity compared to the other, which can be beneficial in some applications, and that the number of distinct coefficients is small, which facilitates the design of FBs with large numbers of channels.     

Suppression of transients in variable recursive digital filterswith a novel and efficient cancellation method

A new method for suppressing transients in recursive infinite impulse response (IIR) digital filters is proposed. The technique is based on modifying the state (delay) variables of the filter when coefficients are changed so that the filter enters a new state smoothly without transient attacks, as originally proposed by Zetterberg and Zhang (1988). In this correspondence, we modify the Zetterberg-Zhang algorithm to render it feasible for efficient implementation. We define a mean square error (MSE) measure for transients and determine the optimal transient suppressor to cancel the transients down to a desired level at the minimum complexity of implementation. The application of the method to all-pole and direct-form II (DF II) IIR filter sections is studied in detail. Time-varying recursive filtering with transient elimination is illustrated for tunable fractional delay filters and variable-bandwidth lowpass filters     

Design of Constrained Causal Stable IIR Filters Using a New Second- Order-Cone-Programming-Based Model-Reduction Technique

This brief proposes a new method for designing infinite-impulse response (IIR) filter with peak error and prescribed flatness constraints. It is based on the model reduction of a finite-impulse response function that satisfies the specification by extending a method previously proposed by Brandenstein. The proposed model-reduction method retains the denominator of the conventional techniques and formulates the optimal design of the numerator as a second-order cone programming problem. Therefore, linear and convex quadratic inequalities such as peak error constraints and prescribed number of zeros at the stopband for IIR filters can be imposed and solved optimally. Moreover, a method is proposed to express the denominator of the model-reduced IIR filter as a polynomial in integer power of z, which efficiently facilitates its polyphase implementation in multirate applications. Design examples show that the proposed method gives better performance, and more flexibility in incorporating a wide variety of constraints than conventional methods     

Design of stable, causal, perfect reconstruction, IIR uniform DFTfilter banks

Design procedures for stable, causal and perfect reconstruction IIR parallel uniform DFT filter banks (DFT FBs) are presented. In particular a family of IIR prototype filters is a good candidate for DFT FB, where a tradeoff between frequency selectivity and numerical properties (as measured by the Weyl-Heisenberg frames theory) could be made. Some realizations exhibiting a simple and a massively parallel and modular processing structure making a VLSI implementation very suitable are shown. In addition, some multipliers in the filters (both the analysis and synthesis) could be made; powers or sum of powers of 2, in particular for feedback loops, resulting in a good sensitivity behavior. For these reasons as well as for the use of low order IIR filters (as compared with conventional FIR filters), the overall digital filter bank structure is efficient for high data rate applications. Some design examples are provided