Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/287
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electronic and Information Engineering | - |
dc.creator | Chau, LP | - |
dc.creator | Siu, WC | - |
dc.date.accessioned | 2014-12-11T08:28:24Z | - |
dc.date.available | 2014-12-11T08:28:24Z | - |
dc.identifier.issn | 1070-9908 | - |
dc.identifier.uri | http://hdl.handle.net/10397/287 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2000 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 | Discrete cosine transform (DCT) | en_US |
dc.subject | Recursive algorithm | en_US |
dc.title | Efficient recursive algorithm for the inverse discrete cosine transform | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 276 | - |
dc.identifier.epage | 277 | - |
dc.identifier.volume | 7 | - |
dc.identifier.issue | 10 | - |
dc.identifier.doi | 10.1109/97.870678 | - |
dcterms.abstract | Recursive algorithms have been found very effective for realization using software and very large scale integrated circuit (VLSI) techniques. Recently, some recursive algorithms have been proposed for the realization of the inverse discrete cosine transform (IDCT). In this paper, an efficient recursive algorithm for the IDCT with arbitrary length is presented. By using some appropriate iterative techniques, the formulation of the IDCT can be implemented effectively using recursive equations, and the hardware complexity is further reduced as compared with the approaches in the literature. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IEEE signal processing letters, Oct. 2000, v. 7, no. 10, p. 276-277 | - |
dcterms.isPartOf | IEEE signal processing letters | - |
dcterms.issued | 2000-10 | - |
dc.identifier.isi | WOS:000089576100003 | - |
dc.identifier.scopus | 2-s2.0-0034294285 | - |
dc.identifier.eissn | 1558-2361 | - |
dc.identifier.rosgroupid | r01639 | - |
dc.description.ros | 2000-2001 > Academic research: refereed > Publication in refereed journal | - |
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: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
inverse-discrete_00.pdf | 41.08 kB | Adobe PDF | View/Open |
Page views
83
Last Week
2
2
Last month
Citations as of Apr 14, 2024
Downloads
105
Citations as of Apr 14, 2024
SCOPUSTM
Citations
13
Last Week
0
0
Last month
0
0
Citations as of Apr 12, 2024
WEB OF SCIENCETM
Citations
8
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.