Abstract
Adaptive modulation communication systems have been popular nowadays. The tradeoff between the symbol error rate and the data rate resulting from the constellation option is crucial in adaptive modulation. In this paper, we propose a constellation subset selection (CSS) approach to seek this tradeoff and design novel efficient approximation algorithms to tackle the CSS problems. The new theorems and studies on the algorithmic and systematic aspects for the constellation subset selection are facilitated. Our attempt to cope with the CSS problems would be valuable for the future communication systems with adjustable constellation sets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
