By Topic

Decoding on Graphs: LDPC-Coded MISO Systems and Belief Propagation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Djahanshahi, A.H. ; Univ. of California at San Diego, La Jolla ; Siegel, P.H. ; Milstein, L.B.

This paper proposes a new approach for decoding LDPC codes over MISO channels. Since in an nT times 1 MISO system with a modulation of alphabet size 2M, nT transmitted symbols are combined and produce one received symbol at the receiver, we propose considering the LDPC-coded MISO system as an LDPC code over 2MnT-ary alphabet. Consequently, we propose a modified Tanner graph to introduce belief propagation for decoding MISO-LDPC systems. As a result, the MISO symbol detection and binary LDPC decoding steps are merged into a single message passing decoding. We also propose an efficient method that significantly reduces the complexity of belief propagation decoding in MISO-LDPC systems. Furthermore, we show that our proposed decoder outperforms the conventional decoder for short length LDPC codes in unknown channel scenarios.

Published in:

Wireless Communications and Networking Conference, 2008. WCNC 2008. IEEE

Date of Conference:

March 31 2008-April 3 2008