Optimal and low-complexity iterative joint network/channel decoding for the multiple-access relay channel

Abstract : In this paper, we investigate joint network and channel decoding algorithms for the multiple-access relay channel. We consider a realistic reference scenario with Rayleigh fading over all the wireless links, including the source-torelay channels. Our contribution is twofold: i) first, we develop the quasi-optimal joint network and channel decoder by taking into account possible errors over the source-torelay channels, and ii) second, we propose a low-complexity iterative joint network and channel decoding algorithm, which reduces the number of channel decoders with respect to state-of-the-art solutions. Our numerical results show that: i) in fully-interleaved Rayleigh fading channels, the proposed solution provides almost the same bit error probability as the quasi-optimal scheme but with a reduction in complexity of approximately the 65%, and ii) in Rayleigh block-fading channels, the proposed scheme yields almost the same bit error probability as state-of-the-art solutions but with a reduction in complexity of approximately the 30%.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal-supelec.archives-ouvertes.fr/hal-00661315
Contributor : Marco Di Renzo <>
Submitted on : Friday, January 20, 2012 - 12:45:31 PM
Last modification on : Thursday, December 5, 2019 - 5:18:02 PM
Long-term archiving on : Saturday, April 21, 2012 - 2:21:57 AM

File

ICASSP-2011.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Xuan Thang Vu, Marco Di Renzo, Pierre Duhamel. Optimal and low-complexity iterative joint network/channel decoding for the multiple-access relay channel. ICASSP 2011, May 2011, Prague, Czech Republic. pp.3312-3315, ⟨10.1109/ICASSP.2011.5947093⟩. ⟨hal-00661315⟩

Share

Metrics

Record views

480

Files downloads

362