An Optimized Modified Booth Recoder for Efficient Design of the Add Multiply Operator
Keywords:
Add-Multiply operation, arithmetic circuits, Modiï¬Âed Booth recoding, VLSI designAbstract
Complex arithmetic operations are widely used in Digital Signal Processing(DSP) applications. In this work, we focus on optimizing the design of the fused Add-Multiply (FAM) operator for increasing performance. We investigate techniques to implement the direct recoding of the sum of two numbers in its Modiï¬ed Booth (MB) form. We introduce a structured and efï¬cient recoding technique and explore three different schemes by incorporating them in FAM designs. Comparing them with the FAM designs which use existing recoding schemes, the proposed technique yields considerable reductions in terms of critical delay, hardware complexity and power consumption of the FAM unit.
References
- A. Amaricai, M. Vladutiu, and O. Boncalo, "Design issues and implementations for ?oating-point divide-add fused," IEEE Trans. Circuits Syst. II–Exp. Briefs, vol. 57, no. 4, pp. 295–299, Apr. 2010.
- E. E. Swartzlander and H. H. M. Saleh, "FFT implementation with fused ?oating-point operations," IEEE Trans. Comput.,vol.61,no.2, pp. 284–288, Feb. 2012.
- J.J.F.Cavanagh, Digital Computer Arithmetic. New York: McGrawHill, 1984.
- S. Nikolaidis, E. Karaolis, and E. D. Kyriakis-Bitzaros, "Estimation of signal transition activity in FIR ?lters implemented by a MAC architecture," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 19, no. 1, pp. 164–169, Jan. 2000.
- O. Kwon, K. Nowka, and E. E. Swartzlander, "A 16-bit by 16-bit MAC design using fast 5: 3 compressor cells," J. VLSI Signal Process. Syst., vol. 31, no. 2, pp. 77–89, Jun. 2002.
- L.-H. Chen, O. T.-C. Chen, T.-Y. Wang, and Y.-C. Ma, "A multiplication-accumulation computation unit with optimized compressors and minimized switching activities," in Proc. IEEE Int, Symp. Circuits and Syst., Kobe, Japan, 2005, vol. 6, pp. 6118–6121.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRST

This work is licensed under a Creative Commons Attribution 4.0 International License.