A Fast DCT-SQ Scheme for Images

Yukihiro ARAI; Takeshi AGUI; Masayuki NAKAJIMA

A Fast DCT-SQ Scheme for Images

Yukihiro ARAI, Takeshi AGUI, Masayuki NAKAJIMA

Full Text Views

0

Cite this

Summary :

The sequence of 8-point DCT and scalar quantization is effective in image data compression. The operation is executed very efficiently, if the DCT coefficients need not to be found explicitly. The present paper proposes a method, requiring only five times of multiplication for the transform. The 8-point DCT can be comopsed from the 16-point DFT which gives only the real parts of coefficients, and final scaling. The real part DFT can be implemented by the small FFT Winograd algorithm, which requires only five multiplications. The final scaling can be combined with the quantizing matrix without any change in arithmetic complexity of the qunatizer. Since each signal path in the proposed algorithm has one multiplication at most, the five multiplications can be executed in parallel. This will make the hardware implementation of the algorithm effective.

Publication: IEICE TRANSACTIONS on transactions Vol.E71-E No.11 pp.1095-1097

Publication Date: 1988/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Image Processing, Computer Graphics and Pattern Recognition

Authors

Yukihiro ARAI
Takeshi AGUI
Masayuki NAKAJIMA

Keyword

Cite this

Copy

Yukihiro ARAI, Takeshi AGUI, Masayuki NAKAJIMA, "A Fast DCT-SQ Scheme for Images" in IEICE TRANSACTIONS on transactions, vol. E71-E, no. 11, pp. 1095-1097, November 1988, doi: .
Abstract: The sequence of 8-point DCT and scalar quantization is effective in image data compression. The operation is executed very efficiently, if the DCT coefficients need not to be found explicitly. The present paper proposes a method, requiring only five times of multiplication for the transform. The 8-point DCT can be comopsed from the 16-point DFT which gives only the real parts of coefficients, and final scaling. The real part DFT can be implemented by the small FFT Winograd algorithm, which requires only five multiplications. The final scaling can be combined with the quantizing matrix without any change in arithmetic complexity of the qunatizer. Since each signal path in the proposed algorithm has one multiplication at most, the five multiplications can be executed in parallel. This will make the hardware implementation of the algorithm effective.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e71-e_11_1095/_p

Copy

@ARTICLE{e71-e_11_1095,
author={Yukihiro ARAI, Takeshi AGUI, Masayuki NAKAJIMA, },
journal={IEICE TRANSACTIONS on transactions},
title={A Fast DCT-SQ Scheme for Images},
year={1988},
volume={E71-E},
number={11},
pages={1095-1097},
abstract={The sequence of 8-point DCT and scalar quantization is effective in image data compression. The operation is executed very efficiently, if the DCT coefficients need not to be found explicitly. The present paper proposes a method, requiring only five times of multiplication for the transform. The 8-point DCT can be comopsed from the 16-point DFT which gives only the real parts of coefficients, and final scaling. The real part DFT can be implemented by the small FFT Winograd algorithm, which requires only five multiplications. The final scaling can be combined with the quantizing matrix without any change in arithmetic complexity of the qunatizer. Since each signal path in the proposed algorithm has one multiplication at most, the five multiplications can be executed in parallel. This will make the hardware implementation of the algorithm effective.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - A Fast DCT-SQ Scheme for Images
T2 - IEICE TRANSACTIONS on transactions
SP - 1095
EP - 1097
AU - Yukihiro ARAI
AU - Takeshi AGUI
AU - Masayuki NAKAJIMA
PY - 1988
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E71-E
IS - 11
JA - IEICE TRANSACTIONS on transactions
Y1 - November 1988
AB - The sequence of 8-point DCT and scalar quantization is effective in image data compression. The operation is executed very efficiently, if the DCT coefficients need not to be found explicitly. The present paper proposes a method, requiring only five times of multiplication for the transform. The 8-point DCT can be comopsed from the 16-point DFT which gives only the real parts of coefficients, and final scaling. The real part DFT can be implemented by the small FFT Winograd algorithm, which requires only five multiplications. The final scaling can be combined with the quantizing matrix without any change in arithmetic complexity of the qunatizer. Since each signal path in the proposed algorithm has one multiplication at most, the five multiplications can be executed in parallel. This will make the hardware implementation of the algorithm effective.
ER -