2010
DOI: 10.1007/s11265-010-0464-y
|View full text |Cite
|
Sign up to set email alerts
|

Iterative-Gradient Based Complex Divider FPGA Core with Dynamic Configurability of Accuracy and Throughput

Abstract: A field programmable gate array (FPGA) implementation of a highly configurable complex divider is presented, based on an iterative gradient algorithm. The proposed architecture allows to configure both the accuracy and the throughput of the division operation, which makes it suitable for diverse applications with different requirements. Results show how various throughputs can be achieved under different maximum error and iteration limit configurations. Besides, the resource occupation is considerably small, c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…On the other hand, the computational cost of R(n) adds one squared modulus and one real moving average. The division in (5) is a costly operation [28] that can be avoided by multiplying ) (n R by the threshold with a cost of 1 real product. The hardware cost of this coarse time synchronization algorithm is: 5 real multipliers, 14 real adders, 160 delay lines and a comparison circuit (combinational logic).…”
Section: Vlsi Implementationmentioning
confidence: 99%
“…On the other hand, the computational cost of R(n) adds one squared modulus and one real moving average. The division in (5) is a costly operation [28] that can be avoided by multiplying ) (n R by the threshold with a cost of 1 real product. The hardware cost of this coarse time synchronization algorithm is: 5 real multipliers, 14 real adders, 160 delay lines and a comparison circuit (combinational logic).…”
Section: Vlsi Implementationmentioning
confidence: 99%