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

Handle URI:
http://hdl.handle.net/10754/566006
Title:
On the average complexity of sphere decoding in lattice space-time coded multiple-input multiple-output channel
Authors:
Abediseid, Walid
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Young Talent Development
Publisher:
Wiley-Blackwell
Journal:
Transactions on Emerging Telecommunications Technologies
Issue Date:
21-Dec-2012
DOI:
10.1002/ett.2610
Type:
Article
ISSN:
2161-3915
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAbediseid, Waliden
dc.date.accessioned2015-08-12T08:59:06Zen
dc.date.available2015-08-12T08:59:06Zen
dc.date.issued2012-12-21en
dc.identifier.issn2161-3915en
dc.identifier.doi10.1002/ett.2610en
dc.identifier.urihttp://hdl.handle.net/10754/566006en
dc.description.abstractThe 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.en
dc.publisherWiley-Blackwellen
dc.titleOn the average complexity of sphere decoding in lattice space-time coded multiple-input multiple-output channelen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentYoung Talent Developmenten
dc.identifier.journalTransactions on Emerging Telecommunications Technologiesen
kaust.authorAbediseid, Waliden
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.