Abstract
The bit-interleaved coded modulation (BICM) method is efficient in mitigatingmultipath fadingby providingtime 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 mappingthem 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 operatingo ver additive white Gaussian noise (AWGN), Rayleigh, Rician, and Nakagami fadingchannels. Results show that the new bounds are tight to simulation curves for different channel models. The proposed bounds are general for any codingscheme with a known distance spectrum.
Original language | English |
---|---|
Pages (from-to) | 722-728 |
Number of pages | 7 |
Journal | IEEE Transactions on Vehicular Technology |
Volume | 55 |
Issue number | 2 |
DOIs | |
State | Published - Mar 2006 |
Keywords
- Additive white Gaussian noise (AWGN)
- Bit interleaved
- Bit-interleaved coded modulation (BICM)
- Coded modulation
- Convolutional codes
- Fading channels
- Generalized fading
- Nakagami
- Rayleigh
- Rician
- Turbo codes
- Union bound
ASJC Scopus subject areas
- Aerospace Engineering
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Automotive Engineering