Please use this identifier to cite or link to this item:
Title: Use of the Remez algorithm for designing FRM based FIR filters
Authors: Saramäki, T.
Lim, Y.C. 
Keywords: Frequences-response masking approach
Linear-phase FIR filter design
Narrow transition-band linear-phase FIR filters
Remez multiple exchange algorithm
Issue Date: Mar-2003
Citation: Saramäki, T.,Lim, Y.C. (2003-03). Use of the Remez algorithm for designing FRM based FIR filters. Circuits, Systems, and Signal Processing 22 (2) : 77-97. ScholarBank@NUS Repository.
Abstract: A very efficient technique for drastically reducing the number of multipliers and adders in narrow transition-band linear-phase finite impulse response (FIR) filters is to use the one-stage or multistage frequency-response masking (FRM) approach as originally introduced by Lim. In the original synthesis techniques developed by Lim and Lian, the subfilters in the overall approach were designed using time-consuming linear programming. In order to perform the overall synthesis faster, this paper shows how these subfilters can be designed with the aid of the Remez multiple exchange algorithm, the most powerful technique for designing arbitrary-magnitude linear-phase FIR filters in the minimax sense. In addition to speeding up the overall procedure, the use of the Remez algorithm enables one to generate a very fast Matlab program for the overall synthesis so that after being given the filter specifications as well as the number of stages, the program automatically provides the solution with the minimum number of multipliers and adders required in the overall implementation. This is possible because the Matlab Remez routine is directly available and thus can be used for this purpose after appropriate modifications.
Source Title: Circuits, Systems, and Signal Processing
ISSN: 0278081X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Feb 2, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.