Fast Fourier Transforms using the complex logarithmic number system

DOI10.1023/A:1022236132192MaRDI QIDQ1405500zbMATH OpenFDO

Authors D. Massart

Publication date 25 August 2003

Published in Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1022236132192

zbMATH Keywords

additioncomplex numbersFast Fourier Transform (FFT)fixed-point arithmeticlogarithmic number system (LNS)polar coordinates

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 5997400
• Fast and precise Fourier transforms
• Multiplierless implementation of rotators and FFTs
• scientific article; zbMATH DE number 1559520
• scientific article; zbMATH DE number 3926792

Cited in

(2)

• scientific article; zbMATH DE number 1960289 (Why is no real title available?)
• Improving 2D-log-number-system representations by use of an optimal base

This page was built for publication: Fast Fourier Transforms using the complex logarithmic number system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405500)