Orthogonal precoder for integer-forcing MIMO

Mohammad Nur Hasan; Brian M. Kurkoski; Amin Sakzad; Emanuele Viterbo

doi:10.1109/ISIT.2019.8849336

Orthogonal precoder for integer-forcing MIMO

Mohammad Nur Hasan, Brian M. Kurkoski, Amin Sakzad, Emanuele Viterbo

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

1 Citation (Scopus)

Abstract

This paper focuses on orthogonal precoding for integer-forcing linear receiver and shows it has two advantages over unitary precoding. Orthogonal precoding exhibits lower complexity than unitary precoding because the dimension of orthogonal matrices is half that of unitary matrices for a fixed number of antennas. Moreover, orthogonal precoding outperforms unitary precoding in terms of achievable rate and error-rate. Despite its promising advantages, it is not easy to find the optimal precoding matrices because it involves an orthogonality constraint and the shortest lattice vector problem. To solve this, we separate the optimization problem into two sub-problems and propose methods based on the steepest gradient with Lie groups and a random search algorithm. The proposed methods have low complexity and are applicable to any MIMO dimension. For high-order QAM, the proposed orthogonal precoder outperforms X-precoders which are designed specifically for QAM.

Original language	English
Title of host publication	2019 IEEE International Symposium on Information Theory
Subtitle of host publication	Proceedings
Editors	Giuseppe Caire, Venugopal V. Veeravalli, Aaron B. Wagner, Gilles Zemor
Place of Publication	Piscataway NJ USA
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	1187-1191
Number of pages	5
ISBN (Electronic)	9781538692912, 9781538692905
ISBN (Print)	9781538692929
DOIs	https://doi.org/10.1109/ISIT.2019.8849336
Publication status	Published - 2019
Event	IEEE International Symposium on Information Theory 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019 https://2019.ieee-isit.org/ https://ieeexplore.ieee.org/xpl/conhome/8827389/proceeding (Proceedings)

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Publisher	IEEE, Institute of Electrical and Electronics Engineers
ISSN (Print)	2157-8095
ISSN (Electronic)	2157-8117

Conference

Conference	IEEE International Symposium on Information Theory 2019
Abbreviated title	ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19
Internet address	https://2019.ieee-isit.org/ https://ieeexplore.ieee.org/xpl/conhome/8827389/proceeding (Proceedings)

Access to Document

10.1109/ISIT.2019.8849336

Cite this

Hasan, M. N., Kurkoski, B. M., Sakzad, A., & Viterbo, E. (2019). Orthogonal precoder for integer-forcing MIMO. In G. Caire, V. V. Veeravalli, A. B. Wagner, & G. Zemor (Eds.), 2019 IEEE International Symposium on Information Theory: Proceedings (pp. 1187-1191). (IEEE International Symposium on Information Theory - Proceedings). IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT.2019.8849336

Hasan, Mohammad Nur ; Kurkoski, Brian M. ; Sakzad, Amin et al. / Orthogonal precoder for integer-forcing MIMO. 2019 IEEE International Symposium on Information Theory: Proceedings. editor / Giuseppe Caire ; Venugopal V. Veeravalli ; Aaron B. Wagner ; Gilles Zemor. Piscataway NJ USA : IEEE, Institute of Electrical and Electronics Engineers, 2019. pp. 1187-1191 (IEEE International Symposium on Information Theory - Proceedings).

@inproceedings{2697c2a095cc4cad98d16a496b0409c2,

title = "Orthogonal precoder for integer-forcing MIMO",

abstract = "This paper focuses on orthogonal precoding for integer-forcing linear receiver and shows it has two advantages over unitary precoding. Orthogonal precoding exhibits lower complexity than unitary precoding because the dimension of orthogonal matrices is half that of unitary matrices for a fixed number of antennas. Moreover, orthogonal precoding outperforms unitary precoding in terms of achievable rate and error-rate. Despite its promising advantages, it is not easy to find the optimal precoding matrices because it involves an orthogonality constraint and the shortest lattice vector problem. To solve this, we separate the optimization problem into two sub-problems and propose methods based on the steepest gradient with Lie groups and a random search algorithm. The proposed methods have low complexity and are applicable to any MIMO dimension. For high-order QAM, the proposed orthogonal precoder outperforms X-precoders which are designed specifically for QAM.",

author = "Hasan, \{Mohammad Nur\} and Kurkoski, \{Brian M.\} and Amin Sakzad and Emanuele Viterbo",

year = "2019",

doi = "10.1109/ISIT.2019.8849336",

language = "English",

isbn = "9781538692929",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

pages = "1187--1191",

editor = "Giuseppe Caire and Veeravalli, \{Venugopal V.\} and Wagner, \{Aaron B.\} and Gilles Zemor",

booktitle = "2019 IEEE International Symposium on Information Theory",

address = "United States of America",

note = "IEEE International Symposium on Information Theory 2019, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

url = "https://2019.ieee-isit.org/, https://ieeexplore.ieee.org/xpl/conhome/8827389/proceeding",

}

Hasan, MN, Kurkoski, BM, Sakzad, A & Viterbo, E 2019, Orthogonal precoder for integer-forcing MIMO. in G Caire, VV Veeravalli, AB Wagner & G Zemor (eds), 2019 IEEE International Symposium on Information Theory: Proceedings. IEEE International Symposium on Information Theory - Proceedings, IEEE, Institute of Electrical and Electronics Engineers, Piscataway NJ USA, pp. 1187-1191, IEEE International Symposium on Information Theory 2019, Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849336

Orthogonal precoder for integer-forcing MIMO. / Hasan, Mohammad Nur; Kurkoski, Brian M.; Sakzad, Amin et al.
2019 IEEE International Symposium on Information Theory: Proceedings. ed. / Giuseppe Caire; Venugopal V. Veeravalli; Aaron B. Wagner; Gilles Zemor. Piscataway NJ USA: IEEE, Institute of Electrical and Electronics Engineers, 2019. p. 1187-1191 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

TY - GEN

T1 - Orthogonal precoder for integer-forcing MIMO

AU - Hasan, Mohammad Nur

AU - Kurkoski, Brian M.

AU - Sakzad, Amin

AU - Viterbo, Emanuele

PY - 2019

Y1 - 2019

N2 - This paper focuses on orthogonal precoding for integer-forcing linear receiver and shows it has two advantages over unitary precoding. Orthogonal precoding exhibits lower complexity than unitary precoding because the dimension of orthogonal matrices is half that of unitary matrices for a fixed number of antennas. Moreover, orthogonal precoding outperforms unitary precoding in terms of achievable rate and error-rate. Despite its promising advantages, it is not easy to find the optimal precoding matrices because it involves an orthogonality constraint and the shortest lattice vector problem. To solve this, we separate the optimization problem into two sub-problems and propose methods based on the steepest gradient with Lie groups and a random search algorithm. The proposed methods have low complexity and are applicable to any MIMO dimension. For high-order QAM, the proposed orthogonal precoder outperforms X-precoders which are designed specifically for QAM.

AB - This paper focuses on orthogonal precoding for integer-forcing linear receiver and shows it has two advantages over unitary precoding. Orthogonal precoding exhibits lower complexity than unitary precoding because the dimension of orthogonal matrices is half that of unitary matrices for a fixed number of antennas. Moreover, orthogonal precoding outperforms unitary precoding in terms of achievable rate and error-rate. Despite its promising advantages, it is not easy to find the optimal precoding matrices because it involves an orthogonality constraint and the shortest lattice vector problem. To solve this, we separate the optimization problem into two sub-problems and propose methods based on the steepest gradient with Lie groups and a random search algorithm. The proposed methods have low complexity and are applicable to any MIMO dimension. For high-order QAM, the proposed orthogonal precoder outperforms X-precoders which are designed specifically for QAM.

UR - http://www.scopus.com/inward/record.url?scp=85073155323&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849336

DO - 10.1109/ISIT.2019.8849336

M3 - Conference Paper

AN - SCOPUS:85073155323

SN - 9781538692929

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1187

EP - 1191

BT - 2019 IEEE International Symposium on Information Theory

A2 - Caire, Giuseppe

A2 - Veeravalli, Venugopal V.

A2 - Wagner, Aaron B.

A2 - Zemor, Gilles

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - Piscataway NJ USA

T2 - IEEE International Symposium on Information Theory 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

Hasan MN, Kurkoski BM, Sakzad A , Viterbo E. Orthogonal precoder for integer-forcing MIMO. In Caire G, Veeravalli VV, Wagner AB, Zemor G, editors, 2019 IEEE International Symposium on Information Theory: Proceedings. Piscataway NJ USA: IEEE, Institute of Electrical and Electronics Engineers. 2019. p. 1187-1191. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2019.8849336

Orthogonal precoder for integer-forcing MIMO

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this