A fast selector-based subtract-multiplication unit and its application to Radix-2 butterfly unit

Large-scale network and multimedia application LSIs include application specific arithmetic units. A multiply-accumulator unit (MAC unit) which is one of these optimized units arranges partial products and decreases carry propagations. However, there is no method similar to MAC to execute “subtract-multiplication”. In this paper, we propose a high-speed subtract-multiplication unit that decreases latency of a subtract operation by bit-level transformation using selector logics. By using bit-level transformation, its partial products are calculated directly. The proposed subtract-multiplication units can be applied to even any types of systems using subtract-multiplications and a butterfly operation in FFT is one of their suitable applications. Experimental results show that our proposed arithmetic units using selector logics improves the performance by 13.92%, compared to a conventional approach.

[1]  Gary Wayne Bewick.  Fast Multiplication: Algorithms and Implementations , 1994 .

[2]  Sau-Gee Chen,et al.  Design of an efficient variable-length FFT processor , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[3]  P. H. Ang,et al.  Generation of high speed CMOS multiplier-accumulators , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[4]  A. Saidi.  Generalized FFT algorithm , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[5]  Chin-Long Wey,et al.  Efficient Memory-Based FFT Architectures for Digital Video Broadcasting (DVB-T/H) , 2007, 2007 International Symposium on VLSI Design, Automation and Test (VLSI-DAT).

[6]  Pei-Yun Tsai,et al.  Low-power variable-length fast Fourier transform processor , 2005 .

[7]  Chin-Long Wey,et al.  Efficient VLSI Implementation of Memory-Based FFT Processors for DVB-T Applications , 2007, IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07).