A simple (de)compression program using Run Length encoding.
Compression is done that easy:
compressedData = rle(originalData)
Decompression:
originalData = rle(compressedData)
Computes BER v EbNo curve for convolutional encoding / soft decision
Viterbi decoding scheme assuming BPSK.
Brute force Monte Carlo approach is unsatisfactory (takes too long)
to find the BER curve.
The computation uses a quasi-analytic (QA) technique that relies on the
estimation (approximate one) of the information-bits Weight Enumerating
Function (WEF) using
A simulation of the convolutional encoder. Once the WEF is estimated, the analytic formula for the BER is used.
This sample demonstrates features of the encoding class, including a fallback mechanism, new to the .NET Framework version 2.0, that allows you to specify its behavior when it encounters problems during the encoding or decoding process.
Library and command line program for Huffman encoding and decoding both files and chunks of memory. The encoder is a 2 pass encoder. The first pass scans the data and builds the Huffman tree. The second pass encodes the data. The decoder is one pa
EZW Embedded Zero-tree Wavelets encoding,video codecs from the EZW family which use a 3D version of EZW or SPIHT algorithms showed better performance than the MPEG-2 compression algorithm. These algorithms have many advantages inherent for wavelet based schemes and EZW-like coders. Their most important advantages are good compression performance and scalability.
