Automatic derivation and implementation of fast convolution algorithms

Journal of Symbolic Computation

Volumn 37, Issue 2, 2004, Pages 261-293

  Johnson, Jeremy R ^a   Breitzman, Anthony F ^a  

^a Drexel University   (United States)

Author keywords

Convolution algorithms; Cyclic convolution

Indexed keywords

EID: 1942477516     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2002.06.001     Document Type: Article

References (26)

1. Agarwal, R.C., Cooley, J.W., 1977. New algorithms for digital convolution. IEEE Trans. Acoust. Speech Signal Proc. 25, 392-410.
2. Auslander, L., Johnson, J., Johnson, R., 1996. Automatic implementation of fft algorithms. Technical Report DU-MCS-96-01, Drexel University.
3. Blahut, R.E., 1992. Algebraic Methods for Signal Processing and Communications Coding. Springer-Verlag, New York.
4. Breitzman, A., Johnson, J.R., 2002. A package for generating, manipulating, and testing convolution algorithms. Technical Report DU-MCS-00-02, Department of Mathematics and Computer Science, Drexel University.
5. Burrus, C.S., Eschenbacher, P.W., 1981. An in-place, in-order prime factor FFT algorithm. IEEE Trans. Acoust. Speech, Signal Processing ASSP-29 (4), 806-817.
6. Burrus, C., Parks, T., 1985. DFT/FFT and Convolution Algorithms: Theory and Implementation. John Wiley and Sons, New York, NY, USA.
7. Char, B.W., Geddes, K.O., Gonnet, G.H., Leong, B.L,, Monagan, M.B., Watt, S.M., 1991. Maple V Language Reference Manual, Springer-Verlag, New York.
8. Cook, S.A., 1966. Thesis: On the minimum computation time of functions. Harvard Thesis.
9. Cooley, J.W., 1989. Automated generation of optimized convolution algorithms. In: Chudnovsky, D.V., Jenks, R.D. (Eds.), Computer Algebra. Lecture Notes in Pure and Applied Mathematics. Marcel Dekker, Inc., New York and Basel.
10. Horn, R.A., Johnson, C.R., 1991. Topics in Matrix Analysis. Cambridge University Press, Cambridge.
11. Johnson, R.W., Huang, C.-H., Johnson, J.R., 1991. Multilinear algebra and parallel programming. J. Supercomput. 5, 189-218.
12. Johnson, J.R., Johnson, R.W., Rodriguez, D., Tolimieri, R., 1990. A methodology for designing, modifying and implementing fourier transform algorithms on various architectures. Circuits Syst. Signal Proc. 9 (4), 449-500.
13. Knuth, D.E., 1981. Seminumerical Algorithms - The Art of Computer Programming, second ed., vol. 2. Addison-Wesley, Reading, MA.
14. Lang, S., 1984. Algebra. Addison-Wesley, Redwood City, CA.
15. Lauer, M., 1982. Computing by homomorphic images. In: Buchberger, B., Collins, G.E., Loos, R. (Eds.), Computer Algebra: Symbolic and Algebraic Computation, second ed. Springer-Verlag, Wien, pp. 139-168.
16. Moura, J.M.F., Johnson, J., Johnson, R.W., Padua, D., Prasanna, V., Püschel, M., Veloso, M.M., 1998. SPIRAL: portable library of optimized signal processing algorithms. Available from http://www.spiral.net.
17. Nussbaumer, H.J., 1982. Fast Fourier Transform and Convolutional Algorithms, second ed. Springer-Verlag, New York.
18. Rader, C.M., 1968. Discrete Fourier transform when the number of data samples is prime. Proc. IEEE 56 (6), 1107-1108.
19. Selesnick, I., Burrus, C., 1996. Automatic generation of prime length fft programs. IEEE Trans. Signal Proc. 44, 14-24.
20. Temperton, C., 1985. Implementation of a self-sorting in-place prime factor FFT algorithm. J. Comput. Phys. 58, 283-299.
21. Tolimieri, R., An, M., Lu, C., 1997. Algorithms for Discrete Fourier Transform and Convolution. Springer-Verlag, New York, NY.
22. Toom, A.L., 1963. Soviet Mathematics 3, 714-716.
23. VanLoan, C., 1992. Computational Frameworks for the Fast Fourier Transform. Society for Industrial and Applied Mathematics, Philadelphia, PA.
24. Winograd, S., 1977. Some bilinear forms whose multiplicative complexity depends on the field of constants, Math. Syst. Theor. 10, 169-180.
25. Winograd, S., 1980. Arithmetic Complexity of Computations, CBMS-NSF Regional Conf. Ser. Appl. Math. Society for Industrial and Applied Mathematics, Philadelphia, PA.
26. Xiong, J., Johnson, J., Johnson, R., Padua, D., 2001. SPL: A Language and Compiler for DSP Algorithms. In: Proc. PLDI, pp. 298-308.