Improved Implementation of Convolutional Code Decoding Algorithm for Conv(2,1,9)
- Login to Download
- 1 Credits
Resource Overview
Implementation of Conv(2,1,9) convolutional code encoding and soft-decision sliding window Viterbi decoding with generator polynomials G0=561 (octal) and G1=753 (octal) using BPSK modulation over AWGN channel, comparing performance impact of different decoding depths through efficient algorithm implementation
Detailed Documentation
This research aims to improve the convolutional code decoding algorithm by implementing Conv(2,1,9) encoding and soft-decision sliding window Viterbi decoding. The convolutional code uses generator polynomials G0=561 (octal) and G1=753 (octal), with BPSK modulation scheme over an AWGN channel. The implementation involves creating a trellis structure with 256 states (2^(m=8)) and utilizing sliding window techniques to reduce computational complexity. By comparing various decoding depths, we investigate their impact on decoder performance and further optimize the algorithm to enhance overall efficiency. The Viterbi algorithm implementation includes path metric calculation, traceback memory management, and soft-decision quantization to handle continuous input values from the demodulator.
- Login to Download
- 1 Credits