By Topic

Memory analysis and throughput enhancement for cost effective bit-plane coder in JPEG2000 applications

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)
Lien-Fei Chen ; Dept. of Electr. Eng., Nat. Chung Hsing Univ., Taiwan ; Tai-Lun Huang ; Yeong-Kang Lai

A cost effective bit-plane coder with throughput enhancement in JPEG2000 applications is proposed. Many papers and the results of chip implementation show that memory requirement dominates the hardware cost of the bit-plane coder. In order to reduce the memory size, a memory-free algorithm is proposed to eliminate state variable memories by calculating three coding state variables (γp+1[n], σp+1[n], and πp[n]) on the fly. We also propose a stripe-column-based pass-parallel operation to perform three coding passes in pipeline operation and to encode four samples within the stripe-column concurrently for the high throughput requirement. Experimental results show that the hardware cost and memory size of the proposed architecture is smaller than other existing architectures because of the proposed memory-free algorithm. Furthermore, the proposed architecture has 3 times greater throughput than other familiar architectures.

Published in:

Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.  (Volume:5 )

Date of Conference:

18-23 March 2005