By Topic

VLSI architecture for very high resolution scalable video coding using the virtual zerotree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li-Minn Ang ; Centre for Very High Speed Microelectron. Syst., Edith Cowan Univ., Joondalup, WA, Australia ; Hon Nin Cheung ; K. Eshraghian

In this paper, we present a hardware architecture for very high resolution (VHR) scalable video coding using the virtual zerotree (VZT) algorithm, a variant of the embedded zerotree wavelet (EZW) algorithm. The VZT architecture is regular and modular and is suitable for VLSI implementation. The output of the architecture is a data stream containing the virtual map, significance map and successive-approximation quantization symbols of the VZT algorithm. The approach is based on an efficient scheme to determine ancestor-descendant relationships in the wavelet coefficient data stream by rearrangement of the data stream for simpler VLSI implementation. The approach uses the sign-magnitude binary representation of the rearranged wavelet coefficients to form a single bit data stream as the input into the architecture. The coding and quantization for the VZT algorithm are formulated in view of the single bit data stream input and the corresponding VLSI architecture to implement the formulated requirements is presented

Published in:

Signal Processing Systems, 1999. SiPS 99. 1999 IEEE Workshop on

Date of Conference: