Work

Multidimensional Fast Multiplierless DCT Algorithm Using Ramanujan Ordered Numbers

Year: 2012
Type: article
Abstract: This paper proposes a new multidimensional (m-D) multiplierless Ramanujan Numbered Discrete Cosine Transform (RDCT) based coding to improvise the coding efficiency in the visual data compression for multimedia applications.In this paper, the mD-DCT with size 12 m N N N   , where i N power of 2 is, can be converted into a series of one dimensional (1-D) DCT's which are evaluated using Ramanujan Ordered Numbers thereby making the algorithm multiplierless.The proposed algorithm achieves considerable savings in terms of shift operations compared with the row-column approach thus making it suitable for image and video coding applications.For a 3-dimensional input data of size 888 , the algorithm reduces the number of shift operations by 66% compared to multidimensional row-column approach and approximately 0.1% increase in the number of adders compared with the row-column approach.Compared with the other recently presented multidimensional DCT algorithms, the proposed one gives better result as it uses the shift operations instead of the floating-point multipliers and also achieves considerable reduction in the number of addition operation .
Language: English
Open Access status: bronze
OpenAlex ID: W2319747426
FWCI: 0.272
Cites: 24
Cited by: 1
Related to: 10