Bruun's FFT algorithm: Difference between revisions

Revision as of 02:24, 9 March 2025

Revision as of 21:20, 4 June 2025

Line 86:

* {{cite journal | first1 = Jianping | last1 = Chen | first2 = Henrik | last2 = Sorensen | title = An efficient FFT algorithm for real-symmetric data | journal = Proc. ICASSP | volume = 5 | pages = 17–20 | year = 1992}}

* {{cite journal | first = Rainer | last = Storn | title = Some results in fixed point error analysis of the Bruun-FTT {{sic}} algorithm | journal = IEEE Transactions on Signal Processing| volume = 41 | issue = 7 | pages = 2371–2375 | year = 1993 | doi = 10.1109/78.224246 | bibcode = 1993ITSP...41.2371S }}

* {{cite journal | first = Hideo | last = Murakami | title = Real-valued decimation-in-time and decimation-in-frequency algorithms | journal = IEEE Transactions on Circuits and Systems IiII: Analog and Digital Signal Processing| volume = 41 | issue = 12 | pages = 808–816 | year = 1994| doi = 10.1109/82.338622 }}

* {{cite journal | first = Hideo | last = Murakami | title = Real-valued fast discrete Fourier transform and cyclic convolution algorithms of highly composite even length | journal = Proc. ICASSP | volume = 3 | pages = 1311–1314 | year = 1996 }}

* Shashank Mittal, Md. Zafar Ali Khan, M. B. Srinivas, "A Comparative Study of Different FFT Architectures for Software Defined Radio", ''Lecture Notes in Computer Science'' '''4599''' (''Embedded Computer Systems: Architectures, Modeling, and Simulation''), 375-384 (2007). Proc. 7th Intl. Workshop, SAMOS 2007 (Samos, Greece, July 16–19, 2007).