A pipeline fast Walsh-Fourier transform
M. Ashouri, Anthony George Constantinides · 2005
The structure for hardware realisation of Fast Walsh-Fourier Transform (FWFT) is presented in this paper. The development of the approach is based on Shanks' algorithm for FWFT and use is made in the realisation of serial storage and simple arithmetic. Two alternative structures are proposed one based on PCM encoding and serial two's complement arithmetic, whilst the other is based on delta-sigma encoding with appropriate arithmetic operations. Comparison of these alternative solutions is given in terms of hardware requirements and the mean square error produced.