On the performance of diagonal lattice space-time codes for the quasi-static MIMO channel

Handle URI:
http://hdl.handle.net/10754/564755
Title:
On the performance of diagonal lattice space-time codes for the quasi-static MIMO channel
Authors:
Abediseid, Walid; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
There has been tremendous work done on designing space-time codes for the quasi-static multiple-input multiple-output (MIMO) channel. All the coding design to date focuses on either high-performance, high rates, low complexity encoding and decoding, or targeting a combination of these criteria. In this paper, we analyze in detail the performance of diagonal lattice space-time codes under lattice decoding. We present both upper and lower bounds on the average error probability. We derive a new closed form expression of the lower bound using the so-called sphere-packing bound. This bound presents the ultimate performance limit a diagonal lattice space-time code can achieve at any signal-to-noise ratio (SNR). The upper bound is simply derived using the union-bound and demonstrates how the average error probability can be minimized by maximizing the minimum product distance of the code. © 2013 IEEE.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Electrical Engineering Program; Young Talent Development; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2013 IEEE 77th Vehicular Technology Conference (VTC Spring)
Conference/Event name:
2013 IEEE 77th Vehicular Technology Conference, VTC Spring 2013
Issue Date:
Jun-2013
DOI:
10.1109/VTCSpring.2013.6692667
Type:
Conference Paper
ISSN:
15502252
ISBN:
9781467363372
Appears in Collections:
Conference Papers; Electrical Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAbediseid, Waliden
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2015-08-04T07:14:52Zen
dc.date.available2015-08-04T07:14:52Zen
dc.date.issued2013-06en
dc.identifier.isbn9781467363372en
dc.identifier.issn15502252en
dc.identifier.doi10.1109/VTCSpring.2013.6692667en
dc.identifier.urihttp://hdl.handle.net/10754/564755en
dc.description.abstractThere has been tremendous work done on designing space-time codes for the quasi-static multiple-input multiple-output (MIMO) channel. All the coding design to date focuses on either high-performance, high rates, low complexity encoding and decoding, or targeting a combination of these criteria. In this paper, we analyze in detail the performance of diagonal lattice space-time codes under lattice decoding. We present both upper and lower bounds on the average error probability. We derive a new closed form expression of the lower bound using the so-called sphere-packing bound. This bound presents the ultimate performance limit a diagonal lattice space-time code can achieve at any signal-to-noise ratio (SNR). The upper bound is simply derived using the union-bound and demonstrates how the average error probability can be minimized by maximizing the minimum product distance of the code. © 2013 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.titleOn the performance of diagonal lattice space-time codes for the quasi-static MIMO channelen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentYoung Talent Developmenten
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journal2013 IEEE 77th Vehicular Technology Conference (VTC Spring)en
dc.conference.date2 June 2013 through 5 June 2013en
dc.conference.name2013 IEEE 77th Vehicular Technology Conference, VTC Spring 2013en
dc.conference.locationDresdenen
kaust.authorAbediseid, Waliden
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.