ARQ‐based updatable relay selection for distributed EO‐STBC cooperative system

Bai, Zhiquan; Yang, Xianglai; Kwak, Kyungsup

doi:10.1002/dac.2347

Cited by 5 publications

(4 citation statements)

References 15 publications

(28 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cooperative communication, originated from MIMO technology, can provide transmit diversity, increase coverage area, and improve system performance [6]- [8]. Many literatures have studied the typical cooperative relaying processing modes, such as amplify-and-forward (AF) relaying, decode-and-forward (DF) scheme, incremental relaying protocol, and so on [9]- [11].…”

Section: Introductionmentioning

confidence: 99%

A Joint Bit-to-Symbol Mapping Scheme in Cooperative Spatial Modulation System

et al. 2019

Self Cite

View full text Add to dashboard Cite

In this paper, a joint bit-to-symbol mapping scheme in a cooperative spatial modulation (SM) system with amplify-and-forward (AF) and decode-and-forward (DF) protocols is proposed to improve the system performance, such as the transmission bit rate and the average bit error rate (BER). The system model and the corresponding signal processing with maximum likelihood (ML) detection for the cooperative SM system without a direct link are presented first. With the consideration of both the cosine similarity among the relay nodes and the channel state information (CSI) of each transmit antenna, the bit-to-symbol mapping scheme that jointly selects the cooperative relay node, the transmit antenna, and the signal constellation is proposed. Then, its average BER performance is derived based on the moment generation function (MGF). For the proposed mapping scheme, a detailed realization process has been given as an example. Furthermore, the simulation results verify that the proposed mapping scheme effectively increases the system transmission bit rate and also improves the system average BER performance compared with the traditional natural mapping scheme. INDEX TERMS Cooperative spatial modulation, bit-to-symbol mapping, AF, DF, cosine similarity, channel state information.

show abstract

Section: Introductionmentioning

confidence: 99%

A Joint Bit-to-Symbol Mapping Scheme in Cooperative Spatial Modulation System

et al. 2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…Although some researchers also focussed on extended OSTBCs [7], yet the use of maximum rank distance (MRD) codes for forming STBC was first proposed in [8]. Although some researchers also focussed on extended OSTBCs [7], yet the use of maximum rank distance (MRD) codes for forming STBC was first proposed in [8].…”

Section: Introductionmentioning

confidence: 99%

“…Most of the existing STBCs were developed based on the metric minimum hamming distance including OSTBCs. Although some researchers also focussed on extended OSTBCs [7], yet the use of maximum rank distance (MRD) codes for forming STBC was first proposed in [8]. MRD codes [9] are potential codes for the construction of STBCs because of their rank metric, which offers efficient error-correcting capability.…”

Section: Introductionmentioning

confidence: 99%

Gaussian integers and interleaved rank codes for space–time block codes

Asif¹,

Honary

Hamayun³

2015

Int J Communication

View full text Add to dashboard Cite

This paper presents the design of space-time block codes (STBCs) over maximum rank distance (MRD) codes, energy-efficient STBCs, STBCs using interleaved-MRD codes, the use of Gaussian integers for STBCs modulation, and Gabidulin's decoding algorithm for decoding STBCs. The design fundamentals of STBCs using MRD codes are firstly put forward for different number of transmit antennas. Extension finite fields (Galois fields) are used to design these linear block codes. Afterward, a comparative study of MRDbased STBCs with corresponding orthogonal and quasi-orthogonal codes is also included in the paper. The simulation results show that rank codes, for any number of transmit antennas, exhibit diversity gain at full rate contrary to orthogonal codes, which give diversity gain at full rate only for two transmit antennas case. Secondly, an energy-efficient MRD-STBC is proposed, which outperforms orthogonal STBC at least for 2 1 antenna system. Thirdly, interleaved-MRD codes are used to construct higher-order transmit antenna systems. Using interleaved-MRD codes further reduces the complexity (compared with normal MRD codes) of the decoding algorithm. Fourthly, the use of Gaussian integers is utilized in mapping MRD-based STBCs to complex constellations. Furthermore, it is described how an efficient and computationally less complex Gabidulin's decoding algorithm can be exploited for decoding complex MRD-STBCs. The decoding results have been compared against hard-decision maximum likelihood decoding. Under this decoding scheme, MRD-STBCs have been shown to be potential candidate for higher transmit antenna systems as the decoding complexity of Gabidulin's algorithm is far less, and its performance for decoding MRD-STBCs is somewhat reasonable.In this section, the design criteria of STBC and fundamentals of MRD codes are described. Design criteria for STBCIt is useful to present the information theory fundamentals behind the construction of STBCs. It is necessary to highlight that the following calculations are valid for Rayleigh fading channels. These vary for Rician and other channels [19]. However, in this paper, our discussion is limited to mere Rayleigh channels only; therefore, this fact will not disturb the results presented in this paper in any way.We start by assuming the transmission matrix as X i ; then Q X is the corresponding estimated matrix, which was obtained by ML decoding. Next, the probability of error (P(e)), that is,can be calculated based on Euclidean distance, d Eu as follows [20]: Int. J. Commun. Syst. 2017; 30: e2943 d M .x;´/ > d M .x; y/ C d M .y;´/ Namely, let x D u C .m C s/i; y D i;´D 0. By direct calculation, one can show that x D x.Hence, all three x,y,and´are in MZ . We have Energy-efficient MIMO systems are obtaining the attention of researchers recently in many aspects [27]. In this section, it is described how energy-constraint STBCs are formed using both MRD and orthogonal codes. We can make use of a specific primitive irreducible polynomial over GF.2/ to form our desired codes. Selecti...

show abstract

“…Wireless relaying is an efficient method to increase throughput and extend coverage of wireless networks [1][2][3][4][5]. So far, most existing works on relay networks assume perfect synchronization among different wireless nodes.…”

Section: Introductionmentioning

confidence: 99%

Low complexity timing estimation and resynchronization for asynchronous bidirectional communications with multiple antenna relay

Fang

Liang

Wang

et al. 2014

Int J Communication

View full text Add to dashboard Cite

In this paper, we consider an asynchronous bidirectional communication system over flat fading channels in which the two source nodes are not perfectly synchronized. A low complexity pilot aided timing estimation and resynchronization scheme is proposed to combat the fractional asynchronous delay between the two source nodes. In the proposed scheme, cyclic prefixed single carrier block transmission is implemented at the two sources and frequency domain orthogonal pilots are transmitted to the relay simultaneously. After timing and channel estimation at the relay, a fractionally spaced frequency domain equalizer is employed at the relay to resynchronize the received mixed signals. With the proposed resynchronization scheme, the data detection at the two sources is the same as in a perfect synchronized system, because the two asynchronous signals are already resynchronized at the relay node. Simulation results show that the performance gap between the proposed scheme and the perfect synchronized system is within 1 dB when there are four antennas at the relay.

show abstract

ARQ‐based updatable relay selection for distributed EO‐STBC cooperative system

Cited by 5 publications

References 15 publications

A Joint Bit-to-Symbol Mapping Scheme in Cooperative Spatial Modulation System

A Joint Bit-to-Symbol Mapping Scheme in Cooperative Spatial Modulation System

Gaussian integers and interleaved rank codes for space–time block codes

Low complexity timing estimation and resynchronization for asynchronous bidirectional communications with multiple antenna relay

Contact Info

Product

Resources

About