Skip to main content
Log in

Decomposed LT Codes for Cooperative Communications

  • Published:
International Journal of Wireless Information Networks Aims and scope Submit manuscript

Abstract

In order to reduce computation complexity and latency in cooperative communication system based on fountain code, a decomposed LT codes (DLT) based cooperative transmission scheme was proposed. The scheme comprises of two layers of random encoding but only a single layer of decoding. A general decomposition technique for the decomposed LT codes construction is developed. The transmission latency for the proposed scheme was analyzed. Simulation results show that the total time consumed under the proposed scheme can be significantly reduced compared to direct transmission and conventional cooperative transmission based on LT codes in the medium to high packet erasure rate regimes. Moreover, With the increase of packet erasure rate, the advantage of the proposed scheme is more evident.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. J. N. Laneman, D. N. C. Tse and G. W. Womell, Cooperative diversity in wireless networks: efficient protocols and outage behavior, The IEEE Transactions on Information Theory, Vol. 50, No. 12, pp. 3062–3080, 2004.

    Article  MATH  Google Scholar 

  2. J. N. Laneman and G. W. Wornell, Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks, The IEEE Transactions on Information Theory, Vol. 49, No. 10, pp. 2415–2425, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. E. Hunter, S. Sanayei and A. Nosratinia, Outage analysis of coded cooperation, The IEEE Transactions on Information Theory, Vol. 52, No. 10, pp. 375–391, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  4. Z. Yi, R. Adve and L. Teng Joon, Outage probability at arbitrary SNR with cooperative diversity, IEEE Communications Letters, Vol. 9, No. 8, pp. 700–702, 2005.

    Article  Google Scholar 

  5. W. P. Siriwongpairat, A. K. Sadek and K. J. Ray Liu, Cooperative communications protocol for multiuser OFDM networks, The IEEE Transactions on Wireless Communications, Vol. 7, No. 7, pp. 2430–2435, 2008.

    Article  Google Scholar 

  6. J.W.Byers, M.Luby and M.Mitzenmacher, A digital fountain approach to reliable distribution of bulk data, Proceeedings of the ACM SIGCOMM’98, Vancouver, Canada, pp. 56–67, 1998.

  7. J. Castura and Y. Mao, Rateless coding for wireless relay channels, The IEEE Transactions on Wireless Communications, Vol. 6, No. 5, pp. 1638–1642, 2007.

    Article  Google Scholar 

  8. A. F. Molisch, N. B. Mehta, J. S. Yedidia, et al., Performance of fountain codes in collaborative relay networks, The IEEE Transactions on Wireless Communications, Vol. 6, No. 11, pp. 4108–4119, 2007.

    Article  Google Scholar 

  9. X. Liu and T. J. Lim, Fountain codes over fading relay channels, The IEEE Transactions on Wireless Communications, Vol. 8, No. 6, pp. 3278–3287, 2009.

    Article  Google Scholar 

  10. Lei Wei-jia, Xie Xian-zhong and Li Guang-jun, The scheme and performance of wireless cooperative relay system using digital fountain codes, Acta Electraonic Sinica, Vol. 38, No. 1, pp. 228–233, 2010.

    Google Scholar 

  11. P. Pakzad, C. Fragouli, and A. Shokrollahi, Coding schemes for line networks, Proceedings of the IEEE International Symposium on Information Theory, Adelaide, Australia, pp. 1853–1857, 2005.

  12. R. Gummadi, and R. S. Sreenivas, Relaying a fountain code across multiple nodes, Proceedings of the Information Theory Workshop(ITW’08), Porto, Portugal, pp. 149–153, 2008.

  13. A. Tarable, I. Chatzigeorgiou, and I. J. Wassell, Randomly select and forward: Erasure probability analysis of a probabilistic relay channel model, Proceedings of the IEEE Information Theory Workshop, Taormina, Italy, pp. 41–45, 2009.

  14. H. Wicaksana, S. Ting, and Y. Guan, Spectral efficient half duplex relaying for fountain code with wireless network coding, Proceedings of the IEEE International Conference on Communications Workshops, Beijing, China, pp. 295–299, 2008.

  15. Rui Cao and Liuqing Yang, Decomposed LT codes for cooperative relay communications, IEEE Journal on selected areas in communications, Vol. 30, No. 2, pp. 407–414, 2012.

    Article  Google Scholar 

  16. D. Sejdinovic, R. J. Piechocki, and A. Doufexi, “AND-OR tree analysis of distributed LT codes, Proceedings of the IEEE Information Theory Workshop on Networking and Information Theory (ITW), Volos, Greece, pp. 261–265, 2009.

  17. K. Zhu, H. Wang, W. Sun, et al., A distributed fountain code for cooperative communications, Acta Electronica Sinica, 2014 (Accepted, in Chinese).

  18. M. Luby, LT codes, Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS), Vancouver, Canada, pp.271–280, 2002.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kaiyan Zhu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhu, K., Wang, H., Niu, F. et al. Decomposed LT Codes for Cooperative Communications. Int J Wireless Inf Networks 21, 317–324 (2014). https://doi.org/10.1007/s10776-014-0249-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10776-014-0249-5

Keywords

Navigation