pith. machine review for the scientific record. sign in

arxiv: 1304.6470 · v1 · submitted 2013-04-24 · 💻 cs.IT · math.IT

Recognition: unknown

Low-Complexity Lattice Reduction-Aided Channel Inversion Methods for Large-Dimensional Multi-User MIMO Systems

Authors on Pith no claims yet
classification 💻 cs.IT math.IT
keywords precodingalgorithmschannelperformanceproposedcomplexityinversionlattice
0
0 comments X
read the original abstract

Low-complexity precoding {algorithms} are proposed in this work to reduce the computational complexity and improve the performance of regularized block diagonalization (RBD) {based} precoding {schemes} for large multi-user {MIMO} (MU-MIMO) systems. The proposed algorithms are based on a channel inversion technique, QR decompositions{,} and lattice reductions to decouple the MU-MIMO channel into equivalent SU-MIMO channels. Simulation results show that the proposed precoding algorithms can achieve almost the same sum-rate performance as RBD precoding, substantial bit error rate (BER) performance gains{,} and a simplified receiver structure, while requiring a lower complexity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.