Abstract
It is shown that the sequential decoding of rate one-half convolutional codes leads to a special type of infinite Markov chain in which only one transition of one step toward the origin state is permitted but any number of transitions away from the origin state are permitted. It is shown that such chains have the singular property that the stationary state probabilities π 0,π 1,π 2,… can be calculated successively without summing any infinite series or solving for any eigenvalues. It is further shown that the analogous infinite Markov chains in which a single transition of one step away from the origin is permitted are also related to a problem in sequential decoding and also have a singular property, namely that π i = (1 − β) β i where β is the unique real eigenvalue of the characteristic polynomial such that 0 < β < 1.
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.
