Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27052
Title: Direct formulation for the realization of discrete cosine transform using recursive structure
Authors: Chau, LP
Siu, WC 
Issue Date: 1995
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on circuits and systems. II, Analog and digital signal processing, 1995, v. 42, no. 1, p. 50-52 How to cite?
Journal: IEEE transactions on circuits and systems. II, Analog and digital signal processing 
Abstract: Effective formulations for the conversion of the Discrete Fourier Transform (DFT) into recursive structure are available and have been found very effective for realization using software, hardware, and VLSI techniques. Little research work has been reported on an effective way to convert the Discrete Cosine Transform (DCT) into recursive form and the related realization. In this paper, we propose a new method to convert a prime length DCT into a recursive structure. A trivial approach is to use a conventional approach to convert the DCT into DFT and to apply Goertzel's algorithm for the rest of the realization. However, this method is inefficient and requires the realization of long length DFT's. In our approach, we suggest using some suitable mappings to convert a prime length DCT into two suitable transforms with approximately half of the original length to effect fast realization. The number of operations is greatly reduced and the structure is extremely regular.
URI: http://hdl.handle.net/10397/27052
ISSN: 1057-7130
DOI: 10.1109/82.363541
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
0
Last month
0
Citations as of Dec 9, 2017

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Nov 13, 2017

Page view(s)

42
Last Week
1
Last month
Checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric



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