Multiplierless fast algorithm for DCT via fast Hartley transform

Taizo Suzuki; Yuichi Tanaka; Masaaki Ikehara; Hirotomo Aso

doi:10.1109/ICASSP.2012.6288663

Multiplierless fast algorithm for DCT via fast Hartley transform

Taizo Suzuki, Yuichi Tanaka, Masaaki Ikehara, Hirotomo Aso

Department of Electronics and Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

Discrete cosine transform (DCT) is known as efficient frequency transform, and when it is implemented on software/hardware, multiplier is undesirable for faster implementation. This paper presents a realization of multiplierless fast DCT for lossy image/video coding on arbitrary devices. First, the proposed DCT is constructed by using fast Hartley transform (FHT). Next, the redundancy of the structure is eliminated by using several characteristics of rotation matrix. Then, multiplierless DCT is obtained by approximating rotation matrices to multiplierless lifting structures with adders and bit-shifters. Finally, the proposed DCT is validated by comparing with the conventional DCTs in image coding.

Original language	English
Title of host publication	2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings
Pages	3469-3472
Number of pages	4
DOIs	https://doi.org/10.1109/ICASSP.2012.6288663
Publication status	Published - 2012
Event	2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Kyoto, Japan Duration: 2012 Mar 25 → 2012 Mar 30

Publication series

Name	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)	1520-6149

Other

Other	2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012
Country/Territory	Japan
City	Kyoto
Period	12/3/25 → 12/3/30

Keywords

Discrete cosine transform (DCT)
fast Hartley transform (FHT)
multiplierless lifting structure

ASJC Scopus subject areas

Software
Signal Processing
Electrical and Electronic Engineering

Access to Document

10.1109/ICASSP.2012.6288663

Cite this

Suzuki, T., Tanaka, Y., Ikehara, M., & Aso, H. (2012). Multiplierless fast algorithm for DCT via fast Hartley transform. In 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings (pp. 3469-3472). Article 6288663 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2012.6288663

Multiplierless fast algorithm for DCT via fast Hartley transform. / Suzuki, Taizo; Tanaka, Yuichi; Ikehara, Masaaki et al.
2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings. 2012. p. 3469-3472 6288663 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Suzuki, T, Tanaka, Y, Ikehara, M & Aso, H 2012, Multiplierless fast algorithm for DCT via fast Hartley transform. in 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings., 6288663, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, pp. 3469-3472, 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012, Kyoto, Japan, 12/3/25. https://doi.org/10.1109/ICASSP.2012.6288663

Suzuki T, Tanaka Y, Ikehara M, Aso H. Multiplierless fast algorithm for DCT via fast Hartley transform. In 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings. 2012. p. 3469-3472. 6288663. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). doi: 10.1109/ICASSP.2012.6288663

@inproceedings{fea1d8402a46418d939db1618530fdfc,

title = "Multiplierless fast algorithm for DCT via fast Hartley transform",

abstract = "Discrete cosine transform (DCT) is known as efficient frequency transform, and when it is implemented on software/hardware, multiplier is undesirable for faster implementation. This paper presents a realization of multiplierless fast DCT for lossy image/video coding on arbitrary devices. First, the proposed DCT is constructed by using fast Hartley transform (FHT). Next, the redundancy of the structure is eliminated by using several characteristics of rotation matrix. Then, multiplierless DCT is obtained by approximating rotation matrices to multiplierless lifting structures with adders and bit-shifters. Finally, the proposed DCT is validated by comparing with the conventional DCTs in image coding.",

keywords = "Discrete cosine transform (DCT), fast Hartley transform (FHT), multiplierless lifting structure",

author = "Taizo Suzuki and Yuichi Tanaka and Masaaki Ikehara and Hirotomo Aso",

year = "2012",

doi = "10.1109/ICASSP.2012.6288663",

language = "English",

isbn = "9781467300469",

series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

pages = "3469--3472",

booktitle = "2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings",

note = "2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 ; Conference date: 25-03-2012 Through 30-03-2012",

}

TY - GEN

T1 - Multiplierless fast algorithm for DCT via fast Hartley transform

AU - Suzuki, Taizo

AU - Tanaka, Yuichi

AU - Ikehara, Masaaki

AU - Aso, Hirotomo

PY - 2012

Y1 - 2012

N2 - Discrete cosine transform (DCT) is known as efficient frequency transform, and when it is implemented on software/hardware, multiplier is undesirable for faster implementation. This paper presents a realization of multiplierless fast DCT for lossy image/video coding on arbitrary devices. First, the proposed DCT is constructed by using fast Hartley transform (FHT). Next, the redundancy of the structure is eliminated by using several characteristics of rotation matrix. Then, multiplierless DCT is obtained by approximating rotation matrices to multiplierless lifting structures with adders and bit-shifters. Finally, the proposed DCT is validated by comparing with the conventional DCTs in image coding.

AB - Discrete cosine transform (DCT) is known as efficient frequency transform, and when it is implemented on software/hardware, multiplier is undesirable for faster implementation. This paper presents a realization of multiplierless fast DCT for lossy image/video coding on arbitrary devices. First, the proposed DCT is constructed by using fast Hartley transform (FHT). Next, the redundancy of the structure is eliminated by using several characteristics of rotation matrix. Then, multiplierless DCT is obtained by approximating rotation matrices to multiplierless lifting structures with adders and bit-shifters. Finally, the proposed DCT is validated by comparing with the conventional DCTs in image coding.

KW - Discrete cosine transform (DCT)

KW - fast Hartley transform (FHT)

KW - multiplierless lifting structure

UR - http://www.scopus.com/inward/record.url?scp=84867614627&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867614627&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2012.6288663

DO - 10.1109/ICASSP.2012.6288663

M3 - Conference contribution

AN - SCOPUS:84867614627

SN - 9781467300469

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

SP - 3469

EP - 3472

BT - 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings

T2 - 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012

Y2 - 25 March 2012 through 30 March 2012

ER -

Multiplierless fast algorithm for DCT via fast Hartley transform

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this