论文信息 - An Algorithm for Sequency Ordering of Hadamard Functions - 字舞流文

An Algorithm for Sequency Ordering of Hadamard Functions

A simple algorithm is developed for obtaining the sequency vector of high-order Hadamard transform matrices without the need for converting the order of individual Hadamard functions to sequency.

[1] Shalhav Zohar. The Counting Recursive Digital Filter , 1973, IEEE Transactions on Computers.

[2] Warren D. Little. An Algorithm for High-Speed Digital Filters , 1974, IEEE Transactions on Computers.

[3] Shalhav Zohar. Fast Hardware Fourier Transformation Through Counting , 1973, IEEE Transactions on Computers.

[4] C. K. Yuen,et al. A Note on Base -2 Arithmetic Logic , 1975, IEEE Trans. Computers.

[5] A. Oppenheim,et al. Effects of finite register length in digital filtering and the fast Fourier transform , 1972 .

[6] H. Andrews,et al. Hadamard transform image coding , 1969 .

[7] J. Walsh. A Closed Set of Normal Orthogonal Functions , 1923 .

[8] Shalhav Zohar,et al. New Hardware Realizations of Nonrecursive Digital Filters , 1972, IEEE Transactions on Computers.