Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,452,829 papers from all fields of science
Search
Sign In
Create Free Account
Fast Walsh–Hadamard transform
Known as:
FWT
, Fast Hadamard transform
, Fast Walsh transform
Expand
In computational mathematics, the Hadamard ordered fast Walsh–Hadamard transform (FWHTh) is an efficient algorithm to compute the Walsh–Hadamard…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Algorithm
Computational complexity theory
Fast Fourier transform
Recursion
Broader (1)
Digital signal processing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Asymmetric optical image encryption using random Hilbert mask based on fast walsh hadamard transform
Mehak Khurana
,
Hukum Singh
International Conference on Computing and…
2017
Corpus ID: 44023610
A new image asymmetric encryption technique using Radial Hilbert mask (RHM) based on Fast Walsh Hadamard Transform (FWHT) is…
Expand
Review
2012
Review
2012
Hurwitz-Radon inspired maximal three-dimensional real orthogonal designs
M. Murugan
,
Sarah Spence Adams
The Australasian Journal of Combinatorics
2012
Corpus ID: 15465925
Higher-dimensional real orthogonal designs were originally introduced thirty years ago by Hammer and Seberry for potential…
Expand
2011
2011
Performance analysis of brain image registration technique using fast walsh hadamard transform and modified adaptive polar transform
D. Sasikala
,
R. Neelaveni
2011
Corpus ID: 61246494
This study proposes a medical image registration method using two algorithms [Fast Walsh Hadamard transform (FWHT) and Modified…
Expand
2011
2011
Classifiers of Digital Modulation Based on the Algorithm of Fast Walsh-Hadamard Transform and Karhunen-Loeve Transform
R. Marie
,
Mazalek Antonin
2011
Corpus ID: 13134813
Automatic recognition of modulation is rapidly evolving area of signal analysis. In recent years, much interest by academic and…
Expand
2007
2007
An Efficient Digital Watermarking Scheme for Dynamic Estimation of Wireless Channel Condition
S. Maity
,
M. Kundu
,
S. Maity
International Conference on Computing: Theory and…
2007
Corpus ID: 6229243
This paper investigates the scope of an unconventional use of digital watermarking principle to blindly assess the quality of the…
Expand
2006
2006
MAI-Free MC-CDMA Systems Based on Hadamard–Walsh Codes
S. Tsai
,
Yuan-Pei Lin
,
C.-C. Jay Kuo
IEEE Transactions on Signal Processing
2006
Corpus ID: 8675500
It is known that multicarrier code-division multiple-access (MC-CDMA) systems suffer from multiaccess interference (MAI) when the…
Expand
2004
2004
Fast Pseudo-Hadamard Transforms
T. Denis
IACR Cryptology ePrint Archive
2004
Corpus ID: 15250653
We prove that the fast pseudo-Hadamard transform (FPHT) over a finite field has a bounded branch number. We shall demonstrate…
Expand
2000
2000
Performance analysis of a wireless multirate direct-sequence CDMA using fast Walsh transform and decorrelating detection
M. Madkour
,
Someshwara C. Gupta
IEEE Transactions on Communications
2000
Corpus ID: 32109131
We analyze the performance of a flexible multirate scheme for direct-sequence code division multiple-access (CDMA) mobile radio…
Expand
2000
2000
On Exact Foldy-Wouthuysen Transformation of Bozons in an Electromagnetic Field and Reduction of Kemmer-Duffin-Petiau Equation
V. Tretynyk
2000
Corpus ID: 10971777
Using discrete symmetries of the Kemmer–Duffin–Petiau (KDP) equation the exact Foldy– Wouthuysen transformation (FWT) was found…
Expand
1970
1970
A note on the finite Walsh transform (Corresp.)
B. Kennett
IEEE Transactions on Information Theory
1970
Corpus ID: 39934576
The theory of the finite Walsh transform is presented as a background to current interest in the fast Walsh transform algorithm.