By Topic

A Fresh Look at Coding for q -ary Symmetric Channels

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)
Weidmann, C. ; ETIS-ENSEA, Univ. Cergy-Pontoise, Cergy-Pontoise, France ; Lechner, G.

This paper studies coding schemes for the q-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size q=2m, m ∈N, thus complementing some recently proposed packet-based schemes requiring large q . First, theoretical optimality of a simple layered scheme is shown; then, a practical coding scheme based on a simple modification of standard binary LDPC decoding is proposed. The decoder is derived from first principles and using a factor-graph representation of a front end that maps q -ary symbols to groups of m bits connected to a binary code. The front end can be processed with a complexity that is linear in m=log2q. An extrinsic information transfer chart analysis is carried out and used for code optimization. Finally, it is shown how the same decoder structure can also be applied to a larger class of q-ary channels.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 11 )