This code implements the shortest path algorithm via the simple Scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file, reading from the key board.
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.
