RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Multiple Peer-To-Peer Relay Network Robust Beamforming Based on Lorentz-Positive Matrices

        Jianhua Li,Yunshan Hou 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.10

        Aiming at minimizing the total transmit power of relay nodes in the multiple peer-to-peer relay network in the presence of channel estimation error, a relay beamforming method based on Lorentz positive matrix is proposed. Firstly, assuming the channel state information of the second hop in the relay network is uncertain and the signal to noise ratios of the destination nodes are given, the expression of total relay nodes transmit power minimization optimization problem is deduced. Secondly, some real valued variables are defined and the concept of Lorentz cone is used to transform the optimization problem into a real valued problem. Finally, using the equivalent linear matrix inequality description of Lorentz positive matrices, the relay transmit power minimization problem is transformed into a real valued convex optimization problem. The proposed method overcomes the problem existing in the conventional robust relay beamforming methods based on semi definite relaxation technique, which sometimes yield solution matrix of with a rank greater than 1. Simulation results show that in the case of different relay nodes and channel error coefficients, the proposed method yields minimum relay transmit power in line with the results of the robust relay beamforming method based on semi definite relaxation technique, which validates the effectiveness of the proposed method.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼