Optimal design of joint network LDPC codes over orthogonal multiple-access relay channels Online publication date: Tue, 22-Dec-2015
by Jingyi Wang; Shuling Che; Ying Li; Junlong Wang
International Journal of Grid and Utility Computing (IJGUC), Vol. 7, No. 1, 2016
Abstract: Optimisation of degree distribution for joint network LDPC code over orthogonal Multiple-Access Relay Channels (MARC) is investigated in this paper. We first use a differential evolution algorithm to optimise the degree distribution of the joint network LDPC code over orthogonal MARC based on Gaussian approximation. Then, using a modified differential evolution algorithm, we design a rate-compatible network LDPC code, which is equivalent to designing a single code with different Signal-to-Noise Ratio (SNR). Simulation results show that the gap between Bit Error Rate (BER) performance of the former algorithm and the decoding threshold is about 0.4 dB and that between the capacity limit and decoding threshold is less than 0.7 dB at BER = 10−6. Simultaneously, the gap between BER performance of the latter algorithm and the decoding threshold is about 0.52 dB and that between the capacity limit and the decoding threshold is less than 0.46 dB at BER = 10−7.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook