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.
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
The package contains a Reed-Solomon coding and decoding program, derived
partly from Phil Karn/Robert Morelos-Zaragoza "new_rs_erasures.c".
In particular the Berlekamp-Massey algorithm has not been modified. New
features compared to "new_rs_erasures.c" are:
- fully parameterized: code parameters (n,k,m) can be selected via
command line options.
- decoding optional by Euclid or Belekamp-Massey algorithm
- efficient support of shortened codes
- extensive verbose levels for hardware verification
