Soft-decision Decoding of Block Codes using the k Shortest Paths Algorithm

摘要：

In this paper, we develop a softdecision decoding algorithm for block codes using the k shortest paths algorithm. The performance of this algorithm is investigated and compared with other decoding schemes. The results show the proposed algorithm gives large gains over the Generalised Minimum Distance (GMD) decoding algorithm and algebraic hard-decision decoding. Further, the proposed algorithm achieves near-MLD performance for the codes simulated. An investigation of the complexity of this algorithm shows the proposed algorithm to be computationally more efficient than the standard Order-l reprocessing algorithm.

作者: Ismail Shakccl Alex Grant

作者单位: Institute for Telecommunications Research, University of South Australia

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 209-213

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）