| http://dbpedia.org/ontology/abstract
|
The cyclotomic fast Fourier transform is a … The cyclotomic fast Fourier transform is a type of fast Fourier transform algorithm over finite fields. This algorithm first decomposes a DFT into several circular convolutions, and then derives the DFT results from the circular convolution results. When applied to a DFT over , this algorithm has a very low multiplicative complexity. In practice, since there usually exist efficient algorithms for circular convolutions with specific lengths, this algorithm is very efficient.lengths, this algorithm is very efficient.
|
| http://dbpedia.org/ontology/wikiPageID
|
41435967
|
| http://dbpedia.org/ontology/wikiPageLength
|
6393
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
697020509
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Characteristic_%28algebra%29 +
, http://dbpedia.org/resource/Convolution +
, http://dbpedia.org/resource/Primitive_nth_root_of_unity +
, http://dbpedia.org/resource/Discrete_Fourier_transform +
, http://dbpedia.org/resource/BCH_codes +
, http://dbpedia.org/resource/Category:Discrete_transforms +
, http://dbpedia.org/resource/Circulant_matrix +
, http://dbpedia.org/resource/Normal_basis +
, http://dbpedia.org/resource/Complex_number +
, http://dbpedia.org/resource/Linearized_polynomial +
, http://dbpedia.org/resource/Category:FFT_algorithms +
, http://dbpedia.org/resource/Error-correcting_code +
, http://dbpedia.org/resource/Reed%E2%80%93Solomon_error_correction +
, http://dbpedia.org/resource/Fast_Fourier_transform +
, http://dbpedia.org/resource/Finite_field +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Discrete_transforms +
, http://dbpedia.org/resource/Category:FFT_algorithms +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Cyclotomic_fast_Fourier_transform?oldid=697020509&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Cyclotomic_fast_Fourier_transform +
|
| owl:sameAs |
http://dbpedia.org/resource/Cyclotomic_fast_Fourier_transform +
, https://global.dbpedia.org/id/fJv8 +
, http://rdf.freebase.com/ns/m.0zth6xv +
, http://yago-knowledge.org/resource/Cyclotomic_fast_Fourier_transform +
, http://www.wikidata.org/entity/Q17006372 +
|
| rdf:type |
http://dbpedia.org/class/yago/Act100030358 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Event100029378 +
, http://dbpedia.org/class/yago/Rule105846932 +
, http://dbpedia.org/class/yago/WikicatFFTAlgorithms +
, http://dbpedia.org/class/yago/Procedure101023820 +
, http://dbpedia.org/class/yago/Algorithm105847438 +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Activity100407535 +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
|
| rdfs:comment |
The cyclotomic fast Fourier transform is a … The cyclotomic fast Fourier transform is a type of fast Fourier transform algorithm over finite fields. This algorithm first decomposes a DFT into several circular convolutions, and then derives the DFT results from the circular convolution results. When applied to a DFT over , this algorithm has a very low multiplicative complexity. In practice, since there usually exist efficient algorithms for circular convolutions with specific lengths, this algorithm is very efficient.lengths, this algorithm is very efficient.
|
| rdfs:label |
Cyclotomic fast Fourier transform
|
