Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1006531> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- Q1006531 subject Q8380265.
- Q1006531 subject Q8470619.
- Q1006531 abstract "A discrete Hartley transform (DHT) is a Fourier-related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous applications in signal processing and related fields. Its main distinction from the DFT is that it transforms real inputs to real outputs, with no intrinsic involvement of complex numbers. Just as the DFT is the discrete analogue of the continuous Fourier transform, the DHT is the discrete analogue of the continuous Hartley transform, introduced by R. V. L. Hartley in 1942.Because there are fast algorithms for the DHT analogous to the fast Fourier transform (FFT), the DHT was originally proposed by R. N. Bracewell in 1983 as a more efficient computational tool in the common case where the data are purely real. It was subsequently argued, however, that specialized FFT algorithms for real inputs or outputs can ordinarily be found with slightly fewer operations than any corresponding algorithm for the DHT (see below).".
- Q1006531 wikiPageExternalLink fftw-paper-ieee.pdf.
- Q1006531 wikiPageWikiLink Q11348.
- Q1006531 wikiPageWikiLink Q1136880.
- Q1006531 wikiPageWikiLink Q11567.
- Q1006531 wikiPageWikiLink Q117879.
- Q1006531 wikiPageWikiLink Q1192422.
- Q1006531 wikiPageWikiLink Q12916.
- Q1006531 wikiPageWikiLink Q1567607.
- Q1006531 wikiPageWikiLink Q17103599.
- Q1006531 wikiPageWikiLink Q207264.
- Q1006531 wikiPageWikiLink Q207643.
- Q1006531 wikiPageWikiLink Q210857.
- Q1006531 wikiPageWikiLink Q245450.
- Q1006531 wikiPageWikiLink Q248.
- Q1006531 wikiPageWikiLink Q269878.
- Q1006531 wikiPageWikiLink Q2878.
- Q1006531 wikiPageWikiLink Q3021749.
- Q1006531 wikiPageWikiLink Q3441496.
- Q1006531 wikiPageWikiLink Q352090.
- Q1006531 wikiPageWikiLink Q41506.
- Q1006531 wikiPageWikiLink Q44337.
- Q1006531 wikiPageWikiLink Q49008.
- Q1006531 wikiPageWikiLink Q4979897.
- Q1006531 wikiPageWikiLink Q5006861.
- Q1006531 wikiPageWikiLink Q5167446.
- Q1006531 wikiPageWikiLink Q529886.
- Q1006531 wikiPageWikiLink Q623950.
- Q1006531 wikiPageWikiLink Q6520159.
- Q1006531 wikiPageWikiLink Q6571111.
- Q1006531 wikiPageWikiLink Q7243214.
- Q1006531 wikiPageWikiLink Q7280126.
- Q1006531 wikiPageWikiLink Q8380265.
- Q1006531 wikiPageWikiLink Q846862.
- Q1006531 wikiPageWikiLink Q8470619.
- Q1006531 wikiPageWikiLink Q913351.
- Q1006531 wikiPageWikiLink Q9165172.
- Q1006531 wikiPageWikiLink Q948010.
- Q1006531 comment "A discrete Hartley transform (DHT) is a Fourier-related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous applications in signal processing and related fields. Its main distinction from the DFT is that it transforms real inputs to real outputs, with no intrinsic involvement of complex numbers.".
- Q1006531 label "Discrete Hartley transform".