loading...
MP&A Mixed Decoding Algorithm for LDPC Codes
Fredericton, New Brunswick, Canada May 14-May 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CNSR.2007.43Fifth Annual Conference on Communicat ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
C.L. Ho, National Central University, Taiwan
Hsu-Hung Yang, National Central University, Taiwan
Because the message passing (MP) method is suboptimum and optimum solutions are not guaranteed, we present a hybrid decoding method by combing the MP and the A* methods. We f irst make comparison between the MP and A* method and then show their combined performance. Using the hybrid structure, its decoding gain is the same as that of A method. Moreover, decoding complexity is sl ight ly greater than that of MP one. For codeword length 96 bits and coding rate 1/2 and BER = 10^-5 , the hybrid structure outperforms 1.4 dB decoding gain than the MP method. This improvement only required 1% received sequences to be transferred to A* decoding block. Our newly designed hybrid structure can solve both of the high decoding gain and low decoding complexity while it has the ability to yield the optimum solution.
Citation:
C.L. Ho, Hsu-Hung Yang, "MP&A Mixed Decoding Algorithm for LDPC Codes," cnsr, pp.239-244, Fifth Annual Conference on Communication Networks and Services Research (CNSR '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.