The Design and Analysis of Distributed Fountain Codes in Three-Source Single-Relay Networks

Article Preview

Abstract:

A novel distributed fountain coding scheme for three-source single-relay networks is proposed. First, the robust Soliton distribution (RSD) is threefoldly deconvolved to get the degree distribution for each source performing encoding. Then the single relay performs re-encoding using certain degree distribution. The asymptotic performance of distributed fountain codes with three sources (DFC-3) is analyzed by the And-Or tree technique. Simulations of the proposed DFC-3 are evaluated and compared with other fountain coding schemes. Simulation results show that the overall degree distribution of DFC-3 is consistent with RSD, and the BER performance agrees with the results of asymptotic analysis. It also reveals that DFC-3 have good performance on lossless channels.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

6042-6045

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Byers J W, Luby M, Mitzenmacher M, et al. A Digital Fountain Approach to Reliable Distribution of Bulk Data. ACM SIGCOMM Computer Communication Review. 1998, 28(4): 56-67.

DOI: 10.1145/285243.285258

Google Scholar

[2] Mackay D J C. Fountain codes. IEE Proceedings-Communications. 2005, 152(6): 1062-1068.

Google Scholar

[3] Luby M. LT codes. Proc. 2002 IEEE Symp. Foundations of Computer Science (FOCS). Vancouver, Canada: 2002: 271-280.

Google Scholar

[4] Puducheri S, Kliewer J, Fuja T E. The Design and Performance of Distributed LT Codes. IEEE Transactions on Information Theory. 2007, 53(10): 3740-3754.

DOI: 10.1109/tit.2007.904982

Google Scholar

[5] Liau A, Yousefi S, Il-Min K. Binary Soliton-Like Rateless Coding for the Y-Network. IEEE Transactions on Communications. 2011, 59(12): 3217-3222.

DOI: 10.1109/tcomm.2011.091911.100189

Google Scholar

[6] Liau A, Kim I, Yousefi S. Improved Low-Complexity Soliton-Like Network Coding for a Resource-Limited Relay. IEEE Transactions on Communications. 2013, 61(8): 3327-3335.

DOI: 10.1109/tcomm.2013.061913.110585

Google Scholar

[7] Talari A, Rahnavard N. Distributed Unequal Error Protection Rateless Codes over Erasure Channels: A Two-Source Scenario. IEEE Transactions on Communications. 2012, PP(99): 1-7.

DOI: 10.1109/tcomm.2012.051512.110109

Google Scholar

[8] Sejdinovic D, Piechocki R J, Doufexi A. AND-OR tree analysis of distributed LT codes. Proceedings 2009 IEEE Information Theory Workshop on Networking and Information Theory. Volos, Greece: 2009: 261-265.

DOI: 10.1109/itwnit.2009.5158583

Google Scholar

[9] Shao H, Xu D, Zhang X. Asymptotic Analysis and Optimization for Generalized Distributed Fountain Codes. IEEE Communications Letters. 2013, 17(5): 988-991.

DOI: 10.1109/lcomm.2013.040913.130187

Google Scholar