Abstract
A new analysis for bounding the average computational effort of sequential decoding is presented. It is based on a branching process model of the subset of incorrect paths explored by the decoder. Closed-form expressions formulated in terms of the set of branch metrics and their probability assignments as actually used by the decoder are derived. Code characteristics in the form of Hamming weights of the 'incorrect paths or column distance function are incorporated, making the analysis directly applicable to specific cases. Evaluation of the bounds is not difficult. Results are in good agreement with those obtained by lengthy computer simulations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.