Browse > Article

Modified CSD Group Multiplier Design for Predetermined Coefficient Groups  

Kim, Yong-Eun (Div. of Electronic & Information Engineering Chonbuk University)
Xu, Yi-Nan (Div. of Electronic & Information Engineering Chonbuk University)
Chung, Jin-Gyun (Div. of Electronic & Information Engineering Chonbuk University)
Publication Information
Abstract
Some digital signal processing applications, such as FFT, request multiplications with a group(or, groups) of a few predetermined coefficients. In this paper, based on the modified CSD algorithm, an efficient multiplier design method for predetermined coefficient groups is proposed. In the multiplier design for sine-cosine generator used in direct digital frequency synthesizer(DDFS), and in the multiplier design used in 128 point $radix-2^4$ FFT, it is shown that the area, power and delay time can be reduced up to 34%.
Keywords
Group Multiplier; Modified CSD; FFT; DDFS;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 O. L. MacSorley, 'High speed arithmetic in binary computers', Proc. IRE, vol. 49, pp. 67-91, 1961   DOI   ScienceOn
2 S. W. Reitwiesner, 'Binary arithmetic,' Advances in Computers, pp. 231 - 308, 1966
3 Y. E Kim, K. J Cho, J. G. Chung 'Low power small area modified Booth multiplier design for predetermined coefficients' IEICE Trans. vol. E90-A, pp. 694-697 Mar. 2007   DOI   ScienceOn
4 De Caro. D and Strollo, A. G. M. 'High-performance direct digital frequency sysnthesizers using piecewise-polynomial approximation', IEEE Trans. vol. 52, no. 2, pp. 324-337, Feb. 2005
5 J. Y. Oh and M. S. Lim, 'New radix-2 to the 4th power pipeline FFT processor,' IEICE Trans. vol. E88-C, no. 8, pp, 1740-1746, Aug. 2005
6 이은실, 김정범 '전류모드 CMOS 다치 논리회로를 이용한 $32{\times}32-bit$ Modified Booth 곱셈기 설계' 전자공학회논문지 제40권 SD편 제12호, pp. 72-79 2003.12