Synthesis of coherent two-port optical delay-line circuit with ringwaveguides

A method has already been reported by the author and others for synthesizing coherent two-port lattice-form optical delay-line circuits which have the same filter characteristics as finite impulse response (FIR) digital filters. This paper proposes a two-port circuit configuration with ring waveguides which can realize the same filter characteristics as infinite impulse response (IIR) digital filters. It also describes a synthesis method for realizing arbitrary IIR filter characteristics with the circuit configuration. This method is based on scattering matrix factorization. Some synthesis examples are demonstrated including an elliptic filter, a Butterworth filter, an optical filter with maximally flat group-delay characteristics, a group-delay dispersion equalizer, and a multichannel selector     

Synthesis of grating lattice circuits

The realization of high-performance components based on optical infinite impulse response (IIR) filter design theory is desirable for next-generation global optical networks. Previously proposed IIR filter synthesis methods are matrix factorization techniques for a lattice circuit using ring resonators. The size of ring resonator limits the bandwidth of the lattice filters. In this paper, two configurations of grating lattice filters are synthesized by using a scattering matrix representation for the grating. The grating is one of the most powerful optical elements both in fiber optics and photonic integrated circuits. One configuration is a serial grating lattice filter configuration and the other is a parallel grating lattice filter configuration. The actual frequency response of the synthesized grating lattice filter is calculated to show the design limitation due to the frequency response of the element gratings     

Design of low-order linear-phase IIR filters via orthogonalprojection

This paper presents an indirect linear-phase IIR filter design technique based on a reduction of linear-phase FIR filters. The desired filter is obtained by minimizing the L₂ norm of the difference between the original FIR filter and the lower order IIR filter. We first establish a relationship between the Hankel singular values of the discarded part of the FIR filter and the L₂ norm of the corresponding filter approximation error based on model truncation. This result motivates us to propose a simple finite search method that will achieve better approximation results than commonly used truncation methods such as the balanced truncation (BT) and the impulse response gramian (IRG) methods. We then develop an iterative algorithm for finding an optimal IIR filter based on a matrix projection of the original FIR filter. The convergence of the proposed algorithm is established. Filters designed using the proposed algorithm are compared with those obtained by other techniques with respect to the amplitude response and group delay characteristics in the passband. Numerical examples show that the proposed algorithm offers the best performance     

Logarithmic wavelength demultiplexers

A general approach for a full 1 /spl times/ N demultiplexer using a tree of filter stages is proposed. The device architecture is compact, requiring at least N - 1 filter stages, and flexible, as each filter stage can be arbitrarily designed, with the only constraint of the half-band power property. The filters can be realized using any optical filtering techniques as thin-film interference, Bragg gratings, or planar delay-line circuits. The performances of the proposed architecture are illustrated with respect to different lattice-form finite impulse response (FIR) and infinite impulse response (IIR) filter stages, showing that the demultiplexer inherently presents low crosstalk and flat passband. A design example of a 1 /spl times/ 4 demultiplexer consisting of three all-pass (AP) filters is compared with a generalized Mach-Zehnder interferometer (MZI) with four AP filters in its arms, showing that the two approaches achieve similar results.     

A new method for adaptive IIR filter design based on tabu search algorithm

Adaptive digital filters have proven their worth in a wide range of applications such as channel equalisation, noise reduction, echo cancelling, and system identification. These filters can be broadly classified into two groups: finite impulse–response (FIR) and infinite impulse–response (IIR) filters. IIR filters have become the target of increasing interest because these filters can reduce the filter order significantly as compared to FIR filters. Tabu search is a heuristic optimisation algorithm which has been originally developed for combinatorial optimisation problems. It simulates the general rules of intelligent problem solving and has the ability of discovering the global minima in a multi-modal search space. In this work, a novel method based on tabu search is described for the design of adaptive IIR filters.     

Desensitized Half-Band Filters

A common component in digital circuitry for communication systems is the half-band filter. Digital half-band filters are often used in cooperation with upsamplers and downsamplers in multirate systems when a sampling-rate change is required. While techniques for designing these filters are well known, an entirely new method for the design and implementation of lowpass FIR half-band filters is presented in this paper, one in which the filter's frequency response can be provided with a significant insensitivity to the filter's tap-coefficient values. Such insensitivity can be exploited in the filter-design process to yield half-band filters with reduced hardware requirements, which can lead to circuits having lower power consumption, higher operating speeds, and smaller IC area.      

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     

IIR Filter Adaptation Using Branch-and-Bound: A Novel Approach

Adaptive infinite impulse response (IIR) filters provide significant advantages over equivalent finite impulse response (FIR) implementations because they are able to more accurately model physical plants that have pole-zero structures. Additionally, they are typically capable of meeting performance specifications using fewer filter parameters. This savings in parameters, which can be as much as 5–10 times, leads to the use of fewer multiplier blocks and therefore, lower power consumption. Despite these advantages, adaptive IIR filters have not found widespread use because the associated mean squared error (MSE) cost function is multimodal and therefore, significantly difficult to minimize. Additionally, the filter can become unstable during adaptation. These two properties pose several problems for adaptive algorithms, causing them to be sensitive to initial conditions, produce biased solutions, unstable filter configurations or converge to local minima. These problems prevent the widespread use of adaptive IIR filters in practice and if such filter structures are to become more practical, new, innovative solutions are required. This paper proposes a new algorithm for minimizing the MSE cost function of adaptive IIR filters aimed at addressing some of the aforementioned issues. We adopt the approach of using a Branch-and-Bound algorithm, which is an exhaustive search method, and employ interval arithmetic for all computations. Simulation results show that the resulting algorithm is viable and competitive and, when compared with a number of existing state-of-the-art algorithms, outperforms them in terms of the MSE of the final point.      

Closed-Form Design of Half-Sample Delay IIR Filter Using Continued Fraction Expansion

In this paper, the closed-form design of half-sample delay infinite-impulse response (IIR) filter is presented. First, the continued fraction expansion (CFE) and its recursive computation are reviewed briefly. Then, the CFE of square root function is applied to design half-sample delay IIR filters with various orders. The comparisons with conventional maximally flat half-sample delay all-pass and Lagrange filters are made and implementation issue is also addressed. Next, the designed half-sample delay filter is used to reduce the approximation error of the conventional IIR Simpson integrator, to design half-band and diamond shaped filters, and to magnify the digital image. Finally, several numerical examples are illustrated to demonstrate the effectiveness of the proposed design method     

Two-channel IIR QMF banks with approximately linear-phase analysisand synthesis filters

Perfect linear-phase two-channel QMF banks require the use of finite impulse response (FIR) analysis and synthesis filters. Although they are less expensive and yield superior stopband characteristics, perfect linear phase cannot be achieved with stable infinite impulse response (IIR) filters. Thus, IIR designs usually incorporate a postprocessing equalizer that is optimized to reduce the phase distortion of the entire filter bank. However, the analysis and synthesis filters of such an IIR filter bank are not linear phase. In this paper, a computationally simple method to obtain IIR analysis and synthesis filters that possess negligible phase distortion is presented. The method is based on first applying the balanced reduction procedure to obtain nearly allpass IIR polyphase components and then approximating these with perfect allpass IIR polyphase components. The resulting IIR designs already have only negligible phase distortion. However, if required, further improvement may be achieved through optimization of the filter parameters. For this purpose, a suitable objective function is presented. Bounds for the magnitude and phase errors of the designs are also derived. Design examples indicate that the derived IIR filter banks are more efficient in terms of computational complexity than the FIR prototypes and perfect reconstruction FIR filter banks. Although the PR FIR filter banks when implemented with the one-multiplier lattice structure and IIR filter banks are comparable in terms of computational complexity, the former is very sensitive to coefficient quantization effects     

Two Classes of Frequency-Response Masking Linear-Phase FIR Filters for Interpolation and Decimation

This paper introduces two classes of frequency-response masking (FRM) linear-phase finite (length) impulse response (FIR) filters for interpolation and decimation by arbitrary integer factors M. As they are based on the FRM approach, the proposed filters are low-complexity (efficient) sharp-transition linear-phase FIR interpolation and decimation filters. Compared to previously existing FRM linear-phase FIR filter classes for interpolation and decimation, the new ones offer lower complexity and more freedom in selecting the locations of the passband and stopband edges. Furthermore, the proposed classes of FRM filters can, as special cases, realize efficient Mth-band FRM linear-phase FIR interpolation and decimation filters for all values of M. Previously, only half-band (M = 2) FRM linear-phase FIR filters have appeared in the literature. The paper includes design techniques suitable for the new filters and design examples illustrating their efficiency.     

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.     

Low-Order IIR Filter Bank Design

The advantage of infinite-impulse response (IIR) filters over finite-impulse response (FIR) ones is that the former require a much lower order (much fewer multipliers and adders) to obtain the desired response specifications. However, in contrast with well-developed FIR filter bank design theory, there is no satisfactory methodology for IIR filter bank design. The well-known IIR filters are mostly derived by rather heuristic techniques, which work in only narrow design classes. The existing deterministic techniques usually lead to too high order IIR filters and thus cannot be practically used. In this paper, we propose a new method to solve the low-order IIR filter bank design, which is based on tractable linear-matrix inequality (LMI) optimization. Our focus is the quadrature mirror filter bank design, although other IIR filter related problems can be treated and solved in a similar way. The viability of our theoretical development is confirmed by extensive simulation.     

Analysis and design of periodically time-varying IIR filters, withapplications to transmultiplexing

Fundamental constraints on the form of infinite impulse response (IIR) periodically time-varying (PTV) filters are identified, and a design technique with well-defined error and stability characteristics based on those constraints is presented. The design technique is based on the selection of poles and zeros within the time-invariant filter banks of equivalent PTV filter analysis structures. A simple example is presented to illustrate the design method, which implements the IIR PTV as a time-invariant all-feedback IIR filter of the form 1/D(z^P) cascaded with an finite impulse response (FIR) PTV filter. An application of IIR PTV filters to telecommunications transmultiplexing is presented to illustrate the design method and for comparison to an existing PTV design method. The computational complexity of the resulting system compares favorably with that of existing transmultiplexers     

Low-power digital filtering using approximate processing

We present an algorithmic approach to the design of low-power frequency-selective digital filters based on the concepts of adaptive filtering and approximate processing. The proposed approach uses a feedback mechanism in conjunction with well-known implementation structures for finite impulse response (FIR) and infinite impulse response (IIR) digital filters. Our algorithm is designed to reduce the total switched capacitance by dynamically varying the filter order based on signal statistics. A factor of 10 reduction in power consumption over fixed-order filters is demonstrated for the filtering of speech signals     

General IIR optical filter design for WDM applications usingall-pass filters

A general design algorithm is presented for infinite impulse response (IIR) bandpass and arbitrary magnitude response filters that use optical all-pass filters as building blocks. Examples are given for an IIR multichannel frequency selector, an amplifier gain equalizer, a linear square-magnitude response, and a multi-level response. Major advantages are the efficiency of the IIR filter compared to finite impulse response (FIR) filters, the simplicity of the optical architecture, and its tolerance for loss. A reduced set of unique operating states is discussed for implementing a reconfigurable multichannel selection filter     

基于FIR与相位补偿IIR滤波器的雷达回波信号处理

FIR与IIR频率选择滤波器的设计,被广泛应用于数字信号处理领域之中。文章以雷达回波信号的数字处理为例,首先分别设计FIR,IIR滤波器完成了对信号特定频率分量的滤除。进而,针对IIR滤波器的非线性相位,基于最优化设计全通系统实现了相位补偿,并对FIR,IIR滤波器进行了综合比较。     

30-Msamples/s programmable filter processor

A 30-MHz finite impulse response (FIR) programmable filter processor that has been developed using a 1.2-μm CMOS EPROM technology with single metal is discussed. Its 30-MHz worst-case operating frequency meets most video filtering requirements and demonstrates the potential of nonvolatile memory technologies in embedded applications. The processor has been designed with a high level of parallelism and pipelining by using a transposed FIR structure. In this approach, the multipliers are implemented with an EPROM-based look-up table containing the results of the products between video samples and filter coefficients, according to the user's application. The chap can implement every kind of FIR filter with a maximum complexity of 59 taps in a half-band filter configuration, 32 taps for a symmetric filter, and 167 taps for an asymmetric one. The equivalent coefficient precision is 12 b, assuming 8 b of input data precision. Multiprocessor configurations are allowed for more demanding performances such as longer filters, input signal precision extension, two-dimensional processing, and increased throughput     

The gamma-filter-a new class of adaptive IIR filters withrestricted feedback

Generalized feedforward filters, a class of adaptive filters that combines attractive properties of finite impulse response (FIR) filters with some of the power of infinite impulse response (IIR) filters, are described. A particular case, the gamma filter, generalizes Widrow's adaptive transversal filter (adaline) to an infinite impulse response filter. Yet, the stability condition for the gamma filter is trivial, and LMS adaptation is of the same computational complexity as the conventional transversal filter structure. Preliminary results indicate that the gamma filter is more efficient than the adaptive transversal filter. The authors extend the Wiener-Kopf equation to the gamma filter and develop some analysis tools     

A technique for realizing linear phase IIR filters

A real-time IIR filter structure is presented that possesses exact phase linearity with 10~1000 times fewer general multiplies than conventional FIR filters of similar performance and better magnitude characteristics than equiripple or maximally flat group delay IIR filters. This structure is based on a technique using local time reversal and single pass sectioned convolution methods to realized a real-time recursive implementation of the noncausal transfer function H(z^-1). The time reversed section technique used to realize exactly linear phase IIR filters is described. The effects of finite section length on the sectional convolution are analyzed. A simulation methodology is developed to address the special requirements of simulating a time reversed section filter. A design example is presented, with computer simulation to illustrate performance, in terms of overall magnitude response and phase linearity, as a function of finite section length. Nine example filter specifications are used to compare the performance and complexity of the time reversed section technique to those of a direct FIR implementation