A New Low Complexity Uniform Filter Bank Based on the Improved Coefficient Decimation Method

In this paper, we propose a new uniform filter bank (FB) based on the improved coefficient decimation method (ICDM). In the proposed FB’s design, the ICDM is used to obtain different multi-band frequency responses using a single lowpass prototype filter. The desired subbands are individually obtained from these multi-band frequency responses by using low order frequency response masking filters and their corresponding ICDM output frequency responses. We show that the proposed FB is a very low complexity alternative to the other FBs in literature, especially the widely used discrete Fourier transform based FB (DFTFB) and the CDM based FB (CDFB). The proposed FB can have a higher number of subbands with twice the center frequency resolution when compared with the CDFB and DFTFB. Design example and implementation results show that our FB achieves 86.59% and 58.84% reductions in resource utilizations and 76.95% and 47.09% reductions in power consumptions when compared with the DFTFB and CDFB respectively

FRM-Based FIR filters with minimum coefficient sensitivities

A method for optimizing FRM-based FIR filters with optimum coefficient sensitivity is presented. This technique can be used in conjunction with nonlinear optimization techniques to design very sharp filters that do not only have very sparse coefficient values but also very low coefficient sensitivity

Design of Sparse Uniform Linear Array Beamformer using Modified FRM Structure for Varied Applications

This paper presents a method to generate antenna patterns for a Uniform Linear Array (ULA) having narrow beamwidth and low sidelobe levels (SLL) using the recently proposed Modified FRM (ModFRM) architecture. This allows it to direct the beams to specific ground cells for communications while mitigating inter-cell interference. The sharpness of the beam pattern defines the spatial discriminating performance of a ULA beamformer, while the SLL dictates the interference and noise suppression capabilities. Typically, a conventional ULA beamforming will demand high computational complexity and a large number of sensors to satisfy these requirements. Hence to reduce the system cost, using the ModFRM technique a sparse array is developed. With this strategy, the total number of sensors is drastically reduced compared to conventional ULA beamformers. The designed beamformers can be used in applications with stringent requirements where cost and size are concerned

Fir filter design for area efficient implementation /

In this dissertation, a variable precision algorithm based on sensitivity analysis is proposed for reducing the wordlength of the coefficients and/or the number of nonzero bits of the coefficients to reduce the complexity required in the implementation. Further space savings is possible if the proposed algorithm is associated with our optimal structures and derived scaling algorithm. We also propose a structure to synthesize FIR filters using the improved prefilter equalizer structure with arbitrary bandwidth, and our proposed filter structure reduces the area required. Our improved design is targeted at improving the prefilters based on interpolated FIR filter and frequency masking design and aims to provide a sharp transition-band as well as increasing the stopband attenuation. We use an equalizer designed to compensate the prefilter performance. In this dissertation, we propose a systematic procedure for designing FIR filters implementations. Our method yields a good design with low coefficient sensitivity and small order while satisfying design specifications. The resulting hardware implementation is suitable for use in custom hardware such as VLSI and Field Programmable Gate Arrays (FPGAs).FIR filters are preferred for many Digital Signal Processing applications as they have several advantages over IIR filters such as the possibility of exact linear phase, shorter required wordlength and guaranteed stability. However, FIR filter applications impose several challenges on the implementations of the systems, especially in demanding considerably more arithmetic operations and hardware components. This dissertation focuses on the design and implementation of FIR filters in hardware to reduce the space required without loss of performance

Low Complexity Multiplier-less Modified FRM Filter Bank using MPGBP Algorithm

The design of a low complexity multiplier-less narrow transition band filter bank for the channelizer of multi-standard software-defined radio (SDR) is investigated in this paper. To accomplish this, the modal filter and complementary filter in the upper and lower branches of the conventional Frequency Response Masking (FRM) architecture are replaced with two power-complementary and linear phase filter banks. Secondly, a new masking strategy is proposed to fully exploit the potential of the numerous spectra replicas produced by the interpolation of the modal filter, which was previously ignored in the existing FRM design. In this scheme, the two masking filters are appropriately modulated and alternately masked over the spectra replicas from 0 to 2$\pi$, to generate even and odd channels. This Alternate Masking Scheme (AMS) increases the potency of the Modified FRM (ModFRM) architecture for the design of a computationally efficient narrow transition band uniform filter bank (termed as ModFRM-FB). Finally, by combining the adjoining ModFRM-FB channels, Non-Uniform ModFRM-FB (NUModFRM-FB) for extracting different communication standards in the SDR channelizer is created. To reduce the total power consumption of the architecture, the coefficients of the proposed system are made multiplier-less using the Matching Pursuits Generalized Bit-Planes (MPGBP) algorithm. In this method, filter coefficients are successively approximated using a dictionary of vectors to give a sum-of-power-of-two (SOPOT) representation. In comparison to all other general optimization techniques, such as genetic algorithms, the suggested design method stands out for its ease of implementation, requiring no sophisticated optimization or exhaustive search schemes. Another notable feature of the suggested approach is that, in comparison to existing methods, the design time for approximation has been greatly reduced. To further bring down the complexity, adders are reused in recurrent SOPOT terms using the Common Sub-expression Elimination (CSE) technique without compromising the filter performance