• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.12-18
• /
• 2012

In this paper, we propose an improved analysis of transmission power of BTHP applied into the downlink multi-user (MU) multi-input multi-output (MIMO) system. On the contrary to the conventional analysis that adopts the strong interference assumption for every users in the system, the proposed analysis approximates the characteristics of the actual interference components so that provides more accurate approximation of the transmission power than that from the conventional analysis. By computer simulations, it is observed that the proposed approximation is more accurate than the conventional one, especially in the case of 4-QAM modulation.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.809-812
• /
• 2011

In this letter, in order to reduce the inter-channel interference at the transmitted side, we design the precoder based on Tomlinson-Harashima coding, which is well know for one kind of non-linear precoding schemes, for 3-user MIMO wireless systems. And its performance is also analyzed in comparison with that of the Dirty Paper Coding based precoder.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.63-69
• /
• 2011

In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user multi-input multi-output (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a $4{\times}4$ MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexity needed by the conventional QR decomposition with M-algorithm encoder (QRDM-E). Also, the encoding throughput of the proposed encoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.632-638
• /
• 2010

In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The Proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a $4\times4$ MU-MIMO system, the complexity of the proposed FSE is 16% that of the conventional QRD-M encoder (QRDM-E). Also, the encoding throughput of the proposed endoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.