Fast Structural Two Dimensional Discrete Cosine Transform Algorithms

Jar-Ferr YANG; Chih-Peng FAN

Fast Structural Two Dimensional Discrete Cosine Transform Algorithms

Jar-Ferr YANG, Chih-Peng FAN

Full Text Views

0

Share
Cite this

Summary :

The matrix decomposition of transformation associated with the Kronecker product not only provides a thoughtful structure in hardware realization but also bestows a skillful tool for complexity evaluation. Hence, there are several fast algorithms developed to achieve efficient computation of two-dimensional (2-D) discrete cosine transform (DCT) with matrix decomposition techniques. However, we found that their derivations associated with their computation structures were not shown formally. In this paper, we propose formal derivations to remedy their deficiencies to achieve more structural 2-D DCT and inverse DCT (IDCT) algorithms. Furthermore, we also show that the remedied algorithms are with less computational complexity and more regular structure for realization.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.6 pp.1210-1215

Publication Date: 1998/06/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Digital Signal Processing

Cite this

Copy

Jar-Ferr YANG, Chih-Peng FAN, "Fast Structural Two Dimensional Discrete Cosine Transform Algorithms" in IEICE TRANSACTIONS on Fundamentals, vol. E81-A, no. 6, pp. 1210-1215, June 1998, doi: .
Abstract: The matrix decomposition of transformation associated with the Kronecker product not only provides a thoughtful structure in hardware realization but also bestows a skillful tool for complexity evaluation. Hence, there are several fast algorithms developed to achieve efficient computation of two-dimensional (2-D) discrete cosine transform (DCT) with matrix decomposition techniques. However, we found that their derivations associated with their computation structures were not shown formally. In this paper, we propose formal derivations to remedy their deficiencies to achieve more structural 2-D DCT and inverse DCT (IDCT) algorithms. Furthermore, we also show that the remedied algorithms are with less computational complexity and more regular structure for realization.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e81-a_6_1210/_p

Copy

@ARTICLE{e81-a_6_1210,
author={Jar-Ferr YANG, Chih-Peng FAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fast Structural Two Dimensional Discrete Cosine Transform Algorithms},
year={1998},
volume={E81-A},
number={6},
pages={1210-1215},
abstract={The matrix decomposition of transformation associated with the Kronecker product not only provides a thoughtful structure in hardware realization but also bestows a skillful tool for complexity evaluation. Hence, there are several fast algorithms developed to achieve efficient computation of two-dimensional (2-D) discrete cosine transform (DCT) with matrix decomposition techniques. However, we found that their derivations associated with their computation structures were not shown formally. In this paper, we propose formal derivations to remedy their deficiencies to achieve more structural 2-D DCT and inverse DCT (IDCT) algorithms. Furthermore, we also show that the remedied algorithms are with less computational complexity and more regular structure for realization.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Fast Structural Two Dimensional Discrete Cosine Transform Algorithms
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1210
EP - 1215
AU - Jar-Ferr YANG
AU - Chih-Peng FAN
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1998
AB - The matrix decomposition of transformation associated with the Kronecker product not only provides a thoughtful structure in hardware realization but also bestows a skillful tool for complexity evaluation. Hence, there are several fast algorithms developed to achieve efficient computation of two-dimensional (2-D) discrete cosine transform (DCT) with matrix decomposition techniques. However, we found that their derivations associated with their computation structures were not shown formally. In this paper, we propose formal derivations to remedy their deficiencies to achieve more structural 2-D DCT and inverse DCT (IDCT) algorithms. Furthermore, we also show that the remedied algorithms are with less computational complexity and more regular structure for realization.
ER -