Compute-forward multiple access (CFMA) with nested LDPC codes

Sula, Erixhen; Zhu, Jingge; Pastore, Adriano; Lim, Sung Hoon; Gastpar, Michael

doi:10.1109/isit.2017.8007067

Cited by 10 publications

(28 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We search BP thresholds by evaluating BER using the population dynamics DE with N = 10 5 and T = 2000. The BP thresholds have a gap to the SIR as predicted in [6].…”

mentioning

confidence: 63%

“…It is not difficult to see that the BP on the degraded channel coincides with the conventional log-domain BP algorithm [11] with symbol LLR expression (7). A BP decoder of this type has been discussed in [6] [7]. A marked advantage of the BP on the degraded channel is that it can be implemented easily based on a practical BP decoder for the additive white Gaussian noise (AWGN) channel merely by replacing an LLR computation unit.…”

Section: Degraded Channelmentioning

confidence: 99%

“…A combination of LDPC codes and belief propagation (BP) decoding has been demonstrated as very powerful and effective techniques for additive noise channels [10]. Sula et al [6] discussed an appropriate modified BP decoding for two-way relay channels. They presented a performance analysis of LDPC codes over a two-way relay channel based on computer simulations.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Asymptotic Behavior of Spatial Coupling LDPC Coding for Compute-and-Forward Two-Way Relaying

Takabe

Wadayama

Hayashi

2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

Compute-and-forward (CAF) relaying is effective to increase bandwidth efficiency of wireless twoway relay channels. In a CAF scheme, a relay is designed to decode a linear combination composed of transmitted messages from other terminals or relays. Design for errorcorrecting codes and its decoding algorithms suitable for CAF relaying schemes remain as an important issue to be studied. As described in this paper, we will present an asymptotic performance analysis of LDPC codes over two-way relay channels based on density evolution (DE). Because of the asymmetric characteristics of the channel, we use the population dynamics DE combined with DE formulas for asymmetric channels to obtain BP thresholds. Additionally, 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. Finally, we will compare the mutual information rate and rate achievability between the CAF scheme and the MAC separation decoding scheme. We demonstrate the possibility that the CAF scheme has higher reliability in the high-rate region.

show abstract

“…We search BP thresholds by evaluating BER using the population dynamics DE with N = 10 5 and T = 2000. The BP thresholds have a gap to the SIR as predicted in [6].…”

mentioning

confidence: 63%

Section: Degraded Channelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Asymptotic Behavior of Spatial Coupling LDPC Coding for Compute-and-Forward Two-Way Relaying

Takabe

Wadayama

Hayashi

2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…The low-density parity-check (LDPC) code is a leading candidate due to its high reliability against various channel models including an additive white Gaussian noise (AWGN) channel [6]. Sula et al proposed the LDPC coding technique for the CAF scheme with the binary phase shift keying (BPSK) modulation and evaluated its decoding performance by numerical simulations [7]. The authors theoretically analyzed the LDPC codes and its spatial coupling coding by the density evolution (DE) method and found that they exhibit higher reliability than the SD scheme [8], [9].…”

Section: Introductionmentioning

confidence: 99%

Asymptotic Analysis on LDPC-BICM Scheme for Compute-and-Forward Relaying

Takabe¹,

Wadayama²,

Hayashi

2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

The compute-and-forward (CAF) scheme has attracted great interests due to its high band-width efficiency on two-way relay channels. In the CAF scheme, a relay attempts to decode a linear combination of transmitted messages from other terminals or relays. It is a crucial issue to study practical errorcorrecting codes in order to realize the CAF scheme with low computational complexity. In this paper, we present an efficient bit-interleaved coded modulation (BICM) scheme for the CAF scheme with phase shift keying (PSK) modulations. In particular, we examine the asymptotic decoding performance of the BICM scheme with low-density parity-check (LDPC) codes by using the density evolution (DE) method. Based on the asymmetric nature of the channel model, we utilize the population dynamics method for the DE equations without the all-zero codeword assumption. The results show that, for two-way relay channels with QPSK and 8PSK modulations, the LDPC-BICM scheme provides higher achievable rate compared with an alternative separation decoding scheme.

show abstract

“…A combination of LDPC codes and belief propagation (BP) decoding has been proved to be very powerful and effective for additive noise channels [10]. Sula et al [6] discussed an appropriate modified BP decoding for the two-way relay channels. They presented a performance analysis on LDPC codes over two-way relay channel based on computer simulations.…”

Section: Introductionmentioning

confidence: 99%

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

Takabe

Ishimatsu

Wadayama

et al. 2018

2018 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

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.

show abstract

Compute-forward multiple access (CFMA) with nested LDPC codes

Cited by 10 publications

References 6 publications

Asymptotic Behavior of Spatial Coupling LDPC Coding for Compute-and-Forward Two-Way Relaying

Asymptotic Behavior of Spatial Coupling LDPC Coding for Compute-and-Forward Two-Way Relaying

Asymptotic Analysis on LDPC-BICM Scheme for Compute-and-Forward Relaying

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

Contact Info

Product

Resources

About