Short-length FIR filters and their use in fast nonrecursivefiltering
Mou, Z.-J.
Duhamel, P.
CNET/PAB/RPE, Issy-Les-Moulineaux;
This paper appears in: Signal Processing, IEEE Transactions on
Publication Date: Jun 1991
Volume: 39,
Issue: 6
On page(s): 1322-1332
ISSN: 1053-587X
References Cited: 13
CODEN: ITPRED
INSPEC Accession Number: 3983880
Digital Object Identifier: 10.1109/78.136539
Current Version Published: 2002-08-06
Abstract
The basic tools required for an efficient use of the recently
proposed fast finite impulse response (FIR) algorithms are provided.
These algorithms not only reduce arithmetic complexity but also
partially maintain the multiply-accumulate structure, thus resulting in
efficient implementations. A set of basic algorithms is derived,
together with some rules for combining them. Their efficiency is
compared with that of classical schemes in the case of three different
criteria, corresponding to various types of implementation. It is shown
that this class of algorithms (which includes classical ones as special
cases) makes it possible to find the best tradeoff corresponding to any
criterion
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
