DocumentCode :
1830193
Title :
Soft-decision Decoding of Block Codes using the k Shortest Paths Algorithm
Author :
Shakeel, Ismail ; Grant, Alex
Author_Institution :
Inst. for Telecommun. Res., South Australia Univ., The Levels, SA
fYear :
2006
fDate :
22-26 Oct. 2006
Firstpage :
209
Lastpage :
213
Abstract :
In this paper, we develop a soft-decision 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
Keywords :
algebraic codes; block codes; decoding; algebraic hard-decision decoding; block codes; generalised minimum distance; k shortest paths algorithm; soft-decision decoding; AWGN; Additive white noise; Block codes; Computational modeling; Conferences; Error correction codes; Hamming distance; Information theory; Maximum likelihood decoding; Shortest path problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE
Conference_Location :
Chengdu
Print_ISBN :
1-4244-0067-8
Electronic_ISBN :
1-4244-0068-6
Type :
conf
DOI :
10.1109/ITW2.2006.323789
Filename :
4119287
Link To Document :
بازگشت