The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1971 vol.20)
pp: 707-710
N. Ahmed , Kansas State Univ.
ABSTRACT
Using elementary matrix partitioning techniques, a fast algorithm for computing the complex BIFORE transform is developed.
INDEX TERMS
Discrete transforms, fast complex BIFORE transformation, fast Fourier transform, matrix factoring, radix 2.
CITATION
N. Ahmed, K.R. Rao, R.B. Schultz, "Fast Complex BIFORE Transform by Matrix Partitioning", IEEE Transactions on Computers, vol.20, no. 6, pp. 707-710, June 1971, doi:10.1109/T-C.1971.223333
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool