File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast algorithms for computing the discrete cosine transform

TitleFast algorithms for computing the discrete cosine transform
Authors
Issue Date1992
Citation
Ieee Transactions On Circuits And Systems Ii: Analog And Digital Signal Processing, 1992, v. 39 n. 3, p. 185-190 How to Cite?
AbstractEfficient methods for mapping odd-length type-II, type-III, and type-IV DCTs to a real-valued DFT are presented. It is found that odd-length type-II and type-III DCTs can be transformed, by means of an index mapping, to a real-valued DFT of the same length using permutations and sign changes only. The real-valued DFT can then be computed by efficient real-valued FFT algorithms such as the prime factor algorithm. Similar mapping is introduced to convert a type-IV DCT to a real-valued DFT up to a scaling factor and some additions. Methods for computing DCTs with even lengths are also discussed.
Persistent Identifierhttp://hdl.handle.net/10722/154961
ISSN
2006 Impact Factor: 0.922
2007 SCImago Journal Rankings: 1.092
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChan, ShingChowen_US
dc.contributor.authorHo, KaLeungen_US
dc.date.accessioned2012-08-08T08:31:18Z-
dc.date.available2012-08-08T08:31:18Z-
dc.date.issued1992en_US
dc.identifier.citationIeee Transactions On Circuits And Systems Ii: Analog And Digital Signal Processing, 1992, v. 39 n. 3, p. 185-190en_US
dc.identifier.issn1057-7130en_US
dc.identifier.urihttp://hdl.handle.net/10722/154961-
dc.description.abstractEfficient methods for mapping odd-length type-II, type-III, and type-IV DCTs to a real-valued DFT are presented. It is found that odd-length type-II and type-III DCTs can be transformed, by means of an index mapping, to a real-valued DFT of the same length using permutations and sign changes only. The real-valued DFT can then be computed by efficient real-valued FFT algorithms such as the prime factor algorithm. Similar mapping is introduced to convert a type-IV DCT to a real-valued DFT up to a scaling factor and some additions. Methods for computing DCTs with even lengths are also discussed.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processingen_US
dc.titleFast algorithms for computing the discrete cosine transformen_US
dc.typeArticleen_US
dc.identifier.emailChan, ShingChow:scchan@eee.hku.hken_US
dc.identifier.emailHo, KaLeung:klho@eee.hku.hken_US
dc.identifier.authorityChan, ShingChow=rp00094en_US
dc.identifier.authorityHo, KaLeung=rp00117en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/82.127302en_US
dc.identifier.scopuseid_2-s2.0-0026838109en_US
dc.identifier.volume39en_US
dc.identifier.issue3en_US
dc.identifier.spage185en_US
dc.identifier.epage190en_US
dc.identifier.isiWOS:A1992HK98800006-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChan, ShingChow=13310287100en_US
dc.identifier.scopusauthoridHo, KaLeung=7403581592en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats