• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document : 5 / 5

ÇѱÛÁ¦¸ñ(Korean Title) Sum MSE Minimization for Downlink Multi-Relay Multi-User MIMO Network
¿µ¹®Á¦¸ñ(English Title) Sum MSE Minimization for Downlink Multi-Relay Multi-User MIMO Network
ÀúÀÚ(Author) Young-Min Cho   Janghoon Yang   Jeongwook Seo   Dong Ku Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 08 NO. 08 PP. 2722 ~ 2742 (2014. 08)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
We propose methods of linear transceiver design for two different power constraints, sum relay power constraint and per relay power constraint, which determine signal processing matrices such as base station (BS) transmitter, relay precoders and user receivers to minimize sum mean square error (SMSE) for multi-relay multi-user (MRMU) networks. However, since the formulated problem is non-convex one which is hard to be solved, we suboptimally solve the problems by defining convex subproblems with some fixed variables. We adopt iterative sequential designs of which each iteration stage corresponds to each subproblem. Karush-Kuhn-Tucker (KKT) theorem and SMSE duality are employed as specific methods to solve subproblems. The numerical results verify that the proposed methods provide comparable performance to that of a full relay cooperation bound (FRCB) method while outperforming the simple amplify-and-forward (SAF) and minimum mean square error (MMSE) relaying in terms of not only SMSE, but also the sum rate
Å°¿öµå(Keyword) MIMO   relay   MSE duality   precoding   transceiver optimization  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå