Live briefing
Everything about Hadamard transform
Involutive change of basis in linear algebra
The Hadamard transform is an example of a generalized class of Fourier transforms. It performs an orthogonal, symmetric, involutive, linear operation on a tuple of 2m numbers. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Hadamard transformA 5-minute orientation
- Skim a recent paper: A Hybrid BCI Using Singular Value Decomposition Values of the Fast Walsh–Hadamard Transform CoefficientsInfluential work since 2022
- Pick up a classic book: Hadamard transform opticsThe most-reprinted book on the subject
- Read the landmark paper: Hadamard transform image codingCited 519 times
- Go sideways: Quantum Fourier transformA closely related topic
- Go sideways: Quantum logic gateA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Hadamard transform image coding
Hadamard Transform Ion Mobility Spectrometry
Hadamard Transform Ion Mobility Spectrometry
Hadamard Transform Capillary Electrophoresis
The center weighted Hadamard transform
BIFORE or Hadamard transform
Hadamard transform measurement of tandem Fourier-transform mass spectra
Hadamard transform imager and imaging spectrometer
🆕 Influential since 2022
A Hybrid BCI Using Singular Value Decomposition Values of the Fast Walsh–Hadamard Transform Coefficients
High-Throughput Multiplexed Infrared Spectroscopy of Ion Mobility-Separated Species Using Hadamard Transform
An improved blind watermarking method facing dual color images based on Hadamard transform
Block Walsh–Hadamard Transform-based Binary Layers in Deep Neural Networks
High-Capacity Image Steganography Based on Discrete Hadamard Transform
📚 Books worth reading
Hadamard transform opticsMartin Harwit · 1979
Multiplex and/or high-throughput spectroscopyGeorge A. Vanasse · 1979
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Quantum Fourier transform In quantum computing, the quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier…
- Quantum logic gate In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate (or simply quantum gate) is a basic quantum circuit…
- Phase kickback In quantum computing, phase kickback refers to the fact that controlled operations have effects on their controls, in addition to on their targets, and…
- Controlled NOT gate In computer science, the controlled NOT gate (also C-NOT or CNOT), controlled-X gate, controlled-bit-flip gate, Feynman gate or controlled Pauli-X is a…
- Fourier transform on finite groups In mathematics, the Fourier transform on finite groups is a generalization of the discrete Fourier transform from cyclic to arbitrary finite groups. The…
- Shor's algorithm Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor…
- Fast Fourier transform A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT), or its inverse (IDFT), of a sequence. A Fourier transform…
- Discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) is a discrete version of the Fourier transform that converts a finite sequence of numbers into another…