On automatic derivation of fast Hadamard transform using genetic programming

Automatic generation of fast Hadamard transform (FHT) algorithms through genetic programming is studied. The design of FHT algorithms is viewed as a search in the space of linear algorithms employing restricted types of coefficients. A generic circuit that can realize all algorithms belonging to this space is proposed. The goal is to automatically find an algorithm that can perform Hadamard transform properly using a specified number of multiply/add operations. It is shown that genetic programming is able to discover a 4-point FHT that requires only 7 multiply/add operations.

[1]  H. Larsen.  An algorithm to compute the sequency ordered Walsh transform , 1976 .

[2]  R. Yarlagadda,et al.  Hadamard matrix analysis and synthesis: with applications to communications and signal/image processing , 1996 .

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Moon Ho Lee,et al.  Fast Hadamard transform based on a simple matrix factorization , 1986, IEEE Trans. Acoust. Speech Signal Process..

[5]  Jacques Morgenstern,et al.  Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform , 1973, JACM.

[6]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[7]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[8]  Ralph R. Martin,et al.  Complexity Reduction Using Expansive Coding , 1994, Evolutionary Computing, AISB Workshop.

[9]  Michael J. Corinthios,et al.  Natural, Dyadic, and Sequency Order Algorithms and Processors for the Walsh-Hadamard Transform , 1977, IEEE Transactions on Computers.

[10]  Jacques Morgenstern,et al.  The Linear Complexity of Computation , 1975, JACM.

[11]  Ephraim Feig,et al.  Hadamard transforms on multiply/add architectures , 1994, IEEE Trans. Signal Process..

[12]  Ralph R. Martin,et al.  A Truncation Method for Computing Walsh Transforms with Applications to Image Processing , 1993, CVGIP Graph. Model. Image Process..

[13]  R. D. Brown.  A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms , 1977, IEEE Transactions on Computers.

[14]  A. Street,et al.  Combinatorics: room squares, sum-free sets, Hadamard matrices , 1972 .