Paper Info
Title
Interleaved coded modulation for non-binary codes: a factor graph approach
Abstract
This contribution deals with the problem of combining (non-binary) error-correcting codes with higher-order modulation schemes on AWGN and flat fading channels through interleaved coded modulation. We extend the idea of bit-interleaved coded modulation (BICM) to a more general form. With the aid of factor graph representations, we show how higher-order modulation can be combined with non-binary codes so that noniterative detection becomes optimal. This is in contrast with conventional BICM, for which non-iterative detection can be far from optimal. Through computer simulations, we compare an optimal non-iterative scheme with conventional BICM. It turns out that the gain due to optimal detection is outweighed by the loss in time-diversity as compared to BICM-ID.
Year
DOI
Venue
2004
10.1109/GLOCOM.2004.1378002
Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE
Keywords
Field
DocType
AWGN channels,error correction codes,fading channels,graph theory,interleaved codes,modulation coding,AWGN channels,BICM,BICM-ID,bit-interleaved coded modulation,computer simulations,error-correcting codes,factor graph approach,factor graph representations,flat fading channels,higher-order modulation,higher-order modulation schemes,interleaved coded modulation,nonbinary codes,optimal noniterative detection,time-diversity loss
Graph theory,Factor graph,Computer science,Fading,Binary code,Algorithm,Communication channel,Theoretical computer science,Real-time computing,Modulation,Coded modulation,Additive white Gaussian noise
Conference
Volume
ISSN
ISBN
1
1930-529X
0-7803-8794-5
Citations 
PageRank 
References 
0
0.34
13
Authors
3
Name
Order
Citations
PageRank
H. Wymeersch1757.79
Heidi Steendam242348.24
Marc Moeneclaey356696.31