Fast Algorithm Designs for Low-Complexity 4<cd0215f.gif>4 Discrete Cosine Transform

Chih-Peng FAN

doi:10.1093/ietfec/e88-a.11.3225

Fast Algorithm Designs for Low-Complexity 44 Discrete Cosine Transform

Chih-Peng FAN

Full Text Views

0

Share
Cite this

Summary :

In the letter, the fast one-dimensional (1-D) and two-dimensional (2-D) algorithms for realizing low-complexity 44 discrete cosine transform (DCT) for H.264 applications are developed. Through applying matrix utilizations with Kronecker product and direct sum, the efficient fast 2-D 44 DCT algorithm can be developed from the proposed fast 1-D 44 DCT algorithm by matrix decompositions. The fast 1-D and 2-D low-complexity 44 DCT algorithms requires fewer multiplications and additions than other fast DCT algorithms. Owing to regular modularity, the proposed fast algorithms can achieve real-time H.264 video signal processing with VLSI implementation.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.11 pp.3225-3229

Publication Date: 2005/11/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.11.3225

Type of Manuscript: LETTER

Category: Digital Signal Processing

Cite this

Copy

Chih-Peng FAN, "Fast Algorithm Designs for Low-Complexity 44 Discrete Cosine Transform" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 11, pp. 3225-3229, November 2005, doi: 10.1093/ietfec/e88-a.11.3225.
Abstract: In the letter, the fast one-dimensional (1-D) and two-dimensional (2-D) algorithms for realizing low-complexity 44 discrete cosine transform (DCT) for H.264 applications are developed. Through applying matrix utilizations with Kronecker product and direct sum, the efficient fast 2-D 44 DCT algorithm can be developed from the proposed fast 1-D 44 DCT algorithm by matrix decompositions. The fast 1-D and 2-D low-complexity 44 DCT algorithms requires fewer multiplications and additions than other fast DCT algorithms. Owing to regular modularity, the proposed fast algorithms can achieve real-time H.264 video signal processing with VLSI implementation.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.11.3225/_p

Copy

@ARTICLE{e88-a_11_3225,
author={Chih-Peng FAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fast Algorithm Designs for Low-Complexity 44 Discrete Cosine Transform},
year={2005},
volume={E88-A},
number={11},
pages={3225-3229},
abstract={In the letter, the fast one-dimensional (1-D) and two-dimensional (2-D) algorithms for realizing low-complexity 44 discrete cosine transform (DCT) for H.264 applications are developed. Through applying matrix utilizations with Kronecker product and direct sum, the efficient fast 2-D 44 DCT algorithm can be developed from the proposed fast 1-D 44 DCT algorithm by matrix decompositions. The fast 1-D and 2-D low-complexity 44 DCT algorithms requires fewer multiplications and additions than other fast DCT algorithms. Owing to regular modularity, the proposed fast algorithms can achieve real-time H.264 video signal processing with VLSI implementation.},
keywords={},
doi={10.1093/ietfec/e88-a.11.3225},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Fast Algorithm Designs for Low-Complexity 44 Discrete Cosine Transform
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3225
EP - 3229
AU - Chih-Peng FAN
PY - 2005
DO - 10.1093/ietfec/e88-a.11.3225
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2005
AB - In the letter, the fast one-dimensional (1-D) and two-dimensional (2-D) algorithms for realizing low-complexity 44 discrete cosine transform (DCT) for H.264 applications are developed. Through applying matrix utilizations with Kronecker product and direct sum, the efficient fast 2-D 44 DCT algorithm can be developed from the proposed fast 1-D 44 DCT algorithm by matrix decompositions. The fast 1-D and 2-D low-complexity 44 DCT algorithms requires fewer multiplications and additions than other fast DCT algorithms. Owing to regular modularity, the proposed fast algorithms can achieve real-time H.264 video signal processing with VLSI implementation.
ER -