Pairwise joint probability propagation in BICM-ID - CentraleSupélec Access content directly
Conference Papers Year : 2012

Pairwise joint probability propagation in BICM-ID

Florence Alberge


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.
Fichier principal
Vignette du fichier
propagation_groupe_AWGN_2.pdf (263.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00728948 , version 1 (07-09-2012)


  • 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⟩
100 View
413 Download


Gmail Facebook X LinkedIn More