Abstract
In this paper, we answer several open questions related to diversity-multiplexing tradeoffs (DMTs) for point-to-point and multiple-access (MAC) MIMO channels. By analyzing the DMT performance of a simple code, we show that the optimal MAC-DMT holds even when the channel remains fixed for less than <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Knt</i> + <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">nr</i> -1 channel uses, where <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> is the number of users, <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">nt</i> is the number of transmit antennas of each user, and <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">nr</i> is the number of receive antennas at receiver. We also prove that the simple code is MAC-DMT optimal. A general code design criterion for constructing MAC-DMT optimal codes that is much more relaxed than the previously known design criterion is provided. Finally, by changing some design parameters, the simple code is modified for use in point-to-point MIMO channels. We show the modified code achieves the same DMT performance as the Gaussian random code.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
