On Lattice Sequential Decoding for Large MIMO Systems

Handle URI:
http://hdl.handle.net/10754/316732
Title:
On Lattice Sequential Decoding for Large MIMO Systems
Authors:
Ali, Konpal S.
Abstract:
Due to their ability to provide high data rates, Multiple-Input Multiple-Output (MIMO) wireless communication systems have become increasingly popular. Decoding of these systems with acceptable error performance is computationally very demanding. In the case of large overdetermined MIMO systems, we employ the Sequential Decoder using the Fano Algorithm. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity and vice versa for higher bias values. We attempt to bound the error by bounding the bias, using the minimum distance of a lattice. Also, a particular trend is observed with increasing SNR: a region of low complexity and high error, followed by a region of high complexity and error falling, and finally a region of low complexity and low error. For lower bias values, the stages of the trend are incurred at lower SNR than for higher bias values. This has the important implication that a low enough bias value, at low to moderate SNR, can result in low error and low complexity even for large MIMO systems. Our work is compared against Lattice Reduction (LR) aided Linear Decoders (LDs). Another impressive observation for low bias values that satisfy the error bound is that the Sequential Decoder's error is seen to fall with increasing system size, while it grows for the LR-aided LDs. For the case of large underdetermined MIMO systems, Sequential Decoding with two preprocessing schemes is proposed – 1) Minimum Mean Square Error Generalized Decision Feedback Equalization (MMSE-GDFE) preprocessing 2) MMSE-GDFE preprocessing, followed by Lattice Reduction and Greedy Ordering. Our work is compared against previous work which employs Sphere Decoding preprocessed using MMSE-GDFE, Lattice Reduction and Greedy Ordering. For the case of large systems, this results in high complexity and difficulty in choosing the sphere radius. Our schemes, particularly 2), perform better in terms of complexity and are able to achieve almost the same error curves, depending on the bias used.
Advisors:
Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Committee Member:
Al-Naffouri, Tareq Y.; Sultan Salem, Ahmed Kamal; Turkiyyah, George
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Program:
Electrical Engineering
Issue Date:
Apr-2014
Type:
Thesis
Appears in Collections:
Theses; Electrical Engineering Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.advisorAlouini, Mohamed-Slimen
dc.contributor.authorAli, Konpal S.en
dc.date.accessioned2014-05-13T07:58:42Z-
dc.date.available2014-05-13T07:58:42Z-
dc.date.issued2014-04en
dc.identifier.urihttp://hdl.handle.net/10754/316732en
dc.description.abstractDue to their ability to provide high data rates, Multiple-Input Multiple-Output (MIMO) wireless communication systems have become increasingly popular. Decoding of these systems with acceptable error performance is computationally very demanding. In the case of large overdetermined MIMO systems, we employ the Sequential Decoder using the Fano Algorithm. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity and vice versa for higher bias values. We attempt to bound the error by bounding the bias, using the minimum distance of a lattice. Also, a particular trend is observed with increasing SNR: a region of low complexity and high error, followed by a region of high complexity and error falling, and finally a region of low complexity and low error. For lower bias values, the stages of the trend are incurred at lower SNR than for higher bias values. This has the important implication that a low enough bias value, at low to moderate SNR, can result in low error and low complexity even for large MIMO systems. Our work is compared against Lattice Reduction (LR) aided Linear Decoders (LDs). Another impressive observation for low bias values that satisfy the error bound is that the Sequential Decoder's error is seen to fall with increasing system size, while it grows for the LR-aided LDs. For the case of large underdetermined MIMO systems, Sequential Decoding with two preprocessing schemes is proposed – 1) Minimum Mean Square Error Generalized Decision Feedback Equalization (MMSE-GDFE) preprocessing 2) MMSE-GDFE preprocessing, followed by Lattice Reduction and Greedy Ordering. Our work is compared against previous work which employs Sphere Decoding preprocessed using MMSE-GDFE, Lattice Reduction and Greedy Ordering. For the case of large systems, this results in high complexity and difficulty in choosing the sphere radius. Our schemes, particularly 2), perform better in terms of complexity and are able to achieve almost the same error curves, depending on the bias used.en
dc.language.isoenen
dc.subjectLatticeen
dc.subjectMIMOen
dc.subjectOverdetermineden
dc.subjectUnderdetermineden
dc.subjectSequential-decodesen
dc.subjectBiasen
dc.titleOn Lattice Sequential Decoding for Large MIMO Systemsen
dc.typeThesisen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
thesis.degree.grantorKing Abdullah University of Science and Technologyen_GB
dc.contributor.committeememberAl-Naffouri, Tareq Y.en
dc.contributor.committeememberSultan Salem, Ahmed Kamalen
dc.contributor.committeememberTurkiyyah, Georgeen
thesis.degree.disciplineElectrical Engineeringen
thesis.degree.nameMaster of Scienceen
dc.person.id124293en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.