Fast Walsh–Hadamard transform
id:
fast-walsh-hadamard-transform-286-1276444
title:
Fast Walsh–Hadamard transform
text:
In computational mathematics, the Hadamard ordered fast Walsh–Hadamard transform (FWHTh) is an efficient algorithm to compute the Walsh–Hadamard transform (WHT). A naive implementation of the WHT of order n = 2 m would have a computational complexity of O( n 2 ). The FWHTh requires only n log n additions or subtractions. The FWHTh is a divide-and-conquer algorithm that recursively breaks down a WHT of size n into two smaller WHTs of size n / 2 . This implementation follows the recursive defini
brand slug:
wiki
category slug:
encyclopedia
description:
Divide-and-conquer algorithm to compute a Hadamard transform
original url:
https://en.wikipedia.org/wiki/Fast_Walsh%E2%80%93Hadamard_transform
date created:
date modified:
2023-11-08T09:27:10Z
main entity:
{"identifier":"Q5437005","url":"https://www.wikidata.org/entity/Q5437005"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/04/Fast_walsh_hadamard_transform_8.svg","width":752,"height":766}
fields total:
13
integrity:
15