• Title/Summary/Keyword: Channel State Information (CSI)

Search Result 173, Processing Time 0.023 seconds

Performance of Two-User Two-Way Amplify-and-Forward Relaying Systems with Scheduling

  • Fang, Zhaoxi;Li, Guosheng;Li, Jun
    • ETRI Journal
    • /
    • v.33 no.5
    • /
    • pp.689-694
    • /
    • 2011
  • In this paper, we study scheduling schemes for two-user two-way wireless relaying systems. Two transmission modes are considered: point-to-point direct transmission and two-way amplify-and-forward relaying. An optimal scheduling scheme that opportunistically selects the best transmission mode for each user is proposed to minimize the sum bit error rate (BER). The performance lower bound of the optimal scheduling scheme is analyzed, and closed-form expression of the lower-bound BER is derived. However, for optimal scheduling, the scheduler requires the knowledge of channel state information (CSI) of all links. To reduce the feedback information of CSI, we also propose a suboptimal scheduling scheme that selects the transmission mode using only the CSI of two direct links. Simulation results show that there are 4 dB to 8 dB gains for the proposed optimal and suboptimal schemes over the fixed direct transmission and fixed two-way relayed transmission scheme. The performance gap between the optimal and suboptimal scheduling schemes is small, which implies a good trade-off between implementation complexity and system performance.

Performance Analysis of Coded Cooperation Protocol with Reactive and Proactive Relay Selection

  • Asaduzzaman, Asaduzzaman;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.2
    • /
    • pp.133-142
    • /
    • 2011
  • Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.

Achievable Rate of Beamforming Dual-hop Multi-antenna Relay Network in the Presence of a Jammer

  • Feng, Guiguo;Guo, Wangmei;Gao, Jingliang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3789-3808
    • /
    • 2017
  • This paper studies a multi-antenna wireless relay network in the presence of a jammer. In this network, the source node transmits signals to the destination node through a multi-antenna relay node which adopts the amplify-and-forward scheme, and the jammer attempts to inject additive signals on all antennas of the relay node. With the linear beamforming scheme at the relay node, this network can be modeled as an equivalent Gaussian arbitrarily varying channel (GAVC). Based on this observation, we deduce the mathematical closed-forms of the capacities for two special cases and the suboptimal achievable rate for the general case, respectively. To reduce complexity, we further propose an optimal structure of the beamforming matrix. In addition, we present a second order cone programming (SOCP)-based algorithm to efficiently compute the optimal beamforming matrix so as to maximize the transmission rate between the source and the destination when the perfect channel state information (CSI) is available. Our numerical simulations show significant improvements of our propose scheme over other baseline ones.

Throughput Performance analysis of AMC based on New SNR Estimation Algorithm using Preamble (프리앰블을 이용한 새로운 SNR 추정 알고리즘 기반의 AMC 기법의 전송률 성능 분석)

  • Seo, Chang-Woo;Portugal, Sherlie;Hwang, In-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.4
    • /
    • pp.6-14
    • /
    • 2011
  • The fast growing of the number of users requires the development of reliable communication systems able to provide higher data rates. In order to meet those requirements, techniques such as Multiple Input Multiple Out (MIMO) and Orthogonal Frequency Division multiplexing (OFDM) have been developed in the recent years. In order to combine the benefits of both techniques, the research activity is currently focused on MIMO-OFDM systems. In addition, for a fast wireless channel environment, the data rate and reliability can be optimized by setting the modulation and coding adaptively according to the channel conditions; and using sub-carrier frequency, and power allocation techniques. Depending on how accurate the feedback-based system obtain the channel state information (CSI) and feed it back to the transmitter without delay, the overall system performance would be poor or optimal. In this paper, we propose a Signal to Noise Ratio (SNR) estimation algorithm where the preamble is known for both sides of the transciever. Through simulations made over several channel environments, we prove that our proposed SNR estimation algorithm is more accurate compared with the traditional SNR estimation. Also, We applied AMC on several channel environments using the parameters of IEEE 802.11n, and compared the Throughput performance when using each of the different SNR Estimation Algorithms. The results obtained in the simulation confirm that the proposed algorithm produces the highest Throughput performance.

Joint Feedback Design for Interference Channel (간섭 채널을 위한 통합 궤환 정보 설계)

  • Jeon, Ki-Jun;Byun, Ilmu;Ko, Byung-Hoon;Rhee, Duho;Lee, Seung-Ro;Kim, Kwang-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.927-936
    • /
    • 2012
  • In this paper, we study joint feedback design for interference channel (IC). We develop a simple iterative algorithm for the joint feedback design to maximize the expected rate when the transmitters use partial channel-state information (CSI) obtained by the feedback link. Also, from the simulation result, we show that the performance gain is obtained compared to the conventional scheme.

Robust Cooperative Relay Beamforming Design for Security

  • Gong, Xiangwu;Dong, Feihong;Li, Hongjun;Shao, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4483-4501
    • /
    • 2015
  • In this paper, we investigate a security transmission scheme at the physical layer for cooperative wireless relay networks in the presence of a passive eavesdropper. While the security scheme has been previously investigated with perfect channel state information(CSI) in the presence of a passive eavesdropper, this paper focuses on researching the robust cooperative relay beamforming mechanism for wireless relay networks which makes use of artificial noise (AN) to confuse the eavesdropper and increase its uncertainty about the source message. The transmit power used for AN is maximized to degrade the signal-to-interference-plus-noise-ratio (SINR) level at the eavesdropper, while satisfying the individual power constraint of each relay node and worst-case SINR constraint at the desired receiver under a bounded spherical region for the norm of the CSI error vector from the relays to the destination. Cooperative beamforming weight vector in the security scheme can be obtained by using S-Procedure and rank relaxation techniques. The benefit of the proposed scheme is showed in simulation results.

The Diversity-Multiplexing Tradeoff for Multiple-Antenna Adaptive Decode and Forward Relay Protocols Exploiting Imperfect CSIT (불완전한 채널정보를 사용하는 다중안테나 적응형 복호 후 전송 중계 프로토콜의 Diversity-Multiplexing Tradeoff 분석)

  • Yoon, Han-Sang;Yoon, Eun-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9A
    • /
    • pp.776-783
    • /
    • 2011
  • In this paper, assuming that the transmitter can exploit imperfect channel state information (CSI), the diversity-multiplexing tradeoff (DMT) functions of three adaptive decode-and-forward (DF) relay protocols, each of which uses multiple-antennas at the destination node, at the relay node, or at the source node are derived. When the imperfect CSI qualities for the source-relay link, the relay-destination link, and the source-destination link are subject to asymptotic conditions, the additional diversity gains attainable by exploiting the imperfect CSI at the transmitter for those three adaptive DF relay protocols are investigated.

Degrees of Freedom of 3-user MIMO Interference Channels with Instantaneous Relay Using Interference Alignment

  • Qiang, Wang;Yuquan, Shu;Minhua, Dong;Ji, Xu;Xiaofeng, Tao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1624-1641
    • /
    • 2015
  • Instantaneous relay (relay-without-delay) using interference alignment is a promising approach to neutralizing interference and improving system capacity. In Wang Chenwei's work, a 2-user scenario required both source and relay to access the global channel state information (CSI). This paper shows a new method of interference alignment improves the degrees of freedom (DoF) prominently for the 3-user MIMO interference channel with instantaneous relay. This new method is focused on the relay node that completes the alignment interference neutralization so the global CSI is obtained only once and the pressure on the base station can be mitigated. In addition, the 3-user MIMO interference channels with instantaneous relay can achieve 2M DoF when source and destination have M antennas, respectively. This method shows 33% improvement over the conventional method using interference alignment which obtains 3M/2 DoF.

Robust Secure Transmit Design with Artificial Noise in the Presence of Multiple Eavesdroppers

  • Liu, Xiaochen;Gao, Yuanyuan;Sha, Nan;Zang, Guozhen;Wang, Shijie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2204-2224
    • /
    • 2021
  • This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel. To enhance security of communication link, the artificial noise (AN) is generated at transmitter. We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers. The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs). The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly. To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP). Additionally, the secrecy rate maximization is explored for fixed total transmit power. To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA). The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.

Minimum BER Power Allocation for OFDM-based Cognitive Radio Networks

  • Xu, Ding;Li, Qun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2338-2353
    • /
    • 2015
  • In this paper, the optimal power allocation algorithm that minimizes the aggregate bit error rate (BER) of the secondary user (SU) in a downlink orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) system, while subjecting to the interference power constraint and the transmit power constraint, is investigated under the assumption that the instantaneous channel state information (CSI) of the interference links between the secondary transmitter and the primary receiver, and between the primary transmitter and the secondary receiver is perfectly known. Besides, a suboptimal algorithm with less complexity is also proposed. In order to deal with more practical situations, we further assume that only the channel distribution information (CDI) of the interference links is available and propose heuristic power allocation algorithms based on bisection search method to minimize the aggregate BER under the interference outage constraint and the transmit power constraint. Simulation results are presented to verify the effectiveness of the proposed algorithms.