Discrete Fourier transform
id:
discrete-fourier-transform-161-9331381
title:
Discrete Fourier transform
text:
In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT f
brand slug:
wiki
category slug:
encyclopedia
description:
Type of Fourier transform in discrete mathematics
original url:
https://en.wikipedia.org/wiki/Discrete_Fourier_transform
date created:
2001-11-13T20:37:06Z
date modified:
2024-08-27T07:45:15Z
main entity:
{"identifier":"Q2878","url":"https://www.wikidata.org/entity/Q2878"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/5a/Fourier_transform%2C_Fourier_series%2C_DTFT%2C_DFT.svg","width":1057,"height":630}
fields total:
13
integrity:
16