A MODIFIED FREQUENCY-RESPONSE MASKING STRUCTURE FOR HIGH-SPEED FPGA IMPLEMENTATION OF SHARP FIR FILTERS

2003 ◽  
Vol 12 (05) ◽  
pp. 643-654 ◽  
Author(s):  
YONG LIAN

This paper presents the design and implementation of high-speed, multiplierless, arbitrary bandwidth sharp FIR filters based on frequency-response masking (FRM) technique. The FRM filter structure has been modified to improve the throughput rate by replacing long band-edge shaping filter in the original FRM approach with two to three cascaded short filters. The proposed structure is suitable for FPGA as well as VLSI implementation for sharp digital FIR filters. It is shown by an example that a near 200-tap equivalent Remez FIR filter can be implemented in a single Xilinx XC4044XLA device that operates at sampling frequency of 5.5 MHz.

2003 ◽  
Vol 12 (05) ◽  
pp. 601-630 ◽  
Author(s):  
OSCAR GUSTAFSSON ◽  
HÅKAN JOHANSSON ◽  
LARS WANHAMMAR

In this work filter structures that decrease the required number of multipliers and adders for implementation of linear-phase FIR filters using frequency-response masking techniques are introduced. The basic idea of the proposed structures is that identical subfilters are used. This leads to the same arithmetic structure can be multiplexed in the implementation, reducing the number of required multipliers and adders. The subfilters are mapped using the folding transformation to obtain an area-efficient time-multiplexed (or pipeline/interleaved) implementation. Both narrow-band and wide-band frequency-response masking as well as arbitrary bandwidth frequency-response masking techniques are considered. The filter design is discussed and for each filter structure the limits on the specifications are derived. Designed examples show the usefulness of the proposed structures.


2003 ◽  
Vol 12 (05) ◽  
pp. 631-642 ◽  
Author(s):  
SERGIO L. NETTO ◽  
LUIZ C. R. de BARCELLOS ◽  
PAULO S. R. DINIZ

A new cosine-modulated filter bank (CMFB) structure is proposed based on the frequency-response masking (FRM) approach using masking filter decomposition. The resulting structure, the so-called FRM2-CMFB, presents reasonable computational complexity (number of arithmetic operations per output sample) and allows one to design filter banks with extremely large number of bands. The examples include the use of M=1024 bands, where the standard minimax method cannot be employed. These examples indicate that the reduction in computational complexity can be as high as 60% of the original FRM-CMFB structure, which does not use masking filter decomposition.


Sign in / Sign up

Export Citation Format

Share Document