Fast Complex BIFORE Transform by Matrix Partitioning

Authors:
N. Ahmed;K. R. Rao;R. B. Schultz
Affiliations:
Kansas State Univ.;-;-
Venue:
IEEE Transactions on Computers
Year:
1971

Citing 3
Cited 0

Kronecker Matrices, Computer Implementation, and Generalized Spectra

Journal of the ACM (JACM)
A Generalization of the Fast Fourier Transform

IEEE Transactions on Computers
A Generalized Technique for Spectral Analysis

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

Using elementary matrix partitioning techniques, a fast algorithm for computing the complex BIFORE transform is developed.