{"title":"有限反馈认知无线电网络中中断最小化","authors":"Y. He, S. Dey","doi":"10.1109/AusCTW.2012.6164911","DOIUrl":null,"url":null,"abstract":"We address an optimal transmit power allocation problem that minimizes the outage probability of a secondary user (SU) who is allowed to coexist with a primary user (PU) in a narrowband spectrum sharing cognitive radio network, under a long term average transmit power constraint at the secondary transmitter (SU-TX) and an average interference power constraint at the primary receiver (PU-RX), with quantized channel state information (CSI) (including both the channels from SU-TX to SU-RX, denoted as g1 and the channel from SU-TX to PU-RX, denoted as g0) at the SU-TX. The optimal quantization regions in the vector channel space is shown to have a `stepwise' structure. With this structure, the above outage minimization problem can be explicitly formulated and solved by employing the Karush-Kuhn-Tucker (KKT) necessary optimality conditions to obtain a locally optimal quantized power codebook. A low-complexity near-optimal quantized power allocation algorithm is derived for the case of large number of feedback bits. More interestingly, we show that as the number of partition regions approaches infinity, the length of interval between any two adjacent quantization thresholds on the g0 axis is asymptotically equal when the average interference power constraint is active. Similarly, we show that when the average interference power constraint is inactive, the ratio between any two adjacent quantization thresholds on the g1 axis becomes asymptotically identical. Finally, an explicit expression for the asymptotic SU outage probability at high rate quantization (as the number of feedback bits goes to infinity) is also provided, and is shown to approximate the optimal outage behavior extremely well for large number of bits of feedback via numerical simulations. Numerical results also illustrate that with 6 bits of feedback, the derived algorithms provide SU outage performance very close to that with full CSI at SU-TX.","PeriodicalId":320391,"journal":{"name":"2012 Australian Communications Theory Workshop (AusCTW)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Outage minimization in cognitive radio networks with limited feedback\",\"authors\":\"Y. He, S. Dey\",\"doi\":\"10.1109/AusCTW.2012.6164911\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address an optimal transmit power allocation problem that minimizes the outage probability of a secondary user (SU) who is allowed to coexist with a primary user (PU) in a narrowband spectrum sharing cognitive radio network, under a long term average transmit power constraint at the secondary transmitter (SU-TX) and an average interference power constraint at the primary receiver (PU-RX), with quantized channel state information (CSI) (including both the channels from SU-TX to SU-RX, denoted as g1 and the channel from SU-TX to PU-RX, denoted as g0) at the SU-TX. The optimal quantization regions in the vector channel space is shown to have a `stepwise' structure. With this structure, the above outage minimization problem can be explicitly formulated and solved by employing the Karush-Kuhn-Tucker (KKT) necessary optimality conditions to obtain a locally optimal quantized power codebook. A low-complexity near-optimal quantized power allocation algorithm is derived for the case of large number of feedback bits. More interestingly, we show that as the number of partition regions approaches infinity, the length of interval between any two adjacent quantization thresholds on the g0 axis is asymptotically equal when the average interference power constraint is active. Similarly, we show that when the average interference power constraint is inactive, the ratio between any two adjacent quantization thresholds on the g1 axis becomes asymptotically identical. Finally, an explicit expression for the asymptotic SU outage probability at high rate quantization (as the number of feedback bits goes to infinity) is also provided, and is shown to approximate the optimal outage behavior extremely well for large number of bits of feedback via numerical simulations. Numerical results also illustrate that with 6 bits of feedback, the derived algorithms provide SU outage performance very close to that with full CSI at SU-TX.\",\"PeriodicalId\":320391,\"journal\":{\"name\":\"2012 Australian Communications Theory Workshop (AusCTW)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Australian Communications Theory Workshop (AusCTW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AusCTW.2012.6164911\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Australian Communications Theory Workshop (AusCTW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AusCTW.2012.6164911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Outage minimization in cognitive radio networks with limited feedback
We address an optimal transmit power allocation problem that minimizes the outage probability of a secondary user (SU) who is allowed to coexist with a primary user (PU) in a narrowband spectrum sharing cognitive radio network, under a long term average transmit power constraint at the secondary transmitter (SU-TX) and an average interference power constraint at the primary receiver (PU-RX), with quantized channel state information (CSI) (including both the channels from SU-TX to SU-RX, denoted as g1 and the channel from SU-TX to PU-RX, denoted as g0) at the SU-TX. The optimal quantization regions in the vector channel space is shown to have a `stepwise' structure. With this structure, the above outage minimization problem can be explicitly formulated and solved by employing the Karush-Kuhn-Tucker (KKT) necessary optimality conditions to obtain a locally optimal quantized power codebook. A low-complexity near-optimal quantized power allocation algorithm is derived for the case of large number of feedback bits. More interestingly, we show that as the number of partition regions approaches infinity, the length of interval between any two adjacent quantization thresholds on the g0 axis is asymptotically equal when the average interference power constraint is active. Similarly, we show that when the average interference power constraint is inactive, the ratio between any two adjacent quantization thresholds on the g1 axis becomes asymptotically identical. Finally, an explicit expression for the asymptotic SU outage probability at high rate quantization (as the number of feedback bits goes to infinity) is also provided, and is shown to approximate the optimal outage behavior extremely well for large number of bits of feedback via numerical simulations. Numerical results also illustrate that with 6 bits of feedback, the derived algorithms provide SU outage performance very close to that with full CSI at SU-TX.