Adobe PDF (193.17 kB)
Title Details:
Discrete Fourier transform
Authors: Tsitsas, Nikolaos
Reviewer: Frantzeskakis, Dimitrios
Subject: MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > FUNCTIONS OF A COMPLEX VARIABLE
MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS
MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > FUNCTIONS OF A COMPLEX VARIABLE > SERIES EXPANSIONS
MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > ORDINARY DIFFERENTIAL EQUATIONS > GENERAL THEORY
MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > PARTIAL DIFFERENTIAL EQUATIONS > GENERAL HIGHER-ORDER EQUATIONS AND SYSTEMS
MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > ORDINARY DIFFERENTIAL EQUATIONS
Description:
Abstract:
This chapter includes an introduction to the Discrete Fourier Transform (DFT) which is the finite discrete equivalent of Fourier series. The DFT can be considered as an approximation of the usual Fourier series, but it is also of considerable interest on its own. The transformation has gained great importance in applications where the processing of numerical data is required. Transforms finite sequences of real or complex numbers into complex sequences that preserve all the information of the original signal. First, the concept of DFT is defined and its basic properties are formulated. Correlations of the DFT with the complex roots of unity and the Fourier matrix are then recorded. Several representative applications of DFT are also listed.
Type: Chapter
Creation Date: 2015
Item Details:
License: http://creativecommons.org/licenses/by-nc-nd/3.0/gr
Handle http://hdl.handle.net/11419/1142
Bibliographic Reference: Tsitsas, N. (2015). Discrete Fourier transform [Chapter]. In Tsitsas, N. 2015. Applied Mathematics [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/1142
Language: Greek
Is Part of: Applied Mathematics
Publication Origin: Kallipos, Open Academic Editions