.png){kind=icon}
Return
Error probability of bit-interleaved coded modulation in wireless environments
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2005.863340.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 Nalkagami 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.
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
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W
Organization
No organization information available
Cited Papers
ShareSaveShareSave
ShareSave
Designing seawater RO for clean and fouling RO feed. Desalination experiences with the FilmTec SW30HR-380 and SW30HR-320 elements — technical—economic review.png)
Desalination
DesalinationIF0
PREAI
ShareSaveShareSave
View more