Low-complexity LDPC decoding algorithms for ultra-high-order modulated signals
Low-complexity decoding algorithms and ultra-high-order modulation formats are necessary to meet data rate requirements in excess of 1 Tbps. The information bottleneck algorithm has been effectively applied to the LDPC decoding algorithm in recent years, and its performance is comparable to that of...
Gespeichert in:
| Veröffentlicht in: | Optics express Jg. 31; H. 25; S. 41645 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
United States
04.12.2023
|
| ISSN: | 1094-4087, 1094-4087 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Low-complexity decoding algorithms and ultra-high-order modulation formats are necessary to meet data rate requirements in excess of 1 Tbps. The information bottleneck algorithm has been effectively applied to the LDPC decoding algorithm in recent years, and its performance is comparable to that of the double-precision information propagation technique. However, the application of information bottleneck decoding algorithms in ultra-high order modulation forms has received little attention. Furthermore, the number of table lookups required for a single decoding loop is square to the node degree, which is undesirable for optical communications. We present a low-complexity LDPC decoding technique for ultra-high-order modulated signals in this study. First, the algorithm employs multivariate covariates to build an information bottleneck framework, which introduces the processing required for applying the information bottleneck algorithm to 1024-QAM signals and the requirement of combining higher-order modulation formats with LDPC codes. The technique makes use of a bidirectional recursive network and the symmetry of quantized information to reuse the same set of tables, considerably reducing the number of table lookup operations required in the decoding process. Constructing a coherent optical communication system with 1024-QAM signals proves that the proposed algorithm can operate effectively. The performance sacrifice of 0.2 ∼ 0.3 dB reduces the number of table lookup operations required for decoding from square to linear magnitude, which greatly reduces the decoding time required in optical communication. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 1094-4087 1094-4087 |
| DOI: | 10.1364/OE.507292 |