Abstract
In this paper, we show that the inherent branch symmetry in the trellis can be used to reduce the computational complexity of the Viterbi decoder. Under the branch symmetry consideration, we propose a modified search algorithm to search new convolutional codes of rate 2/n, with not only high error‐correcting capability but also high branch symmetry. By exploiting the branch symmetry, the branch metric computation of the new codes can be reduced by a factor of 4 or 8 with a performance similar to previous best codes.
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.
