Computer Science – Information Theory
Scientific paper
2011-03-08
Computer Science
Information Theory
submitted to IEEE Transactions on Communications
Scientific paper
The exact complexity analysis of the basic sphere decoder for general space-time codes applied to multiple-input multiple-output (MIMO) wireless channel is known to be difficult. In this work, we shed the light on the computational complexity of sphere decoding for the quasi-static, LAttice Space-Time (LAST) coded MIMO channel. Specifically, we drive an upper bound of the tail distribution of the decoder's computational complexity. We show that, when the computational complexity exceeds a certain limit, this upper bound becomes dominated by the outage probability achieved by LAST coding and sphere decoding schemes. We then calculate the minimum (average) computational complexity that is required by the decoder to achieve near optimal performance in terms of the system parameters. Moreover, we show analytically how the minimum-mean square-error decision feed-back equalization can significantly improve the tail exponent and as a consequence reduces (average) computational complexity. Our results indicate that there exists a cut-off rate (multiplexing gain) for which the average complexity remains bounded.
Abediseid Walid
Damen Mohamed Oussama
No associations
LandOfFree
On the Computational Complexity of Sphere Decoding in Lattice Space-Time Coded MIMO Channel 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 On the Computational Complexity of Sphere Decoding in Lattice Space-Time Coded MIMO Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Computational Complexity of Sphere Decoding in Lattice Space-Time Coded MIMO Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-81929