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

Daniel Pak Kong Lun; Wan Chi Siu

doi:10.1109/ISCAS.1992.230149

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

Daniel Pak Kong Lun, Wan Chi Siu

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-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 language	English
Title of host publication	1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	726-729
Number of pages	4
ISBN (Electronic)	0780305930
DOIs	https://doi.org/10.1109/ISCAS.1992.230149
Publication status	Published - 10 May 1992
Event	1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992 - San Diego, United States Duration: 10 May 1992 → 13 May 1992

Publication series

Name	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	2
ISSN (Print)	0271-4310

Conference

Conference	1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
Country/Territory	United States
City	San Diego
Period	10/05/92 → 13/05/92

ASJC Scopus subject areas

Electrical and Electronic Engineering

More information

10.1109/ISCAS.1992.230149

Cite this

Lun, D. P. K., & Siu, W. C. (1992). An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform. In 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992 (pp. 726-729). Article 230149 (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 2). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISCAS.1992.230149

@inproceedings{4d5577b0ea4745fdb6dd10796078749c,

title = "An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform",

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.",

author = "Lun, {Daniel Pak Kong} and Siu, {Wan Chi}",

year = "1992",

month = may,

day = "10",

doi = "10.1109/ISCAS.1992.230149",

language = "English",

series = "Proceedings - IEEE International Symposium on Circuits and Systems",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "726--729",

booktitle = "1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992",

note = "1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992 ; Conference date: 10-05-1992 Through 13-05-1992",

}

Lun, DPK & Siu, WC 1992, An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform. in 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992., 230149, Proceedings - IEEE International Symposium on Circuits and Systems, vol. 2, Institute of Electrical and Electronics Engineers Inc., pp. 726-729, 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992, San Diego, United States, 10/05/92. https://doi.org/10.1109/ISCAS.1992.230149

An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform. / Lun, Daniel Pak Kong; Siu, Wan Chi.
1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992. Institute of Electrical and Electronics Engineers Inc., 1992. p. 726-729 230149 (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 2).

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

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

AU - Lun, Daniel Pak Kong

AU - Siu, Wan Chi

PY - 1992/5/10

Y1 - 1992/5/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0001603225&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.1992.230149

DO - 10.1109/ISCAS.1992.230149

M3 - Conference article published in proceeding or book

AN - SCOPUS:0001603225

T3 - Proceedings - IEEE International Symposium on Circuits and Systems

SP - 726

EP - 729

BT - 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992

Y2 - 10 May 1992 through 13 May 1992

ER -

Lun DPK, Siu WC. An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform. In 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992. Institute of Electrical and Electronics Engineers Inc. 1992. p. 726-729. 230149. (Proceedings - IEEE International Symposium on Circuits and Systems). doi: 10.1109/ISCAS.1992.230149

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this