AREA EFFICIENT DISTRIBUTED ARITHMETIC DISCRETE COSINE TRANSFORM USING MODIFIED WALLACE TREE MULTIPLIER
- 1 Department of Electronics and Communication Engineering, Sasurie College of Engineering, Vijayamangalam, Tamilnadu, India
- 2 Department of Electrical and Electronics Engineering, Institute of Road and Transport Technology, Erode, Tamilnadu, India
Abstract
In this study by using the modified Wallace tree multiplier, an error compensated adder tree is constructed in order to round off truncation errors and to obtain high through put discrete cosine transform design. Peak Signal to Noise Ratio (PSNR) is met efficiently since modified Wallace Tree method is an efficient, hardware implementable digital circuit that multiplies two integers resulting an output with reduced delays and errors. Nearly 6% of delays and around 1% of gate counts are reduced. The number of look up tables consumed is 2% lesser than that of the previous multipliers. Thus an area efficient discrete cosine transform is built to achieve high throughput with minimum gate counts and delays for the required Peak Signal to Noise Ratio when compared to the existing DCT’s.
DOI: https://doi.org/10.3844/ajassp.2014.180.188
Copyright: © 2014 R. P. Meenaakshi Sundari, R. Anita and V. Venkateshwaran. This is an open access article distributed under the terms of the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 3,098 Views
- 2,644 Downloads
- 0 Citations
Download
Keywords
- 2-D Discrete Cosine Transform
- Error Compensated Adder Tree (ECAT)
- Read Only Memory (ROM)
- New Distributed Arithmetic (NEDA)