Fast discrete radon transform and 2-D discrete Fourier transform

摘要

The discrete Radon transform (DRT) has been known to convert two-dimensional discrete Fourier transforms (2-D DFTs) into 1-D DFTs. A fast discrete Radon transform (FDRT) algorithm is presented. A FDRT-based algorithm is presented for computing 2-D DFTs, which has the advantages of having the lowest number of multiplications and being more suitable for parallel implementation compared with other related algorithms.