File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficient index mapping for computing discrete cosine transform

TitleEfficient index mapping for computing discrete cosine transform
Authors
Chan, SCHo, KL
KeywordsAlgorithms
Signal processing
Transforms
Issue Date1989
PublisherThe Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/EL
Citation
Electronics Letters, 1989, v. 25 n. 22, p. 1499-1500 How to Cite?
AbstractAn efficient algorithm for computing the discrete cosine transform (DCT) is presented. It is based on an index mapping which converts an odd-length DCT 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. The algorithm is more efficient than an earlier one because no postmultiplications are required.
Persistent Identifierhttp://hdl.handle.net/10722/154895
ISSN
0013-5194
2023 Impact Factor: 0.7
2023 SCImago Journal Rankings: 0.323
ISI Accession Number ID
WOS:A1989AZ48200022

 

DC FieldValueLanguage
dc.contributor.authorChan, SCen_US
dc.contributor.authorHo, KLen_US
dc.date.accessioned2012-08-08T08:31:04Z-
dc.date.available2012-08-08T08:31:04Z-
dc.date.issued1989en_US
dc.identifier.citationElectronics Letters, 1989, v. 25 n. 22, p. 1499-1500en_US
dc.identifier.issn0013-5194en_US
dc.identifier.urihttp://hdl.handle.net/10722/154895-
dc.description.abstractAn efficient algorithm for computing the discrete cosine transform (DCT) is presented. It is based on an index mapping which converts an odd-length DCT 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. The algorithm is more efficient than an earlier one because no postmultiplications are required.en_US
dc.languageengen_US
dc.publisherThe Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/ELen_US
dc.relation.ispartofElectronics Lettersen_US
dc.subjectAlgorithms-
dc.subjectSignal processing-
dc.subjectTransforms-
dc.titleEfficient index mapping for computing discrete cosine transformen_US
dc.typeArticleen_US
dc.identifier.emailChan, SC:scchan@eee.hku.hken_US
dc.identifier.emailHo, KL:klho@eee.hku.hken_US
dc.identifier.authorityChan, SC=rp00094en_US
dc.identifier.authorityHo, KL=rp00117en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0024751470en_US
dc.identifier.volume25en_US
dc.identifier.issue22en_US
dc.identifier.spage1499en_US
dc.identifier.epage1500en_US
dc.identifier.isiWOS:A1989AZ48200022-
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridChan, SC=13310287100en_US
dc.identifier.scopusauthoridHo, KL=7403581592en_US
dc.identifier.issnl0013-5194-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats