Skip to Main content Skip to Navigation
Conference papers

Pairwise joint probability propagation in BICM-ID

Abstract : The iterative decoding of BICM is analyzed from an optimization point of view. The objective function in standard iterative decoding proceeds from a coarse approximation of the optimal Maximum Likelihood Decoding. This approximation is suitable when large block of data are processed but may be critical for short blocks. In this contribution, it is proved that refined approximations can be obtained by propagating extrinsics on groups of bits instead of single bits. The particular case of pairwise joint probability propagation is investigated. The computational complexity is similar to the standard iterative decoding. Simulations show the favorable behaviour of the proposed method with both AWGN and fading channels.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Florence Alberge Connect in order to contact the contributor
Submitted on : Friday, September 7, 2012 - 9:50:19 AM
Last modification on : Thursday, June 17, 2021 - 3:49:27 AM
Long-term archiving on: : Saturday, December 8, 2012 - 3:40:13 AM


Files produced by the author(s)


  • HAL Id : hal-00728948, version 1



Florence Alberge. Pairwise joint probability propagation in BICM-ID. IEEE ISTC 2012, Aug 2012, Goteborg, Sweden. pp.6-10. ⟨hal-00728948⟩



Les métriques sont temporairement indisponibles