Fast 2-Dimensional 8<cd0215f.gif>8 Integer Transform Algorithm Design for H.264/AVC Fidelity Range Extensions

Chih-Peng FAN

doi:10.1093/ietisy/e89-d.12.3006

Fast 2-Dimensional 88 Integer Transform Algorithm Design for H.264/AVC Fidelity Range Extensions

Chih-Peng FAN

Full Text Views

0

Share
Cite this

Summary :

In this letter, efficient two-dimensional (2-D) fast algorithms for realizations of 88 forward and inverse integer transforms in H.264/AVC fidelity range extensions (FRExt) are proposed. Based on matrix factorizations with Kronecker product and direct sum operations, efficient fast 2-D 88 forward and inverse integer transforms can be derived from the one-dimensional (1-D) fast 88 forward and inverse integer transforms through matrix operations. The proposed fast 2-D 88 forward and inverse integer transform designs don't require transpose memory in hardware realizations. The fast 2-D 88 integer transforms require fewer latency delays and provide a larger throughput rate than the row-column based method. With regular modularity, the proposed fast algorithms are suitable for VLSI implementations to achieve H.264/AVC FRExt high-profile signal processing.

Publication: IEICE TRANSACTIONS on Information Vol.E89-D No.12 pp.3006-3011

Publication Date: 2006/12/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1093/ietisy/e89-d.12.3006

Type of Manuscript: LETTER

Category: Image Processing and Video Processing

Cite this

Copy

Chih-Peng FAN, "Fast 2-Dimensional 88 Integer Transform Algorithm Design for H.264/AVC Fidelity Range Extensions" in IEICE TRANSACTIONS on Information, vol. E89-D, no. 12, pp. 3006-3011, December 2006, doi: 10.1093/ietisy/e89-d.12.3006.
Abstract: In this letter, efficient two-dimensional (2-D) fast algorithms for realizations of 88 forward and inverse integer transforms in H.264/AVC fidelity range extensions (FRExt) are proposed. Based on matrix factorizations with Kronecker product and direct sum operations, efficient fast 2-D 88 forward and inverse integer transforms can be derived from the one-dimensional (1-D) fast 88 forward and inverse integer transforms through matrix operations. The proposed fast 2-D 88 forward and inverse integer transform designs don't require transpose memory in hardware realizations. The fast 2-D 88 integer transforms require fewer latency delays and provide a larger throughput rate than the row-column based method. With regular modularity, the proposed fast algorithms are suitable for VLSI implementations to achieve H.264/AVC FRExt high-profile signal processing.
URL: https://globals.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.12.3006/_p

Copy

@ARTICLE{e89-d_12_3006,
author={Chih-Peng FAN, },
journal={IEICE TRANSACTIONS on Information},
title={Fast 2-Dimensional 88 Integer Transform Algorithm Design for H.264/AVC Fidelity Range Extensions},
year={2006},
volume={E89-D},
number={12},
pages={3006-3011},
abstract={In this letter, efficient two-dimensional (2-D) fast algorithms for realizations of 88 forward and inverse integer transforms in H.264/AVC fidelity range extensions (FRExt) are proposed. Based on matrix factorizations with Kronecker product and direct sum operations, efficient fast 2-D 88 forward and inverse integer transforms can be derived from the one-dimensional (1-D) fast 88 forward and inverse integer transforms through matrix operations. The proposed fast 2-D 88 forward and inverse integer transform designs don't require transpose memory in hardware realizations. The fast 2-D 88 integer transforms require fewer latency delays and provide a larger throughput rate than the row-column based method. With regular modularity, the proposed fast algorithms are suitable for VLSI implementations to achieve H.264/AVC FRExt high-profile signal processing.},
keywords={},
doi={10.1093/ietisy/e89-d.12.3006},
ISSN={1745-1361},
month={December},}

Copy

TY - JOUR
TI - Fast 2-Dimensional 88 Integer Transform Algorithm Design for H.264/AVC Fidelity Range Extensions
T2 - IEICE TRANSACTIONS on Information
SP - 3006
EP - 3011
AU - Chih-Peng FAN
PY - 2006
DO - 10.1093/ietisy/e89-d.12.3006
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2006
AB - In this letter, efficient two-dimensional (2-D) fast algorithms for realizations of 88 forward and inverse integer transforms in H.264/AVC fidelity range extensions (FRExt) are proposed. Based on matrix factorizations with Kronecker product and direct sum operations, efficient fast 2-D 88 forward and inverse integer transforms can be derived from the one-dimensional (1-D) fast 88 forward and inverse integer transforms through matrix operations. The proposed fast 2-D 88 forward and inverse integer transform designs don't require transpose memory in hardware realizations. The fast 2-D 88 integer transforms require fewer latency delays and provide a larger throughput rate than the row-column based method. With regular modularity, the proposed fast algorithms are suitable for VLSI implementations to achieve H.264/AVC FRExt high-profile signal processing.
ER -