A Novel Hybrid Decoding Algorithm for Convolutional Codes

Yang Fan; Luo Zhen-dong; Tian Bao-yu

doi:10.3724/SP.J.1146.2008.00989

Volume 31 Issue 5

Dec. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2009 > 31(5): 1237-1240

Yang Fan, Luo Zhen-dong, Tian Bao-yu. A Novel Hybrid Decoding Algorithm for Convolutional Codes[J]. Journal of Electronics & Information Technology, 2009, 31(5): 1237-1240. doi: 10.3724/SP.J.1146.2008.00989

Citation:

Yang Fan, Luo Zhen-dong, Tian Bao-yu. A Novel Hybrid Decoding Algorithm for Convolutional Codes[J]. Journal of Electronics & Information Technology, 2009, 31(5): 1237-1240. doi: 10.3724/SP.J.1146.2008.00989

Citation:

PDF( 231 KB)

A Novel Hybrid Decoding Algorithm for Convolutional Codes

doi: 10.3724/SP.J.1146.2008.00989

Received Date: 2008-08-09
Rev Recd Date: 2009-01-07
Publish Date: 2009-05-19

Abstract

Abstract

A concatenated hybrid decoding algorithm for convolutional codes is presented. The algorithm is complemented by using two-stage decoding, where the first stage uses the Belief-Propagation (BP) algorithm, while the second stage uses the Modified Viterbi Decoding (MVD) algorithm. Firstly, the received sequence is pre-decoded by BP, and its outputs are divided into two groups which are reliable Log-Likelihood Ratios (LLRs) and unreliable LLRs. The hard decision symbols corresponding to reliable LLRs and the parts of received symbols corresponding to unreliable LLRs are formed a hybrid sequence, which is further corrected by MVD. Simulation shows that compared with the conventional Viterbi decoding algorithm, the proposed algorithm has a little performance deterioration with much lower average complexity at moderate-to-high signal to noise ratio.

FullText(HTML)

References(1)

References

Forney G D J. The Viterbi algorithmProc[J].. IEEE.1973,61(3):268-278[2]Benaissa M and Zhu Yi-qun. Reconfigurable hardwarearchitectures for sequential and hybrid decoding[J].IEEETrans. on Circuits and Systems I: Regular Papers.2007, 54(3):555-565[3]Sudhakar R, Mukhtar A, and Gu Zhen-zhong. Lowcomplexityerror selective Viterbi decoder [J]. ElectronicsLetters, 2000, 36(2): 147-148.[4]Zadeh S A G and Soleymani M R. An iterative M-algorithmbased decoder for convolutional codes [C]. CanadianConference on Electrical and Computer Engineering,Saskatoon, 2005: 1618-1621.[5]Felzenszwalb P F and Huttenlocher D R. Efficient beliefpropagation for early vision[J]. Computer Vision and PatternRecognition, 2006, 70(1): 261-268.[6]杨帆, 罗振东, 田宝玉. 改进的LDPC 串行译码[J]. 北京邮电大学学报, 2008, 31(4): 130-134.Yang Fan, Luo Zhen-dong, and Tian Bao-yu. A modifiedserial decoding algorithm for low-density parity-check codes[J]. Journal of Beijing University of Posts andTelecommunications, 2008, 31(4): 130-134.[7]Zhu L X, Wang J F, and Yang S Z. Iterative decoding ofturbo codes based on factor graphs[C][J].IEEE 2002international conference on Communications, Circuits andSystems and West Sino Expositions (ICCCASWeSinoExppo02), Chengdu, China.2002, vol.1:46-50[8]Wu Xiao-fu.[J].Ling Cong, and Jiang Ming, et al.. Towardsunderstanding weighted bit-flipping decoding[C]. IEEEInternational Symposium on Information Theory 07, Nice,France.2007,:-

Relative Articles

Supplements(0)

Cited By

Proportional views