Digital filter synthesis based on an algorithm to generate all minimal signed digit representations

In this paper, the authors propose an algorithm to find all the minimal signed digit (MSD) representations of a constant and present an algorithm to synthesize digital filters based on the MSD representation. The hardware complexity of a digital signal processing system is dependent on the number system used for the implementation. Although the canonical signed digit (CSD) representation is widely employed, as it is unique and guarantees the minimal number of nonzero digits for a constant, the MSD representation provides multiple representations that have the same number of nonzero digits as the CSD representation. The proposed filter synthesis algorithm utilizes this redundancy of the MSD representation to make common subexpressions, as many as possible, leading to smaller filters. By applying the proposed algorithm to the hardware synthesis of finite impulse response filters, the authors obtained multiplier blocks that are 7% smaller than those generated from the CSD representation.

[1]  Chein-Wei Jen,et al.  A simple processor core design for DCT/IDCT , 2000, IEEE Trans. Circuits Syst. Video Technol..

[2]  김준태,et al.  Design and implementation of computationally efficient FIR filters, and scalable VLSI architectures for discrete wavelet transform = 연산이 효율적인 유한응답 여파기의 설계와 구현 및 이산 웨이브릿 변환의 가변 VLSI 구조에 관한 연구 , 1998 .

[3]  Israel Koren.  Computer arithmetic algorithms , 1993 .

[4]  G. Venkatesh,et al.  Synthesis of multiplier-less FIR filters with minimum number of additions , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[5]  Bede Liu,et al.  Decomposition of binary integers into signed power-of-two terms , 1991 .

[6]  Miodrag Potkonjak,et al.  Efficient Substitution of Multiple Constant Multiplications by Shifts and Additions Using Iterative Pairwise Matching , 1994, 31st Design Automation Conference.

[7]  R. Hashemian.  A new method for conversion of a 2's complement to canonic signed digit number system and its representation , 1996, Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers.

[8]  A. Dempster,et al.  Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .

[9]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[10]  David Bull,et al.  Primitive operator digital filters , 1991 .

[11]  Patrick Schaumont,et al.  A new algorithm for elimination of common subexpressions , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Yong Ching Lim,et al.  A polynomial-time algorithm for designing digital filters with power-of-two coefficients , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[13]  R. Hartley.  Subexpression sharing in filters using canonic signed digit multipliers , 1996 .

[14]  George W. Reitwiesner,et al.  Binary Arithmetic , 1960, Adv. Comput..

[15]  H. Samueli,et al.  An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficients , 1989 .

[16]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .