Efficient realizations of analysis and synthesis filters based on the 2-D discrete wavelet transform

Authors:
C. Chakrabarti;C. Mumford
Affiliations:
Dept. of Electr. Eng., Arizona State Univ., Tempe, AZ, USA;-
Venue:
ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06
Year:
1996

Citing 0
Cited 7

VLSI architectures of the 1-D and 2-D discrete wavelet transforms for JPEG 2000

Signal Processing
VLSI Implementation of 2-D DWT/IDWT Cores using 9/7-tap filter banks based on the Non-expansive Symmetric Extension Scheme

ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Design of a flexible 2-D discrete wavelet transform IP core for JPEG2000 image coding in embedded imaging systems

Signal Processing
A high-throughput, memory efficient architecture for computing the tile-based 2D discrete wavelet transform for the JPEG2000

Integration, the VLSI Journal
A novel VLSI architecture for multidimensional discrete wavelet transform

ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
Low-power and high-performance 2-D DWT and IDWT architectures based on 4-tap Daubechies filters

MUSP'07 Proceedings of the 7th WSEAS International Conference on Multimedia Systems & Signal Processing
A high-throughput, memory efficient architecture for computing the tile-based 2D discrete wavelet transform for the JPEG2000

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents folded architectures and scheduling algorithms for computing the 2-D DWT for analysis and synthesis filters. The folded architectures consist of two parallel computation units (one for computations along the rows and the other for computations along the columns) and two storage units to store the intermediate outputs that are generated by the two units. The scheduling algorithms range from those that try to minimise the latency to those that try to minimise the control unit complexity and keep the data flow regular. A comparison of the scheduling algorithms has been included to aid the designer in choosing an algorithm that is best suited for a particular application.