Constellation Subset Selection: Theories and Algorithms

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 th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on wireless communications Ročník 9; číslo 7; s. 2248 - 2257
Hlavní autoři: Wu, Hsiao-Chun, Chang, Shih Yu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.07.2010
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
adaptive modulation
Algorithm design and analysis
Algorithms
Amplitude modulation
Applied sciences
Cascading style sheets
Constellation diagram
Constellation selection
Constellations
Design engineering
Exact sciences and technology
Exploration
Information, signal and communications theory
Mathematical analysis
Maximization
Modulation
Modulation coding
Modulation, demodulation
Multidimensional systems
Phase modulation
Phase shift keying
Signal and communications theory
Signal design
symmetric constellation properties
Telecommunications and information theory
Wireless communication
Performance evaluation
Selection problem
Constellation selection
symmetric constellation properties
Minimal distance
Feasibility
Algorithm
Adaptive modulation
ISSN:1536-1276, 1558-2248
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 commonly-used 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2010.07.090500