2010 6th International Symposium on Turbo Codes &Amp; Iterative Information Processing 2010
DOI: 10.1109/istc.2010.5613828
|View full text |Cite
|
Sign up to set email alerts
|

Optimized variable degree matched mapping for protograph LDPC coded modulation with 16QAM

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 22 publications
(21 citation statements)
references
References 15 publications
0
21
0
Order By: Relevance
“…Doing this for the case of gray-labeled squared-constellation-based 16-ary DCSK reveals I (x e 0 ; y) = I (x e 1 ; y) and I (x e 2 ; y) = I (x e 3 ; y) with I (x e 1 ; y) > I (x e 3 ; y). The term water-filling refers to the mapping of variable node degrees in proportion to the bit-plane MI, which still performs well because higher-degree nodes can affect more other nodes than lower-degree nodes although it is not optimal [23].…”
Section: A Transmitter 1) Squared-constellation-based M-ary Dcskmentioning
confidence: 99%
See 2 more Smart Citations
“…Doing this for the case of gray-labeled squared-constellation-based 16-ary DCSK reveals I (x e 0 ; y) = I (x e 1 ; y) and I (x e 2 ; y) = I (x e 3 ; y) with I (x e 1 ; y) > I (x e 3 ; y). The term water-filling refers to the mapping of variable node degrees in proportion to the bit-plane MI, which still performs well because higher-degree nodes can affect more other nodes than lower-degree nodes although it is not optimal [23].…”
Section: A Transmitter 1) Squared-constellation-based M-ary Dcskmentioning
confidence: 99%
“…Firstly, the extrinsic mutual information (MI) of the demodulator is calculated for a fixed E b /N 0 [23], [27]. Initialize the priori MI I …”
Section: P-exit Algorinthmmentioning
confidence: 99%
See 1 more Smart Citation
“…Following that idea, Jin et. al [11] carried out an exhaustive search of all possible permutations of protograph variable nodes mappings to symbol bits, and find the optimal mapping pattern for the 16-QAM modulation whose constellation is shown in Figure 5, which gives an iterative decoding threshold improvement of 0.14 dB compared with that of the water-filling approach in [10].…”
Section: A Mapping Algorithmmentioning
confidence: 99%
“…In this paper, we study two families of protograph codes: AR4JA protograph codes [8] and a recently proposed protograph codes [9], and map them to high-order modulations. We should mention that the protograph-based LDPC coded BICM using AR4JA protograph codes with 16QAM in AWGN channel was previously studied in [10], [11]; the advantage of our design process is that it is modular and easy to apply to other protographs and modulations. We propose here a general mapping scheme that maps any protograph structure with any modulation.…”
Section: Introductionmentioning
confidence: 99%