Computer Science – Information Theory
Scientific paper
2005-06-13
Computer Science
Information Theory
This is the version after review (shorter, better etc)
Scientific paper
Caire, Taricco and Biglieri presented a detailed analysis of bit interleaved coded modulation, a simple and popular technique used to improve system performance, especially in the context of fading channels. They derived an upper bound to the probability of error, called the expurgated bound. In this correspondence, the proof of the expurgated bound is shown to be flawed. A new upper bound is also derived. It is not known whether the original expurgated bound is valid for the important special case of square QAM with Gray labeling, but the new bound is very close to, and slightly tighter than, the original bound for a numerical example.
Hajek Bruce
Sethuraman Vignesh
No associations
LandOfFree
Comments on `Bit Interleaved Coded Modulation' does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Comments on `Bit Interleaved Coded Modulation', we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comments on `Bit Interleaved Coded Modulation' will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-649378