Walsh–Hadamard transform
E1067314
UNEXPLORED
The Walsh–Hadamard transform is an orthogonal, non-sinusoidal signal transform that decomposes data into a basis of square-wave-like functions, widely used in communications, coding theory, and signal processing.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Hadamard transform | 1 |
| Hadamard transform spectroscopy | 1 |
| Walsh–Hadamard transform canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T13893971 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Walsh–Hadamard transform Context triple: [Hadamard matrix, usedIn, Walsh–Hadamard transform]
-
A.
Haar wavelet
The Haar wavelet is the simplest and oldest wavelet function, used as a basic building block in wavelet analysis for representing signals with abrupt changes.
-
B.
Modified Discrete Cosine Transform
Modified Discrete Cosine Transform is a lapped transform widely used in audio coding and compression (e.g., MP3, AAC) to efficiently represent overlapping time-domain signals in the frequency domain with reduced artifacts.
-
C.
Hilbert transform
The Hilbert transform is an integral transform that produces the harmonic conjugate of a real-valued function, playing a central role in signal processing, harmonic analysis, and the theory of analytic signals.
-
D.
Cooley–Tukey Fast Fourier Transform algorithm
The Cooley–Tukey Fast Fourier Transform algorithm is a widely used, efficient method for computing the discrete Fourier transform that revolutionized digital signal processing and numerical analysis.
-
E.
Daubechies wavelets
Daubechies wavelets are a family of compactly supported orthogonal wavelets widely used in signal processing and image compression for their efficient time-frequency localization.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Walsh–Hadamard transform Target entity description: The Walsh–Hadamard transform is an orthogonal, non-sinusoidal signal transform that decomposes data into a basis of square-wave-like functions, widely used in communications, coding theory, and signal processing.
-
A.
Haar wavelet
The Haar wavelet is the simplest and oldest wavelet function, used as a basic building block in wavelet analysis for representing signals with abrupt changes.
-
B.
Modified Discrete Cosine Transform
Modified Discrete Cosine Transform is a lapped transform widely used in audio coding and compression (e.g., MP3, AAC) to efficiently represent overlapping time-domain signals in the frequency domain with reduced artifacts.
-
C.
Hilbert transform
The Hilbert transform is an integral transform that produces the harmonic conjugate of a real-valued function, playing a central role in signal processing, harmonic analysis, and the theory of analytic signals.
-
D.
Cooley–Tukey Fast Fourier Transform algorithm
The Cooley–Tukey Fast Fourier Transform algorithm is a widely used, efficient method for computing the discrete Fourier transform that revolutionized digital signal processing and numerical analysis.
-
E.
Daubechies wavelets
Daubechies wavelets are a family of compactly supported orthogonal wavelets widely used in signal processing and image compression for their efficient time-frequency localization.
- F. None of above. chosen
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
Hadamard matrices
linked to: Walsh–Hadamard transform
linked to: Walsh–Hadamard transform