DocumentCode
1108909
Title
Fast Complex BIFORE Transform by Matrix Partitioning
Author
Ahmed, Nova ; Rao, K. Raghava
Issue
6
fYear
1971
fDate
6/1/1971 12:00:00 AM
Firstpage
707
Lastpage
710
Abstract
Using elementary matrix partitioning techniques, a fast algorithm for computing the complex BIFORE transform is developed.
Keywords
Discrete transforms, fast complex BIFORE transformation, fast Fourier transform, matrix factoring, radix 2.; Counting circuits; Discrete transforms; Fast Fourier transforms; Hardware; Partitioning algorithms; Tree data structures; Discrete transforms, fast complex BIFORE transformation, fast Fourier transform, matrix factoring, radix 2.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223333
Filename
1671926
Link To Document