Computer Science – Information Theory
Scientific paper
2012-02-05
Computer Science
Information Theory
Scientific paper
We study LDPC codes for the channel with $2^m$-ary input $\underline{x}\in \GF(2)^m$ and output $\underline{y}=\underline{x}+\underline{z}\in \GF(2)^m$. The receiver knows a subspace $V\subset \GF(2)^m$ from which $\underline{z}=\underline{y}-\underline{x}$ is uniformly chosen. Or equivalently, the receiver receives an affine subspace $\underline{y}-V$ where $\underline{x}$ lies. We consider a joint iterative decoder involving the channel detector and the LDPC decoder. The decoding system considered in this paper can be viewed as a simplified model of the joint iterative decoder over non-binary modulated signal inputs e.g., $2^m$-QAM. We evaluate the performance of binary spatially-coupled MacKay-Neal code by density evolution. EXIT-like function curve calculations reveal that iterative decoding threshold values are very close to the Shannon limit.
Kasai Kenta
Nozaki Takayuki
Sakaniwa Kohichi
No associations
LandOfFree
Spatially-Coupled Binary MacKay-Neal Codes for Channels with Non-Binary Inputs and Affine Subspace Outputs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Spatially-Coupled Binary MacKay-Neal Codes for Channels with Non-Binary Inputs and Affine Subspace Outputs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spatially-Coupled Binary MacKay-Neal Codes for Channels with Non-Binary Inputs and Affine Subspace Outputs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-461801