File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A new two-dimensional fast cosine transform algorithm

TitleA new two-dimensional fast cosine transform algorithm
Authors
Issue Date1991
Citation
Ieee Transactions On Signal Processing, 1991, v. 39 n. 2, p. 481-485 How to Cite?
AbstractA novel algorithm for computing the two-dimensional discrete cosine transform (2-D DCT) is presented. It is based on a one-dimensional fast cosine transform (1-D FCT) algorithm. Instead of computing the 2-D transform using the row-column method, the 1-D algorithm is extended by means of the vector-radix approach. Derivation based on both the sequence splitting and Kronecker matrix product method are discussed. The sequence splitting approach has the advantage that all the underlying operations are shown clearly, while the matrix product representations are more compact and readily generalized to higher dimensions. The bit reversal operations are placed before the recursive additions so that the recursive operations can be performed in a very regular manner. This greatly simplifies the indexing problem in the software implementation of the algorithms. The complexity of the proposed algorithm is described. The vector-radix algorithm saves 25% multiplications as compared with the row-column method.
Persistent Identifierhttp://hdl.handle.net/10722/154935
ISSN
2015 Impact Factor: 2.624
2015 SCImago Journal Rankings: 2.004
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChan, SCen_US
dc.contributor.authorHo, KLen_US
dc.date.accessioned2012-08-08T08:31:12Z-
dc.date.available2012-08-08T08:31:12Z-
dc.date.issued1991en_US
dc.identifier.citationIeee Transactions On Signal Processing, 1991, v. 39 n. 2, p. 481-485en_US
dc.identifier.issn1053-587Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/154935-
dc.description.abstractA novel algorithm for computing the two-dimensional discrete cosine transform (2-D DCT) is presented. It is based on a one-dimensional fast cosine transform (1-D FCT) algorithm. Instead of computing the 2-D transform using the row-column method, the 1-D algorithm is extended by means of the vector-radix approach. Derivation based on both the sequence splitting and Kronecker matrix product method are discussed. The sequence splitting approach has the advantage that all the underlying operations are shown clearly, while the matrix product representations are more compact and readily generalized to higher dimensions. The bit reversal operations are placed before the recursive additions so that the recursive operations can be performed in a very regular manner. This greatly simplifies the indexing problem in the software implementation of the algorithms. The complexity of the proposed algorithm is described. The vector-radix algorithm saves 25% multiplications as compared with the row-column method.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Signal Processingen_US
dc.titleA new two-dimensional fast cosine transform algorithmen_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.doi10.1109/78.80833en_US
dc.identifier.scopuseid_2-s2.0-0026105329en_US
dc.identifier.volume39en_US
dc.identifier.issue2en_US
dc.identifier.spage481en_US
dc.identifier.epage485en_US
dc.identifier.isiWOS:A1991EU96300024-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChan, SC=13310287100en_US
dc.identifier.scopusauthoridHo, KL=7403581592en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats