On the BICM Capacity

Optimal binary labelings, input distributions, and input alphabets are analyzed for the so-called bit-interleaved coded modulation (BICM) capacity, paying special attention to the low signal-to-noise ratio (SNR) regime. For 8-ary pulse amplitude modulation (PAM) and for 0.75 bit/symbol, the folded binary code results in a higher capacity than the binary reflected gray code (BRGC) and the natural binary code (NBC). The 1 dB gap between the additive white Gaussian noise (AWGN) capacity and the BICM capacity with the BRGC can be almost completely removed if the input symbol distribution is properly selected. First-order asymptotics of the BICM capacity for arbitrary input alphabets and distributions, dimensions, mean, variance, and binary labeling are developed. These asymptotics are used to define first-order optimal (FOO) constellations for BICM, i.e. constellations that make BICM achieve the Shannon limit -1.59 \tr{dB}. It is shown that the \Eb/N_0 required for reliable transmission at asymptotically low rates in BICM can be as high as infinity, that for uniform input distributions and 8-PAM there are only 72 classes of binary labelings with a different first-order asymptotic behavior, and that this number is reduced to only 26 for 8-ary phase shift keying (PSK). A general answer to the question of FOO constellations for BICM is also given: using the Hadamard transform, it is found that for uniform input distributions, a constellation for BICM is FOO if and only if it is a linear projection of a hypercube. A constellation based on PAM or quadrature amplitude modulation input alphabets is FOO if and only if they are labeled by the NBC; if the constellation is based on PSK input alphabets instead, it can never be FOO if the input alphabet has more than four points, regardless of the labeling.Comment: Submitted to the IEEE Transactions on Information Theor

Constellation Shaping in Optical Communication Systems

Exploiting the full-dimensional capacity of coherent optical communication systems is needed to overcome the increasing bandwidth demands of the future Internet. To achieve capacity, both coding and shaping gains are required, and they are, in principle, independent. Therefore it makes sense to study shaping and how it can be achieved in various dimensions and how various shaping schemes affect the whole performance in real systems. This thesis investigates the performance of constellation shaping methods including geometric shaping (GS) and probabilistic shaping (PS) in coherent fiber-optic systems. To study GS, instead of considering machine learning approaches or optimization of irregular constellations in two dimensions, we have explored multidimensional lattice-based constellations. These constellations provide a regular structure with a fast and low-complexity encoding and decoding. In simulations, we show the possibility of transmitting and detecting constellation with a size of more than 10^{28} points which can be done without a look-up table to store the constellation points. Moreover, improved performance in terms of bit error rate, symbol error rate, and transmission reach are demonstrated over the linear additive white Gaussian noise as well as the nonlinear fiber channel compared to QAM formats.Furthermore, we investigate the performance of PS in two separate scenarios, i.e., transmitter impairments and transmission over hybrid systems with on-off keying channels. In both cases, we find that while PS-QAM outperforms the uniform QAM in the linear regime, uniform QAM can achieve better performance at the optimum power in the presence of transmitter or channel nonlinearities