An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform

Daniel Pak Kong Lun, Wan Chi Siu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

3 Citations (Scopus)

Abstract

This paper presents a new algorithm for the computation of the two-dimensional discrete Fourier transform and discrete Hartley transform. By using the discrete Radon transform, the algorithm essentially converts the two-dimensional transforms into a number of one-dimensional ones. However, the present algorithm is improved as compared to the previous propositions in that about 20% of the additions are saved. It is achieved by a new decomposition technique for the computation of the discrete Radon transform. In fact, the present algorithm has exactly the same arithmetic complexity as the respective fastest algorithms which use the polynomial transform for their decomposition. However, the present approach has the advantage over the ones using the polynomial transform on the point that it can be easily realized.

Original languageEnglish
Title of host publication1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages726-729
Number of pages4
ISBN (Electronic)0780305930
DOIs
Publication statusPublished - 10 May 1992
Event1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992 - San Diego, United States
Duration: 10 May 199213 May 1992

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume2
ISSN (Print)0271-4310

Conference

Conference1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
Country/TerritoryUnited States
CitySan Diego
Period10/05/9213/05/92

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this