IEEE Workshop on Signal Processing Systems
DOI: 10.1109/sips.2002.1049699
|View full text |Cite
|
Sign up to set email alerts
|

High sampling rate retimed DLMS filter implementations in Virtex-II FPGA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…14, where , , and are the latencies of pre-characterized adder, multiplier, and multiplexer blocks, respectively. This extends the retiming algorithm from [25] that assumes equal latency in add and multiply blocks, as applied to FIR filters. Starting from the DFG representation, the latency assignment is carried out as follows.…”
Section: ) Loop Retimingmentioning
confidence: 96%
“…14, where , , and are the latencies of pre-characterized adder, multiplier, and multiplexer blocks, respectively. This extends the retiming algorithm from [25] that assumes equal latency in add and multiply blocks, as applied to FIR filters. Starting from the DFG representation, the latency assignment is carried out as follows.…”
Section: ) Loop Retimingmentioning
confidence: 96%
“…For a given throughput constraint, the solution of Eq. (2) is a set of positive integers (m, a, u) that corresponds to equal clock period, adding b 1 and b 2 balancing registers as needed to satisfy loop latency N. Accounting for different latency of library blocks nicely extends the retiming algorithm from [5].…”
Section: Loop Retimingmentioning
confidence: 99%
“…Throughput and resource usage constraints are placed on the FPGA processor by the system in which it is to be integrated, and a clever design methodology is required which rapidly explores the throughput/resource usage tradeoff to efficiently exploit the FPGA resources for the required throughput requirement. Techniques, such as retiming, for folding and unfolding transformations 6 explore this trade-off and can produce highly efficient results 7 Current approaches in this arena 8 perform architectural retiming techniques for graphs where the folding transformation has been defined. They provide little insight into the effect of the mapping stage from SFG to circuit architecture.…”
Section: Introductionmentioning
confidence: 99%