Your browser does not support JavaScript!

Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)

Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In the letter a fast and efficient algorithm is presented for calculating both the DFT and the WHT. This is achieved through the factorisation of the intermediate transform into a product of sparse matrices. The algorithm can implemented using a single butterfly structure, and is amenable for both software and hardware implementations.


    1. 1)
      • C.Y. Hsu , J.L. Wu . Fast computation of dicretc Hartley transform via WaishHadamard transform. Electron. Lett. , 466 - 468
    2. 2)
      • Y. Tadokoro , T. Higuchi . Discrete Fourier transform computation via the Walsh transform. IEEE Trans. , 236 - 240
    3. 3)
      • S. Boussakta , A.J.G. Holt . Relationship between the Fermat number transform and the WalshHadamard transform. IEE Proc. G , 191 - 204
    4. 4)
      • D. Hein , H. Nasir . On real-time WalshHadamard/cosine transform image processor. IEEE Trans. , 453 - 457

Related content

This is a required field
Please enter a valid email address