Fast algorithm suitable for DCT implementation with integer multiplication

Yeonsik Jeong; Imgeun Lee; Taekhyun Yun; Gooman Park; Kyu Tae Park

Fast algorithm suitable for DCT implementation with integer multiplication

Yeonsik Jeong, Imgeun Lee, Taekhyun Yun, Gooman Park, Kyu Tae Park

Media IT Engineering Program

Yonsei University

Research output: Contribution to conference › Paper › peer-review

9 Scopus citations

Abstract

The Discrete Cosine Transform (DCT) has wide applications in speech and image data compression. In this paper, we propose novel fast DCT algorithm. The proposed algorithm is based on symmetric property of the DCT kernel matrix. This decomposes N-point into N/2-point DCT and can be iterated further. Because it has fewer multiplication steps, when converting the algorithm into hardware implementation with integer computation, we can reduce the error.

Original language	English
Pages	784-787
Number of pages	4
State	Published - 1996
Event	Proceedings of the 1996 IEEE Region 10 TENCON - Digital Signal Processing Applications Conference. Part 2 (of 2) - Perth, Aust Duration: 26 Nov 1996 → 29 Nov 1996

Conference

Conference	Proceedings of the 1996 IEEE Region 10 TENCON - Digital Signal Processing Applications Conference. Part 2 (of 2)
City	Perth, Aust
Period	26/11/96 → 29/11/96

Cite this

@conference{316b0767b3c24722b8f2baff7b573d3b,

title = "Fast algorithm suitable for DCT implementation with integer multiplication",

abstract = "The Discrete Cosine Transform (DCT) has wide applications in speech and image data compression. In this paper, we propose novel fast DCT algorithm. The proposed algorithm is based on symmetric property of the DCT kernel matrix. This decomposes N-point into N/2-point DCT and can be iterated further. Because it has fewer multiplication steps, when converting the algorithm into hardware implementation with integer computation, we can reduce the error.",

author = "Yeonsik Jeong and Imgeun Lee and Taekhyun Yun and Gooman Park and Park, \{Kyu Tae\}",

year = "1996",

language = "English",

pages = "784--787",

note = "Proceedings of the 1996 IEEE Region 10 TENCON - Digital Signal Processing Applications Conference. Part 2 (of 2) ; Conference date: 26-11-1996 Through 29-11-1996",

}

TY - CONF

T1 - Fast algorithm suitable for DCT implementation with integer multiplication

AU - Jeong, Yeonsik

AU - Lee, Imgeun

AU - Yun, Taekhyun

AU - Park, Gooman

AU - Park, Kyu Tae

PY - 1996

Y1 - 1996

N2 - The Discrete Cosine Transform (DCT) has wide applications in speech and image data compression. In this paper, we propose novel fast DCT algorithm. The proposed algorithm is based on symmetric property of the DCT kernel matrix. This decomposes N-point into N/2-point DCT and can be iterated further. Because it has fewer multiplication steps, when converting the algorithm into hardware implementation with integer computation, we can reduce the error.

AB - The Discrete Cosine Transform (DCT) has wide applications in speech and image data compression. In this paper, we propose novel fast DCT algorithm. The proposed algorithm is based on symmetric property of the DCT kernel matrix. This decomposes N-point into N/2-point DCT and can be iterated further. Because it has fewer multiplication steps, when converting the algorithm into hardware implementation with integer computation, we can reduce the error.

UR - https://www.scopus.com/pages/publications/0030313835

M3 - Paper

AN - SCOPUS:0030313835

SP - 784

EP - 787

T2 - Proceedings of the 1996 IEEE Region 10 TENCON - Digital Signal Processing Applications Conference. Part 2 (of 2)

Y2 - 26 November 1996 through 29 November 1996

ER -

Fast algorithm suitable for DCT implementation with integer multiplication

Abstract

Conference

Other files and links

Fingerprint

Cite this