Abstract
The Pe-criterion is a recent analysis of sequential decoding of tree codes based on the design condition that the decoder must achieve a set error probability Pe. This work extends the criterion to channels with intersymbol interference (ISI), assuming binary random coding, and both hard and soft decision decoding. The result is a definite boundary for the tree search region and a well defined estimate of path numbers searched. Comparisons among the channels show the influence of ISI in the decoding process. We show how ISI increases the search region and number of paths searched as compared to memoryless channels. Furthermore, we show that the use of soft decisions may not only result in large savings as compared to hard decisions, but indeed be the key to assure feasibility of the limited search decoder.
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.
