2001
DOI: 10.1016/s0920-5489(01)00064-2
|View full text |Cite
|
Sign up to set email alerts
|

A VLSI chip implementation of an A/D converter error table compensator

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2009
2009
2009
2009

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…This property can be used to reduce the hardware for the CRBBE circuit so that only one selector logic of each distinct signed multiple magnitude needs to be generated. The positive-negative-complement encoded RB partial product corresponding to the dipole, is denoted by as (8) where , and the subscripts and are the indexes of the multiplier and the multiplicand bits, respectively.…”
Section: A Radix-4 Covalent Redundant Binary Booth Encoding (Crbbe-2)mentioning
confidence: 99%
See 2 more Smart Citations
“…This property can be used to reduce the hardware for the CRBBE circuit so that only one selector logic of each distinct signed multiple magnitude needs to be generated. The positive-negative-complement encoded RB partial product corresponding to the dipole, is denoted by as (8) where , and the subscripts and are the indexes of the multiplier and the multiplicand bits, respectively.…”
Section: A Radix-4 Covalent Redundant Binary Booth Encoding (Crbbe-2)mentioning
confidence: 99%
“…T HE digital multiplier is a ubiquitous arithmetic unit in microprocessors, digital signal processors, and emerging media processors [1]- [4]. It is also a kernel operator in application-specific data path of video and audio codecs, digital filters, computer graphics, and embedded systems [5]- [8]. Compared with many other arithmetic operations, multiplication is time-consuming and power hungry.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The additional delay required to add an extra partial product row critically slows down short operand length multiplier due to the relatively fewer number of adder stages in its partial product summing tree. This is the case especially for the power-of-two operand lengths, which are the most commonly encountered word lengths for application-specific data paths and general computing benchmarks [37,38,[71][72][73][74]. Therefore, new RB multiplier architecture with BEPPGs that eradicates the overhead of negation, especially for powerof-two operand lengths, is another perspective that has not been delved into adequately.…”
mentioning
confidence: 99%