{'fraction_non_alphanumeric': 0.026957637997432605, 'fraction_numerical': 0.0038510911424903724, 'mean_word_length': 5.495833333333334, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Floating Point Data Compression Using Inter-Extrapolative Predictor

In recent years, along with advances in processor technology, large-scale numerical simulation dealing with huge floating point data is an active research field. In the case of supercomputing using many processors via the network, the bottleneck is communication speed rather than the calculation one. Thus reduction of the communication cost is strongly required in the supercomputing and its straightforward technique is data compression. Most conventional floating-point data compression schemes use predictive coding based on an extrapolative prediction [1–2]. In general, it is known that interpolative prediction has higher accuracy than extrapolative one. This paper proposes a floating point data compression using combined predictor with interpolation and extrapolation, namely Inter-Extrapolative predictor. Proposed predictor is defined one-dimensional but it can be is easily expanded into 2-dimensional by cascading in the horizontal-vertical direction. Note that the interpolation violates causality because it uses future data. In order to avoid this problem, transmission order of data is arranged; first, odd index sequence; second, remaining even index one. The first even index sequence is extrapolated, then the odd index sequence. Similar to Lindstrom's method [1], each prediction residual is encoded by the range coder with '0' run-length of bitwise. Thus proposed method can gain the higher compression rate than [1] under the same number of arithmetic operation.