Articles | Volume 9, issue 9
https://doi.org/10.5194/gmd-9-3199-2016
https://doi.org/10.5194/gmd-9-3199-2016
Development and technical paper
 | 
19 Sep 2016
Development and technical paper |  | 19 Sep 2016

Bit Grooming: statistically accurate precision-preserving quantization with compression, evaluated in the netCDF Operators (NCO, v4.4.8+)

Charles S. Zender

Viewed

Total article views: 3,984 (including HTML, PDF, and XML)
HTML PDF XML Total Supplement BibTeX EndNote
2,643 1,162 179 3,984 573 186 179
  • HTML: 2,643
  • PDF: 1,162
  • XML: 179
  • Total: 3,984
  • Supplement: 573
  • BibTeX: 186
  • EndNote: 179
Views and downloads (calculated since 21 Apr 2016)
Cumulative views and downloads (calculated since 21 Apr 2016)

Cited

Saved (final revised paper)

Latest update: 24 Feb 2024
Download
Short summary
We introduce Bit Grooming, a lossy compression algorithm that removes the bloat due to false precision, those bits and bytes beyond the meaningful precision of the data. Bit Grooming is statistically unbiased, applies to all floating-point numbers, and is easy to use. Bit Grooming reduces data storage requirements by 25–80 %. Unlike its best-known competitor Linear Packing, Bit Grooming imposes no software overhead on users, and guarantees its precision throughout the whole floating-point range.