z-logo
open-access-imgOpen Access
High‐throughput 2 bit low‐density parity‐check forward error correction for C‐RAN optical fronthaul based on a hard‐decision algorithm
Author(s) -
Li Ao,
Meghdadi Vahid,
Cances JeanPierre,
AupetitBerthelemot Christelle
Publication year - 2019
Publication title -
iet circuits, devices and systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.251
H-Index - 49
ISSN - 1751-8598
DOI - 10.1049/iet-cds.2018.5102
Subject(s) - computer science , algorithm , bit error rate , c ran , low density parity check code , decoding methods , additive white gaussian noise , throughput , latency (audio) , context (archaeology) , computer engineering , channel (broadcasting) , radio access network , telecommunications , wireless , mobile station , base station , paleontology , biology
In this study, the authors demonstrate the potentiality of the integration of low‐density parity‐check codes with a full self‐seeded optical architecture using advanced optical and electrical models. This study aims to show the performances that one can expect from this association in the context of cloud radio access network (C‐RAN). Different decoding algorithms have been studied over additive white Gaussian noise channel. Hard‐decision algorithm of Gradient descent bit flipping (GDBF) is finally chosen since it represents the best trade‐off between the complexity of decoder and the performance. Furthermore, the authors show that a small 2‐bit quantification is sufficient, which can increase the data rate and decrease the latency of decoder in comparison with a more complex ADs. The same performance of floating point GDBF is achieved by using the new algorithm Balanced Weighted GDBF (BWGDBF) with 2‐bit quantification. Finally, the authors have succeeded to implement BWGDBF algorithm on the FPGA Spartan 6 xc6slx16. The proposed system exhibits very good performances since it is able to achieve 2.5 Gb/s throughput in the C‐RAN context.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here