2009
DOI: 10.1109/tvlsi.2008.2002107
|View full text |Cite
|
Sign up to set email alerts
|

Multiplication Acceleration Through Twin Precision

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
39
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 34 publications
(39 citation statements)
references
References 28 publications
0
39
0
Order By: Relevance
“…Their modifications have given a significant improvement in realizing a multiplier with less area, delay, and power [4,5]. Magnus Sjalander and Per Larsson-Edefors [6] have presented a twin precision algorithm to accelerate multiplication. The implemented multiplier has low power dissipation and enables an increased computational throughput.…”
Section: Introductionmentioning
confidence: 99%
“…Their modifications have given a significant improvement in realizing a multiplier with less area, delay, and power [4,5]. Magnus Sjalander and Per Larsson-Edefors [6] have presented a twin precision algorithm to accelerate multiplication. The implemented multiplier has low power dissipation and enables an increased computational throughput.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we narrowed our research work towards achieving double throughput in signed multipliers with lesser hardware complexity. Twin precision (TP) is the technique that can be exploited to obtain the dual output [1] in multipliers, and this technique was implemented for both signed and unsigned multipliers [2].…”
Section: Introductionmentioning
confidence: 99%
“…In [2], double throughput is realised effectively by adopting TP technique in MB multiplier. MB algorithm [10] is a widely used signed algorithm since it has reduced partial product row.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations