Software Version: 1st October 1998
This is the [18,9,5]-tail-biting code implemented in [12] with about 1600 transistors in a standard 0.8 um BiCMOS technology.
The software demo can do an approximate a posteriori probability (APP) decoding of this code using the sum-product algorithm. The decoding is only approximate because the factor graph has a loop. The sum-product algorithm is guaranteed to converge on a graph with a single loop, but not necessarily to the correct solution [13,14]. You can run simulations by clicking on Run Simulation... in the Run menu. For reasonable decoding, the algorithm should make at least one pass through the entire trellis. This means that you should set the "Variable/Function Updates" number to at least 9, the length of the loop (counted in variable nodes).