On constellation shaping for short block lengths

Gaussian channel inputs are required to achieve the capacity of additive white Gaussian noise (AWGN) channels. Equivalently, the n-dimensional constellation boundary must be an n-sphere. In this work, constellation shaping is discussed for short block lengths. Two different approaches are considered: Sphere shaping and constant composition distribution matching (CCDM). It is shown that both achieve the maximum rate and generate Maxwell-Boltzmann (MB) distributed inputs. However sphere shaping achieves this maximum faster than CCDM and performs more efficiently in the short block length regime. This is shown by computing the finite-length rate losses. Then the analysis is justified by numerical simulations employing low-density parity-check (LDPC) codes of the IEEE 802.11 standard

A variable-rate modulation and coding scheme for low earth orbit satellites

Low Earth Orbit (LEO) satellites are increasingly being used for a wide variety of communications applications. These satellites have to operate in widely varying channel conditions. These conditions are often significantly better than the 'worst case' situations that are experienced and thus a single rate transmission scheme is clearly suboptimal. The objective of the thesis is to suggest and test a method of modulation/coding that can take advantage of better signal strength conditions in order to improve data transmission rates. In order to provide the goal of approximately 50kbps transmission in a 10kHz Frequency Division Multiple Access (FDMA) channel it was necessary to consider spectrally efficient, rather than power efficient, modulations. The proposed modulation scheme makes use of an eight-dimensional trellis coded modulation system. Multiple signal constellation sets are used in conjunction with this coding in order to provide different transmission rates, depending on the signal to noise ratio and the channel state. To enhance the suitability of the modulation scheme for the channel, it was combined with Reed-Solomon Coding and interleaving in an inner/outer code arrangement. Various means of determining when to switch between coding rates were discussed briefly, but an in-depth treatment of the subject fell outside of the scope of the thesis. Various combinations of these codes were tested in gaussian noise conditions and various degrees of Rician and Rayleigh fading. In order to make use of the higher rate QAM constellations, it was necessary to provide the decoder with channel state information. The tested system achieved its purpose of providing a variable rate coding scheme resulting in good performance over a range of channel conditions. It is fairly flexible and can be adapted to specific channel requirements

Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping

In this paper, we provide for the first time a systematic comparison of distribution matching (DM) and sphere shaping (SpSh) algorithms for short blocklength probabilistic amplitude shaping. For asymptotically large blocklengths, constant composition distribution matching (CCDM) is known to generate the target capacity-achieving distribution. As the blocklength decreases, however, the resulting rate loss diminishes the efficiency of CCDM. We claim that for such short blocklengths and over the additive white Gaussian channel (AWGN), the objective of shaping should be reformulated as obtaining the most energy-efficient signal space for a given rate (rather than matching distributions). In light of this interpretation, multiset-partition DM (MPDM), enumerative sphere shaping (ESS) and shell mapping (SM), are reviewed as energy-efficient shaping techniques. Numerical results show that MPDM and SpSh have smaller rate losses than CCDM. SpSh--whose sole objective is to maximize the energy efficiency--is shown to have the minimum rate loss amongst all. We provide simulation results of the end-to-end decoding performance showing that up to 1 dB improvement in power efficiency over uniform signaling can be obtained with MPDM and SpSh at blocklengths around 200. Finally, we present a discussion on the complexity of these algorithms from the perspective of latency, storage and computations.Comment: 18 pages, 10 figure

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.Comment: 12 pages, 12 figure

Restriction enzymes use a 24 dimensional coding space to recognize 6 base long DNA sequences

Restriction enzymes recognize and bind to specific sequences on invading bacteriophage DNA. Like a key in a lock, these proteins require many contacts to specify the correct DNA sequence. Using information theory we develop an equation that defines the number of independent contacts, which is the dimensionality of the binding. We show that EcoRI, which binds to the sequence GAATTC, functions in 24 dimensions. Information theory represents messages as spheres in high dimensional spaces. Better sphere packing leads to better communications systems. The densest known packing of hyperspheres occurs on the Leech lattice in 24 dimensions. We suggest that the single protein EcoRI molecule employs a Leech lattice in its operation. Optimizing density of sphere packing explains why 6 base restriction enzymes are so common.Comment: Version 1: 31 pages, 3 figures, 1 table; Version 2: 33 pages, 3 figures, 1 table, responses to reviewers, new ref