A fast algorithm for the computation of 2-D forward and inverse MDCT

13 years 4 months ago

Download hal.archives-ouvertes.fr

A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT and IMDCT with block size M

J. S. Wu, Huazhong Shu, Lotfi Senhadji, Limin Luo

Real-time Traffic

Algorithm | Discrete Cosine | Modified Discrete Cosine Transform | SIGPRO 2008 |

claim paper

» ErrorFree Computation of 8x8 2D DCT and IDCT Using TwoDimensional Algebraic Integer Quanti...

» A splinebased forward model for Optical Diffuse Tomography

» Fast algorithms for the computation of sliding sequencyordered complex hadamard transform

» Fast Algorithms for Bayesian Uncertainty Quantification in LargeScale Linear Inverse Probl...

» Fast Image Reconstruction Methods for Fully 3d Multispectral Optical Bioluminescence Tomog...

» On compositional Image Alignment with an application to Active Appearance Models

» Fast Image Alignment in the Fourier Domain

» Fast PixelPart Selection with Sparse Eigenvectors

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	SIGPRO
Authors	J. S. Wu, Huazhong Shu, Lotfi Senhadji, Limin Luo

Comments (0)

Sciweavers

A fast algorithm for the computation of 2-D forward and inverse MDCT

Algorithm | Discrete Cosine | Modified Discrete Cosine Transform | SIGPRO 2008 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers