Search

In this paper, coded multiple-input-multiple-output (MIMO) communication schemes for data transmission over the optical atmospheric turbulence channels are studied. Two strategies are proposed and compared. The first is based on repetition coding, and the second on space-time (ST) coding. Both approaches employ low-density parity-check (LDPC) codes. The LDPC codes are designed using the concept of pairwise balanced design (PBD), balanced incomplete block design (BIBBD), and block-circulant (array) codes. To improve the spectral efficiency, we employ a bit-interleaved (BI) LDPC-coded modulation based on the pulse amplitude modulation (PAM). A better bit error rate (BER) performance is achieved by the iteration of extrinsic information between a demapper and LDPC decoder. The simulations show that the LDPC-coded MIMO schemes can operate under a strong atmospheric turbulence and at the same time provide excellent coding gains compared with the transmission of uncoded data. To verify the efficiency of the proposed coding schemes, achievable information rates are computed when the turbulence is modeled by a gamma-gamma distribution. [ABSTRACT FROM PUBLISHER]

A problem of suppression of intrachannel nonlinearities through the use of constrained coding is considered. Three different techniques are proposed and compared with respect to their efficiency, namely 1) constrained coding; 2) combined constrained and error control coding; and 3) deliberate error insertion. Significant Q-factor improvement up to 16 dB depending on code rate and number of spans is demonstrated. A combined constrained-iterative forward error correction (FEC) scheme can operate in the presence of strong intrachannel nonlinearities when even advanced FEC schemes would be overwhelmed with errors. It provides a coding gain of 12.1 dB at a bit error rate (BER) of 10-9. Deliberate error insertion is an efficient approach to balance the encoder complexity and the achievable coding gain. [ABSTRACT FROM PUBLISHER]

In an earlier paper, we reported that the low-density parity-check (LDPC) codes from finite planes outperform any other known forward error-correction (FEC) scheme for optical communications. However, the number of different LDPC codes of code rate above 0.8 is rather small. As a natural extension of the prior work, in this paper, we consider LDPC codes on m flats derived from projective and affine geometries, which outperform codes from finite planes. The codes on m flats also provide a greater selection of structured LDPC codes of rate 0.8 or higher. The performance of the codes in a long-haul optical-communication system was assessed using an advanced simulator able to capture all important transmission impairments. Specifically, they achieve a coding gain of 10 dB at a bit error rate (BER) of 10-9, outperforming, therefore, the best turbo product codes proposed for optical communications. In addition, the simulator implements a fixed-point (FP) iterative decoder that allows control of the precision of the soft information used in the decoder. Such quantization is required to facilitate hardware implementations of the iterative decoder, and the high-speed operations for long-haul optical transmission systems. The loss in performance due to reduced precision of the soft information can be as low as 0.2 dB. [ABSTRACT FROM PUBLISHER]

We propose a class of moderate-length nonbinary low-density parity-check (LDPC) codes for long-haul high-speed optical transmission systems. In particular, we present an LDPC code with 12.59% redundancy that achieves a 9.9-dB coding gain at a bit-error rate of 10-10. A similar coding gain is obtained for a long nonbinary LDPC code with a redundancy of only 6.7%. [ABSTRACT FROM PUBLISHER]

A novel family of low-density parity-check codes is proposed based on MacNeish-Mann theorem for construction of mutually orthogonal Latin squares. Codes from this family have high code rate, girth at least six, large minimum distance, and significantly outperform conventional forward error correction schemes based on Reed-Solomon (RS) and turbo codes. [ABSTRACT FROM PUBLISHER]