{"title":"Adaptive M-QAM signaling for dynamic spectrum access","authors":"B. Ellingsaeter, T. Maseng","doi":"10.1109/SPAWC.2011.5990387","DOIUrl":null,"url":null,"abstract":"In this paper we consider an OFDM multiuser system with K orthogonal subcarriers. We assume each user uses M-QAM modulation in each subcarrier. The modulation must be adaptive to cope with propagation changes and to meet the bit error rate requirement of the user. We maximize the sum of information bits per user selfishly, and compare the performance with other power allocation algorithms. Surprisingly, measuring rate by constellation size instead of Shannon's capacity yields a power allocation algorithm that differ widely from previously known power allocation algorithms, such as the iterative water filling algorithm (IWFA). This is because we only accept bit error rates better than 10−3 and the rate achieved with modulation can only be discrete values, whereas other algorithms based on Shannon's capacity can achieve any rate.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2011.5990387","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
In this paper we consider an OFDM multiuser system with K orthogonal subcarriers. We assume each user uses M-QAM modulation in each subcarrier. The modulation must be adaptive to cope with propagation changes and to meet the bit error rate requirement of the user. We maximize the sum of information bits per user selfishly, and compare the performance with other power allocation algorithms. Surprisingly, measuring rate by constellation size instead of Shannon's capacity yields a power allocation algorithm that differ widely from previously known power allocation algorithms, such as the iterative water filling algorithm (IWFA). This is because we only accept bit error rates better than 10−3 and the rate achieved with modulation can only be discrete values, whereas other algorithms based on Shannon's capacity can achieve any rate.