Generalized Interval Transformation Coding

This section describes Intel IPP data compression functions that perform Generalized Interval Transformation (GIT) coding. The coding procedure is of a statistical entropy nature. The GIT algorithm is based on Interval Transformations also known as Distance coding or Inversion frequencies [Arn97 ] and Rice-Golomb coding [Gal75]. This algorithm compresses blocks of data at ratios that are close to Huffman encoding compression ratios. However, with low entropy source data, the GIT algorithm typically provides coding at higher compression ratios as compared with the Huffman algorithm.

• Special Parameters
  
• EncodeGITInitAlloc
  Allocates memory and initializes the GIT encoding state structure.
• GITFree
  Frees memory allocated for the GIT coding structures.
• EncodeGITInit
  Initializes the GIT encoding state structure.
• EncodeGITGetSize
  Computes the size of the GIT encoding state structure.
• EncodeGIT
  Performs GIT encoding.
• DecodeGITInitAlloc
  Allocates memory and initializes the GIT decoding state structure.
• DecodeGITInit
  Initializes the GIT decoding state structure.
• DecodeGITGetSize
  Computes the size of the GIT decoding state structure.
• DecodeGIT
  Performs GIT decoding.

Copyright © 2000 - 2011, Intel Corporation. All rights reserved.