Joint decoding of multiple non-binary LDPC codewords

We develop a belief-propagation (BP) decoder for the joint decoding of multiple codewords which belong to the same non-binary LDPC code. Decoding is based on soft information in form of joint channel-posterior probabilities of all codeword symbols. We extend the BP algorithm for q-ary LDPC codes suc...

Full description

Saved in:
Bibliographic Details
Main Author: Pfletschinger, Stephan
Format: Conference Proceeding
Language:English
Subjects:
Complexity theory
Decoding
Fading
Joints
Manganese
Parity check codes
Vectors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We develop a belief-propagation (BP) decoder for the joint decoding of multiple codewords which belong to the same non-binary LDPC code. Decoding is based on soft information in form of joint channel-posterior probabilities of all codeword symbols. We extend the BP algorithm for q-ary LDPC codes such that the FFT-based check node processing is preserved and the complexity remains manageable. This joint decoding is useful in settings in which multiple codewords are transmitted in a non-orthogonal way over the same channel, including multiple-access with packet collisions, physical-layer network coding and multi-resolution broadcasting. We show in an example that joint decoding can be far superior to separate decoding.
ISSN:2164-7038
DOI:10.1109/ICCW.2014.6881250