On Communication Over Correlated Fading Channels With Practical Power Constraints

157 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.Caire, Taricco, and Biglieri presented a detailed analysis of bit-interleaved coded modulation (BICM), 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. Here, 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.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD