DFT/FFT and Convolution Algorithms: Theory and Implementation
DFT/FFT and Convolution Algorithms: Theory and Implementation
Conjugate symmetric sequency-ordered complex Hadamard transform
IEEE Transactions on Signal Processing
A new class of reciprocal-orthogonal parametric transforms
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Generalized discrete Fourier transform with nonlinear phase
IEEE Transactions on Signal Processing
MAI-Free MC-CDMA Systems Based on Hadamard–Walsh Codes
IEEE Transactions on Signal Processing
Maximum-likelihood estimation of complex sinusoids and Toeplitzcovariances
IEEE Transactions on Signal Processing
Fast Cocyclic Jacket Transform
IEEE Transactions on Signal Processing
Sequency-Ordered Complex Hadamard Transform: Properties, Computational Complexity and Applications
IEEE Transactions on Signal Processing - Part I
Transform Order Division Multiplexing
IEEE Transactions on Signal Processing
On the existence of positive-definite maximum-likelihood estimates of structured covariance matrices
IEEE Transactions on Information Theory
Fast Walsh–Hadamard–Fourier Transform Algorithm
IEEE Transactions on Signal Processing
OFDM Based on Low Complexity Transform to Increase Multipath Resilience and Reduce PAPR
IEEE Transactions on Signal Processing
Hi-index | 0.08 |
A new transform family, called the sequency-ordered generalized Walsh-Fourier transform (SGWFT), is proposed in this paper. Using the kernel matrix generation process and the controllable phase quantization parameter, the Walsh-Hadamard transform (WHT), the sequency-ordered Hadamard transform (SCHT), and the discrete Fourier transform (DFT) become special cases of the SGWFT. The SGWFT can be adjusted by a single parameter to become the WHT, the SCHT, and the DFT. In addition, the SGWFT also has the radix-2 and the split-radix fast algorithms. Compared with the WHT and the SCHT, the properties and the performance of the SGWFT are more similar to those of the DFT. On the other hand, compared with the DFT, the number of multiplications in the SGWFT is less. We also show that the proposed SGWFT has better performance in the applications of DS-CDMA sequence design and transform coding.