About: Finite Fourier transform     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FFinite_Fourier_transform

In mathematics the finite Fourier transform may refer to either * another name for discrete-time Fourier transform (DTFT) of a finite-length series. E.g., (pp. 52–53) describes the finite Fourier transform as a "continuous periodic function" and the discrete Fourier transform (DFT) as "a set of samples of the finite Fourier transform". In actual implementation, that is not two separate steps; the DFT replaces the DTFT. So (pp. 77–78) describes the implementation as discrete finite Fourier transform. or * another name for the Fourier series coefficients. or

AttributesValues
rdfs:label
  • Finite Fourier transform (en)
rdfs:comment
  • In mathematics the finite Fourier transform may refer to either * another name for discrete-time Fourier transform (DTFT) of a finite-length series. E.g., (pp. 52–53) describes the finite Fourier transform as a "continuous periodic function" and the discrete Fourier transform (DFT) as "a set of samples of the finite Fourier transform". In actual implementation, that is not two separate steps; the DFT replaces the DTFT. So (pp. 77–78) describes the implementation as discrete finite Fourier transform. or * another name for the Fourier series coefficients. or (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • In mathematics the finite Fourier transform may refer to either * another name for discrete-time Fourier transform (DTFT) of a finite-length series. E.g., (pp. 52–53) describes the finite Fourier transform as a "continuous periodic function" and the discrete Fourier transform (DFT) as "a set of samples of the finite Fourier transform". In actual implementation, that is not two separate steps; the DFT replaces the DTFT. So (pp. 77–78) describes the implementation as discrete finite Fourier transform. or * another name for the Fourier series coefficients. or * another name for one snapshot of a short-time Fourier transform. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software