Some optimizations of hardware multiplication by constant matrices

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2003, Pages 20-27

  Boullis, Nicolas ^a   Tisserand, Arnaud ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISCRETE FOURIER TRANSFORMS; FIELD PROGRAMMABLE GATE ARRAYS; FIR FILTERS; SIGNAL PROCESSING; SIMULATED ANNEALING;

CONSTANT MATRIX MULTIPLICATION (CMM);

MATRIX ALGEBRA;

EID: 0043136418     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. R. Bernstein. Multiplication by integer constants. Software - Practice and Experience, 16(7):641-652, July 1986.
2. P. Boonyanant and S. Tantaratana. FIR filters with punctured radix-8 symmetric coefficients: Design and multiplier-free realizations. Circuits Systems Signal Processing, 21(4):345-367, 2002.
3. A. D. Booth. A signed binary multiplication technique. Quart. J. Mech. App. Math., IV(2):236-240, 1951.
4. P. Briggs and T. Harvey. Multiplication by integer constants. Technical report, Rice University, 1994.
5. K. D. Chapman. Fast integer multipliers fit in FPGAs. EDN Magazine, May 1994.
6. V. S. Dimitrov, G. A. Jullien, and W. C. Miller. Theory and applications of the double-base number system. IEEE Transactions on Computers, 48(12):1098-1106, 1999.
7. R. I. Hartley. Subexpression sharing in filters using canonic signed digit multipliers. IEEE Transactions on Circuits and Systems - II: Analog and Digital Signal Processing, 43(10):677-688, Oct. 1996.
8. N. Homma, T. Aoki, and T. Higuchi. Evolutionary graph generation system with transmigration capability and its application to arithmetic circuit synthesis. IEE Proceedings, 149(2):97-104, Apr. 2002.
9. H.-J. Kang and I.-C. Park. FIR filter synthesis algorithms for minimizing the delay and the number of adders. IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, 48(8):770-777, Aug. 2001.
10. V. Lefèvre. Multiplication par une constante. Réseaux et Systèmes Répartis, Calculateurs Parallèles, 13(4-5):465-484, 2001.
11. D. J. Magenheimer, L. Peters, K. W. Pettis, and D. Zuras. Integer multiplication and division on the HP precision architecture. IEEE Transactions on Computers, 37(8):980-990, Aug. 1988.
12. M. Martínez-Peiró, E. I. Boemo, and L. Wanhammar. Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm. IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, 49(3):196-203, Mar. 2002.
13. A. Matsuura, M. Yukishita, and A. Nagoya. A hierarchical clustering method for the multiple constant multiplication problem. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E80-A(10):1767-1773, Oct. 1997.
14. M. F. Mellal and J.-M. Delosme. Multiplier optimization for small sets of coefficients. In International Workshop Logic and Architecture Synthesis, pages 13-22, Grenoble, France, Dec. 1997.
15. H. T. Nguyen and A. Chatterjee. Number-splitting with shift-and-add decomposition for power and hardware optimization in linear DSP synthesis. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 8(4):419-424, Aug. 2000.
16. R. Paško, P. Schaumont, V. Derudder, S. Vernalde, and D. Ďuračková. A new algorithm for elimination of common subexpressions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18(1):58-68, Jan. 1999.
17. M. Potkonjak, M. B. Srivastava, and 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, 15(2):151-165, Feb. 1996.
18. H. Samueli. An improved search algorithm for the design of multiplierless FIR filters with power-of-two coefficients. IEEE Transactions on Circuits and Systems, 36(7): 1044-1047, July 1989.
19. S. Yu and E. E. Swartzlander. DCT implementation with distributed arithmetic. IEEE Transactions on Computers, 50(9):985-991, Sept. 2001.