Issue No. 06 - June (1971 vol. 20)
N. Ahmed , Kansas State Univ.
Using elementary matrix partitioning techniques, a fast algorithm for computing the complex BIFORE transform is developed.
Discrete transforms, fast complex BIFORE transformation, fast Fourier transform, matrix factoring, radix 2.
N. Ahmed, K. Rao and R. Schultz, "Fast Complex BIFORE Transform by Matrix Partitioning," in IEEE Transactions on Computers, vol. 20, no. , pp. 707-710, 1971.