Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1511
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electrical Engineering-
dc.creatorChan, YH-
dc.creatorSiu, WC-
dc.date.accessioned2014-12-11T08:26:28Z-
dc.date.available2014-12-11T08:26:28Z-
dc.identifier.urihttp://hdl.handle.net/10397/1511-
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.rights© 1991 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_US
dc.rightsThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en_US
dc.subjectAlgorithmsen_US
dc.subjectBandwidth compressionen_US
dc.subjectComputational complexityen_US
dc.subjectFourier transformsen_US
dc.subjectImage codingen_US
dc.subjectImage compressionen_US
dc.subjectMathematical transformationsen_US
dc.titleSymmetric realization of DCT for multi-dimensional data compressionen_US
dc.typeConference Paperen_US
dcterms.abstractThe row-column approach is widely used for the realization of multi-dimensional DCT due to its simple and flexible structure. In this paper, we propose a new DCT algorithm which is most suitable for the realization of multi-dimensional DCT with the row-column decomposition technique. By using this new algorithm, the saving in terms of computational complexity is exponentially proportional to the degree of dimension compared with any other 1-D DCT algorithms. On the other hand, this new algorithm can also achieve additional saving in terms of the number of multiplications when the complete DCT realization is not necessary. These two important properties make the algorithm very suitable for the realization of multi-dimensional DCT for image compression.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationChina 1991 International Conference on Circuits and Systems : conference proceedings : 16-17 June 1991, Shenzhen University, Shenzhen, China, v. 1, p. 309-312-
dcterms.issued1991-
dc.identifier.scopus2-s2.0-0026271829-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Symmetric Realization of DCT for Multi-dim Data Comp_91.pdf407.39 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Show simple item record

Page views

42
Last Week
0
Last month
Citations as of Jun 19, 2022

Downloads

80
Citations as of Jun 19, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.