Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1480
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electrical Engineering | - |
dc.creator | Chan, YH | - |
dc.creator | Chau, LP | - |
dc.creator | Siu, WC | - |
dc.date.accessioned | 2014-12-11T08:28:26Z | - |
dc.date.available | 2014-12-11T08:28:26Z | - |
dc.identifier.issn | 1051-8215 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1480 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 1994 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 | Data structures | en_US |
dc.subject | Fourier transforms | en_US |
dc.subject | Image processing | en_US |
dc.subject | Recursive functions | en_US |
dc.title | Efficient implementation of discrete cosine transform using recursive filter structure | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 550 | - |
dc.identifier.epage | 552 | - |
dc.identifier.volume | 4 | - |
dc.identifier.issue | 6 | - |
dc.identifier.doi | 10.1109/76.340198 | - |
dcterms.abstract | In this paper, we generalize a formulation for converting a length-2ⁿ discrete cosine transform into n groups of equations, then apply a novel technique for its implementation. The sizes of the groups are 2[sup n-1], 2[sup n-2],... 2[sup 0] respectively, while their structures are extremely regular. The realization can then be converted into recursive filter form, which is of particularly simple for practical implementation. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IEEE transactions on circuits and systems for video technology, Dec. 1994, v. 4, no. 6, p. 550-552 | - |
dcterms.isPartOf | IEEE transactions on circuits and systems for video technology | - |
dcterms.issued | 1994-12 | - |
dc.identifier.isi | WOS:A1994PZ22600005 | - |
dc.identifier.scopus | 2-s2.0-0028735323 | - |
dc.identifier.eissn | 1558-2205 | - |
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 | |
---|---|---|---|---|
Implementation of discrete cosine transform_94.pdf | 266.89 kB | Adobe PDF | View/Open |
Page views
106
Last Week
1
1
Last month
Citations as of Mar 24, 2024
Downloads
187
Citations as of Mar 24, 2024
SCOPUSTM
Citations
22
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
WEB OF SCIENCETM
Citations
21
Last Week
1
1
Last month
0
0
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.