pith. sign in

arxiv: 1412.7772 · v1 · pith:RQBVEWXHnew · submitted 2014-12-25 · 💻 cs.IT · math.IT

Coordinate Tomlinson-Harashima Precoding Design for Overloaded Multi-user MIMO Systems

classification 💻 cs.IT math.IT
keywords antennasnumbercoordinatetransmitalgorithmdiagonaliterativeprecoding
0
0 comments X p. Extension
pith:RQBVEWXH Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{RQBVEWXH}

Prints a linked pith:RQBVEWXH badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

Tomlinson-Harashima precoding (THP) is a nonlinear processing technique employed at the transmit side to implement the concept of dirty paper coding (DPC). The perform of THP, however, is restricted by the dimensionality constraint that the number of transmit antennas has to be greater or equal to the total number of receive antennas. In this paper, we propose an iterative coordinate THP algorithm for the scenarios in which the total number of receive antennas is larger than the number of transmit antennas. The proposed algorithm is implemented on two types of THP structures, the decentralized THP (dTHP) with diagonal weighted filters at the receivers of the users, and the centralized THP (cTHP) with diagonal weighted filter at the transmitter. Simulation results show that a much better bit error rate (BER) and sum-rate performances can be achieved by the proposed iterative coordinate THP compared to the previous linear art.

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.