Recursive form of the discrete Fourier transform for two-dimensional signals

Zümray Dokur; Tamer Ölmez

doi:10.1007/3-540-45675-9_83

Recursive form of the discrete Fourier transform for two-dimensional signals

Zümray Dokur, Tamer Ölmez

Department of Electronics and Communication Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper, recursive fast Fourier transform is presented for twodimensional signals. When applying to real-time analysis, the computational efficiency is highly improved by integrating a recursive procedure. The recursive procedure highly reduces the number of complex arithmetic operations, and provide detailed spectral analysis for one or two-dimensional signals. In the first stage, the recursive algorithm is realized for one-dimensional signals. Then, recursive fast Fourier transform is presented for two-dimensional signals. The advantages of the recursive algorithm are presented by giving examples for one and two-dimensional signals.

Original language	English
Title of host publication	Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings
Editors	Hujun Yin, Nigel Allinson, Richard Freeman, John Keane, Simon Hubbard
Publisher	Springer Verlag
Pages	551-556
Number of pages	6
ISBN (Print)	9783540440253
DOIs	https://doi.org/10.1007/3-540-45675-9_83
Publication status	Published - 2002
Event	3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002 - Manchester, United Kingdom Duration: 12 Aug 2002 → 14 Aug 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2412
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002
Country/Territory	United Kingdom
City	Manchester
Period	12/08/02 → 14/08/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Access to Document

10.1007/3-540-45675-9_83

Cite this

Dokur, Z., & Ölmez, T. (2002). Recursive form of the discrete Fourier transform for two-dimensional signals. In H. Yin, N. Allinson, R. Freeman, J. Keane, & S. Hubbard (Eds.), Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings (pp. 551-556). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2412). Springer Verlag. https://doi.org/10.1007/3-540-45675-9_83

Dokur, Zümray ; Ölmez, Tamer. / Recursive form of the discrete Fourier transform for two-dimensional signals. Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings. editor / Hujun Yin ; Nigel Allinson ; Richard Freeman ; John Keane ; Simon Hubbard. Springer Verlag, 2002. pp. 551-556 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c96ceff7e6e44e749c2b8c8e31bed090,

title = "Recursive form of the discrete Fourier transform for two-dimensional signals",

abstract = "In this paper, recursive fast Fourier transform is presented for twodimensional signals. When applying to real-time analysis, the computational efficiency is highly improved by integrating a recursive procedure. The recursive procedure highly reduces the number of complex arithmetic operations, and provide detailed spectral analysis for one or two-dimensional signals. In the first stage, the recursive algorithm is realized for one-dimensional signals. Then, recursive fast Fourier transform is presented for two-dimensional signals. The advantages of the recursive algorithm are presented by giving examples for one and two-dimensional signals.",

author = "Z{\"u}mray Dokur and Tamer {\"O}lmez",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002 ; Conference date: 12-08-2002 Through 14-08-2002",

year = "2002",

doi = "10.1007/3-540-45675-9\_83",

language = "English",

isbn = "9783540440253",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "551--556",

editor = "Hujun Yin and Nigel Allinson and Richard Freeman and John Keane and Simon Hubbard",

booktitle = "Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings",

address = "Germany",

}

Dokur, Z & Ölmez, T 2002, Recursive form of the discrete Fourier transform for two-dimensional signals. in H Yin, N Allinson, R Freeman, J Keane & S Hubbard (eds), Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2412, Springer Verlag, pp. 551-556, 3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002, Manchester, United Kingdom, 12/08/02. https://doi.org/10.1007/3-540-45675-9_83

Recursive form of the discrete Fourier transform for two-dimensional signals. / Dokur, Zümray ; Ölmez, Tamer.
Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings. ed. / Hujun Yin; Nigel Allinson; Richard Freeman; John Keane; Simon Hubbard. Springer Verlag, 2002. p. 551-556 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2412).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Recursive form of the discrete Fourier transform for two-dimensional signals

AU - Dokur, Zümray

AU - Ölmez, Tamer

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

N2 - In this paper, recursive fast Fourier transform is presented for twodimensional signals. When applying to real-time analysis, the computational efficiency is highly improved by integrating a recursive procedure. The recursive procedure highly reduces the number of complex arithmetic operations, and provide detailed spectral analysis for one or two-dimensional signals. In the first stage, the recursive algorithm is realized for one-dimensional signals. Then, recursive fast Fourier transform is presented for two-dimensional signals. The advantages of the recursive algorithm are presented by giving examples for one and two-dimensional signals.

AB - In this paper, recursive fast Fourier transform is presented for twodimensional signals. When applying to real-time analysis, the computational efficiency is highly improved by integrating a recursive procedure. The recursive procedure highly reduces the number of complex arithmetic operations, and provide detailed spectral analysis for one or two-dimensional signals. In the first stage, the recursive algorithm is realized for one-dimensional signals. Then, recursive fast Fourier transform is presented for two-dimensional signals. The advantages of the recursive algorithm are presented by giving examples for one and two-dimensional signals.

UR - https://www.scopus.com/pages/publications/84947996350

U2 - 10.1007/3-540-45675-9_83

DO - 10.1007/3-540-45675-9_83

M3 - Conference contribution

AN - SCOPUS:84947996350

SN - 9783540440253

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 551

EP - 556

BT - Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings

A2 - Yin, Hujun

A2 - Allinson, Nigel

A2 - Freeman, Richard

A2 - Keane, John

A2 - Hubbard, Simon

PB - Springer Verlag

T2 - 3rd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2002

Y2 - 12 August 2002 through 14 August 2002

ER -

Dokur Z , Ölmez T. Recursive form of the discrete Fourier transform for two-dimensional signals. In Yin H, Allinson N, Freeman R, Keane J, Hubbard S, editors, Intelligent Data Engineering and Automated Learning - IDEAL 2002 - 3rd International Conference, Proceedings. Springer Verlag. 2002. p. 551-556. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45675-9_83

Recursive form of the discrete Fourier transform for two-dimensional signals

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this