On the performance of independently designed LDPC codes for the relay channel
Proceedings of the 2006 Infernational Symposium on Information Theory (ISIT 2006), Seattle, WA, July 2006.
Download
Adobe Portable Document Format - [PDF]
Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Abstract
A decode-and-forward LDPC-based coding and decoding scheme is proposed and applied to the BAWGN single-relay channel. The source broadcasts information to both the relay and the destination. The relay is able to simultaneously receive and transmit. Both the relay and the destination apply successive iterative decoding using belief propagation. In the proposed scheme, the LDPC code used by the source and the LDPC code used by the relay are designed independently of each other. Optimality properties of this approach are established via information-theoretic upper and lower bounds. Asymptotic analysis shows that the performance of the proposed scheme can be as close as 0 .02 dB away from the theoretical limit for any decode-and-forward scheme, and simulation results show that its performance for a block code of length 214 can be within 0.65 dB away from the same limit with a corresponding bit error probability of 10^{-6} .
Reference
J. Ezri and M. Gastpar, On the performance of independently designed LDPC codes for the relay channel, Proceedings of the 2006 International Symposium on Information Theory (ISIT 2006), Seattle, WA, July 2006.
BibTeX
@INPROCEEDINGS(je_mg_isit06, AUTHOR = "J.~Ezri and M.~Gastpar", TITLE = "On the performance of independently designed LDPC codes for the relay channel", BOOKTITLE = "Proceedings of the 2006 International Symposium on Information Theory (ISIT 2006)", MONTH = "July", ADDRESS = "Seattle, WA", YEAR = "2006")