Abstract
In this work, an improved union bound on the performance of turbo codes is evaluated using a new union bound presented by Viterbi et al., (1998). The characterization of turbo code performance is provided considering both the fully-interleaved channel and correlated Rice slow-fading channel. A uniform interleaver is assumed: this strategy allows one to derive the average performance of the turbo coding scheme by analysis. Of interest is the improvement of the bound for values of E/sub b//N/sub 0/ near and below R/sub 0/ (i.e., the "computational cutoff rate"), region where the conventional union bound becomes useless. This improvement allows a better estimate of the code performance in conjunction with the AWGN channel and with the fast-fading fully-interleaved channel. Moreover, it allows one to determine a tighter bound to the actual code performance as far as the slow fading Rician channel is concerned.
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.
