OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Fast Walsh–Hadamard transform

 Home Mathematics Fields of mathematics Applied mathematics Algorithms Digital signal processing
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Fast Walsh–Hadamard Transform (FWHT) is an efficient algorithm for computing the Walsh–Hadamard Transform (WHT), which is a linear transform widely used in signal processing, data analysis, and various applications in computer science and engineering. The WHT is similar to the well-known Fourier Transform but operates over a different basis, specifically using the Walsh functions instead of complex exponentials.

 Ancestors (6)

  1. Digital signal processing
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook