Optimal and low-complexity iterative joint network/channel decoding for the multiple-access relay channel - CentraleSupélec Access content directly
Conference Papers Year : 2011

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%.
Fichier principal
Vignette du fichier
ICASSP-2011.pdf (129.7 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00661315 , version 1 (20-01-2012)

Identifiers

Cite

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 - 36th IEEE International Conference on Acoustics, Speech and Signal Processing, May 2011, Prague, Czech Republic. pp.3312-3315, ⟨10.1109/ICASSP.2011.5947093⟩. ⟨hal-00661315⟩
162 View
300 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More