Low Power Small Area Modified Booth Multiplier Design for Predetermined Coefficients

Kim, Yong-Eun; Cho, Kyung-Ju; Chung, Jin-Gyun

doi:10.1093/ietfec/e90-a.3.694

Cited by 14 publications

(24 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The kernel achieves a precision of 22.69 correct bits by using 10 adders, as shown in Table VII. 3) Comparison: Figures 13 and 14 compare the proposed rotators from Table VII with other multiplierless rotators for W 16 and W 32 in the literature. The previous approaches include rotators based on MCM [5] 1 , Booth encoding [25], trigonometric identities [7], [24], base-3 rotators [27], MSR-CORDIC [23] 2 and non-redundant CORDIC [13]. The number of adders in the figures are for rotations in the range [0, π/4].…”

Section: Mcr With Uniform Scalingmentioning

confidence: 99%

“…Among them, the proposed approach achieves less error and requires less adders 1 For the results presented here, the algorithm in [33] is used, which generally gives fewer adders compared to the algorithm used originally [5]. 2 [5] R. Booth [25] Trig. Id.…”

Section: Mcr With Uniform Scalingmentioning

confidence: 99%

“…CORDIC-based approaches for constant rotators [18]- [23] are based on selecting stages of the conventional CORDIC [18]- [20] or increasing the amount of micro-rotation angles [21]- [23]. Multiplier-based approaches for constant rotators [4]- [7], [24]- [27] base on techniques to optimize realvalued constant multiplications [4]- [6], trigonometric identities [7], [24], optimization of the coefficient encoding [25], [26], and angle generation by a base-3 system [27].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI)

Garrido

Qureshi

Gustafsson

2014

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

Abstract-This paper presents a new approach to design multiplierless constant rotators. The approach is based on a combined coefficient selection and shift-and-add implementation (CCSSI) for the design of the rotators. First, complete freedom is given to the selection of the coefficients, i.e., no constraints to the coefficients are set in advance and all the alternatives are taken into account. Second, the shift-and-add implementation uses advanced single constant multiplication (SCM) and multiple constant multiplication (MCM) techniques that lead to lowcomplexity multiplierless implementations. Third, the design of the rotators is done by a joint optimization of the coefficient selection and shift-and-add implementation. As a result, the CCSSI provides an extended design space that offers a larger number of alternatives with respect to previous works. Furthermore, the design space is explored in a simple and efficient way.The proposed approach has wide applications in numerous hardware scenarios. This includes rotations by single or multiple angles, rotators in single or multiple branches, and different scaling of the outputs.Experimental results for various scenarios are provided. In all of them, the proposed approach achieves significant improvements with respect to state of the art.

show abstract

Section: Mcr With Uniform Scalingmentioning

confidence: 99%

Section: Mcr With Uniform Scalingmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI)

Garrido

Qureshi

Gustafsson

2014

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

show abstract

“…Figure 4 compares different rotators for W 32 . The proposed architecture is shown to be more efficient than the Boothlike design [11], the CORDIC and the trigonometric identity solution [10]. Only the errors in the W 32 angles are considered in this case.…”

Section: Comparisonmentioning

confidence: 99%

“…They implemented only a few constants, and then derive the rest of them to those, by using, e.g., sin(π/8) = 2 cos(π/16) sin(π/16). In [11], a reduced Booth-like multipliers is presented. It is based on the observation that when the set of coefficients is known, it is enough to design the accumulation tree for the maximum number of actual partial products.…”

Section: Introductionmentioning

confidence: 99%

Low-complexity rotators for the FFT using base-3 signed stages

Källström

Garrido

Gustafsson

2012

2012 IEEE Asia Pacific Conference on Circuits and Systems

View full text Add to dashboard Cite

Abstract-Rotations by angles that are fractions of the unit circle find applications in e.g. fast Fourier transform (FFT) architectures. In this work we propose a new rotator that consists of a series of stages. Each stage calculates a micro-rotation by an angle corresponding to a power-of-three fractional parts. Using a continuous powers-of-three range, it is possible to carry out all rotations required. In addition, the proposed rotators are compared to previous approaches, based of shift-and-add algorithms, showing improvements in accuracy and number of adders.

show abstract

Analysis of twiddle factor memory complexity of radix-2<sup>i</sup> pipelined FFTs

Qureshi

Gustafsson

2009

2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

Low Power Small Area Modified Booth Multiplier Design for Predetermined Coefficients

Cited by 14 publications

References 0 publications

Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI)

Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI)

Low-complexity rotators for the FFT using base-3 signed stages

Analysis of twiddle factor memory complexity of radix-2<sup>i</sup> pipelined FFTs

Contact Info

Product

Resources

About