Fixed-point IDCT without multiplications based on B.G. Lee's algorithm-Reference-Cited by-同舟云学术

Fixed-point IDCT without multiplications based on B.G. Lee's algorithm

Published:2009-07 Issue:4 Volume:19 Page:770-777
ISSN:1051-2004
Container-title:Digital Signal Processing
language:en
Short-container-title:Digital Signal Processing

Author:

Zhu Pingping,Liu Jianguo,Dai Shengkui

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Signal Processing,Artificial Intelligence,Applied Mathematics,Computer Vision and Pattern Recognition,Statistics, Probability and Uncertainty,Computational Theory and Mathematics

Reference9 articles.

1. A new algorithm to compute the discrete cosine transform;Lee;IEEE Trans. Acoust. Speech Signal Process.,1984

2. JPEG Still Image Data Compression Standard;Pennebaker,1993

3. C. Loeffler, A. Ligtenberg, G. Moschytz, Practical fast 1-D DCT algorithms with 11 multiplications, in: International Conference on Acoustics, Speech, and Signal Processing (ICASSP '89), 1989, pp. 988–999

4. Efficient recursive structures for forward and inverse discrete cosine transform;Chen;IEEE Trans. Signal Process.,2004

5. A new multidimensional recursive architecture for computing the discrete cosine transform;Elnaggar;IEEE Trans. Circuits Systems Video Technol.,2000

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Realization of Systolic Architecture of Discrete Cosine Transform;2021 International Conference on Computer Communication and Informatics (ICCCI);2021-01-27

2. Novel VLSI Algorithm and Architecture with Good Quantization Properties for a High-Throughput Area Efficient Systolic Array Implementation of DCT;EURASIP Journal on Advances in Signal Processing;2010-12-28