Cyclotomic FFTs with reduced additive complexities based on a novel common subexpression elimination algorithm

IEEE Transactions on Signal Processing

Volumn 57, Issue 3, 2009, Pages 1010-1020

  Chen, Ning ^a   Yan, Zhiyuan ^a  

^a Lehigh University   (United States)

Author keywords

Common subexpression elimination (CSE); Complexity theory; Convolution; Discrete Fourier transforms (DFTs); Galois fields; Multiple constant multiplication (MCM); Reed Solomon codes

Indexed keywords

ALGORITHMS; BLOCK CODES; COMPUTATIONAL COMPLEXITY; CONVOLUTION; DECODING; MATHEMATICAL TRANSFORMATIONS; REED-SOLOMON CODES;

COMMON SUBEXPRESSION ELIMINATION (CSE); COMMON SUBEXPRESSION ELIMINATION ALGORITHMS; COMPLEXITY REDUCTIONS; COMPLEXITY THEORY; GALOIS FIELDS; MATRIX-VECTOR MULTIPLICATIONS; MULTIPLE CONSTANT MULTIPLICATION (MCM); SUB-EXPRESSIONS; WEIGHTED SUMS;

DISCRETE FOURIER TRANSFORMS;

EID: 61549093976     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2008.2009891     Document Type: Article

References (37)

1. R. E. Blahut, "Transform techniques for error control codes," IBM J. Res. Develop., vol. 23, no. 3, pp. 299-315, May 1979.
2. rm) for 8 ≤ ℳ ≤ 10," Inf. Sci., vol. 176, no. 1, pp. 1-26, Jan. 2006.
3. rm) for 8 ≤ ℳ ≤ 10," IEEE Trans. Commun., vol. 54, no. 2, pp. 181-186, Feb. 2006.
4. T.-C. Lin, T. K. Truong, and P. D. Chen, "A fast algorithm for the syndrome calculation in algebraic decoding of Reed-Solomon codes," IEEE Trans. Commun., vol. 55, no. 12, pp. 1-5, Dec. 2007.
5. T. G. Zakharova, "Fourier transform evaluation in fields of characteristic 2," Probl. Inf. Transm., vol. 28, no. 2, pp. 154-167, 1992.
6. P. V. Trifonov and S. V. Fedorenko, "A method for fast computation fo the Fourier transform over a finite field," Probl. Inf. Transm. vol. 39, no. 3, pp. 231-238, 2003 Online. Available: http://dcn.infos.ru/~petert/papers/fftEng.pdf
7. E. Costa, S. V. Fedorenko, and P. V. Trifonov, "On computing the syndrome polynomial in Reed-Solomon decoder," Eur. Trans. Telecomm. vol. 15, no. 4, pp. 337-342, 2004 Online. Available: http://dcn.infos.ru/~petert/papers/syndromes_ett.pdf
8. S. V. Fedorenko, "A method of computation of the discrete Fourier transform over a finite field," Probl. Inf. Transm., vol. 42, no. 2, pp. 139-151, 2006.
9. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, ser. Books in the Mathematical Sciences. San Francisco, CA: W. H. Freeman, 1979.
10. P. Cappello and K. Steiglitz, "Some complexity issues in digital signal processing," IEEE Trans. Acoust., Speech, Signal Process., vol. 32, no. 5, pp. 1037-1041, Oct. 1984.
11. R. A. Horn and C. R. Johnson, Matrix Analysis. New York: Cambridge Univ. Press, 1985.
12. S. Winograd, "Some bilinear forms whose multiplicative complexity depends on the field of constants," Math. Syst. Theory, vol. 10, no. 1, pp. 169-180, 1977.
13. M. D. Wagh and S. D. Morgera, "A new structured design method for convolutions over finite fields, Part I," IEEE Trans. Inf. Theory vol. 29, no. 4, pp. 583-595, Jul. 1983.
14. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
15. R. E. Blahut, Fast Algorithms for Digital Signal Processing. Reading, MA: Addison-Wesley, 1984.
16. P. Trifonov, private communication.
17. P. Trifonov, "Matrix-vector multiplication via erasure decoding," in Proc. XI Int. Symp. Problems of Redundancy in Information and Control Systems, Saint Petersburg, Russia, Jul. 2007, pp. 104-108 [Online]. Available: http://dcn.infos.ru/~petert/ papers/mo.pdf
18. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
19. M. Potkonjak, M. B. Srivastava, and A. P. Chandrakasan, "Multiple constant multiplications: Efficient and versatile framework and algorithms for exploring common subexpression elimination," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 15, no. 2, pp. 151-165, Feb. 1996.
20. R. Paško, P. Schaumont, V. Derudder, S. Vernalde, and D. Ďuračková, "A new algorithm for elimination of common subexpressions," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 18, no. 1, pp. 58-68, Jan. 1999.
21. R. I. Hartley, "Subexpression sharing in filters using canonic signed digit multipliers," IEEE Trans. Circuits Syst. II, vol. 43, no. 10, pp. 677-688, Oct. 1996.
22. M. Martínez-Peiró, E. I. Boemo, and L. Wanhammar, "Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm," IEEE Trans. Circuits Syst. II, vol. 49, no. 3, pp. 196-203, Mar. 2002.
23. R. Mahesh and A. P. Vinod, "A new common subexpression elimination algorithm for realizing low-complexity higher order digital filters," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 27, no. 2, pp. 217-229, Feb. 2008.
24. A. G. Dempster and M. D. Macleod, "Use of minimum-adder multiplier blocks in FIR digital filters," IEEE Trans. Circuits Syst. II, vol. 42, no. 9, pp. 569-577, Sep. 1995.
25. C.-H. Chang, J. Chen, and A. P. Vinod, "Information theoretic approach to complexity reduction of FIR filter design," IEEE Trans. Circuits Syst. I, to be published.
26. X. Zhang and K. K. Parhi, "Implementation approaches for the Advanced Encryption Standard algorithm," IEEE Circuits Syst. Mag., vol. 2, no. 4, pp. 24-46, 2002.
27. M. D. Macleod and A. G. Dempster, "Common subexpression elimination algorithm for low-cost multiplierless implementation of matrix multipliers," Electron. Lett., vol. 40, no. 11, pp. 651-652, May 2004.
28. O. Gustafsson and M. Olofsson, "Complexity reduction of constant matrix computations over the binary field," in Proc. Int. Workshop Arithmetic Finite Fields (WAIFI'07), Madrid, Spain, Jun. 2007, vol. 4547, Lecture Notes in Computer Science, pp. 103-115.
29. D. P. Bertsekas, Dynamic Programming and Optimal Control. Belmont, MA: Athena Scientific, 1995.
30. rm)," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 271-274, Jan. 1993.
31. R. Agarwal and J. Cooley, "New algorithms for digital convolution," IEEE Trans. Acoust., Speech, Signal Process., vol. 25, no. 5, pp. 392-410, Oct. 1977.
32. S. B. Wicker, Error Control Systems for Digital Communications and Storage. Upper Saddle River, NJ: Prentice-Hall, 1995.
33. Y. Wang and X. Zhu, "A fast algorithm for the Fourier transform over finite fields and its VLSI implementation," IEEE J. Sel. Areas Commun., vol. 6, no. 3, pp. 572-577, Apr. 1988.
34. Reed-Solomon Codes and Their Applications, S. B. Wicker and V. K. Bhargava, Eds. New York: IEEE, 1994.
35. E. O. Brigham, The Fast Fourier Transform and Its Applications. Englewood, NJ: Prentice-Hall, 1988.
36. B. Sunar and Č. K. Koč, "Mastrovito multiplier for all trinomials," IEEE Trans. Comput., vol. 48, no. 5, pp. 522-527, May 1999.
37. rm) with cryptographic significance," IEE Proc.-Commun., vol. 152, no. 6, pp. 965-974, Dec. 2005.