Terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber-optical systems

C. Häger, A.G.I. Amat, F. Brännström, A. Alvarado, E. Agrell

Research output: Contribution to journalArticleAcademicpeer-review

14 Citations (Scopus)
1 Downloads (Pure)

Abstract

We study the design of spectrally efficient fiber-optical communication systems based on different spatially coupled (SC) forward error correction (FEC) schemes. In particular, we optimize the allocation of the coded bits from the FEC encoder to the modulation bits of the signal constellation. Two SC code classes are considered. The codes in the first class are protograph-based low-density parity-check (LDPC) codes which are decoded using iterative soft-decision decoding. The codes in the second class are generalized LDPC codes which are decoded using iterative hard-decision decoding. For both code classes, the bit allocation is optimized for the terminated and tailbiting SC cases based on a density evolution analysis. An optimized bit allocation can significantly improve the performance of tailbiting SC codes over the baseline sequential allocation, up to the point where they have a comparable gap to capacity as their terminated counterparts, at a lower FEC overhead. For the considered terminated SC codes, the optimization only results in marginal performance improvements, suggesting that in this case a sequential allocation is close to optimal.
Original languageEnglish
Pages (from-to)1275-1285
Number of pages11
JournalJournal of Lightwave Technology
Volume33
Issue number7
DOIs
Publication statusPublished - 1 Apr 2015

Keywords

  • Bit mapper optimization
  • LDPC codes
  • coded modulation
  • forward error correction
  • hard-decision decoding
  • soft-decision decoding
  • spatial coupling.

Fingerprint Dive into the research topics of 'Terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber-optical systems'. Together they form a unique fingerprint.

Cite this