학술논문

Non-Concatenated FEC Codes for Ultra-High Speed Optical Transport Networks
Document Type
Conference
Source
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011 Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE. :1-5 Dec, 2011
Subject
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Computing and Processing
Signal Processing and Analysis
Parity check codes
Bit error rate
Decoding
Complexity theory
Encoding
Adaptive optics
Field programmable gate arrays
Language
ISSN
1930-529X
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^{-13} and 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^{-13}. Based on this finding, we introduce a new low complexity postprocessing technique to push BER floors down to 10^{-15}.