DocumentCode
1680376
Title
Constellation Subset Selection: Theories and Algorithms
Author
Wu, Hsiao-Chun ; Chang, Shih Yu
Author_Institution
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
fYear
2009
Firstpage
1
Lastpage
6
Abstract
Constellation subset selection 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 commonly-used constellations and then facilitate the constellation subset selection problem. Based on our problem formulation, we design two algorithms to solve this problem thereby. Our complexity analysis evinces the effectiveness of the proposed algorithms.
Keywords
adaptive modulation; computational complexity; adaptive modulation communication; commonly used constellation; complexity analysis; constellation phasers; constellation subset selection problem; mathematical properties; problem formulation; theoretical analysis; Algorithm design and analysis; Amplitude modulation; Communication system control; Constellation diagram; Modulation coding; Multidimensional systems; Phase modulation; Phase shift keying; Signal design; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE
Conference_Location
Honolulu, HI
ISSN
1930-529X
Print_ISBN
978-1-4244-4148-8
Type
conf
DOI
10.1109/GLOCOM.2009.5425385
Filename
5425385
Link To Document