Logo image
Fast approximation algorithms for symmetric constellation subset selection
Journal article   Peer reviewed

Fast approximation algorithms for symmetric constellation subset selection

Scott C.-H. Huang, Hsiao-Chun Wu and Shih Yu Chang
IEEE Transactions on Wireless Communications, Vol.11(5), pp.1655-1665
05/2012

Abstract

approximation algorithms Constellation subset selection symbol error rate bounds
Adaptive-modulation transceivers have been widely used in wireless communications nowadays. The tradeoff between symbol error rate and data rate can be tuned by adjusting the constellation size. In this paper, we propose a constellation subset selection (CSS) approach and design the novel efficient approximation algorithms to tackle the CSS problems. The approximation ratios for these algorithms are derived. The theoretical studies on how to control the target symbol error rate by selecting an appropriate parameter K are also presented. Monte Carlo simulation results show that our CSS scheme really can reach below the target error probability. © 2002-2012 IEEE.

Metrics

1 Record Views

Details

Logo image