Comments on `Bit Interleaved Coded Modulation'
| dc.creator | Sethuraman, Vignesh | |
| dc.creator | Hajek, Bruce | |
| dc.date | 2005-06-13 | |
| dc.date | 2005-11-22 | |
| dc.date.accessioned | 2026-07-07T08:15:28Z | |
| dc.date.available | 2026-07-07T08:15:28Z | |
| dc.description | 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. | |
| dc.description | This is the version after review (shorter, better etc) | |
| dc.identifier | https://arxiv.org/abs/cs/0506052 | |
| dc.identifier | http://arxiv.org/abs/cs/0506052 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133461 | |
| dc.subject | Information Theory | |
| dc.title | Comments on `Bit Interleaved Coded Modulation' | |
| dc.type | text |