pith. sign in

arxiv: 1801.06328 · v1 · pith:M74TAT3Onew · submitted 2018-01-19 · 💻 cs.IT · math.IT

Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels

classification 💻 cs.IT math.IT
keywords channelsrelaycodestwo-wayasymptoticcompute-and-forwardanalysisasymmetric
0
0 comments X
read the original abstract

Compute-and-forward relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a compute-and-forward scheme, a relay tries to decode a linear combination composed of transmitted messages from other terminals or relays. Design for error correcting codes and its decoding algorithms suitable for compute-and-forward relaying schemes are still important issue to be studied. In this paper, we will present an asymptotic performance analysis on LDPC codes over two-way relay channels based on density evolution (DE). Because of the asymmetric nature of the channel, we employ the population dynamics DE combined with DE formulas for asymmetric channels to obtain BP thresholds. In addition, we also evaluate the asymptotic performance of spatially coupled LDPC codes for two-way relay channels. The results indicate that the spatial coupling codes yield improvements in the BP threshold compared with corresponding uncoupled codes for two-way relay channels.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.