Searcharxiv⌕ Search

arXiv subjects

Chigo Okonkwo

Publications and source records attributed to Chigo Okonkwo.

64 records · Page 4Linked to original sources
arXiv2019

Introducing Enumerative Sphere Shaping for Optical Communication Systems with Short Blocklengths

Probabilistic shaping based on constant composition distribution matching (CCDM) has received considerable attention as a way to increase the capacity of fiber optical communication systems. CCDM suffers from significant rate loss at short blocklengths and requires long blocklengths to achieve high shaping gain, which makes its implementation very challenging. In this paper, we propose to use enumerative sphere shaping (ESS) and investigate its performance for the nonlinear fiber optical channel. ESS has lower rate loss than CCDM at the same shaping rate, which makes it a suitable candidate to be implemented in real-time high-speed optical systems. In this paper, we first show that finite blocklength ESS and CCDM exhibit higher effective signal-to-noise ratio than their infinite blocklength counterparts. These results show that for the nonlinear fiber optical channel, large blocklengths should be avoided. We then show that for a 400 Gb/s dual-polarization 64-QAM WDM transmission system, ESS with short blocklengths outperforms both uniform signaling and CCDM. Gains in terms of both bit-metric decoding rate and bit-error rate are presented. ESS with a blocklength of 200 is shown to provide an extension reach of about 200 km in comparison with CCDM with the same blocklength. The obtained reach increase of ESS with a blocklength of 200 over uniform signaling is approximately 450 km (approximately 19%)

cs.IT↗
arXiv2019

Polarization-ring-switching for nonlinearity-tolerant geometrically-shaped four-dimensional formats maximizing generalized mutual information

In this paper, a new four-dimensional 64-ary polarization ring switching (4D-64PRS) modulation format with a spectral efficiency of 6 bit/4D-sym is introduced. The format is designed by maximizing the generalized mutual information (GMI) and by imposing a constant-modulus on the 4D structure. The proposed format yields an improved performance with respect to state-of-the-art geometrically shaped modulation formats for bit-interleaved coded modulation systems at the same spectral efficiency. Unlike previously published results, the coordinates of the constellation points and the binary labeling of the constellation are jointly optimized. When compared with polarization-multiplexed 8-ary quadrature-amplitude modulation (PM-8QAM), gains of up to 0.7 dB in signal-to-noise ratio are observed in the additive white Gaussian noise (AWGN) channel. For a long-haul nonlinear optical fiber system of 8,000 km, gains of up to 0.27 bit/4D-sym (5.5% data capacity increase) are observed. These gains translate into a reach increase of approximately 16% (1,100 km). The proposed modulation format is also shown to be more tolerant to nonlinearities than PM-8QAM. Results with LDPC codes are also presented, which confirm the gains predicted by the GMI.

eess.SP↗
arXiv2016

An Experimental Comparison of Coded Modulation Strategies for 100 Gbit/s Transceivers

Coded modulation is a key technique to increase the spectral efficiency of coherent optical communication systems. Two popular strategies for coded modulation are turbo trellis-coded modulation (TTCM) and bit-interleaved coded modulation (BICM) based on low-density parity-check (LDPC) codes. Although BICM LDPC is suboptimal, its simplicity makes it very popular in practice. In this work, we compare the performance of TTCM and BICM LDPC using information-theoretic measures. Our information-theoretic results show that for the same overhead and modulation format only a very small penalty (less than 0.1 dB) is to be expected when an ideal BICM LDPC scheme is used. However, the results obtained for the coded modulation schemes implemented in this paper show that the TTCM outperforms BICM LDPC by a larger margin. For a 1000 km transmission at 100 Gbit/s, the observed gain was 0.4 dB.

cs.IT↗