# On the Equivalence Between One-Dimensional Discrete Walsh-Hadamard and Multidimensional Discrete Fourier Transforms

@article{Kunz1979OnTE, title={On the Equivalence Between One-Dimensional Discrete Walsh-Hadamard and Multidimensional Discrete Fourier Transforms}, author={Henry O. Kunz}, journal={IEEE Transactions on Computers}, year={1979}, volume={C-28}, pages={267-268} }

It is shown that the discrete Walsh–Hadamard transform applied to 2none-dimensional data is equivalent to the discrete n-dimensional Fourier transform applied to the same 2ndata arranged on the binary n-cube. A similar relationship is valid for the generalized discrete Walsh transform suggested by Andrews and Caspari. This relationship explains the theorem concerning the shift invariance of the power spectrum for the Walsh–Hadamard transform and its generalizations.

#### Figures and Topics from this paper

#### 26 Citations

Cryptography and Coding

- Computer Science
- Lecture Notes in Computer Science
- 2013

Olympic polynomials give rise to several new constructions of infinite classes of semi-bent Boolean functions in even dimension, which are useful in constructing significant cryptographic primitives such as plateaued Boolean functions. Expand

Spatial multiplexing using walsh-hadamard transform

- Mathematics
- 2016 International Conference on Smart Green Technology in Electrical and Information Systems (ICSGTEIS)
- 2016

This paper proposes a model (WHT-SMX), that combines spatial multiplexing (SMX) with walsh-hadamard transform (WHT). The use of WHT is to convert transmit symbols of SMX to change location of… Expand

Nonlinear cryptanalysis of reduced-round Serpent and metaheuristic search for S-box approximations

- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2013

Three variants of a new nonlinear cryptanalytic algorithm are proposed which overcomes the main issues that prevented the use of nonlinear approximations in previous research, and the statistical frameworks for calculating the complexity of each version are presented. Expand

Filtered Nonlinear Cryptanalysis of Reduced-Round Serpent, and the Wrong-Key Randomization Hypothesis

- Computer Science, Mathematics
- IMACC
- 2013

We present a deterministic algorithm to find nonlinear S-box approximations, and a new nonlinear cryptanalytic technique; the "filtered" nonlinear attack, which achieves the lowest data complexity of… Expand

Significant Target Detection of Traffic Signs Based on Walsh-Hadamard Transform

- Computer Science
- Advances in Intelligent Systems and Computing
- 2019

This method uses the Walsh-Hadamard transform and normalized image binary spectrum to detect the traffic target with significant target and can quickly and effectively detect the significant area of traffic signs compared with other algorithms in the text. Expand

Applications of search techniques to cryptanalysis and the construction of cipher components.

- Computer Science
- 2012

The emphasis then shifts from the construction of cryptographic artefacts to the related area of cryptanalysis, in which non-linear approximations to S-boxes more powerful than the existing linear approximation are derived and exploited in cryptanalytic attacks against the ciphers DES and Serpent. Expand

Chapter 4 – LDPC Decoders

- Computer Science
- 2014

This chapter provides first an overall survey of LDPC decoders, and then a more detailed insight into some of the most widely used decodes, to explain the whys and wherefores, while providing the reader with sufficient knowledge and details to allow implementing the presented decodes. Expand

Local Differential Privacy with K-anonymous for Frequency Estimation

- Computer Science
- 2019 IEEE International Conference on Big Data (Big Data)
- 2019

The numerical experiments demonstrate that SAnonLAP achieves better KL-divergence and estimation error compared to another known privacy model: RAPPOR. Expand

Symmetry and the salience of textures.

- Biology, Mathematics
- 2019

Orbit invariants may provide a clue on the discrimination of these richer textures, as the ordinary Minkowski functionals do for binary textures, by recasting these functionals as a combination of dihedral invariants. Expand

Scalable learning through linearithmic time kernel approximation techniques

- 2014

Random Feature mappings as first suggested in 2007 by Rahimi and Recht provide mappings that closely approximate feature spaces in O(nDd). Two new approaches for random feature mapping were presented… Expand

#### References

SHOWING 1-8 OF 8 REFERENCES

Two-dimensional digital processing of one-dimensional signal

- Mathematics
- 1974

It is of importance to find the necessary and sufficient conditions under which the one-dimensional and two-dimensional processing of any general transform should be equivalent. These conditions are… Expand

A Generalized Technique for Spectral Analysis

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 1970

It is shown how the Kronecker product can be mathematically defined and efficiently implemented using a matrix factorization method and a generalized spectral analysis is suggested, and a variety of examples are presented displaying various properties of the decompositions possible. Expand

B70-2 Transmission of Information by Orthogonal Functions

- Computer Science
- IEEE Transactions on Computers
- 1970

The book provides a new and interesting approach to the field of information and communication theory and is a welcome and thought- provoking exposition on a subject too often reviewed by… Expand

Theory and Application of Digital Signal Processing

- Computer Science
- IEEE Transactions on Systems, Man, and Cybernetics
- 1978

In this well-written book, Bellman and Wing have indeed accomplished the task of introducing the simplicity of the invariant imbedding method to tackle various problems of interest to engineers, physicists, applied mathematicians, and numerical analysts. Expand