I Introduction
Future radio/optical communications systems require enhanced communication rates, and/or reduced peak/average transmit power/energy. In this respect, the modulation scheme is important. It is desirable that the average mutual information (MI) vs. the signal-to-noise ratio (SNR), , of the modulation schemes, is as close to the additive white Gaussian noise (AWGN) (Shannon) capacity, [b/Hz/s] as possible. Well known modulation signal constellations are quadrature amplitude modulation (QAM), phase shift keying (PSK), star-QAM [3], and amplitude PSK (APSK) [4]. QAM, the most studied and deployed of all constellation designs, exhibits an asymptotic 1.53 dB SNR-gap (a shaping-loss) between the MI and the AWGN capacity [5]. Hence, QAM waste % more transmit power than needed at high rates. Geometric- and probabilistic-shaping have been proposed to overcome this shaping-loss. Some works on geometric-shaping are on asymmetric constellations in [6], on nonuniform-QAM in [7], on nonuniform-PAM for AWGN in [8], and on PSK/PAM capacity optimization in [9]. Similarly, some works on probabilistic shaping are as a survey in [10], on -dimensional sphere/cube constellations in [11]
, on Maxwell-Boltzmann distribution based probabilistic shaping in
[12], and on APSK in [13, 14, 15]. While geometric shaping can be applied to QAM, a constellation with circular symmetry (like APSK) is often preferred since the capacity achieving (complex Gaussian) distribution is circular symmetric. Yet, one issue with geometrically-shaped APSK is that the number of constellation points in each ring depends on the shaping.
Recently in [1], and extended in [2], the Golden angle modulation (GAM) framework was introduced. There are two key design features in GAM. The first is separating consecutively indexed constellation points with the golden angle in the phase domain. The second is allowing the radial and the phase distribution of constellation points to have different forms and dependency on the constellation point index. More formally, the GAM signal constellation points can be expressed as
(1) |
where , , and is the golden angle in radians. For large enough constellations, this discrete, spiral-related, design offers a near ideal circular symmetric design, a near ideal uniform phase distribution, and allows for geometric radial shaping. More specifically in [1, 2], two key GAM-designs where proposed. The first one, geometric bell-shaped GAM (GB-GAM), had magnitudes
(2) |
where , and average power . The second one, disc-shaped GAM (disc-GAM), had
(3) |
where .
We note that relatively few works, preceding GAM, consider spiral-based designs. Analog spiral-based modulation was proposed in [16, 17, 18]. The first work uses interconnected semicircular segments of increasing radius, whereas the latter two studied Archimedean spirals with amplitudes in [17], and , in [18]. In [19, 20], discrete spiral-based modulation schemes were proposed. Whereas the former examined a logarithmic spiral design, the latter proposed a design with four intertwinned Archimedean spirals. In the related area of joint source-channel coding, [21, 22, 23], also considered Archimedean spiral-based mapping. The GAM framework does not adopt, nor limit itself to, the Archimedean spiral design. This is not just because the Archimedean spiral has been used several times before, but, more importantly, since it by design, i.e. not decoupling phase and magnitude forms, defy the notion of radial shaping with near-ideal uniform phase distribution. Such characteristic, as offered by GAM, is desirable, e.g. for AWGN capacity achieving, and/or a PAPR-controlled, designs. In addition, none of the prior works have used, nor benefited from, the golden angle-based phase arrangement of constellation points.
In [1, 2], it was seen that the MI of GB-GAM was close to the channel capacity for, say, , where is the signal constellation entropy. Disc-GAM, on the other hand, performed best when . Hence, there is a wide SNR-range, where neither GB-GAM, nor disc-GAM, perform optimally. An effort to handle this in [1, 2], was by optimizing the magnitudes to maximize the MI for every SNR. This problem could not be solved analytically, and a numerical optimization solving approach could only handle constellation points. Hence, it is of interest to find an analytical expression for the magnitudes that improves the MI for the full SNR-range, , relative to GB-GAM, disc-GAM, and classical signal constellations. It is also of interest to parameterize the analytical expression in one, or two, variables that allows for numerical optimization of larger constellations sizes.
I-a Truncated Geometric Bell-shaped GAM
It can be recognized that GB-GAM and disc-GAM can be seen as resulting from two extremes of a truncated Gaussian input distribution. GB-GAM would then approximate a (non-truncated) Gaussian pdf, and disc-GAM would approximate a truncated Gaussian pdf when the radius approaches zero. We can approach this line of reasoning more formally. The overall procedure is to first find a continuous input distribution that (closely) approximates the MI-maximizing distribution, and then using this distribution together with the GAM framework and inverse sampling to determine constellation point magnitudes . First, the MI between a continuous input signal , and a continuous output signal , can be lower bounded as follows, , where the fact that conditioning reduces entropy, , is used in the last step. Hence, instead of finding an input distribution for that maximize the entropy , the entropy is maximized, thereby giving a lower bound to .
Since GAM is near circular symmetric, i.e. for a sufficiently large , we target a continuous circular symmetric input distribution that maximizes for an average power constraint. For notation simplicity and clearness below, we use the notation instead of . Moreover, for generality, and control over the PAPR, we let the circular symmetric density be nonzero for magnitudes less than an outer radius, , but also greater than an inner radius, . More precisely, the pdf is assumed to fulfill
(4) | ||||
where .
The optimization problem can now be formulated as
(5) | ||||||
subject to | ||||||
This problem can, due to convexity of the entropy, be solved by classical Lagrangian optimization. The solution is straightforward and is simply a truncated 2-dim Gaussian pdf. Writing it on the standard bi-variate Gaussian form, with an undetermined normalization constant , we have , where . Since and can be tuned to any value, without loss of generality, we let . As the discrete GAM magnitudes are sought after, it useful to transform to a marginal density with respect to a magnitude . Via Euclidean-to-polar coordinate variable substitution, and
, and integrating over a uniform distribution in phase, we get
(6) |
Integrating the pdf, , yields the constant . The corresponding cdf is then
(7) |
Similar to this work, in [24, 25, 26], a peak-power constrained input distribution was considered. Specifically, the complex AWGN channel was studied in [25]. It was found that the optimal input distribution is discrete in the radial domain, but uniformly continuous in phase. As a sub-optimal input distribution, they derived (based on the same line of reasoning as above) a peak-power truncated complex Gaussian distribution. However, no actual modulation scheme was proposed. Moreover, the result on continuous uniformly distributed phase is incompatible with the idea of discrete signal constellation points. Even if a modulation scheme had been proposed, say APSK-based, it is not obvious how to combine APSK with the truncated complex Gaussian input distribution assumption in a simple and well-performing manner. The designer of an APSK scheme must carefully split the total number of constellation points among the rings, and arrange the distance among rings. The constellations must be designed, and optimized, for every distinct . Certain values of , e.g. prime numbered , give APSK constellations with asymmetries. GAM, on the other hand, together with the method of inverse sampling, is versatile enough to seamlessly adapt to a desired truncated complex Gaussian input distribution and any integer . To more flexibly control PAPR, as said, we also let .
To design a discrete constellation, we consider the method of inverse sampling, together with the GAM design, and the (double) truncated bi-variate Gaussian target density. In inverse sampling, one equates the cdf with a continuous uniformly distributed r.v., say , and solve for . Generating uniformly on , then gives with pdf . With large number of constellation points, we can approximate the uniformly distributed continuous r.v with a uniformly distributed discrete r.v. with a pmf with, e.g., , or alternatively with . Thus, we have , from which we solve for and get
(8) |
It is convenient to normalize the magnitudes , to an average power constraint, , by letting , and where the constant is determined as below
(9) |
Henceforth, we let
, and the AWGN noise variance is then
. In total, the (unit-power normalized) GAM constellation point magnitudes are(10) |
Note that since the constellation is unit-power normalized, the resulting PAPR is simply dB.
As depends only on two parameters and , a simplified optimization problem can be formulated compared to optimizing all values for . The advantage of this is that numerical optimization is not seriously limited by constellation size. The optimization problem, including an optional PAPR constraint , can then be written
(11) | ||||||
subject to | ||||||
where the input distribution for is now given by in (1), in (10
), and where each constellation point have the probability
. After closer scrutiny, it is seen that the optimization problem in (11) can not easily be solved analytically. It is straightforward to further simplify the expressions (and the optimization) above by letting .To simplify the expression for further, we may chose a form that converges to GB- and disc-GAM for and , respectively. First let . Inspecting (10), and knowing that diminishes with increasing SNR, we propose the simple, yet well-performing, form
(12) |
When , (12) (essentially) converges to the GB-GAM’s (2) (by letting ), whereas when , (12) converges to the disc-GAM’s (3).
Ii Numerical Results and Discussion
In the following, the MI vs. SNR performance for coded modulation (CM) is Monte Carlo simulated, whereas the optimized MI performance is numerically computed. In Fig. 1LABEL:sub@fig:ConstG2-b-LABEL:sub@fig:ConstG2-d, we plot the signal constellations of optimized TGB-GAM (10)+(11), for , , and dB. We note that the signal constellation change in shape from an approximate discrete complex Gaussian like design, over an intermediate design, to a disc-shaped design. In Fig. 2LABEL:sub@fig:MagnG2-b-LABEL:sub@fig:MagnG2-d, we plot the magnitude distributions for the TGB-GAM together with GB-GAM and disc-GAM for the same SNRs as in Fig. 1LABEL:sub@fig:ConstG2-b-LABEL:sub@fig:ConstG2-d. We observe how the signal constellation magnitudes have nearly the same distribution as GB-GAM for low SNRs, and nearly the same distribution as disc-GAM for high SNR. We also note that the truncated Gaussian design overcomes the oscillatory problem seen in [2] for the GB-GAM G2 scheme at low SNRs. For the G2 scheme, a polynomial described the growth of , and its coefficients where optimized to maximize the MI. In Fig. 3, we illustrate the MI-performance for the SNR-dependent TGB-GAM (12) together with QAM and the AWGN capacity. It is observed that the MI performance of TGB-GAM is generally better than QAM, and approaches the AWGN capacity as SNR decreases. For , TGB-GAM and QAM performs about the same.
A possible misconception could be that since 16-QAM and 16-GAM have almost the same MI vs. SNR performance, there is no point in favoring GAM over QAM for relatively small constellation sizes, e.g. . Such idea would be based on a certain design paradigm. Let’s consider an example. Say that a rate [b/Hz/s] is desired. Then, the idea could be to use a constellation size and a channel code rate . Zooming in around [b/Hz/s], Fig. 4 shows that the SNR-gaps for 16-QAM and 16-TGB-GAM (12) to the AWGN capacity at [b/Hz/s] are, respectively, dB and dB. (Note that the MI can be improved for GAM using (10)+(11) or with optimization of ). However, this is not necessarily the best design approach, as the required SNR for a desired rate is unnecessarily high. Let’s instead consider the MI-performance for very large , say . Then, the SNR-gaps from 1024-QAM and 1024-TGB-GAM (12) to [b/Hz/s] are, respectively, dB and dB. So a designer could on one hand choose 16-QAM with a code, or on another hand choose 1024-TGB-GAM with a rate code. The latter choice reduces the SNR-gap with dB. This has implication for modem design. Instead of implementing many different constellation sizes, one may implement just the largest desired constellation size, say , and then adapt the code rate to achieve the desired rate . Of course, this reasoning assumes that other costs, e.g. any additional energy consumption, are of less concern. Another aspect speaking for GAM is that the PAPR performance. For example, in [1, 2], we found that QAM asymptotically requires dB higher PAPR than for disc-GAM for the same average constellation point distances. In Fig. 5, we compare the MI of TGB-GAM (both for (10)+(11), and (12)), with GB-GAM, disc-GAM, QAM, and non-uniform QAM (NU-QAM) [8, (1)-(2)]. As aimed for, TGB-GAM (both variants) performs better than all reference cases. NU-QAM performs quite poorly when . Disc-GAM is, as expected due its disc-shape, about dB better than QAM. In Fig. 6, the PAPR vs. SNR of TGB-GAM (10)+(11), and TGB-GAM (12), for is plotted. The PAPR decreases for increasing SNR, as the constellation approaches the shape of disc-GAM. The PAPR is also higher for larger constellation sizes .
Iii Summary and conclusion
In this work, we proposed a new GAM shaping design based on inverse sampling of (a double) truncated complex Gaussian pdf. The MI (and PAPR) performance inherently improved over the two special cases GB-GAM (good at low SNR) and disc-GAM (good at high SNR). A numerical optimization problem was formulated in only two (or optionally just one) optimization variables, and hence allows numerical optimization to be performed for large- constellations. A simplified, SNR-dependent, expression for the magnitude was proposed, and found to offer improved MI-performance over GB-GAM, disc-GAM, QAM, and NU-QAM. A capacity approaching, simplified implementation, modem design, with large size and adaptive low rate , was discussed. It is hoped that GAM-based designs can find use in future wireless communication systems, such as next generation cellular, high-rate microwave-links, satellite, or optical fiber, systems.
References
- [1] P. Larsson, “Golden angle modulation,” IEEE Wireless Communications Letters, vol. 7, no. 1, pp. 98–101, Feb 2018, (Date of publication: arXiv, 20 Aug, 2017; IEEEXplore, 26 Sep, 2017). [Online]. Available: arxiv.org/abs/1708.05947,ieeexplore.ieee.org/document/8049510/
- [2] ——, “Golden angle modulation: Geometric- and probabilistic-shaping,” arXiv, Aug 2017. [Online]. Available: arxiv.org/abs/1708.07321
- [3] L. L. Hanzo, S. X. Ng, T. Keller, and W. Webb, Star QAM Schemes for Rayleigh fading channels. Wiley-IEEE Press, 2004, pp. 307–335.
- [4] C. Thomas, M. Weidner, and S. Durrani, “Digital amplitude-phase keying with M-ary alphabets,” IEEE Transactions on Communications, vol. 22, no. 2, pp. 168–180, February 1974.
- [5] G. D. Forney and G. Ungerboeck, “Modulation and coding for linear Gaussian channels,” IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2384–2415, Oct 1998.
- [6] D. Divsalar, M. Simon, and J. Yuen, “Trellis coding with asymmetric modulations,” IEEE Transactions on Communications, vol. 35, no. 2, pp. 130–141, February 1987.
- [7] W. Betts, A. R. Calderbank, and R. Laroia, “Performance of nonuniform constellations on the Gaussian channel,” IEEE Transactions on Information Theory, vol. 40, no. 5, pp. 1633–1638, Sep 1994.
- [8] D. Sommer and G. P. Fettweis, “Signal shaping by non-uniform QAM for AWGN channels and applications using turbo coding,” in Proc. International ITG Conference source and channel coding, 2000, pp. 81–86.
- [9] M. F. Barsoum, C. Jones, and M. Fitz, “Constellation design via capacity maximization,” in 2007 IEEE International Symposium on Information Theory, June 2007, pp. 1821–1825.
- [10] G. Forney, R. Gallager, G. Lang, F. Longstaff, and S. Qureshi, “Efficient modulation for band-limited channels,” IEEE Journal on Selected Areas in Communications, vol. 2, no. 5, pp. 632–647, Sep 1984.
- [11] A. R. Calderbank and L. H. Ozarow, “Nonequiprobable signaling on the Gaussian channel,” IEEE Transactions on Information Theory, vol. 36, no. 4, pp. 726–740, Jul 1990.
- [12] F. R. Kschischang and S. Pasupathy, “Optimal nonuniform signaling for Gaussian channels,” IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 913–929, May 1993.
- [13] Z. Liu, Q. Xie, K. Peng, and Z. Yang, “APSK constellation with Gray mapping,” IEEE Communications Letters, vol. 15, no. 12, pp. 1271–1273, December 2011.
- [14] X. Xiang and M. C. Valenti, “Closing the gap to the capacity of APSK: Constellation shaping and degree distributions,” in Proc. International Conference on Computing, Networking and Communications (ICNC´13), Jan 2013, pp. 691–695.
- [15] H. Méric, “Approaching the Gaussian channel capacity with APSK constellations,” IEEE Communications Letters, vol. 19, no. 7, pp. 1125–1128, July 2015.
- [16] C. Thomas, C. May, and G. Welti, “Hybrid amplitude-and-phase modulation for analog data transmission,” IEEE Transactions on Communications, vol. 23, no. 6, pp. 634–645, Jun 1975.
- [17] I. Kvecher and D. Rephaeli, “An analog modulation using a spiral mapping,” in 2006 IEEE 24th Convention of Electrical Electronics Engineers in Israel, Nov 2006, pp. 194–198.
- [18] B. Kravtsov and D. Raphaeli, “Multidimensional analog modulation and optimal mappings,” in IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference, Nov 2007, pp. 1426–1430.
- [19] A. Jafargholi, N. Esmi, M. R. Mousavi, and A. Hosseinbeig, “Novell efficient digital modulation technique,” in 2006 International Conference on Communication Technology, Nov 2006, pp. 1–3.
- [20] B. J. Kwak, N. O. Song, B. Park, and D. S. Kwon, “Spiral QAM: A novel modulation scheme robust in the presence of phase noise,” in 2008 IEEE 68th Vehicular Technology Conference, Sept 2008, pp. 1–5.
- [21] F. Hekland, G. E. Oien, and T. A. Ramstad, “Using 2:1 Shannon mapping for joint source-channel coding,” in Data Compression Conference, March 2005, pp. 223–232.
- [22] P. A. Floor and T. A. Ramstad, “Noise analysis for dimension expanding mappings in source-channel coding,” in 2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, July 2006, pp. 1–5.
- [23] A. A. Zaidi, M. N. Khormuji, S. Yao, and M. Skoglund, “Optimized analog network coding strategies for the white Gaussian multiple-access relay channel,” in 2009 IEEE Information Theory Workshop, Oct 2009, pp. 460–464.
- [24] J. G. Smith, “The information capacity of amplitude- and variance-constrained scalar Gaussian channels,” vol. 18, no. 3, pp. 203–219, April 1971.
- [25] S. Shamai and I. Bar-David, “The capacity of average and peak-power-limited quadrature Gaussian channels,” IEEE Transactions on Information Theory, vol. 41, no. 4, pp. 1060–1071, Jul 1995.
- [26] G. Hosoya and H. Yashima, “Constellation shaping for non-uniform signals based on truncated Gaussian distribution,” in 2016 International Symposium on Information Theory and Its Applications (ISITA), Oct 2016, pp. 557–561.
Comments
There are no comments yet.