This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
June 1971 (vol. 20 no. 6)
pp. 707-710
N. Ahmed, Kansas State Univ.
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
Usage of this product signifies your acceptance of the Terms of Use.