loading
ADAPTIVE PRUNED 4×4 DCT ALGORITHM FOR H.264
2006 Edition, January 1, 2006 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A new integer 4times4 transform is adopted in the new video coding standard H.264/AVC. To reduce the computation load of the new transform, the SSAVT model for 8times8 transform is applied into H.264 4times4 transform with some modifications. Then, three classes...

Prime-factor DCT algorithms
1995 Edition, Volume 43, March 1, 1995 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In this correspondence, new algorithms are presented for computing the l-D and 2-D discrete cosine transform (DCT) of even length by using the discrete Fourier transform (DFT). A comparison of the proposed algorithms to other fast ones points out their computational...

CORDIC Based Fast Radix-2 DCT Algorithm
2013 Edition, Volume 20, May 1, 2013 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This letter proposes a novel coordinate rotation digital computer (CORDIC)-based fast radix-2 algorithm for computation of discrete cosine transformation (DCT). The proposed algorithm has some distinguish advantages, such as Cooley-Tukey fast Fourier transformation...

A convolution-based DCT algorithm
1992 Edition, Volume 1, January 1, 1992 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A convolution-based algorithm for computing the discrete cosine transform (DCT) (with power of two length) that is based on some theorems of number theory is proposed: It computes a length-N DCT (with N a power of two) using only N multiplications.< >

The matrix decomposition representation of DCT algorithms
2005 Edition, January 1, 2005 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In this paper, the matrix multiplication theory is utilized to obtain Loeffler's DCT algorithm and Feig's DCT algorithm. In addition, the Feig's algorithm is extended to other three forms. Utilizing matrix decomposition representation, the links and differences...

A fast 4*4 DCT algorithm for the recursive 2-D DCT
1992 Edition, Volume 40, September 1, 1992 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The authors present an efficient algorithm for the computation of the 4*4 discrete cosine transform (DCT). The algorithm is based on the decomposition of the 4*4 DCT into four 4-point 1-D DCTs. Thus, only 1-D...

Decoding on adaptively pruned trellis for correcting synchronization errors
2017 Edition, Volume 14, July 1, 2017 - China Communications Magazine Co. Ltd.

Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to high computational complexity. In order to reduce the number of the...

Decoding on adaptively pruned trellis for correcting synchronization errors
2017 Edition, Volume 14, July 1, 2017 - China Communications Magazine Co. Ltd.

Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to high computational complexity. In order to reduce the number of the...

Multiplierless Approximation of Fast DCT Algorithms
2006 Edition, July 1, 2006 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original transform by a signed digit representation. We developed an efficient algorithm to convert any...

Matrix decomposition representation of fast DCT algorithms
1997 Edition, Volume 1, January 1, 1997 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This paper describes the matrix decomposition of two popular 1D DCT algorithms. In this form, the link and differences in the computational structure between the two algorithms are revealed and the vector-radix algorithms based on Lee's (1984) and Hou's (1987) 1D fast...

Advertisement