Abstract
AbstractThe performance of a communication system that operates over a binary‐input, output‐symmetric memoryless channel and employs a convolutional error correcting code is usually evaluated by applying the union bound to the node error and the bit error probabilities. These bounds depend on the probability that an incorrect path on the code trellis accumulates a larger metric than the correct path. The paper presents an easy method to compute this pairwise error probability that is applicable to the significant case of a Viterbi decoder that uses a finite set of integer branch metrics.
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.
