TY - JOUR
T1 - Joint Unitary Triangularization for Gaussian Multi-User MIMO Networks
AU - Khina, Anatoly
AU - Livni, Idan
AU - Hitron, Ayal
AU - Erez, Uri
N1 - Publisher Copyright:
© 1963-2012 IEEE.
PY - 2015/5/1
Y1 - 2015/5/1
N2 - The problem of transmitting a common message to multiple users over the Gaussian multiple-input multiple-output broadcast channel is considered, where each user is equipped with an arbitrary number of antennas. A closed-loop scenario is assumed, for which a practical capacity-approaching scheme is developed. By applying judiciously chosen unitary operations at the transmit and receive nodes, the channel matrices are triangularized so that the resulting matrices have equal diagonals, up to a possible multiplicative scalar factor. This, along with the utilization of successive interference cancellation, reduces the coding and decoding tasks to those of coding and decoding over the single-antenna additive white Gaussian noise channel. Over the resulting effective channel, any off-the-shelf code may be used. For the two-user case, it was recently shown that such joint unitary triangularization is always possible. In this paper, it is shown that for more than two users, it is necessary to carry out the unitary linear processing jointly over multiple channel uses, i.e., space-time processing is employed. It is further shown that exact triangularization, where all resulting diagonals are equal, is still not always possible, and appropriate conditions for the existence of such are established for certain cases. When exact triangularization is not possible, an asymptotic construction is proposed, that achieves the desired property of equal diagonals up to edge effects that can be made arbitrarily small, at the price of processing a sufficiently large number of channel uses together.
AB - The problem of transmitting a common message to multiple users over the Gaussian multiple-input multiple-output broadcast channel is considered, where each user is equipped with an arbitrary number of antennas. A closed-loop scenario is assumed, for which a practical capacity-approaching scheme is developed. By applying judiciously chosen unitary operations at the transmit and receive nodes, the channel matrices are triangularized so that the resulting matrices have equal diagonals, up to a possible multiplicative scalar factor. This, along with the utilization of successive interference cancellation, reduces the coding and decoding tasks to those of coding and decoding over the single-antenna additive white Gaussian noise channel. Over the resulting effective channel, any off-the-shelf code may be used. For the two-user case, it was recently shown that such joint unitary triangularization is always possible. In this paper, it is shown that for more than two users, it is necessary to carry out the unitary linear processing jointly over multiple channel uses, i.e., space-time processing is employed. It is further shown that exact triangularization, where all resulting diagonals are equal, is still not always possible, and appropriate conditions for the existence of such are established for certain cases. When exact triangularization is not possible, an asymptotic construction is proposed, that achieves the desired property of equal diagonals up to edge effects that can be made arbitrarily small, at the price of processing a sufficiently large number of channel uses together.
KW - Gaussian MIMO
KW - Matrix decompositions
KW - common-message broadcast
KW - physical-layer multicast
KW - space-time modulation
KW - successive interference cancellation
UR - http://www.scopus.com/inward/record.url?scp=84928533143&partnerID=8YFLogxK
U2 - 10.1109/TIT.2015.2409836
DO - 10.1109/TIT.2015.2409836
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84928533143
SN - 0018-9448
VL - 61
SP - 2662
EP - 2692
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 5
M1 - 7056559
ER -