Journal ArticleDOI
On the fixed-point-error analysis of several fast DCT algorithms
Il Dong Tun,Sang Uk Lee +1 more
Reads0
Chats0
TLDR
It is found that the fixed-point-error characteristics of the row-column approach for 2D DCTs is very similar to that of their 1D counterparts, which shows one of the algorithms is better than others in terms of average SNR performance.Abstract:
A fixed-point-error analysis for several 1D fast DCT algorithms is presented. For comparison, a direct-form approach is also included in the investigation. A statistical model is used as the basis for predicting the fixed-point error in implementing the algorithms, and a suitable scaling scheme is selected to avoid overflow. Closed-form expressions for both the mean and variance for fixed-point error are derived and compared with experimental results. Simulation results show close agreement between theory and experiment, validating the analysis. The results show that one of the algorithms is better than others in terms of average SNR performance. Based on the 1D analysis, attempts are made to investigate the fixed-point-error analysis of the two-column approach for 2D DCT. It is found that the fixed-point-error characteristics of the row-column approach for 2D DCTs is very similar to that of their 1D counterparts. >read more
Citations
More filters
Journal ArticleDOI
Fast multiplierless approximations of the DCT with the lifting scheme
Jie Liang,Trac D. Tran +1 more
TL;DR: The binDCT can be tuned to cover the gap between the Walsh-Hadamard transform and the DCT, and allows a 16-bit implementation, enables lossless compression, and maintains satisfactory compatibility with the floating-point DCT.
Journal ArticleDOI
Fixed-point optimization utility for C and C++ based digital signal processing programs
TL;DR: Fixed-point optimization utility software is developed that can aid scaling and wordlength determination of digital signal processing algorithms written in C or C++ and can be used to compare the fixed-point characteristics of different implementation architectures.
Journal ArticleDOI
Fast algorithm for computing discrete cosine transform
TL;DR: An efficient method for computing the discrete cosine transform (DCT) is proposed, which is a generalization of the radix 2 DCT algorithm, and the recursive properties of the DCT for an even length input sequence are derived.
Book ChapterDOI
CHAPTER 1 – Discrete Cosine and Sine Transforms
TL;DR: The book presents the complete set of discrete cosine transforms and discrete sine transforms constituting the entire class of discrete sinusoidal unitary transforms, including their definitions, general mathematical properties, relations to the Karhunen-Loeve transform, with the emphasis on fast algorithms and integer approximations for their efficient implementations in the integer domain.
Journal ArticleDOI
Approximate DCT Image Compression Using Inexact Computing
TL;DR: A new framework for digital image processing relies on inexact computing to address some of the challenges associated with the discrete cosine transform (DCT) compression, and shows very good improvements in reduction for energy and delay, while maintaining acceptable accuracy levels for image processing applications.
References
More filters
Journal ArticleDOI
Discrete Cosine Transform
TL;DR: In this article, a discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed, which can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Book
Discrete Cosine Transform: Algorithms, Advantages, Applications
TL;DR: This paper presents two Dimensional DCT Algorithms and their relations to the Karhunen-Loeve Transform, and some applications of the DCT, which demonstrate the ability of these algorithms to solve the discrete cosine transform problem.
Journal ArticleDOI
A Fast Computational Algorithm for the Discrete Cosine Transform
TL;DR: A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional DiscreteCosine Transform algorithms using the Fast Fourier Transform.
Journal ArticleDOI
A new algorithm to compute the discrete cosine Transform
TL;DR: A new algorithm is introduced for the 2m-point discrete cosine transform that reduces the number of multiplications to about half of those required by the existing efficient algorithms, and it makes the system simpler.
Journal ArticleDOI
Adaptive Coding of Monochrome and Color Images
Wen-Hsiung Chen,C. Smith +1 more
TL;DR: In this article, an efficient adaptive encoding technique using a new implementation of the Fast Discrete Cosine Transform (FDCT) for bandwidth compression of monochrome and color images is described.