Multilevel codes: theoretical concepts and practical design rules

Wachsmann, U.; Fischer, Robert F. H.; Huber, Johannes B.

doi:10.1109/18.771140

Cited by 788 publications

(702 citation statements)

References 71 publications

Supporting

Mentioning

691

Contrasting

Unclassified

Order By: Relevance

“…The variance of the channel symbols is denoted by σ 2 A = E s /T s (E s : average energy per symbol). 1 According to [7], the cascade of mapper and channel can be equivalently modeled by m parallel binary input channels, aka. bit levels.…”

Section: System Modelmentioning

confidence: 99%

See 1 more Smart Citation

Asymptotically optimal mappings for BICM with M -PAM and M ² -QAM

Stierstorfer

Fischer

2009

Electron. Lett.

Self Cite

View full text Add to dashboard Cite

show abstract

Section: System Modelmentioning

confidence: 99%

“…The analysis of bit-interleaved coded modulation (BICM) [8], [1] is commonly based on an equivalent channel model of several parallel binary input channels [7], [1]. The sum over the individual capacities of these subchannels is generally referred to as parallel-decoding (PD) capacity or BICM capacity.…”

Section: Introductionmentioning

confidence: 99%

Asymptotically optimal mappings for BICM with M -PAM and M ² -QAM

Stierstorfer

Fischer

2009

Electron. Lett.

Self Cite

View full text Add to dashboard Cite

show abstract

“…With the aid of the so-called equivalent capacity rule [2], we obtain the desired code rate of each component for 8-PSK modulation using Gray mapping, yielding R 0 =R 1 =R 2 ¼ 0.510=0.745=0.745. Given that the total number of uncoded input bits is k i and the total number of channel coded output bits is n i for the GLDPC encoder at the ith MLC protection level, the coding rate of the ith GLDPC component code is [5].…”

Section: Modulation and Demodulationmentioning

confidence: 99%

“…Parallel independent decoding (PID) [2] is employed as an efficient decoding strategy with reduced decoding delay, where there is no information exchange across the different protection classes.…”

mentioning

confidence: 99%

Multilevel generalised low-density parity-check codes

2006

View full text Add to dashboard Cite

Multilevel coding invoking generalised low-density parity-check component codes is proposed, which is capable of outperforming the classic low-density parity check component codes at a reduced decoding latency.Introduction: Multilevel coding (MLC) was proposed by Imai and Hirawaki [1] as a bandwidth-efficient coded modulation scheme designed for protecting each bit of a non-binary symbol with the aid of binary codes, while maintaining different target bit error rates (BERs). Parallel independent decoding (PID) [2] is employed as an efficient decoding strategy with reduced decoding delay, where there is no information exchange across the different protection classes.MLC schemes may be constructed using different component codes. Recently, classic low-density parity-check (LDPC) codes [3] have been commonly used as component codes [4] owing to their flexible code rates and good BER performance. Belief propagation (BP) [3] may be used for iterative soft decoding at each different BER protection level. Against this background, we propose a novel MLC design using generalised LDPC (GLDPC) codes rather than classic LDPC codes [5] as component codes, which has the benefit of an improved BER performance and an implementationally attractive shorter parallel decoding structure.As a benefit of their block-based nature and random generator matrix construction, no channel interleaver is required for LDPC or GLDPC component codes. For our GLDPC codes, instead of using Gallager's single-error detecting parity-check code [3], we employ binary BCH error-correcting codes [6] as the constituent codes. Simple iterative soft-input soft-output (SISO) decoders [6] are used for each constituent BCH code of the MLC scheme. We invoke both inner iterations within the LDPC=GLDPC component codes and outer iterations exchanging information between the LDPC=GLDPC block codes and the demapper, as shown in Figs. 1 and 2. Gray mapping (GM) of the bits to modulated symbols is used for non-iterative decoding, while set partitioning (SP) based mapping is used for iterative decoding, because it provides improved iteration gains.

show abstract

“…This method is called the multi-level coding (MLC) [34], [35]. At the receiver, we can decode the sequence of x 1 first then pass the decision to the next decoder which decodes the sequence of x 2 .…”

Section: Code Designmentioning

confidence: 99%

Energy efficient error-correcting coding for wireless systems

Shao¹

View full text Add to dashboard Cite

Multilevel codes: theoretical concepts and practical design rules

Cited by 788 publications

References 71 publications

Asymptotically optimal mappings for BICM with M -PAM and M ² -QAM

Asymptotically optimal mappings for BICM with M -PAM and M ² -QAM

Multilevel generalised low-density parity-check codes

Energy efficient error-correcting coding for wireless systems

Contact Info

Product

Resources

About

Multilevel codes: theoretical concepts and practical design rules

Cited by 788 publications

References 71 publications

Asymptotically optimal mappings for BICM with M -PAM and M 2 -QAM

Asymptotically optimal mappings for BICM with M -PAM and M 2 -QAM

Multilevel generalised low-density parity-check codes

Energy efficient error-correcting coding for wireless systems

Contact Info

Product

Resources

About

Asymptotically optimal mappings for BICM with M -PAM and M ² -QAM

Asymptotically optimal mappings for BICM with M -PAM and M ² -QAM