File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast odd discrete cosine transform algorithms

TitleFast odd discrete cosine transform algorithms
Authors
Chan, SCHo, KL
KeywordsAlgorithms
Mathematical techniques
Modelling
Transforms
Issue Date1990
PublisherThe Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/EL
Citation
Electronics Letters, 1990, v. 26 n. 8, p. 503-505 How to Cite?
AbstractIt is shown that an N point type I odd discrete cosine transform can be reformulated as a (2N - 1) point DFT of a real-symmetric sequence efficiently computed by the real-symmetric PFA-FFT. Using simple index mappings, the type II and II ODCTs are efficiently computed from the ODCT-I of the same length. The ODCT-IV are then computed from ODCT-II or III using simple recurrence formulas.
Persistent Identifierhttp://hdl.handle.net/10722/154910
ISSN
0013-5194
2023 Impact Factor: 0.7
2023 SCImago Journal Rankings: 0.323
ISI Accession Number ID
WOS:A1990DB40700005

 

DC FieldValueLanguage
dc.contributor.authorChan, SCen_US
dc.contributor.authorHo, KLen_US
dc.date.accessioned2012-08-08T08:31:07Z-
dc.date.available2012-08-08T08:31:07Z-
dc.date.issued1990en_US
dc.identifier.citationElectronics Letters, 1990, v. 26 n. 8, p. 503-505en_US
dc.identifier.issn0013-5194en_US
dc.identifier.urihttp://hdl.handle.net/10722/154910-
dc.description.abstractIt is shown that an N point type I odd discrete cosine transform can be reformulated as a (2N - 1) point DFT of a real-symmetric sequence efficiently computed by the real-symmetric PFA-FFT. Using simple index mappings, the type II and II ODCTs are efficiently computed from the ODCT-I of the same length. The ODCT-IV are then computed from ODCT-II or III using simple recurrence formulas.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.subjectMathematical techniques-
dc.subjectModelling-
dc.subjectTransforms-
dc.titleFast odd discrete cosine transform algorithmsen_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-0025417625en_US
dc.identifier.volume26en_US
dc.identifier.issue8en_US
dc.identifier.spage503en_US
dc.identifier.epage505en_US
dc.identifier.isiWOS:A1990DB40700005-
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