{"title":"基于HARQ的OFDMA自组网在速率和功率约束下的最优资源分配","authors":"N. Ksairi, P. Ciblat, C. Martret","doi":"10.1109/ICASSP.2014.6853636","DOIUrl":null,"url":null,"abstract":"We address multiuser power and bandwidth allocation for Orthogonal Frequency Division Multiple Access (OFDMA) networks employing a Type-II Hybrid Automatic Repeat reQuest (HARQ) mechanism, practical Coding and Modulation Schemes (MCSs) and Bit Interleaved Coded Modulation (BICM). The problem is formulated as minimizing the sum power required to satisfy a goodput constraint for each link while its transmit power does not exceed a certain level. Assuming statistical Channel State Information (CSI), we propose an algorithm to compute the corresponding optimal resource allocation and a practical selection of the MCSs that significantly boosts the proposed algorithm.","PeriodicalId":6545,"journal":{"name":"2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"26 1","pages":"449-453"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal resource allocation for type-II HARQ based OFDMA ad hoc networks under individual rate and power constraints\",\"authors\":\"N. Ksairi, P. Ciblat, C. Martret\",\"doi\":\"10.1109/ICASSP.2014.6853636\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address multiuser power and bandwidth allocation for Orthogonal Frequency Division Multiple Access (OFDMA) networks employing a Type-II Hybrid Automatic Repeat reQuest (HARQ) mechanism, practical Coding and Modulation Schemes (MCSs) and Bit Interleaved Coded Modulation (BICM). The problem is formulated as minimizing the sum power required to satisfy a goodput constraint for each link while its transmit power does not exceed a certain level. Assuming statistical Channel State Information (CSI), we propose an algorithm to compute the corresponding optimal resource allocation and a practical selection of the MCSs that significantly boosts the proposed algorithm.\",\"PeriodicalId\":6545,\"journal\":{\"name\":\"2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"volume\":\"26 1\",\"pages\":\"449-453\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.2014.6853636\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.2014.6853636","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal resource allocation for type-II HARQ based OFDMA ad hoc networks under individual rate and power constraints
We address multiuser power and bandwidth allocation for Orthogonal Frequency Division Multiple Access (OFDMA) networks employing a Type-II Hybrid Automatic Repeat reQuest (HARQ) mechanism, practical Coding and Modulation Schemes (MCSs) and Bit Interleaved Coded Modulation (BICM). The problem is formulated as minimizing the sum power required to satisfy a goodput constraint for each link while its transmit power does not exceed a certain level. Assuming statistical Channel State Information (CSI), we propose an algorithm to compute the corresponding optimal resource allocation and a practical selection of the MCSs that significantly boosts the proposed algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
