Published Articles >> Table of Contents >> Abstract

2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)   p. 254
Matrix Factorizations for Parallel Integer Transforms
Yiyuan She, Peking University, Beijing, China; University of London, UK
Pengwei Hao, Peking University, Beijing, China; University of London, UK
Yakup Paker, University of London, UK

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300489
Send link to a friend

Abstract
Integer mapping is critical for lossless source coding and the techniques have been used for image compression in the new international image compression standard, JPEG 2000. In this paper, from block factorizations for any nonsingular transform matrix, we introduce two types of parallel elementary reversible matrix (PERM) factorizations which are helpful for the parallelization of perfectly reversible integer transforms. With improved degree of parallelism (DOP) and parallel performance, the cost of multiplication and addition can be respectively reduced to O(logN) and O(log{2}N) for an N-by-N transform matrix. These make PERM factorizations an effective means of developing parallel integer transforms for large matrices. Besides, we also present a scheme to block the matrix and allocate the load of processors for efficient transformation.
Back to Top Additional Information
Citation:  Yiyuan She, Pengwei Hao, Yakup Paker, "Matrix Factorizations for Parallel Integer Transforms," ispan, p. 254,  2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04),  2004