Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission
Open Access
- 11 February 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (7) , 4491-4517
Abstract
Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are considered. However, in communications, complex-valued processing is usually of interest. Besides, by the use of dual-polarized transmission as well as by the combination of two time slots or frequencies, four-dimensional (quaternion-valued) approaches become more and more important. Hence, to account for this fact, well-known lattice algorithms and related concepts are generalized in this work. To this end, a brief review of complex arithmetic, including the sets of Gaussian and Eisenstein integers, and an introduction to quaternion-valued numbers, including the sets of Lipschitz and Hurwitz integers, are given. On that basis, generalized variants of two important algorithms are derived: first, of the polynomial-time LLL algorithm, resulting in a reduced basis of a lattice by performing a special variant of the Euclidean algorithm defined for matrices, and second, of an algorithm to calculate the successive minima—the norms of the shortest independent vectors of a lattice—and its related lattice points. Generalized bounds for the quality of the particular results are established and the asymptotic complexities of the algorithms are assessed. These findings are extensively compared to conventional real-valued processing. It is shown that the generalized approaches outperform their real-valued counterparts in complexity and/or quality aspects. Moreover, the application of the generalized algorithms to MIMO communications is studied, particularly in the field of lattice-reduction-aided and integer-forcing equalization.Keywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (Fi 982/13-1)
- Engineering and Physical Sciences Research Council (EP/S021043/1)
This publication has 66 references indexed in Scilit:
- Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channelsIEEE Transactions on Information Theory, 2003
- Closest point search in latticesIEEE Transactions on Information Theory, 2002
- Sphere-bound-achieving coset codes and multilevel coset codesIEEE Transactions on Information Theory, 2000
- A simple transmit diversity technique for wireless communicationsIEEE Journal on Selected Areas in Communications, 1998
- A generalization of the LLL-algorithm over euclidean rings or ordersJournal de Théorie des Nombres de Bordeaux, 1996
- Codes over Gaussian integersIEEE Transactions on Information Theory, 1994
- Numerical recipes: the art of scientific computingAnalytica Chimica Acta, 1987
- Fast quantizing and decoding and algorithms for lattice quantizers and codesIEEE Transactions on Information Theory, 1982
- Ueber die positiven quadratischen Formen und über kettenbruchähnliehe Algorithmen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1891
- Extraits de lettres de M. Ch. Hermite à M. Jacobi sur différents objects de la théorie des nombres.Journal für die reine und angewandte Mathematik (Crelles Journal), 1850