The Transactions of The Korean Institute of Electrical Engineers (전기학회논문지)

The Korean Institute of Electrical Engineers (대한전기학회)
권호 표지
DOI QR코드

DOI QR Code

Time-Multiplexed FIR Filter Design Using Group CSD(GCSD) Multipliers

Group CSD(GCSD) 곱셈기를 이용한 Time-Multiplexed FIR 필터 설계

  • 전창하 (전북대 전기전자컴퓨터공학부) ;
  • 서동현 (전북대 전기전자컴퓨터공학부) ;
  • 정진균 (전북대 전기전자컴퓨터공학부) ;
  • 김용은 (자동차부품연구소) ;
  • 이철동 (전북임베디드시스템연구센터)
  • Published : 2010.02.01
Download PDF
⟨ Previous Next ⟩

Abstract

Multiplication is a fundamental arithmetic operation in many digital signal processing (DSP) and communication algorithms. The group CSD (GCSD) multiplier was recently proposed based on the variation of canonical signed digit (CSD) encoding and partial product sharing. This multiplier provides an efficient design when the multiplications are performed only with a few predetermined coefficients (e.g., FFT). In this paper, it is shown that, by exploiting the characteristics of the filter coefficients, GCSD multipliers can be used for the efficient implementation of time-multiplexed FIR filters.

Keywords

References

  1. MacSorley, "High speed arithmetic in binary computers", Proc. IRE, vol. 49, pp. 67-91, 1961.
  2. Y. E. Kim, S. H. Cho and J. G. Chung, "Modified CSD group multiplier design for predetermined coefficient groups", in Proc. IEEE ISCAS 2008, pp. 3362-3365, May, 2008.
  3. Y. E. Kim, K. J. Cho, J. G. Chung and X. Huang "CSD-based programmable multiplier design for predetermined coefficient groups", IEICE Trans. (to appear).
  4. Y. E. Kim, K. J. Cho and J. G. Chung "Low power small area modified Booth multiplier design for predetermined coefficients", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E90-A, pp. 694-697, Mar. 2007. https://doi.org/10.1093/ietfec/e90-a.3.694
  5. S. W. Reitwiesner, "Binary arithmetic," Advances in Computers, pp. 231-308, 1966.
  6. 변산호, 류성영, 최영길, 노형동, 남현석, 노정진, "시그마-델타 A/D 컨버터용 디지털 데시메이션 필터 설계", 대한전자공학회 논문지, pp. 34-45, 2007.