Low-Density Parity-Check Codes over Finite Gaussian Integer Fields
- This work proposes a construction for low-density parity-check (LDPC) codes over finite Gaussian integer fields. Furthermore, a new channel model for codes over Gaussian integers is introduced and its channel capacity is derived. This channel can be considered as a first order approximation of the additive white Gaussian noise channel with hard decision detection where only errors to nearest neighbors in the signal constellation are considered. For this channel, the proposed LDPC codes can be decoded with a simple non-probabilistic iterative decoding algorithm similar to Gallager's decoding algorithm A.
Author: | Daniel RohwederORCiD, Jürgen FreudenbergerORCiDGND, Sergo ShavgulidzeORCiD |
---|---|
DOI: | https://doi.org/10.1109/ISIT.2018.8437456 |
ISSN: | 2157-8117 |
Parent Title (English): | IEEE International Symposium on Information Theory (ISIT), 17-22 June 2018, Vail, CO, USA |
Publisher: | IEEE |
Document Type: | Conference Proceeding |
Language: | English |
Year of Publication: | 2018 |
Release Date: | 2019/01/07 |
Page Number: | 5 |
First Page: | 481 |
Last Page: | 485 |
Note: | Volltextzugriff für Angehörige der Hochschule Konstanz via Datenbank IEEE Xplore möglich. |
Institutes: | Institut für Systemdynamik - ISD |
Open Access?: | Nein |
Licence (German): | ![]() |