Bruun's FFT algorithm: Difference between revisions

Revision as of 21:21, 4 June 2025

Revision as of 21:22, 4 June 2025

Line 84:

* {{cite book | first = H. J. | last = Nussbaumer | title = Fast Fourier Transform and Convolution Algorithms | series = Springer Series in Information Sciences | publisher = Springer-Verlag | ___location = Berlin | year = 1990 | volume = 2 |doi=10.1007/978-3-642-81897-4| isbn = 978-3-540-11825-1 }}

* {{cite journal | first = Yuhang | last = Wu | title = New FFT structures based on the Bruun algorithm | journal = IEEE Transactions on Acoustics, Speech, and Signal Processing| volume = 38 | issue = 1 | pages = 188–191 | year = 1990 | doi = 10.1109/29.45572 | url = https://backend.orbit.dtu.dk/ws/files/4601557/Wu.pdf }}

* {{cite journalbook | first1 = Jianping | last1 = Chen | first2 = Henrik | last2 = Sorensen | title = [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing | chapter = An efficient FFT algorithm for real-symmetric data | journal = Proc. ICASSP | volume = 5 | pages = 17–20 | year = 1992 |doi=10.1109/ICASSP.1992.226669| isbn = 0-7803-0532-9 }}

* {{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 }}