Bruun's FFT algorithm: Difference between revisions

Revision as of 21:22, 4 June 2025

Latest revision as of 21:23, 4 June 2025

Line 87:

* {{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 II: Analog and Digital Signal Processing| volume = 41 | issue = 12 | pages = 808–816 | year = 1994| doi = 10.1109/82.338622 }}

* {{cite journalbook | first = Hideo | last = Murakami | title = 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings | chapter = 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 |doi=10.1109/ICASSP.1996.543667| isbn = 0-7803-3192-3 }}

* {{cite book |doi=10.1007/978-3-540-73625-7_39 |chapter=A Comparative Study of Different FFT Architectures for Software Defined Radio |title=Embedded Computer Systems: Architectures, Modeling, and Simulation |series=Lecture Notes in Computer Science |date=2007 |last1=Mittal |first1=Shashank |last2=Khan |first2=Md. Zafar Ali |last3=Srinivas |first3=M. B. |volume=4599 |pages=375–384 |isbn=978-3-540-73622-6 }}

{{refend}}