Comments on 'A 70 MHz Multiplierless FIR Hilbert Transformer in 0.35  m Standard CMOS Library'

Gustafsson, Oscar

doi:10.1093/ietfec/e91-a.3.899

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Minimization Of Logic Depth1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

2017

Publication Types

Select...

Other3

Book1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3. The mapping between CPAs and CSAs is not consistent (Gustafsson, 2008). Hence, there is a need to solve the CSA constant multiplications using specialized algorithms.…”

Section: Introductionmentioning

confidence: 99%

Low-Complexity and High-Speed Constant Multiplications for Digital Filters Using Carry-Save Arithmetic

Gustafsson¹,

Wanhammar²

2011

Digital Filters

View full text Add to dashboard Cite

“…3. The mapping between CPAs and CSAs is not consistent (Gustafsson, 2008). Hence, there is a need to solve the CSA constant multiplications using specialized algorithms.…”

Section: Introductionmentioning

confidence: 99%

Low-Complexity and High-Speed Constant Multiplications for Digital Filters Using Carry-Save Arithmetic

Gustafsson¹,

Wanhammar²

2011

Digital Filters

View full text Add to dashboard Cite

“…Otherwise, two sets of registers are required to store the sum and carry vectors for the transposed direct form filter before they are accumulated to the sum and carry vectors of the next coefficient multiplier in the tap-delay line. More discussion on the use of CPA and CSA can be found in [78].…”

Section: Minimization Of Logic Depthmentioning

confidence: 99%

Design methodologies for complexity reduction of FIR filters

Faust¹

View full text Add to dashboard Cite

SA block optimization are also proposed. By making use of the existing registers in the tapdelay line of SA block, only a small percentage of additional registers need to be introduced to allows for pipelining. A new method has also be introduced to gradually reduce the bit width of the operators in the SA block towards the output with a very small sacrifice of the output precision. Finally, very high-speed circuit architectures for the conversions from Binary to Canonical Signed Digit (CSD) and from CSD to Binary representations are proposed. These components can be used to speed up and simplify the implementation of adaptive filters.

show abstract