Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1504
DC FieldValueLanguage
dc.contributorDepartment of Electrical Engineering-
dc.creatorChan, YH-
dc.creatorSiu, WC-
dc.date.accessioned2014-12-11T08:26:26Z-
dc.date.available2014-12-11T08:26:26Z-
dc.identifier.isbn0-7803-1254-6-
dc.identifier.urihttp://hdl.handle.net/10397/1504-
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.rights© 1993 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.subjectComputational complexityen_US
dc.subjectDigital arithmeticen_US
dc.titleOn the theoretical lower bound of the multiplicative complexity for DCTen_US
dc.typeConference Paperen_US
dcterms.abstractIn this paper, we present a discussion on DCT algorithms based on convolutions. It is shown that these approaches can provide effective solutions to realize DCTs. Besides, they provide a theoretical lower bound on the number of multiplications required for the realization of DCTs. Some fast short length DCT algorithms have also been derived from these approaches.-
dcterms.bibliographicCitation1993 IEEE International Symposium on Circuits and Systems : Chicago, IL, May 3-6, 1993, p. 750-753-
dcterms.issued1993-
dc.identifier.scopus2-s2.0-0027237920-
dc.description.oapublished_final-
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Multiplicative complexity for DCT_93.pdf304.6 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show simple item record
PIRA download icon_1.1View/Download Full Text

Page view(s)

892
Last Week
2
Last month
Citations as of Oct 25, 2020

Download(s)

216
Citations as of Oct 25, 2020

Google ScholarTM

Check


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