Joint Partial Relay and Antenna Selection for Full-Duplex Amplify-and-Forward Relay Networks

Ou, Qinghai; Hou, Xinjing; Liu, Fang; Liu, Yuanan; Fang, Shaofeng

doi:10.1007/978-3-319-72998-5_16

Cited by 4 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The polynomial coefficients are taken GF(2 4 ), and α is the primitive in GF(2 4 ). The selection process of K 2 = 7 out of K 1 = 11 using proposed methods are as follow.…”

Section: Examples Of Two Methodsmentioning

confidence: 99%

“…Information Selection Methods for Distributed Goppa Coding Scheme Figures 3,4 and 5 show the performance of three different distributed Goppa code schemes for different selection methods, respectively. It is assumed that source-relay link is ideal, i.e., (γ S,R = ∞) and the smart decoding algorithm is applied.…”

Section: Performance Comparison Under Differentmentioning

confidence: 99%

“…Cover and Gamal analyzed the capacity of the relay channel and concluded that the capacity of the whole relay channel is better than that between the source node and the destination node in most cases. Different cooperative relay information forwarding protocols have been presented, such as amplify-and-forward [4], compress-and-forward [5] and decodeand-forward [6]. Combining these protocols with channel coding builds a more effective mode of cooperation, which is known as coded-cooperative.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Jointly Optimized Design of Distributed Goppa Codes and Decoding

Feng¹,

Yang²,

Chen³

et al. 2023

RADIOENGINEERING

View full text Add to dashboard Cite

In order to improve the adverse influence of fading channel in communication system, a distributed Goppa coding scheme is proposed in this paper. Two Goppa codes are set at the source node and the relay node in this scheme respectively. An optimal design criterion at the relay is proposed to obtain the optimal joint resultant code at the destination. Furthermore, two novel joint decoding algorithms are proposed to enhance the overall BER performance of the proposed scheme. Monte Carlo simulations show that the proposed distributed Goppa coding scheme outperforms the non-cooperative scheme. Moreover, the proper information selection approach at the relay performs better than random selection in the proposed distributed Goppa coding scheme.

show abstract

“…The polynomial coefficients are taken GF(2 4 ), and α is the primitive in GF(2 4 ). The selection process of K 2 = 7 out of K 1 = 11 using proposed methods are as follow.…”

Section: Examples Of Two Methodsmentioning

confidence: 99%

Section: Performance Comparison Under Differentmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Jointly Optimized Design of Distributed Goppa Codes and Decoding

Feng¹,

Yang²,

Chen³

et al. 2023

RADIOENGINEERING

View full text Add to dashboard Cite

show abstract

“…Furthermore, Table 5 lists all three scenarios of distributed RS codes and selection patterns, which will be considered in Section 6 to generalize the proposed distributed RS coding scheme. 3,4,6,8,10,11,12,15,16,20,21,22,23,25,26,27] 3515 505725 123550 2 [1,3,4,5,7,8,9,10,11,12,13,14,15,18,19,20,24] 3515 584250 ---3 [2,3,4,5,6,8,11,13,14,15,19,20,21,22,23,24,26] 3515 505725 132425…”

Section: Last Partmentioning

confidence: 99%

“…In a cooperative communication system, a relay node repeats the received information from source node through either relaying or hard detection as discussed in [2]. Different protocols of cooperative communication have been proposed such as decoded-andforward [24], compress-and-forward [25] and amplifyand-forward [26]. These protocols have been combined with channel codes to construct a more efficient way of cooperation known as coded-cooperative.…”

Section: Introductionmentioning

confidence: 99%

Jointly Optimized Design of Distributed RS Codes by Proper Selection in Relay

Guo

Yang

Zhao

et al. 2021

Preprint

View full text Add to dashboard Cite

This paper proposes a distributed RS coding scheme which is comprised of two different ReedSolomon (RS) codes over fast Rayleigh fading channel. Practically in any distributed coding scheme, an appropriate encoding strategy at the relay plays a vital role in achieving an optimized code at the destination. Therefore, the authors have proposed an efficient approach for proper selection of information at the relay based on subspace approach. Using this approach as the proper benchmark, another more practical selection approach with low complexity is also proposed. Monte Carlo simulations demonstrate that the distributed RS coding scheme under the two approaches can achieve nearly the same bit error rate (BER) performance. Furthermore, to jointly decode the source and relay codes at the destination, two different decoding algorithms named as naive and smart algorithms are proposed. The simulation results reveal that the advantage of smart algorithm as compared to naive one. The proposed distributed RS coding scheme with smart algorithm outperforms its non-cooperative scheme by a gain of 2.4-3.2 dB under identical conditions. Moreover, the proposed distributed RS coding scheme outperforms multiple existing distributed coding schemes, making it an excellent candidate for the future distributed coding wireless communications.

show abstract