For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Fast DCT-SQ Scheme for Images
Yukihiro ARAI Takeshi AGUI Masayuki NAKAJIMA
IEICE TRANSACTIONS (1976-1990)
Publication Date: 1988/11/25
Print ISSN: 0000-0000
Type of Manuscript: LETTER
Category: Image Processing, Computer Graphics and Pattern Recognition
Full Text: PDF(136.1KB)
>>Buy this Article
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.