Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94
DOI: 10.1109/iscas.1994.409207
|View full text |Cite
|
Sign up to set email alerts
|

High-speed FIR-filter architectures with scalable sample rates

Abstract: FIR ( nite impulse response) lters are widely used in digital signal processing. In this paper new architectures for high speed FIR lters with programmable coe cients are presented. Special e orts are undertaken to develop a structure that is well suitable for di erent data rates and therefore may be used within a tool ( lter generator) that generates demand driven dedicated lter structures. The presented structure leads to highly e cient designs, that are useable within di erent e n vironments. The basic desi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 10 publications
(3 reference statements)
0
3
0
Order By: Relevance
“…The number of full adder cells between two consecutive pipeline register cells has been chosen to be 2 in order to gain the smallest possible area while fulfilling the constraints on the data rate. This results in a modified structure (Vaupel & Meyr 1994) compared to (Noll 1987). The principle of the structure is depicted in Figure 3 exemplified by a filter with three taps and a coefficient word length of four bit.…”
Section: Timing Synchronizationmentioning
confidence: 99%
See 1 more Smart Citation
“…The number of full adder cells between two consecutive pipeline register cells has been chosen to be 2 in order to gain the smallest possible area while fulfilling the constraints on the data rate. This results in a modified structure (Vaupel & Meyr 1994) compared to (Noll 1987). The principle of the structure is depicted in Figure 3 exemplified by a filter with three taps and a coefficient word length of four bit.…”
Section: Timing Synchronizationmentioning
confidence: 99%
“…Exploiting a carry-save representation as internal data format, the filters are implemented as rows of adder cells (bitplanes). Since investigations led to an optimum pipeline depth (the number of additions between two registers) of three, a re-ordering of the bitplanes similar to (Vaupel & Meyr 1994) has been applied to reduce silicon real estate. In order to provide the adder cells with the correctly delayed values, the input samples are delayed in one shift register chain.…”
Section: Figure 4 Block Diagram Of One Branch Of the Matched Filtermentioning
confidence: 99%
“…The complexity of developed generators reaches from simple logic functions or micro processor interjaces to quite complex blocks like Viterbi decoders [15], CORDIC processors [16] or filters with fixed or variable coefficients [17].…”
Section: Generator Clause I-gzr>mentioning
confidence: 99%