On the performance of diagonal lattice space-time codes

Handle URI:
http://hdl.handle.net/10754/563077
Title:
On the performance of diagonal lattice space-time codes
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 up-to-date focuses on either high-performance, high rates, low complexity encoding and decoding, or targeting a combination of these criteria [1]-[9]. In this paper, we analyze in details the performance limits of diagonal lattice space-time codes under lattice decoding. We present both lower and upper bounds on the average decoding error probability. We first derive a new closed-form expression for the lower bound using the so-called sphere lower 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 then derived using the union-bound which demonstrates how the average error probability can be minimized by maximizing the minimum product distance of the code. Combining both the lower and the upper bounds on the average error probability yields a simple upper bound on the the minimum product distance that any (complex) lattice code can achieve. At high-SNR regime, we discuss the outage performance of such codes and provide the achievable diversity-multiplexing tradeoff under lattice decoding. © 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:
IEEE Transactions on Wireless Communications
Issue Date:
Nov-2013
DOI:
10.1109/TWC.2013.092413.130034
Type:
Article
ISSN:
15361276
Sponsors:
This paper was funded in part by a grant from King Abdulaziz City of Science and Technology.
Appears in Collections:
Articles; 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-03T11:35:16Zen
dc.date.available2015-08-03T11:35:16Zen
dc.date.issued2013-11en
dc.identifier.issn15361276en
dc.identifier.doi10.1109/TWC.2013.092413.130034en
dc.identifier.urihttp://hdl.handle.net/10754/563077en
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 up-to-date focuses on either high-performance, high rates, low complexity encoding and decoding, or targeting a combination of these criteria [1]-[9]. In this paper, we analyze in details the performance limits of diagonal lattice space-time codes under lattice decoding. We present both lower and upper bounds on the average decoding error probability. We first derive a new closed-form expression for the lower bound using the so-called sphere lower 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 then derived using the union-bound which demonstrates how the average error probability can be minimized by maximizing the minimum product distance of the code. Combining both the lower and the upper bounds on the average error probability yields a simple upper bound on the the minimum product distance that any (complex) lattice code can achieve. At high-SNR regime, we discuss the outage performance of such codes and provide the achievable diversity-multiplexing tradeoff under lattice decoding. © 2013 IEEE.en
dc.description.sponsorshipThis paper was funded in part by a grant from King Abdulaziz City of Science and Technology.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectCoding gainen
dc.subjectDiagonal space-time codesen
dc.subjectLattice codingen
dc.subjectLattice decodingen
dc.subjectProduct distanceen
dc.titleOn the performance of diagonal lattice space-time codesen
dc.typeArticleen
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.journalIEEE Transactions on Wireless Communicationsen
kaust.authorAbediseid, Waliden
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.