Proceedings of the 2005 ACM/SIGDA 13th International Symposium on Field-Programmable Gate Arrays 2005
DOI: 10.1145/1046192.1046257
|View full text |Cite
|
Sign up to set email alerts
|

A 2005 review of FPGA arithmetic (abstract only)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2008
2008
2008
2008

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(8 citation statements)
references
References 0 publications
0
8
0
Order By: Relevance
“…This technique gives compact, but very slow implementations which take N clock cycles to be completed [7,8].…”
Section: Non Conventional Addersmentioning
confidence: 99%
See 4 more Smart Citations
“…This technique gives compact, but very slow implementations which take N clock cycles to be completed [7,8].…”
Section: Non Conventional Addersmentioning
confidence: 99%
“…Array structures: Are also denoted as Horner multiplier, are based on parallel arrays that give fast multipliers, with minimum delay, but results in large implementations, and most of the logic is idle during a calculation [7].…”
Section: Non Conventional Addersmentioning
confidence: 99%
See 3 more Smart Citations