Block- and strand-multiplexing for fast computation of a class of transforms
- 1 March 1975
- journal article
- research article
- Published by Taylor & Francis in International Journal of Electronics
- Vol. 38 (3) , 401-412
- https://doi.org/10.1080/00207217508920413
Abstract
The transforms dealt with in this paper are defined in terms of the transform kernels which are Kroneeker products of the two or more component kernels. The signal flow-graph for the computation of such a transform is obtained with the flow-graphs for the component transforms as building blocks.Keywords
This publication has 6 references indexed in Scilit:
- The Relationship Between Two Fast Fourier TransformsIEEE Transactions on Computers, 1971
- Fast Fourier-Hadamard decoding of orthogonal codesInformation and Control, 1969
- A short bibliography on the fast Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- Computation of the Fast Walsh-Fourier TransformIEEE Transactions on Computers, 1969
- Hadamard transform image codingProceedings of the IEEE, 1969
- Study of algorithmic properties of chebyshev coefficientsInternational Journal of Computer Mathematics, 1968