2012 IEEE International Symposium on Information Theory Proceedings 2012
DOI: 10.1109/isit.2012.6284238
|View full text |Cite
|
Sign up to set email alerts
|

On matching short LDPC codes with spectrally-efficient modulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…Many authors have studied the optimization of bit mappers for irregular LDPC code ensembles. For example, in [8], [9], the authors use extrinsic information transfer charts to find approximate decoding thresholds and subsequently optimize bit mappers, where in [9] special attention is payed to the short block length regime. In [10], a downhill algorithm is used to find optimized bit mappings for two different LDPC codes.…”
Section: Introductionmentioning
confidence: 99%
“…Many authors have studied the optimization of bit mappers for irregular LDPC code ensembles. For example, in [8], [9], the authors use extrinsic information transfer charts to find approximate decoding thresholds and subsequently optimize bit mappers, where in [9] special attention is payed to the short block length regime. In [10], a downhill algorithm is used to find optimized bit mappings for two different LDPC codes.…”
Section: Introductionmentioning
confidence: 99%