By Topic

Parallel algorithms for multi-indexed recurrence relations with applications to DPCM image compression

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

1 Author(s)
A. Youssef ; Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA

Summary form only given. DPCM decoding is essentially the computation of a 2-indexed scalar recurrence relation; the two indices are: the row and column positions of the pixels. Although several logarithmic-time parallel algorithms for solving 1-indexed recurrence relations have been designed, no work has been reported on multi-indexed recurrence relations. Considering the importance of fast DPCM decoding of imagery, parallel algorithms for solving multi-indexed recurrence relations merit serious study. We designed novel parallel algorithms for solving 2-indexed recurrence relations, and identified the parallel architectures best suited for them. We developed three approaches: index sequencing, index decoupling, and dimension shifting. To solve a 2-indexed relation in DPCM decoding of an n×n image, index sequencing breaks down the relation into a sequence of n 1-indexed scalar recurrence relations that must be solved one after another. Each relation is then solved by a parallel O(nlogn) time algorithm on an n-processor hypercube or partitionable bus. Thus, the n equations take O(nlogn) time on n processors. Index decoupling, applicable in a common case of DPCM, breaks the 2-indexed relation into n independent 1-indexed recurrence relations, which are then solved simultaneously in O(logn) parallel time, using n2 processors configured as a hypercube or a mesh of partitionable buses

Published in:

Data Compression Conference, 1998. DCC '98. Proceedings

Date of Conference:

30 Mar-1 Apr 1998