Publication IEICE TRANSACTIONS on Information and SystemsVol.E89-DNo.12pp.3006-3011 Publication Date: 2006/12/01 Online ISSN: 1745-1361 DOI: 10.1093/ietisy/e89-d.12.3006 Print ISSN: 0916-8532 Type of Manuscript: LETTER Category: Image Processing and Video Processing Keyword: H.264, fidelity range extensions (FRExt), integer transform, fast algorithm,
Full Text: PDF>>
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.