#### DMCA

## Constellation Shaping for Bit-Interleaved Coded APSK

Citations: | 5 - 5 self |

### Citations

2070 | Information Theory and Reliable Communication - Gallager - 1968 |

545 |
Bit-interleaved coded modulation
- Caire, Taricco, et al.
- 1998
(Show Context)
Citation Context ...ticular constellation X , number of shaping bits g, and (ns,ks) shaping code, we numerically evaluate the information rate I(X; Y ). While the evaluation could be done using a Monte Carlo integration =-=[9]-=-, we use the Gauss-Hermite quadratures method of evaluation described in [10]. We begin by evaluating the information rates under the assumption that the input symbols have a uniform distribution (als... |

275 | Computation of channel capacity and rate distortion functions
- Blahut
- 1972
(Show Context)
Citation Context ...bability of occurrence of each of the symbols be independently varied. Techniques for finding the optimizing distributions may be readily found in the literature, such as the Blahut-Arimoto algorithm =-=[8]-=-. However, the shaping scheme proposed in Section III does not allow for independent symbol probabilities. Rather, the symbol probabilities are correlated by the value of p0, the number of shaping bit... |

75 |
Guillén i Fàbregas
- Boutros, A
(Show Context)
Citation Context ...der M, an APSK constellation is characterized by the number of rings, the number of signals in each ring, the relative radii of the rings, and the phase offset of the rings relative to each other. In =-=[2]-=- and [3] these parameters were optimized using a technique based on information theory. In particular, the achievable information rate was computed for each choice of APSK parameters, and from these i... |

59 |
Nonequiprobable signaling on the Gaussian channel
- Calderbank, Ozarow
- 1990
(Show Context)
Citation Context ...specify how these distributions can be achieved in a practical system. While it is difficult to induce an arbitrary symbol distribution, constellation shaping techniques, such as the ones proposed in =-=[4]-=-, have been devised that bias the symbols in an effort to increase the information rate. When constellationshaping is combined with powerful, capacity-approaching codes, the method of combination is a... |

14 |
Constellation shaping for bandwidth-efficient turbo-coded modulation with iterative receiver
- Goff, Khoo, et al.
- 2007
(Show Context)
Citation Context ... symbols in an effort to increase the information rate. When constellationshaping is combined with powerful, capacity-approaching codes, the method of combination is a challenging problem. In [5] and =-=[6]-=-, Le Goff et al. propose a shaping technique suitable for bit-interleaved systems typical of modern communication standards. The technique involves the use of the short nonlinear shaping codes describ... |

8 |
Tsimenidis, “Bitinterleaved coded modulation with iterative decoding using constellation shaping
- Khoo, Goff, et al.
- 2006
(Show Context)
Citation Context ...bias the symbols in an effort to increase the information rate. When constellationshaping is combined with powerful, capacity-approaching codes, the method of combination is a challenging problem. In =-=[5]-=- and [6], Le Goff et al. propose a shaping technique suitable for bit-interleaved systems typical of modern communication standards. The technique involves the use of the short nonlinear shaping codes... |

8 | Channel capacity calculations for M-ary N-dimensional signal sets
- McIllree
- 1995
(Show Context)
Citation Context ..., we numerically evaluate the information rate I(X; Y ). While the evaluation could be done using a Monte Carlo integration [9], we use the Gauss-Hermite quadratures method of evaluation described in =-=[10]-=-. We begin by evaluating the information rates under the assumption that the input symbols have a uniform distribution (also called the symmetric information rate). For M =16, we evaluated the informa... |

7 |
On 64-APSK constellation design optimization
- Liolis, Alagha
- 2008
(Show Context)
Citation Context ...n APSK constellation is characterized by the number of rings, the number of signals in each ring, the relative radii of the rings, and the phase offset of the rings relative to each other. In [2] and =-=[3]-=- these parameters were optimized using a technique based on information theory. In particular, the achievable information rate was computed for each choice of APSK parameters, and from these informati... |