On the Performance of Iterative Demapping and Decoding Techniques over Quasi-Static Fading Channels

Add to your list(s) Download to your calendar using vCal

• William Carson, Digital Technology Group, Computer Laboratory
• Friday 07 December 2007, 14:30-15:30
• Computer Laboratory, Room SN08.

If you have a question about this talk, please contact Ioannis Chatzigeorgiou.

Room changed

We investigate in detail the performance of iterative demapping and decoding techniques over quasi-static fading channels both with and without antenna diversity. In particular, we consider the effect on the system performance of various mapping schemes, different coding schemes, the interleaver size as well as space diversity. Results demonstrate that over quasi-static fading channels characterized by significant antenna diversity, mappings traditionally optimized for iterative receivers (e.g., Boronka mapping) outperform mappings more appropriate for non-iterative receivers (e.g., Gray mapping). In contrast, over quasi-static fading channels characterized by limited antenna diversity, Gray mapping always outperform Boronka mapping for all values of Eb/N0 and all iterations. Strikingly, this situation is in sharp contrast to that in the AWGN case. We note that we can further improve the performance of non-iterative systems (e.g., Gray mapping) having limited antenna diversity by increasing the memory size and removing the interleaving.

This talk is part of the Wireless Communications Team Seminars series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory, Room SN08
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• Wireless Communications Team Seminars
• bld31

Note that ex-directory lists are not shown.