By Topic

Bounds on the thresholds of non-binary LDPC codes

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

2 Author(s)
Levi, O. ; Sch. of Electr. Eng., Tel Aviv Univ., Tel Aviv, Israel ; Burshtein, D.

LDPC codes over non-binary Galois fields were proposed for reliable transmission over arbitrary discrete memoryless channels and in particular for transmission in the bandwidth efficient regime. It was shown that some properties, originally derived for binary LDPC codes, extend to the appropriately defined non-binary ensemble. However, the extension of density evolution to this ensemble results in a prohibitive computational complexity. In this paper we analyze the performance by tracking the evolution of the Bhattacharya noise parameter associated with the decoding messages, and derive upper and lower bounds on its evolution. These bounds are then used to obtain upper and lower bounds on the asymptotic threshold required for reliable communication.

Published in:

Electrical and Electronics Engineers in Israel, 2008. IEEEI 2008. IEEE 25th Convention of

Date of Conference:

3-5 Dec. 2008