Abstract
The bit-interleaved coded modulation (BICM) method is efficient in mitigating multipath fading by providing time diversity. In this paper, union bounds on the bit and packet error probabilities of the BICM are derived. In the derivation, the authors assume the uniform interleaving of coded bits prior to mapping them onto the signal constellation. This results in a random distribution of the error bits in a codeword over the transmitted symbols. This distribution is evaluated, and the corresponding pairwise error probability is derived. Union bounds are functions of the distance spectrum of the channel code and the signal constellation used in the BICM system. The authors consider BICM systems operating over additive white Gaussian noise (AWGN), Rayleigh, Rician, and Nakagami fading channels. Results show that the new bounds are tight to simulation curves for different channel models. The proposed bounds are general for any coding scheme with a known distance spectrum.
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.