MRPF: An Architectural Transformation for Synthesis of High-Performance and Low-Power Digital Filters

作者: Kaushik Roy , Khurram Muhammad , Hunsoo Choo

DOI: 10.5555/789083.1022807

关键词: ComputationAdderParallel computingComputational complexity theorySet cover problemGraphGraph theoryDigital filterAlgorithmComputer science

摘要: We present a graph theoretical methodology that reduces the implementation complexity of vector multiplied by scalar The proposed approach is called MRP (minimally redundant parallel) optimization and presented in FIR filtering framework to obtain low-complexity multiplierless implementation. key idea expand design space using shift inclusive differential coefficients together with computation reordering theoretic maximal sharing. transformed architecture filter obtained solving set cover problem graph. A simple algorithm based on greedy presented. merged common sub-expression elimination. simulation results show 70% 16% improvement terms computational over (transposed direct form) sub-expression, respectively, when carry, lookahead adder synthesized from Synopsys designware library 0.25 /spl mu/m technology.

参考文章(10)
Kaushik Roy, Khurram Muhammad, Algorithmic and architectural techniques for low-power digital signal processing Purdue University. ,(1999)
K. Muhammad, K. Roy, Minimally redundant parallel implementation of digital filters and vector scaling international conference on acoustics, speech, and signal processing. ,vol. 6, pp. 3295- 3298 ,(2000) , 10.1109/ICASSP.2000.860104
Hunsoo Choo, K. Muhammad, K. Roy, Decision feedback equalizer with two's complement computation sharing multiplication international conference on acoustics, speech, and signal processing. ,vol. 2, pp. 1245- 1248 ,(2001) , 10.1109/ICASSP.2001.941150
H. Samueli, An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficients IEEE Transactions on Circuits and Systems. ,vol. 36, pp. 1044- 1047 ,(1989) , 10.1109/31.31347
M. Potkonjak, M.B. Srivastava, A.P. Chandrakasan, Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 15, pp. 151- 165 ,(1996) , 10.1109/43.486662
K. Muhammad, K. Roy, A graph theoretic approach for synthesizing very low-complexity high-speed digital filters IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 21, pp. 204- 216 ,(2002) , 10.1109/43.980259
S. Ramprasad, N.R. Shanbhag, I.N. Hajj, Decorrelating (DECOR) transformations for low-power digital filters IEEE Transactions on Circuits and Systems Ii: Analog and Digital Signal Processing. ,vol. 46, pp. 776- 788 ,(1999) , 10.1109/82.769785
Richard I Hartley, None, Subexpression sharing in filters using canonic signed digit multipliers IEEE Transactions on Circuits and Systems Ii: Analog and Digital Signal Processing. ,vol. 43, pp. 677- 688 ,(1996) , 10.1109/82.539000
In-Cheol Park, Hyeong-Ju Kang, Digital filter synthesis based on minimal signed digit representation Proceedings of the 38th conference on Design automation - DAC '01. pp. 468- 473 ,(2001) , 10.1145/378239.378564