VLSI ARCHITECTURE FOR IMAGE COMPRESSION THROUGH ADDER MINIMIZATION TECHNIQUE AT DCT STRUCTURE
Abstract
vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff1e0317000000675a010001000d00
Data compression plays a vital role in multimedia devices to present the information in a succinct frame. Initially, the DCT structure is used for Image compression, which has lesser complexity and area efficient. Similarly, 2D DCT also has provided reasonable data compression, but implementation concern, it calls more multipliers and adders thus its lead to acquire more area and high power consumption. To contain an account of all, this paper has been dealt with VLSI architecture for image compression using Rom free DA based DCT (Discrete Cosine Transform) structure. This technique provides high-throughput and most suitable for real-time implementation. In order to achieve this image matrix is subdivided into odd and even terms then the multiplication functions are removed by shift and add approach. Kogge_Stone_Adder techniques are proposed for obtaining a bit-wise image quality which determines the new trade-off levels as compared to the previous techniques. Overall the proposed architecture produces reduced memory, low power consumption and high throughput. MATLAB is used as a funding tool for receiving an input pixel and obtaining output image. Verilog HDL is used for implementing the design, Model Sim for simulation, Quatres II is used to synthesize and obtain details about power and area.

Authors
N.R. Divya, K. Kannadasan
Adhiparasakthi Engineering College, India

Keywords
Distributed Arithmetic-Discrete Cosine Transform (DA-DCT), Kogge_Stone_Adder (KSA), Inverse Discrete Cosine Transform (IDCT), Very Large Scale Integrated Circuit (VLSI)
Yearly Full Views
JanuaryFebruaryMarchAprilMayJuneJulyAugustSeptemberOctoberNovemberDecember
000000000001
Published By :
ICTACT
Published In :
ICTACT Journal on Image and Video Processing
( Volume: 5 , Issue: 1 , Pages: 891-894 )
Date of Publication :
August 2014
Page Views :
192
Full Text Views :
2

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.