Abstract
In this paper, a new unitary transform is presented. Some of the new unitary transform properties are discussed, and a fast algorithm is also given. The transform has less operations as compared to the fast Hadamard transform, and has invariant power spectrum under a cyclic shift.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Ahmed and K. R. Rao, Orthogonal Transforms for Digital Signal Processing, New York, Springer-Verlag, (1975).
J. W. Cooly and J. W. Tukey, An Algorithm for Machine Computation pf Complex Fourier Series,Mathematics of Computation 19:297–301 (1965).
Hu Zheng and Fan Chang-xi, Walsh Functions and their Applications in Telecommunications, Beijing, Publishing House of People's Posts and Telecommunications (1980).
Kou Wei-dong, The Walsh-Hadamard Transform forN (= 2) Samples,J. of Beijing Inst. of Posts and Telecommunitions,00(1):00–00 (1983).
Kou Wei-dong,H/H Transform andH/h Transform (to be published).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Weidong, K., Zheng, H. CH transform. International Journal of Computer and Information Sciences 13, 291–307 (1984). https://doi.org/10.1007/BF00977834
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00977834