Abstract
This study modifies the wrap-around Viterbi algorithm (WAVA) for tailbiting convolutional codes (TBCCs). The proposed modification is based on the fact that it is unnecessary to decode a codeword of TBCCs from the beginning of the codeword. WAVA must apply the Viterbi algorithm (VA) to the whole codeword repeatedly until the optimal sufficient condition is satisfied. Instead of checking the whole codeword, the algorithm checks the sufficient condition immediately after performing each level of metric computation. This approach significantly reduces the computational complexity. Simulation results in the case of (2,1,6) codes and E_b/N_0=3.5 dB show that the average number of extra levels is only 0.48, which is less than 1/9 that of WAVA.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
