Dedicated VLSI Architecture for 3-D Discrete Wavelet Transform
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2014, Vol 3, Issue 9
Abstract
This Paper Presents an architecture of the lifting based 3-d discrete wavelet transform (DWT), which is a powerful image and video compression algorithm. With 3-D-DWT architectures the memory requirement, block based or scan-based architectures with independent group of pictures (GOP) transform have been reported. However, blocking degrades the PSNR quality while the independent GOPs introduce annoying jerks in video playback due to PSNR drop at transform boundaries. The proposed design is one of the first lifting based complete 3-D-DWT architectures without group of pictures restriction. The new computing technique based on analysis of lifting signal flow graph minimizes the storage requirement. This architecture enjoys reduced memory referencing and related low power consumption, low latency, and high throughput compared to those of earlier reported works. The adders from the library and device dual port block RAMs have been utilized as the principal resources for the designed processor. Simulation is performed by ModelSim XE III 6.0a, which yields a set of end results completely. The Proposed Architecture has been has been successfully implemented and synthesized on Xilinx 14.2 ISE Design Suite.
Authors and Affiliations
D. Kondal Rao, C. Chandrasekhar
Channel Performance Improvement through FF and RBF Neural Network based Equalization
In wireless technology, the communication systems require signal processing techniques to improve the channel performance. The wireless communication is not easily able to avail the error free signal transmission bec...
An Improved Performance of MANET using AODV Protocol for Black Hole Detection
Routing attacks have been identified for single path routing in wireless ad hoc networks. The effects of routing attacks on multipath routing have not been addressed so far. In this paper, an approach have been propo...
Estimation of Complexity of the Regenerator Placement Problem in Optical Networks
Placement of regenerators in optical networks has attracted the attention of recent research works in optical networks. In this problem, we are given a network with an underlying topology of a graph and with a set o...
Scent Rupture Nodes Using DCD In Wireless Sensor Networks
A cut is nothing but a part of wireless sensor networks which is splited into different connection components because of some node failures in the network. This paper proposes a new algorithm to detect these cuts by...
Applications of Graph Labeling in Major Areas of Computer Science
The field of Graph Theory plays a vital role in various fields. In Graph theory main problem is graph labeling. Graph Labeling is the assignment of integer’s form 1 to n for vertex, edges and both of the graphs respec...