Please use this identifier to cite or link to this item:
|Title:||Practical relay code design based on protograph codes||Authors:||Noor-A-Rahim, Md.
Ali, G.G.Md. Nawaz
Guan, Yong Liang
Relay Networks (Telecommunication)
|Issue Date:||2018||Source:||Noor-A-Rahim, M., Ali, G. N., & Guan, Y. L. (2018). Practical relay code design based on protograph codes. IET Communications, 12(3), 334-339.||Series/Report no.:||IET Communications||Abstract:||The low-density parity-check (LDPC) code design for three-terminal (namely, source, relay, and destination) relay network while considering decode-and-forward protocol is studied. Numerous works have been done on LDPC relay code design with parity bits forwarding approach, where additional parity bits are generated at the relay and forwarded to the destination. Most of the previous works assume that the forwarded parity bits are received perfectly at the destination and hence ignore the impact of relay–destination channel. This assumption is unrealistic in practical/finite-length codeword scenario. In this study, a protograph based LDPC code design is proposed while lifting the above unrealistic assumption. A Gaussian approximated density evolution is presented for the proposed scheme, which considers that the overall codeword experiences source–destination and relay–destination channels. For various designed codes with different rates, the authors show that the asymptotic thresholds of the designed codes are very close to the corresponding capacity bounds. Asymptotically, our designed code gives similar decoding threshold compared to the existing optimised irregular LDPC codes, while protograph codes are simpler to optimise and encode than the irregular LDPC codes. More importantly, proposed code performs better than the existing LDPC-based relay codes for finite-length scenarios.||URI:||https://hdl.handle.net/10356/87706
|ISSN:||1751-8628||DOI:||http://dx.doi.org/10.1049/iet-com.2017.1002||Rights:||© 2017 Institution of Engineering and Technology. This paper was published in IET Communications and is made available as an electronic reprint (preprint) with permission of Institution of Engineering and Technology. The published version is available at: [http://dx.doi.org/10.1049/iet-com.2017.1002]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.