Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1504
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electrical Engineering | - |
| dc.creator | Chan, YH | - |
| dc.creator | Siu, WC | - |
| dc.date.accessioned | 2014-12-11T08:26:26Z | - |
| dc.date.available | 2014-12-11T08:26:26Z | - |
| dc.identifier.isbn | 0-7803-1254-6 | - |
| dc.identifier.uri | http://hdl.handle.net/10397/1504 | - |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE | en_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.rights | This 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.subject | Algorithms | en_US |
| dc.subject | Computational complexity | en_US |
| dc.subject | Digital arithmetic | en_US |
| dc.title | On the theoretical lower bound of the multiplicative complexity for DCT | en_US |
| dc.type | Conference Paper | en_US |
| dcterms.abstract | In 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.accessRights | open access | en_US |
| dcterms.bibliographicCitation | 1993 IEEE International Symposium on Circuits and Systems : Chicago, IL, May 3-6, 1993, p. 750-753 | - |
| dcterms.issued | 1993 | - |
| dc.identifier.scopus | 2-s2.0-0027237920 | - |
| dc.description.oa | Version of Record | en_US |
| dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
| dc.description.pubStatus | Published | en_US |
| Appears in Collections: | Conference Paper | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Multiplicative complexity for DCT_93.pdf | 304.6 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
147
Last Week
2
2
Last month
Citations as of Apr 21, 2024
Downloads
146
Citations as of Apr 21, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.