Constellation subset selection: theories and algorithms

Authors:
Hsiao-Chun Wu;Shih Yu Chang
Affiliations:
Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA;Department of Computer Science, National Tsing Hua University, Taiwan
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 6
Cited 0

Trellis-coded modulation with multidimensional constellations

IEEE Transactions on Information Theory
Modern Quadrature Amplitude Modulation: Principles and Applications for Fixed and Wireless Channels

Modern Quadrature Amplitude Modulation: Principles and Applications for Fixed and Wireless Channels
The Art of Assembly Language

The Art of Assembly Language
OFDM and MC-CDMA for Broadband Multi-User Communications, WLANs and Broadcasting

OFDM and MC-CDMA for Broadband Multi-User Communications, WLANs and Broadcasting
Constellation subset selection: theories and algorithms

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Nonuniform phase-shift-key modulation for multimedia multicast transmission in mobile wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Constellation subset selection (CSS) is a new topic emerging in the adaptive modulation communications. How to choose the subset of the original constellation phasers appears to be challenging and interesting to the researchers. There hardly exists any literature which studies the feasibility and the solution of constellation subset selection in details. Here we dedicate to this problem in both theoretical exploration and algorithm design. In this paper, we introduce the detailed theoretical analysis regarding the mathematical properties of the commonlyused constellations and then facilitate the constellation subset selection problem. The CSS problem can be formulated as the maximization of the minimum inter-phaser distance within a constellation subset subject to the symmetry and rate constraints. Based on our problem formulation, we design two algorithms to solve this problem thereby. Our complexity analysis evinces the effectiveness of the proposed algorithms.