Non-Concatenated FEC Codes for Ultra-High Speed Optical Transport Networks
- 1 December 2011
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper presents a non-concatenated forward error correction (FEC) code suitable for applications in 100Gb/s optical transport networks (OTN). A typical requirement in this application is a net coding gain (NCG) >;10 dB at a bit error rate (BER) of 10-15 with an overhead (OH) of ~20%. As discussed in [1], non-concatenated codes are the ultimate frontier in terms of performance for OTN applications, because of their superior performance, lower latency, and lower overhead than concatenated codes. However, a major stumbling block for the use of these codes has been the existence of BER floors at levels significantly higher than the required 10-15(typically 10-10). In this paper we present a new coding scheme based on a low density parity check (LDPC) code with an expected net coding gain of 11.30dB at 10-15, 20% OH, and a block size of 24576 bits. This represents a significant improvement over the previous state of the art [2], based on a concatenated code with a block size of 74844 bits and 20.5% OH. The code is designed to minimize the BER floor while simultaneously reducing the memory requirements and the interconnection complexity of the iterative decoder [3]. Experimental results obtained with an FPGA-based hardware emulator demonstrate an NCG of 10.70 dB at a BER of 10-13and no error floors. These experimental results are extrapolated to 10-15 using importance sampling techniques, resulting in the expected performance stated above. Moreover, we find that fixed-point implementation is the main cause of error floors below 10-13Based on this finding, we introduce a new low complexity postprocessing technique to push BER floors down to 10-15.Keywords
This publication has 18 references indexed in Scilit:
- Channel CodesPublished by Cambridge University Press (CUP) ,2009
- Sliced Message Passing: High Throughput Overlapped Decoding of High-Rate Low-Density Parity-Check CodesIEEE Transactions on Circuits and Systems I: Regular Papers, 2008
- Low-Complexity High-Speed Decoder Design for Quasi-Cyclic LDPC CodesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2007
- Inversion-based hardware gaussian random number generator: A case study of function evaluation via hierarchical segmentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- An Efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC CodesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check CodesIEEE Transactions on Communications, 2005
- Reduced-Complexity Decoding of LDPC CodesIEEE Transactions on Communications, 2005
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981