On the average complexity of sphere decoding in lattice space-time coded multiple-input multiple-output channel

Type
Article

Authors
Abediseid, Walid

KAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Young Talent Development

Online Publication Date
2012-12-21

Print Publication Date
2015-03

Date
2012-12-21

Abstract
The exact average 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. Our results indicate that there exists a cut-off rate (multiplexing gain) for which the average complexity remains bounded. Copyright © 2012 John Wiley & Sons, Ltd.

Citation
Abediseid, W. (2012). On the average complexity of sphere decoding in lattice space-time coded multiple-input multiple-output channel. Transactions on Emerging Telecommunications Technologies, 26(3), 355–366. doi:10.1002/ett.2610

Publisher
Wiley

Journal
Transactions on Emerging Telecommunications Technologies

DOI
10.1002/ett.2610

Permanent link to this record