Distributed Reed Muller Code with Multiple Relays for Cooperative Broadband Wireless Networks

Umar, Rahim; Yang, Feng; Mughal, Shoaib

doi:10.3103/s0735272719090024

Cited by 3 publications

(7 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Step 4: The optimized selection pattern is η (1) = η q = [1, 3,6,7,9,10,11]. Searching is terminated.…”

Section: Examples Of Two Methodsmentioning

confidence: 99%

“…Combining these protocols with channel coding builds a more effective mode of cooperation, which is known as coded-cooperative. Low density parity check (LDPC) codes [7], turbo codes [8], polar codes [9] and Reed-Muller (RM) codes [10] are applied to codedcooperative schemes in the existing literature [11][12][13][14][15].…”

Section: Introductionmentioning

confidence: 99%

“…For those types of wireless communication, most of them use short or medi-um length information sequences for transmission. Umar et al [10] used RM codes in the coded-cooperative scheme. Mughal et al [16] applied polar codes in the codecooperative scheme.…”

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

“…Step 4: The optimized selection pattern is η (1) = η q = [1, 3,6,7,9,10,11]. Searching is terminated.…”

Section: Examples Of Two Methodsmentioning

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%

“…Such type of communication may demand a short length message sequence rather than a long message sequence. In [19], the short length binary code RM code has been used in the coded-cooperative scheme and the scheme constructs a subcode at the destination which acquires a better bit-error-rate (BER) performance. Also, in [18,20], polar codes have been applied in the code cooperation scheme.…”

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