MIMO-STBC Based Multiple Relay Cooperative Communication Over Time-Selective Rayleigh Fading Links With Imperfect Channel Estimates

Jagannatham

IEEE Trans. Cogn. Commun. Netw.

2018

Self Cite

This work analyzes the performance of an underlay cognitive radio based decode-and-forward mixed multipleinput multiple-output (MIMO) radio frequency/free space optical (RF/FSO) cooperative relay system with multiple mobile secondary and primary user nodes. The effect of imperfect channel state information (CSI) arising due to channel estimation error is also considered at the secondary user transmitters (SU-TXs) and relay on the power control and symbol detection processes respectively. A unique aspect of this work is that both fixed and proportional interference power constraints are employed to limit the interference at the primary user receivers (PU-RXs). Analytical results are derived to characterize the exact and asymptotic outage and bit error probabilities of the above system under practical conditions of node mobility and imperfect CSI, together with impairments of the optical channel, such as path loss, atmospheric turbulence, and pointing errors, for orthogonal space-time block coded transmission between each SU-TX and relay. Finally, simulation results are presented to yield various interesting insights into the system performance such as the benefits of a midamble versus preamble for channel estimation.

Section: Cognitive System Modelmentioning

confidence: 99%

Cognitive MIMO-RF/FSO Cooperative Relay Communication With Mobile Nodes and Imperfect Channel State Information

Jagannatham

IEEE Trans. Cogn. Commun. Netw.

2018

Self Cite

“…Many researches have widely discussed for cooperative relay networks. () Two main relay categories are dual‐hop (DH) and multihop (MH) schemes, which are usually used as to obtain a cooperative diversity. () In addition, two main cooperation protocols have been proposed in the literature, such as amplify‐and‐forward (AF) and decode‐and‐forward (DF) cooperation.…”

Section: Introductionmentioning

confidence: 99%

“…To obtain the spatial diversity gain under the reasonable complexity at the relay node, orthogonal space‐time block code (OSTBC) in multiple‐input multiple‐output (MIMO) relaying networks have been also investigated. () Chalise and Vandendorpe analyzed the outage probability for OSTBC transmission over DH relay networks with DF protocol, assuming that each node is equipped with multiple antennas. Zhang et al derived exact formulas of the outage probability and its approximation in high signal‐to‐noise ratio (SNR) region for cognitive DF relay network in a spectrum sharing scenario with OSTBC transmission.…”

Section: Introductionmentioning

confidence: 99%

“…In one study, the authors presented an analysis of a selective DF relaying based MIMO STBC cooperative wireless system. Varshney and Jagannatham analyzed the effect of time‐selective fading arising due to node mobility and imperfect channel estimates on the error performance of MIMO STBC multiple DF relay cooperative networks where source and relay nodes have the same number of antennas.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Exact SEP and performance bounds for orthogonal space‐time block codes in cooperative multiantenna AF relaying networks

Jeong

Ryu

Jang

et al. 2019

Int J Communication

In this paper, we derive a moment generating function (MGF) for dual-hop (DH) amplify-and-forward (AF) relaying networks, in which all nodes have an arbitrary number of antennas, with orthogonal space-time block code (OSTBC) transmissions over Rayleigh fading channels. We present an exact error rate expression based on the derived MGF and another analytical approach to derive achievable performance bounds as closed-forms of symbol error rate, outage probability, and normalized channel capacity. Furthermore, we derive the asymptotic behavior of symbol error rate and outage probability. From this asymptotic behavior, it is shown that the diversity order and its dependence on antenna configurations can be explicitly determined. Simulation results are also presented to verify their accuracy by comparing with numerical results and to provide an insight to the relationship between relaying networks' antenna configuration and diversity order. It is confirmed that the transmit antenna gain of the source node and the receive antenna gain of the relay node can be obtained only when the relay is close to the destination, and then, the transmit antenna gain of the relay node and the receive antenna gain of the destination node can be obtained only when the relay is close to the source. KEYWORDS amplify-and-forward, dual-hop networks, MIMO, OSTBC, Rayleigh fading channels Int J Commun Syst. 2019;32:e3943.wileyonlinelibrary.com/journal/dac

“…Meanwhile, space-time block coding (STBC) schemes have been developed to provide reliable transmission for MIMO systems [10][11][12][13][14][15][16][17], particularly when channel parameters vary rapidly owing to the movement of mobile stations. The simple STBC scheme proposed by Alamouti [10] has attracted substantial attention because it can achieve full-rate and full-diversity gain by a simple combining operation on the receiver side.…”

Section: Introductionmentioning

confidence: 99%

Blind adaptive receiver for uplink multiuser massive MIMO systems

Shin

Seo

2019

ETRI Journal

Herein, we consider uplink multiuser massive multiple‐input multiple‐output systems when multiple users transmit information symbols to a base station (BS) by applying simple space‐time block coding (STBC). At the BS receiver, two detection filters for each user are used to detect the STBC information symbols. One of these filters is for odd‐indexed symbols and the other for even‐indexed symbols. Using constrained output variance metric minimization, we first derive a special relation between the closed‐form optimal solutions for the two detection filters. Then, using the derived special relation, we propose a new blind adaptive algorithm for implementing the minimum output variance‐based optimal filters. In the proposed adaptive algorithm, filter weight vectors are updated only in the region satisfying the special relation. Through a theoretical analysis of the convergence speed and a computer simulation, we demonstrate that the proposed scheme exhibits faster convergence speed and lower steady‐state bit error rate than the conventional scheme.