A Sequency-Ordered Fast Walsh Transform

@inproceedings{ManzASF,
  title={A Sequency-Ordered Fast Walsh Transform},
  author={Joseph W Manz}
}
A method is described that Yjelds Ule fast WaJsb bmsfmm (FFWT) in sequency order. The advantages of this method over others are: 1) it is based on the Cooky-Tukey-type fast Hadamard transform (FHT) algorithm , 2) the computational effort is identical to the conventional FHT, and 3) the transform remains its own inverse. Certain properties of a Hadamard matrix of order N= 2-w make it a convenient vehicle for the computation of the fast Walsh transform (FWT) [ 11, [2]. The rows or columns of the… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Computation of the fast Walsh - Fourier transform

  • K. R. Rao N. Ahmed, R. B. Schultz
  • IEEE Trans . Comput . ( Short Notes )

Similar Papers

Loading similar papers…