Inversion Frequency Vector / Distance Coding
This page contains information Inversion Frequency Vector, a small program that simulates processing steps similar to MTF. Unlike MTF coding, IF forms a composite source. By using IFV, all information related to the smallest element in a given data string resides in the first block of the IFV of the second is present in next block, and so on. I will be examining whether any further compression gain can be achieved by investigation properties of composite source.
IFV algorithm increases compression when used a step to process output of BWT.
This program requires gcc version 2.95.2
Update
-
Date : 04/23/2001 Basic Version of IFV generation $Id : ifv.cpp version 1.0.0 [CPP file]
-
Have few problems like it has fixed memory allocated to handle input, so this might lead to overflow when you are considering file sizes > 5K
-
Problems to fix : dynamic memory allocation, will handle more that 5K block and SIMPLE TRICK to increase context of text considered in block.
How it works
How to use
ifv [input-file] [output-file] [Options]
These are command line options for this program.
-
input-file
- This file is output of BWT (Burrows-Wheeler Transform).
-
output-file
- This is output file of IFV.
-
-b --blocksize
- This is the size of the block that is used for distance coding. (to be added)
-
-c --complement
- Computes two complements of adjacent bytes to increase context. (to be added)
How to get it
Current file is present in Update section.
Results
No tests performed yet.
Credits
Originally written by Ziya Arnavut and Spyros S. Magliveras. Modified by Nitin Jeevan Motgi (nmotgi@cs.ucf.edu).
Nitin Jeevan Motgi, School of Electrical Engineering and Computer Science, nmotgi@cs.ucf.edu $Id: ifv.html$