Bit_reversed sequency order or bit_reversed Walsh order (M) is presented. Walsh functions in this order can be processed easily, and there is a simple relation between sequency order and bit_reversed sequency order. 8...Bit_reversed sequency order or bit_reversed Walsh order (M) is presented. Walsh functions in this order can be processed easily, and there is a simple relation between sequency order and bit_reversed sequency order. 8 fast algorithms for discrete Walsh transform in bit_reversed sequency order are given.展开更多
A more efficient permutation algorithm which has less computer operation and better structure is presented here for radix-2 FFT(FHT). It can fasten the FFT and FHT efficiently when N becomes large.
文摘Bit_reversed sequency order or bit_reversed Walsh order (M) is presented. Walsh functions in this order can be processed easily, and there is a simple relation between sequency order and bit_reversed sequency order. 8 fast algorithms for discrete Walsh transform in bit_reversed sequency order are given.
文摘A more efficient permutation algorithm which has less computer operation and better structure is presented here for radix-2 FFT(FHT). It can fasten the FFT and FHT efficiently when N becomes large.
