Advances in Iterative Decoding and Maximum Likelihood Decoding for the Packet Network with Comparisons to Fountain Codes over the Erasure Channel
Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany
Proceedings: TURBO - CODING - 2006
Pages: 5Language: englishTyp: PDFPersonal VDE Members are entitled to a 10% discount on this title
Cai, J.; Tomlinson, M.; Tjhai, C.; Ambroze, M.; Ahmed, M. (Fixed and Mobile Communications Research, University of Plymouth, PL4 8AA, United Kingdom)
In this paper, we propose a novel ML decoding algorithm - the In-place Algorithm in conjunction with a Product Packetisation method for the congested Internet Network modeled as a Binary Erasure Channel (BEC). Any code can be used with this algorithm and we give results for cyclic codes constructed from BCH codes. Existing codes and decoding algorithms are compared in terms of performance and decoding complexity. It is shown that a significant performance improvement can be achieved. In general, ML decoding on the Erasure channel has a complexity of O(N3) or O(N2) depending on the algorithm. It is shown that this complexity can be reduced to O(N1:5) for the network channel by using the product packetisation method. With an analysis in performance, ratelessness can be achieved by acks.