Corning Community College
CSCS2330 Discrete Structures
Any changes that have been made.
To apply your skills in implementing an encoding scheme that, in ideal circumstances, will lead to a smaller storage footprint for your data.
A Google search defines encoding as:
When we program, we encode ideas into syntax.
When you compile source code, the compiler encodes your coding syntax into machine code.
When we lay out a pattern, we encode particular aspects of a process.
Encoding can be as simple as a 1:1 translation (such as shifting letters around to encipher a message), but it can also take other forms.
Compression is a certain form of encoding, one where we focus on taking something (typically data, bits, bandwidth, instructions) and encode it in a way where it ends up requiring less storage space than when we began.
According to Wikipedia, data compression is: the process of encoding digital information using fewer bits.
Another aspect to consider is whether the act of encoding data results in a reversible pathway or not. Sometimes the process of encoding can eliminate seemingly unnecessary data, aiding in the task of taking up less space. When data is trimmed in this manner, we say the process is lossy; when all data is preserved, it is lossless.
For more information on lossy and lossless data compression:
Wikipedia has categories identifying various algorithms implemented for both lossless and lossy compression algorithms.
Our algorithm of implementation this week is a relatively simple and straightforward one known as Run-Length Encoding (RLE for short).
Sometimes associated with certain image formats, RLE is an algorithm that, when matched with appropriately patterned data, can yield some space savings.
However, like other special-purpose algorithms, it its worst cases it can actually balloon the storage footprint of your data.
To demonstrate what RLE does, let us look at the following data:
aaaabcccdddddefghhhhhhhhhhhh (28 bytes total)
Notice how there are sequences of repeating letters? Turns out in some patterns of data, that can be quite the frequent occurrence (for example, images with large swaths of the same color).
RLE adds a sort of narrative to the data, sort of like what we might do if we were describing that string:
Or, to concisely represent it:
4a1b3c5d1e1f1g12h (17 bytes total)
By applying that “narrative” to the data, we were able to both preserve the integrity of the data, while shrinking its storage footprint.
And in that case, we got some pretty decent gains:
However, the data must be appropriately repetitive… if not, it can grow in size. Take this example:
abcdefgh (8 bytes)
Applying our same narrative:
Or, concisely:
1a1b1c1d1e1f1g1h (16 bytes)
In that case, we not only didn't shrink, but we grew to twice our original size.
When RLE works, it can work pretty well, but when the data isn't conducive, it really doesn't help out that much at all.
You'll be writing an encode and a decode program implementing RLE, in accordance with these published specifications (this way, any one can take an RL-encoded file from someone else and decode it with their's, and vice versa).
Every RL-encoded file will start with the following 12-byte header:
Following this we will have a repeating sequence of count and value fields, continuing until the end of the file.
For example, encoding our 28-byte example from above we'd get:
04 61 01 62 03 63 05 64 01 65 01 66 01 67 0c 68
Or, if looking at the ENTIRE encoded file, with header, where the source file was named 'sample.txt' and has a newline character at the end (I've wrapped it at 16 bytes per line so it better fits on the page without a horizontal scroll):
64 63 66 58 20 52 4c 45 00 01 01 0a 73 61 6d 70 6c 65 2e 74 78 74 04 61 01 62 03 63 05 64 01 65 01 66 01 67 0c 68 01 0a
Now, in this case, with full headers, our original 28-byte (29, counting the newline) example would actually end up at 40 bytes, but that sample is rather small. A repetitive file originally 40-ish bytes, and of course larger, would start to yield space savings.
It is your task to write an encoder and decoder for this specification of the dcfX RLE format:
Your program should:
For those familiar with the grabit tool on lab46, I have made some skeleton files and a custom Makefile available for this project.
To “grab” it:
lab46:~/src/discrete$ grabit discrete dcf0 make: Entering directory '/var/public/SEMESTER/discrete/dcf0' ‘/var/public/SEMESTER/discrete/dcf0/Makefile’ -> ‘/home/USERNAME/src/discrete/dcf0/Makefile’ ‘/var/public/SEMESTER/discrete/dcf0/encode.c’ -> ‘/home/USERNAME/src/discrete/dcf0/encode.c’ ‘/var/public/SEMESTER/discrete/dcf0/decode.c’ -> ‘/home/USERNAME/src/discrete/dcf0/decode.c’ ‘/var/public/SEMESTER/discrete/dcf0/in/sample0.txt’ -> ‘/home/USERNAME/src/discrete/dcf0/in/sample0.txt’ ‘/var/public/SEMESTER/discrete/dcf0/in/sample1.txt’ -> ‘/home/USERNAME/src/discrete/dcf0/in/sample1.txt’ ‘/var/public/SEMESTER/discrete/dcf0/in/sample2.bmp’ -> ‘/home/USERNAME/src/discrete/dcf0/in/sample2.bmp’ ‘/var/public/SEMESTER/discrete/dcf0/in/sample3.wav’ -> ‘/home/USERNAME/src/discrete/dcf0/in/sample3.wav’ ‘/var/public/SEMESTER/discrete/dcf0/in/sample4.bmp.rle’ -> ‘/home/USERNAME/src/discrete/dcf0/in/sample4.bmp.rle’ ‘/var/public/SEMESTER/discrete/dcf0/in/sample5.txt.rle’ -> ‘/home/USERNAME/src/discrete/dcf0/in/sample5.txt.rle’ ‘/var/public/SEMESTER/discrete/dcf0/in/sample6.mp3.rle’ -> ‘/home/USERNAME/src/discrete/dcf0/in/sample6.mp3.rle’ ‘/var/public/SEMESTER/discrete/dcf0/in/sample7.txt.rle’ -> ‘/home/USERNAME/src/discrete/dcf0/in/sample7.txt.rle’ make: Leaving directory '/var/public/SEMESTER/discrete/dcf0' lab46:~/src/discrete$ cd dcf0 lab46:~/src/discrete/dcf0 $ ls Makefile in out decode.c encode.c lab46:~/src/discrete/dcf0$
Just another “nice thing” we deserve.
NOTE: You do NOT want to do this on a populated dcf0 project directory– it will overwrite files. Only do this on an empty directory.
With the Makefile, we have your basic compile and clean-up operations:
To accept (or rather, to gain access) to arguments given to your program at runtime, we need to specify two parameters to the main() function. While the names don't matter, the types do.. I like the traditional argc and argv names, although it is also common to see them abbreviated as ac and av.
Please declare your main() function as follows:
int main(int argc, char **argv)
The arguments are accessible via argv, in the order they were specified:
Although I'm not going to require extensive argument parsing or checking for this project, we should check to see if the minimal number of arguments has been provided:
if (argc < 3) // if less than 3 arguments have been provided { fprintf(stderr, "Not enough arguments!\n"); exit(1); }
Your program output should be as follows (given the specific input):
lab46:~/src/discrete/dcf0$ ./encode in/sample0.txt out/sample0.txt.rle input name length: 14 bytes input filename: in/sample0.txt output name length: 19 bytes output filename: out/sample0.txt.rle stride value: 1 byte read in: 82 bytes wrote out: 62 bytes compression rate: 24.39% lab46:~/src/discrete/dcf0$
lab46:~/src/discrete/dcf0$ mkdir tmp lab46:~/src/discrete/dcf0$ ./decode out/sample0.txt.rle tmp/sample0.txt input name length: 19 bytes input filename: out/sample0.txt.rle output name length: 15 bytes output filename: tmp/sample0.txt header text: dcfX RLE v1 stride value: 1 byte read in: 62 bytes wrote out: 82 bytes inflation rate: 32.26% lab46:~/src/discrete/dcf0$
A good way to test that both encode and decode are working is to encode data then immediately turn around and decode that same data. If the decoded file is in the same state as the original, pre-encoded file, you know things are working.
A quick way to check if two files are identical is to run the diff(1) command on them, so assuming the original file in in/sample0.txt, and the decoded version (which should be the same thing) in tmp/sample0.txt:
lab46:~/src/discrete/dcf0$ diff in/sample0.txt tmp/sample0.txt lab46:~/src/discrete/dcf0$
Just getting your prompt back indicates no major differences were found.
If you'd like to be REALLY sure, generate MD5sum hashes and compare:
lab46:~/src/discrete/dcf0$ md5sum in/sample0.txt tmp/sample0.txt 10f9bc85023dcf37be2b04638cb45ee2 in/sample0.txt 10f9bc85023dcf37be2b04638cb45ee2 tmp/sample0.txt lab46:~/src/discrete/dcf0$
As you can see, both hashes match (the MD5sum hashes are analyzing the file contents, NOT the name/location).
You may want to check and see what exactly your program is generating.
This can be done by performing a hex data dump (or visualization) of the raw data in the output file.
The tool I'd recommend for quick viewing is xxd(1); please see the following example:
lab46:~/src/discrete/dcf0$ xxd out/sample0.txt.rle 0000000: 6463 6658 2052 4c45 0001 010e 696e 2f73 dcfX RLE....in/s 0000010: 616d 706c 6530 2e74 7874 0161 0262 0363 ample0.txt.a.b.c 0000020: 0464 0565 0666 0767 0868 0969 086a 076b .d.e.f.g.h.i.j.k 0000030: 066c 056d 046e 036f 0270 0171 010a .l.m.n.o.p.q.. lab46:~/src/discrete/dcf0$
With this output, we can confirm, byte-by-byte, what has been placed in our encoded file. What you'll see are three fields:
If you'd like to verify your implementations, there is a check script included when you use the grabit tool to obtain the skeleton files and data.
NOTE: As there have been updates to this script since the project was first released, you may want to manually obtain a copy, to ensure you have the latest and greatest:
lab46:~/src/discrete/dcf0$ cp /var/public/SEMESTER/discrete/dcf0/check .
To run it, you need a functioning encode and decode program (although it does its best otherwise).
It runs through four separate tests, storing the results in a corresponding o#/ directory (sometimes, if applicable, intermediate results in a corresponding m#/ directory):
How it works:
If all goes according to plan, you'll see “OK” status messages displayed.
lab46:~/src/discrete/dcf0$ ./check ================================================= = PHASE 0: Raw -> Encode data verification test = ================================================= in/sample0.txt -> o0/sample0.txt.rle: OK in/sample1.txt -> o0/sample1.txt.rle: OK in/sample2.bmp -> o0/sample2.bmp.rle: OK in/sample3.wav -> o0/sample3.wav.rle: OK ================================================= = PHASE 1: Decode -> Raw data verification test = ================================================= in/sample0.txt.rle -> o1/sample0.txt: OK in/sample1.txt.rle -> o1/sample1.txt: OK in/sample2.bmp.rle -> o1/sample2.bmp: OK in/sample3.wav.rle -> o1/sample3.wav: OK ================================================ = PHASE 2: Raw -> Encode -> Decode -> Raw test = ================================================ in/sample0.txt -> m2/sample0.txt.rle -> o2/sample0.txt: OK in/sample1.txt -> m2/sample1.txt.rle -> o2/sample1.txt: OK in/sample2.bmp -> m2/sample2.bmp.rle -> o2/sample2.bmp: OK in/sample3.wav -> m2/sample3.wav.rle -> o2/sample3.wav: OK ============================================= = PHASE 3: Decode -> Raw -> Encode Raw test = ============================================= in/sample0.txt.rle -> m3/sample0.txt -> o3/sample0.txt.rle: OK in/sample1.txt.rle -> m3/sample1.txt -> o3/sample1.txt.rle: OK in/sample2.bmp.rle -> m3/sample2.bmp -> o3/sample2.bmp.rle: OK in/sample3.wav.rle -> m3/sample3.wav -> o3/sample3.wav.rle: OK
Should something not work correctly, you'll see a “FAIL” message:
lab46:~/src/discrete/dcf0$ ./check ================================================= = PHASE 0: Raw -> Encode data verification test = ================================================= in/sample0.txt -> o0/sample0.txt.rle: OK in/sample1.txt -> o0/sample1.txt.rle: OK in/sample2.bmp -> o0/sample2.bmp.rle: FAIL: checksums do not match in/sample3.wav -> o0/sample3.wav.rle: OK ================================================= = PHASE 1: Decode -> Raw data verification test = ================================================= in/sample0.txt.rle -> o1/sample0.txt: OK in/sample1.txt.rle -> o1/sample1.txt: OK in/sample2.bmp.rle -> o1/sample2.bmp: FAIL: checksums do not match in/sample3.wav.rle -> o1/sample3.wav: OK ================================================ = PHASE 2: Raw -> Encode -> Decode -> Raw test = ================================================ in/sample0.txt -> m2/sample0.txt.rle -> o2/sample0.txt: OK in/sample1.txt -> m2/sample1.txt.rle -> o2/sample1.txt: OK in/sample2.bmp -> m2/sample2.bmp.rle -> o2/sample2.bmp: FAIL: checksums do not match in/sample3.wav -> m2/sample3.wav.rle -> o2/sample3.wav: OK ============================================= = PHASE 3: Decode -> Raw -> Encode Raw test = ============================================= in/sample0.txt.rle -> m3/sample0.txt -> o3/sample0.txt.rle: OK in/sample1.txt.rle -> m3/sample1.txt -> o3/sample1.txt.rle: OK in/sample2.bmp.rle -> m3/sample2.bmp -> o3/sample2.bmp.rle: FAIL: checksums do not match in/sample3.wav.rle -> m3/sample3.wav -> o3/sample3.wav.rle: OK
Should something not work at all (like a missing or uncompiling decode binary), you'll see a “MISSING” message:
lab46:~/src/discrete/dcf0$ ./check ... ================================================= = PHASE 1: Decode -> Raw data verification test = ================================================= in/sample0.txt.rle -> o1/sample0.txt: MISSING: decode in/sample1.txt.rle -> o1/sample1.txt: MISSING: decode in/sample2.bmp.rle -> o1/sample2.bmp: MISSING: decode in/sample3.wav.rle -> o1/sample3.wav: MISSING: decode ...
To successfully complete this project, the following criteria must be met:
To submit this program to me using the submit tool, run the following command at your lab46 prompt:
lab46:~/src/discrete/dcf0$ make submit removed 'decode' removed 'encode' removed 'errors' Project backup process commencing Taking snapshot of current project (dcf0) ... OK Compressing snapshot of dcf0 project archive ... OK Setting secure permissions on dcf0 archive ... OK Project backup process complete Submitting discrete project "dcf0": -> ../dcf0-DATESTRING-HOUR.tar.gz(OK) SUCCESSFULLY SUBMITTED
You should get some sort of confirmation indicating successful submission if all went according to plan. If not, check for typos and or locational mismatches.