TY - GEN
T1 - A high rate open-loop MIMO multi-user downlink transmission system
AU - Han, Yang
AU - See, Ho Ting
AU - Yong, Liang Guan
PY - 2007
Y1 - 2007
N2 - In this paper, we first propose a new class of full rate full diversity Quasi-Orthogonal Space Time Block Code (QOSTBC), namely QO-STBC with Blind Precoding (BP-QO-STBC). Based on this code, an open-loop MIMO multi-user downlink transmission scheme is derived. Presuming M blocks of BP-QOSTBC are transmitted from the access point simultaneously, thus achieving a multiplexing gain of M, we show that the broadcasted signal can be separated by any user with only mR ≥ M receive antennas, which is much smaller than that required by conventional linear schemes. By exploiting the special structure of BP-QO-STBC, we derived two decoding algorithms with different complexities, namely an optimal Maximum Likelihood Decoder which achieves the lowest decoding complexity known for all full rate full diversity QO-STBC, and a suboptimal linear decoder with even lower complexity. Thus a flexible tradeoff between complexity and performance is achieved. A comparison between the proposed scheme and Random Beamforming in terms of bit error rate is also shown via simulation and the results support our proposed scheme as a better practical candidate for high speed wireless network.
AB - In this paper, we first propose a new class of full rate full diversity Quasi-Orthogonal Space Time Block Code (QOSTBC), namely QO-STBC with Blind Precoding (BP-QO-STBC). Based on this code, an open-loop MIMO multi-user downlink transmission scheme is derived. Presuming M blocks of BP-QOSTBC are transmitted from the access point simultaneously, thus achieving a multiplexing gain of M, we show that the broadcasted signal can be separated by any user with only mR ≥ M receive antennas, which is much smaller than that required by conventional linear schemes. By exploiting the special structure of BP-QO-STBC, we derived two decoding algorithms with different complexities, namely an optimal Maximum Likelihood Decoder which achieves the lowest decoding complexity known for all full rate full diversity QO-STBC, and a suboptimal linear decoder with even lower complexity. Thus a flexible tradeoff between complexity and performance is achieved. A comparison between the proposed scheme and Random Beamforming in terms of bit error rate is also shown via simulation and the results support our proposed scheme as a better practical candidate for high speed wireless network.
UR - http://www.scopus.com/inward/record.url?scp=50449088393&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50449088393&partnerID=8YFLogxK
U2 - 10.1109/ICICS.2007.4449733
DO - 10.1109/ICICS.2007.4449733
M3 - Conference contribution
AN - SCOPUS:50449088393
SN - 1424409837
SN - 9781424409839
T3 - 2007 6th International Conference on Information, Communications and Signal Processing, ICICS
BT - 2007 6th International Conference on Information, Communications and Signal Processing, ICICS
T2 - 2007 6th International Conference on Information, Communications and Signal Processing, ICICS
Y2 - 10 December 2007 through 13 December 2007
ER -