|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)
Matrix Factorizations for Parallel Integer Transforms
Hong Kong, SAR, China
May 10-May 12
ISBN: 0-7695-2135-5
| ASCII Text | x | ||
| Yiyuan She, Pengwei Hao, Yakup Paker, "Matrix Factorizations for Parallel Integer Transforms," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 254, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/ISPAN.2004.1300489, author = {Yiyuan She and Pengwei Hao and Yakup Paker}, title = {Matrix Factorizations for Parallel Integer Transforms}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2004}, issn = {1087-4089}, pages = {254}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300489}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Matrix Factorizations for Parallel Integer Transforms SN - 1087-4089 SP EP A1 - Yiyuan She, A1 - Pengwei Hao, A1 - Yakup Paker, PY - 2004 KW - null VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER - | |||
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.
Citation:
Yiyuan She, Pengwei Hao, Yakup Paker, "Matrix Factorizations for Parallel Integer Transforms," ispan, pp.254, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.