Lossless compression of high-volume numerical data from simulations
暂无分享,去创建一个
Summary form only given. We propose a lossless algorithm of delta compression (a variant of predictive coding) that attempts to predict the next point from previous points using higher-order polynomial extrapolation. In contrast to traditional predictive coding our method takes into account varying (non-equidistant) domain (typically, time) steps. To save space and guarantee lossless compression, the actual and predicted values are converted to 64-bit integers. The residual (difference between actual and predicted values) is computed as difference of integers. The unnecessary bits of the residual are truncated, e.g., 1111110101 is replaced by 10101. The length of the bit sequence (5/sub 10/=(000101)/sub 2/) is prepended.
[1] E. Ziegel. Beta Mathematics Handbook , 1991 .
[2] Allan S. Y. Grady,et al. Beta : Mathematics Handbook , 1991, The Mathematical Gazette.
[3] David Salesin,et al. Interactive multiresolution surface viewing , 1996, SIGGRAPH.
[4] Dag Fritzson,et al. Rolling Bearing Simulation On Mimd Computers , 1997, Int. J. High Perform. Comput. Appl..
[5] Michael J. Gormish,et al. Lossless and nearly lossless compression for high-quality images , 1997, Electronic Imaging.