The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2003 vol.52)
pp: 1640-1646
Chun-Yuan Lin , IEEE Computer Society
Yeh-Ching Chung , IEEE Computer Society
ABSTRACT
<p><b>Abstract</b>—In our previous work, we have proposed the <it>extended Karnaugh map representation</it> (<it>EKMR</it>) scheme for multidimensional array representation. In this paper, we propose two data compression schemes, <it>EKMR Compressed Row</it>/<it>Column Storage</it> (<it>ECRS</it>/<it>ECCS</it>), for multidimensional sparse arrays based on the <it>EKMR</it> scheme. To evaluate the proposed schemes, we compare them to the <it>CRS</it>/<it>CCS</it> schemes. Both theoretical analysis and experimental tests were conducted. In the theoretical analysis, we analyze the <it>CRS</it>/<it>CCS</it> and the <it>ECRS</it>/<it>ECCS</it> schemes in terms of the time complexity, the space complexity, and the range of their usability for practical applications. In experimental tests, we compare the compressing time of sparse arrays and the execution time of <it>matrix-matrix addition</it> and <it>matrix-matrix multiplication</it> based on the <it>CRS</it>/<it>CCS</it> and the <it>ECRS</it>/<it>ECCS</it> schemes. The theoretical analysis and experimental results show that the <it>ECRS</it>/<it>ECCS</it> schemes are superior to the <it>CRS</it>/<it>CCS</it> schemes for all the evaluated criteria, except the space complexity in some cases.</p>
INDEX TERMS
Data compression scheme, sparse array operation, multidimensional sparse array, Karnaugh map, sparse ratio.
CITATION
Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu, "Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme", IEEE Transactions on Computers, vol.52, no. 12, pp. 1640-1646, December 2003, doi:10.1109/TC.2003.1252859
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool