Article
Version 1
Preserved in Portico This version is not peer-reviewed
Discrete Two Dimensional Fourier Transform in Polar Coordinates Part I: Theory and Operational Rules
Version 1
: Received: 9 July 2019 / Approved: 11 July 2019 / Online: 11 July 2019 (05:09:11 CEST)
A peer-reviewed article of this Preprint also exists.
Baddour, N. Discrete Two-Dimensional Fourier Transform in Polar Coordinates Part I: Theory and Operational Rules. Mathematics 2019, 7, 698. Baddour, N. Discrete Two-Dimensional Fourier Transform in Polar Coordinates Part I: Theory and Operational Rules. Mathematics 2019, 7, 698.
Abstract
The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In this paper, we propose and evaluate the theory of the 2D discrete Fourier Transform (DFT) in polar coordinates. This discrete theory is shown to arise from discretization schemes that have been previously employed with the 1D DFT and the discrete Hankel Transform (DHT). The proposed transform possesses orthogonality properties, which leads to invertibility of the transform. In the first part of this two-part paper, the theory of the actual manipulated quantities is shown, including the standard set of shift, modulation, multiplication, and convolution rules. Parseval and modified Parseval relationships are shown, depending on which choice of kernel is used. Similar to its continuous counterpart, the 2D DFT in polar coordinates is shown to consist of a 1D DFT, DHT and 1D inverse DFT.
Keywords
fourier theory; DFT in polar coordinates; polar coordinates; multidimensional DFT; discrete hankel transform; discrete fourier transform; orthogonality
Subject
Computer Science and Mathematics, Discrete Mathematics and Combinatorics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment