This disclosure relates generally to data communication, and more specifically to a modified enumerative sphere shaping of multidimensional constellations used for data communication.
The present invention is illustrated by way of example and is not limited by the accompanying figures, in which like references indicate similar elements. Elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale.
Communications systems are often required to operate at higher spectral efficiencies while keeping average transmit power and hardware complexity as small as possible. However, conveying the maximum amount of information for a given power budget has often underutilized available channel capacity (e.g., due to the Shannon limit). This is because most of the standardized data transmission strategies employ uniform signaling schemes where each possible message is transmitted with equal probability. Gaussian signaling is shown to be necessary to improve channel utilization, and have a gap to uniform signaling, which is 0.255 bits per real channel usage in Achievable Information Rate (AIR), or equivalently, 1.54 dB in Signal to Noise Ration (SNR). This gap is referred to as the “shaping gap.”
Sequences of one-dimensional, uniform and equidistant signal points form a cubically bounded lattice structure. However, by effectively removing the corners of the cube, and adopting a spherical shape in the limit (e.g., an N-sphere), we obtain the least average energy for a fixed volume of energy states in N dimensions. Accordingly, sphere shaping utilizes communication bandwidth more efficiently from average transmit power perspective.
Enumerative amplitude sphere shaping reduces the SNR gap between the channel capacity (e.g., the Shannon limit) and the realized rate by decreasing the average required signal energy. An enumerative shaper outputs length N amplitude sequences taken from an N-dimensional sphere. In one embodiment, the amplitude sequences are used by a channel encoder to add redundancy in the form of sign bits, (e.g., the channel code bits select the signs of the channel input symbols). This is equivalent to say, that the shaper is used to determine the bits that determine the amplitudes of the channel inputs, (e.g., the amplitude bits). However, especially for large constellations, prescribing all amplitude bits thru enumerative shaping introduces high computational and storage complexities.
Embodiments described herein provide for more efficient enumerative sphere shaping by prescribing a subset (Nk) of the amplitude bits (N(m−1)) (where m is the number of bits that are mapped to a one-dimensional symbol) and having remaining (N(m−1−k)) uniformly distributed to modify a Gaussian distributed amplitude sequence determined by a modified k-bit ESS, such that computational load and storage requirements are significantly reduced while still achieving a significant part of the shaping gain. Enumerative amplitude shaping yields many benefits including a decrease in the SNR required to operate at a specific transmission rate, and enabling changes in the transmission rate without changing the code rate or constellation. Consequently, interference is also decreased, which is important in dense networks (e.g., in an automobile environment). Rate adaptivity is also important to efficiently utilize the communication channel bandwidth.
The transmit system 12 receives the serial data bit stream 14 with a shaper 30. The shaper 30 will be described in further detail with reference to
An encoder 34 coverts the combined amplitude stream 32 into a signed amplitude sequence 36 by adding uniformly distributed sign bits to each of the respective amplitudes in the combined amplitude stream 32, while maintaining the Gaussian distribution centered about zero (e.g., resulting in a substantially equal number of positive and negative amplitudes). In another embodiment, the encoder 34 adds some of the sign bits and the remaining sign bits are directly selected by the uniform data. The polarity of the sign bits is a function of the respective amplitude value. In various embodiments, the addition of the sign bits by the encoder further creates code redundancy and error correction. In one embodiment, the encoder uses a convolutional encoding following an IEEE 802.11 protocol. In another embodiment, the encoder uses a Forward Error Correction (FEC) encoding.
A mapper 38 converts the signed amplitude sequence 36 received from the encoder 34, into a transmitter input 40 (e.g., another serial symbol stream). In various embodiments, the transmitter 42 transmits the transmitter input 40 as a shaped encoded symbol stream 16 to the AWGN communications channel 18. In one embodiment, the transmitter 42 comprises an amplifier.
The receive system 22 receives a shaped symbol stream 26 from the AWGN communications channel 18, and produces a receiver output 52 as another serial symbol stream. In various embodiments, the receiver 50 comprises a low noise amplifier. A demapper 54 converts the receiver output 52 into sequence 56 by performing an inverse operation to the mapper 38. In many embodiments, the sequence 56 is a sequence of log-likelihood values. A decoder 58 converts the sequence 56 into an amplitude stream 60 by performing an inverse operation to the encoder 34. In some embodiments, the demapper 54 and the decoder 58 are combined to eliminate the intermediate step of forming the amplitude sequence 56. A deshaper 62 converts the shaped unsigned amplitude stream 60 to a serial data bit stream 24 by performing an inverse operation to the shaper 30. The deshaper 62 will be described in further detail with reference to
Each path corresponds to one of the energy-constrained sequences starting at the energy level 80a (or state) with zero energy, and terminating at one of the four maximum energy levels 80e, 80i, 80m or 80q. Each of the energy levels has a first number 122 representing the cumulative energy along the path. For example, if the four pulses are modulated with +1, the path is 80a to 80b to 80c to 80d to 80e for a cumulative energy of 1+1+1+1 or 4, as shown by the first number in energy level 80e. If the path taken is 80a to 80n, the energy is level is (+5){circumflex over ( )}2 or 25 as shown by the first number in energy level 80n. Note that the modulation level 120 is squared to convert an amplitude gain of a transmitted pulse to an energy level, because power is proportional to a voltage squared.
The second number 124 in each energy level defines the number of alternative paths from that energy level to one of the four maximum energy levels 80e, 80i, 80m and 80q. For example starting partially at an interim point of an amplitude sequence, at energy level 80c, the second number shows 6 alternative paths to proceed to one of the four maximum energy levels. The 6 paths are as follows: (1) 80c to 80d to 80e; (2) 80c to 80d to 80i; (3) 80c to 80d to 80q; (4) 80c to 80h to 80i; (5) 80c to 80h to 80m; and (6) 80c to Op to 80q.
Each of the paths listed by the second number 124 is indexed by lexographical ordering over all of the energy constrained sequences, thus reducing the required storage capacity. For example, the path with the least possible cumulative energy is from 80a to 80b to 80c to 80d to 80e, having a total energy of 4. The path with the next smallest cumulative energy consists of N−1 ones and 1 three, or 80a to 80b to 80c to 80d to 80i for a total energy of 12. Paths that include the same total cumulated energy are further separated by differences in cumulative energy during the sequence. In other words, determining the index of a sequence requires counting the number of sequences that are lexicographically prior to that sequence. For example, the sequence 3, 1, 1, 1 defined from 80a to 80f to 80g to 80h to 80m is lexographically prior to the sequence 3, 1, 3, 1 defined from 80a to 80f to 80g to 80j to 80m. The number of sequences that are lexicographically before the sequence 3, 1, 1, 1 is 12 (e.g., 1+11). Conversely, the number of sequences that are lexicographically before the sequence 3, 1, 3, 1 is 13 (e.g., 11+2, given by the second numbers of energy levels 80b and 80h).
The ESS 160 generates a first unsigned amplitude sequence 162. The converter 164 maps the amplitude sequence 162 into a first shaped Data bit sequence 166. In one embodiment, the converter 164 mapping uses the same circuit and methodology as the mapper 38 of
Referring now to
Referring to
As will be appreciated, embodiments as disclosed include at least the following. In one embodiment, a method for k-bit Enumerative Sphere Shaping (ESS) of multidimensional constellations comprises converting a first set of a plurality of uniformly distributed data bits from a serial data bit stream to a first unsigned amplitude sequence comprising a plurality of amplitudes bounded by a spherical constellation of maximum energy levels of a plurality of energy levels, wherein the first unsigned amplitude sequence has a Gaussian distribution and each of the energy levels is determined by a respective one of the amplitudes in the amplitude sequence. The first unsigned amplitude sequence is converted to a first shaped data bit sequence. The first shaped data bit sequence is combined with a second set of a one or more uniformly distributed data bits from the serial data bit stream to form a combined data stream. The combined data stream is mapped to a combined amplitude stream.
Alternative embodiments of the method for k-bit Enumerative Sphere Shaping (ESS) of multidimensional constellations include one of the following features, or any combination thereof. Converting the first set of uniformly distributed data bits to the first unsigned amplitude sequence further comprises assigning a first symbol to the first unsigned amplitude sequence, wherein the first symbol is defined by an indexed path in a trellis comprising a path length equal to a number of amplitudes in the first unsigned amplitude sequence. The first unsigned amplitude sequence is determined from a lexicographical ordering of a plurality of amplitudes defined by the spherical constellation. The plurality of amplitudes are defined by an Amplitude Shift Keying modulation method. A uniformly distributed sign bit is added to each of the respective amplitudes in the combined amplitude bit stream with an encoder. The combined amplitude bit stream is encoded with an encoder configured to implement an 802.11 encoding protocol. The combined amplitude stream is encoded with a Forward Error Correction encoder. The second set of uniformly distributed data bits includes one of a Most Significant Bit and a Least Significant Bit of the serial data bit stream. An encoded version of the combined amplitude stream is transmitted over a communication channel.
In another embodiment, an apparatus for k-bit Enumerative Sphere Shaping (ESS) of multidimensional constellations comprises an ESS circuit configured to convert a first set of a plurality of uniformly distributed data bits from a serial data bit stream to a first unsigned amplitude sequence comprising a plurality of amplitudes bounded by a spherical constellation of maximum energy levels of a plurality of energy levels, wherein the first unsigned amplitude sequence has a Gaussian distribution and each of the energy levels is determined by a respective one of the amplitudes in the amplitude sequence. A converter is configured to convert the first unsigned amplitude sequence to a first shaped data bit sequence. A combiner is configured to combine the first shaped data bit sequence with a second set of a one or more uniformly distributed data bits from the serial data bit stream to form a combined data stream, and to map the combined data stream to a combined amplitude stream.
Alternative embodiments of the apparatus for k-bit Enumerative Sphere Shaping (ESS) of multidimensional constellations include one of the following features, or any combination thereof. A first symbol is defined by an indexed path in a trellis comprising a path length equal to a number of amplitudes in the first unsigned amplitude sequence. The first unsigned amplitude sequence is determined from a lexicographical ordering of a plurality of amplitude sequences defined by the spherical constellation. The plurality of amplitudes are defined by an Amplitude Shift Keying modulation method. The second set of uniformly distributed data bits includes one of a Most Significant Bit and a Least Significant Bit of the serial data bit stream. An encoder is configured to add a uniformly distributed sign bit to each of the respective amplitudes in the combined amplitude bit stream. The encoder is configured to implement an 802.11 encoding protocol. A transmitter is configured to transmit an encoded version of the combined amplitude stream over a communication channel.
In another embodiment, an apparatus for k-bit Enumerative Sphere Deshaping of multidimensional constellations comprises a demapper-decoder configured to receive a shaped symbol stream from a communication channel, and to convert the shaped symbol stream to an amplitude stream. A parser is configured to parse the amplitude stream into a first shaped data bit sequence and a second set of a one or more uniformly distributed data bits, wherein a serial data bit stream comprises the second set. A deconverter is configured to convert the first shaped data bit sequence to a first unsigned amplitude sequence. An Enumerative Sphere Deshaping circuit is configured to convert the first unsigned amplitude sequence to a first set of a plurality of uniformly distributed data bits, wherein the serial data bit stream further comprises the first set, the first unsigned amplitude sequence comprises a plurality of amplitudes bounded by a spherical constellation of maximum energy levels of a plurality of energy levels, the first unsigned amplitude sequence has a Gaussian distribution, and each of the energy levels is determined by a respective one of the amplitudes in the amplitude sequence.
Alternative embodiments of the apparatus for k-bit Enumerative Sphere Deshaping of multidimensional constellations include one of the following features, or any combination thereof. A first symbol is defined by an indexed path in a trellis comprising a path length equal to a number of amplitudes in the first unsigned amplitude sequence. The first unsigned amplitude sequence is determined from a lexicographical ordering of a plurality of amplitudes defined by the spherical constellation.
Although the invention is described herein with reference to specific embodiments, various modifications and changes can be made without departing from the scope of the present invention as set forth in the claims below. Accordingly, the specification and figures are to be regarded in an illustrative rather than a restrictive sense, and all such modifications are intended to be included within the scope of the present invention. Any benefits, advantages, or solutions to problems that are described herein with regard to specific embodiments are not intended to be construed as a critical, required, or essential feature or element of any or all the claims.
Unless stated otherwise, terms such as “first” and “second” are used to arbitrarily distinguish between the elements such terms describe. Thus, these terms are not necessarily intended to indicate temporal or other prioritization of such elements.
Number | Name | Date | Kind |
---|---|---|---|
7233634 | Hassell Sweatman | Jun 2007 | B1 |
7443928 | Nefedov | Oct 2008 | B2 |
7583763 | Nissani (Nissensohn) | Sep 2009 | B2 |
8059709 | Abou Rjeily | Nov 2011 | B2 |
8091006 | Prasad | Jan 2012 | B2 |
8116242 | Thomas | Feb 2012 | B2 |
8165194 | Abou Rjeily | Apr 2012 | B2 |
8238488 | Lee | Aug 2012 | B1 |
8346175 | Milliner | Jan 2013 | B2 |
8379768 | Eckert | Feb 2013 | B2 |
8660210 | Kim | Feb 2014 | B2 |
8665977 | Cheng | Mar 2014 | B2 |
8687749 | Serbetli | Apr 2014 | B2 |
8699599 | Eckert | Apr 2014 | B2 |
8718170 | Nissani (Nissensohn) | May 2014 | B2 |
9509533 | Paker | Nov 2016 | B2 |
20030236076 | Brunel | Dec 2003 | A1 |
20040047426 | Nissani Nissensohn | Mar 2004 | A1 |
20050094742 | Yee | May 2005 | A1 |
20050135498 | Yee | Jun 2005 | A1 |
20070133709 | Park | Jun 2007 | A1 |
20070283210 | Prasad | Dec 2007 | A1 |
20080182521 | Milliner | Jul 2008 | A1 |
20080212720 | Abou Rjeily | Sep 2008 | A1 |
20080232455 | Abou Rjeily | Sep 2008 | A1 |
20090076743 | Moseson | Mar 2009 | A1 |
20100034320 | Champion | Feb 2010 | A1 |
20100054372 | Eckert | Mar 2010 | A1 |
20100248391 | Garcia Tello | Sep 2010 | A1 |
20110293052 | Serbetli | Dec 2011 | A1 |
20140146923 | Paker | May 2014 | A1 |
20150304069 | Wu | Oct 2015 | A1 |
20170141788 | Khsiba | May 2017 | A1 |
20180191532 | Mejri | Jul 2018 | A1 |
20180241591 | Rekaya-Ben Othman | Aug 2018 | A1 |
20190052511 | Gultekin | Feb 2019 | A1 |
20190081824 | Arvinte | Mar 2019 | A1 |
Entry |
---|
Bocherer et al., “High Throughput Probabilistic Shaping with Product Distribution Matching,” IEEE, cs.IT, Feb. 24, 2017; 9 pages. |
International Telecommunication Union, “A Modem Operating At Data Signaling Rates of Up to 33,600 bit/s for Use on the General Switched Telephone Network and on Leased Point-To-Point 2-Wire Telephone-Type Circuits,” ITU-T Recommendation V.34, WTSC Resolution No. 1 procedure, Feb. 1998; 79 pages. |
Lang et al., “A Leech Lattice Modem,” IEEE Journal on Selected Areas in Communications, vol. 7, No. 6, Aug. 1989, pp. 968-973; 6 pages. |
Laroia et al., “On Optimal Shaping of Multidimensional Constellations,” IEEE Transactions on Information Theory, vol. 40, No. 4, Jul. 1994, pp. 1044-1056; 13 pages. |
Schulte et al., “Constant Composition Distribution Matching,” IEEE Transactions on Information Theory, vol. 62, No. 1, Jan. 1, 2016, pp. 430-434; 5 pages. |
Wachsmann et al., “Multilevel Codes: Theoretical Concepts and Practical Design Rules,” IEEE Transactions on Information Theory, vol. 45, No. 5, Jul. 1999, pp. 1361-1391; 31 pages. |
Willems et al., “A Pragmatic Approach to Shaped Coded Modulation,” IEEE 1st Symposium on Communications and Vehicular Technology in the Benelux, Oct. 1993; 6 pages. |
Bocherer, G. et al. “Matching Dyadic Distributions to Channels”, IEEE Computer Society—Data Compression Conference, pp. 23-32 (2011). |
Gultekin, Y, C. et al. “Approximate Enumerative Sphere Shaping”, IEEE International Symposium of Information Theory, pp. 676-680 (Aug. 16, 2018). |