首页 > 最新文献

2011 8th International Symposium on Wireless Communication Systems最新文献

英文 中文
Performance of OSTBC MIMO amplify-and-forward two-hop relay system with asymmetric channels 具有非对称信道的OSTBC MIMO放大转发两跳中继系统的性能
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125283
Nuwan S. Ferdinand, Nandana Rajatheva, M. Latva-aho
We present performance analysis of multiple input multiple output (MIMO) amplify-and-forward (AF) two-hop relay system having asymmetric independent channels of Nakagami-m fading and Rician fading. By considering channel state information (CSI)-assisted relaying, we derive outage probability, average symbol error rate (SER) and ergodic capacity. Further we provide high SNR results to understand the depth of system performance and diversity gain. Finally, we present Monte Carlo simulations to verify our analytical results.
对具有非对称独立信道Nakagami-m衰落和rici衰落的多输入多输出(MIMO)放大前向(AF)两跳中继系统进行了性能分析。在考虑信道状态信息辅助中继的基础上,导出了中断概率、平均码错率和遍历容量。此外,我们提供了高信噪比的结果,以了解系统性能和分集增益的深度。最后,我们用蒙特卡罗模拟来验证我们的分析结果。
{"title":"Performance of OSTBC MIMO amplify-and-forward two-hop relay system with asymmetric channels","authors":"Nuwan S. Ferdinand, Nandana Rajatheva, M. Latva-aho","doi":"10.1109/ISWCS.2011.6125283","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125283","url":null,"abstract":"We present performance analysis of multiple input multiple output (MIMO) amplify-and-forward (AF) two-hop relay system having asymmetric independent channels of Nakagami-m fading and Rician fading. By considering channel state information (CSI)-assisted relaying, we derive outage probability, average symbol error rate (SER) and ergodic capacity. Further we provide high SNR results to understand the depth of system performance and diversity gain. Finally, we present Monte Carlo simulations to verify our analytical results.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121674408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
On the performance of spectrum sharing systems over α-µ fading channel for non-identical µ parameter 非相同微参数下α-微衰落信道频谱共享系统性能研究
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125405
Hung Tran, T. Duong, H. Zepernick
Spectrum sharing is a promising approach in cognitive radio networks to improve the spectrum utilization of wireless communication systems. In this paper, we analyze the performance of spectrum sharing systems under the peak interference power constraint for a general fading model, namely the α-μ fading channel. In particular, we derive expressions for statistical characteristics such as probability density function and cumulative distribution function of the end-to-end signal-to-noise ratio for dissimilar fading parameter μ. Using these statistics, we obtain the closed-form expressions for outage probability, amount of fading and approximate ergodic capacity for the considered spectrum sharing system. Finally, Monte Carlo simulations are presented to verify the analytical results.
频谱共享是认知无线电网络中提高无线通信系统频谱利用率的一种很有前途的方法。本文分析了一种通用衰落模型,即α-μ衰落信道,在峰值干扰功率约束下频谱共享系统的性能。特别地,我们导出了不同衰落参数μ的端到端信噪比的概率密度函数和累积分布函数等统计特征的表达式。利用这些统计量,我们得到了所考虑的频谱共享系统的中断概率、衰落量和近似遍历容量的封闭表达式。最后,通过蒙特卡罗仿真验证了分析结果。
{"title":"On the performance of spectrum sharing systems over α-µ fading channel for non-identical µ parameter","authors":"Hung Tran, T. Duong, H. Zepernick","doi":"10.1109/ISWCS.2011.6125405","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125405","url":null,"abstract":"Spectrum sharing is a promising approach in cognitive radio networks to improve the spectrum utilization of wireless communication systems. In this paper, we analyze the performance of spectrum sharing systems under the peak interference power constraint for a general fading model, namely the α-μ fading channel. In particular, we derive expressions for statistical characteristics such as probability density function and cumulative distribution function of the end-to-end signal-to-noise ratio for dissimilar fading parameter μ. Using these statistics, we obtain the closed-form expressions for outage probability, amount of fading and approximate ergodic capacity for the considered spectrum sharing system. Finally, Monte Carlo simulations are presented to verify the analytical results.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122638527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
On network coding with finite channel state information 有限信道状态信息下的网络编码
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125407
Ming Xiao, M. Skoglund
We study network coding for wireless networks with finite channel state information (CSI) at intermediate nodes (relays). Based on the CSI of the relay-sink channels, we adapt the network codes at the relays. For a specific network with two sources, four relays and two sinks, the analytic results show that one bit CSI of all relay-sink channels (global CSI) can reduce complexity (field size), and simultaneously decrease the erasure probability. Then, we generalize the results to relay networks with M users, N relays and J sinks. We show that fixed network codes without CSI cannot achieve instantaneous min-cut, i.e., min-cut under current channel state. We also show that with one bit global CSI, we can achieve instantaneous min-cut by adapting the network codes using an alphabet size L, where L is the number of sinks connecting to a relay. Yet, the fixed MDS network codes use an alphabet size L(M−1N−1). For the networks with perfect or imperfect source-relay channels, adaptive network codes with one bit global CSI have lower erasure probability than the codes without CSI. Thus, one bit global CSI can reduce the erasure probability, and simultaneously reduce coding complexity.
本文研究了中间节点(中继)具有有限信道状态信息的无线网络的网络编码问题。根据中继接收信道的CSI,对中继上的网络编码进行调整。分析结果表明,对于具有两个源、四个中继和两个接收器的特定网络,所有中继-接收器通道的1位CSI(全局CSI)可以降低复杂性(字段大小),同时降低擦除概率。然后,我们将结果推广到具有M个用户、N个中继和J个接收器的中继网络。我们证明了没有CSI的固定网码不能实现瞬时最小割,即当前信道状态下的最小割。我们还表明,使用一位全局CSI,我们可以通过使用字母大小L来调整网络代码来实现瞬时最小切断,其中L是连接到继电器的接收器数量。而固定MDS网络码使用的是字母大小L(M−1N−1)。对于具有完全或不完全源中继信道的网络,具有1位全局CSI的自适应网络码比不具有全局CSI的自适应网络码具有更低的擦除概率。因此,1位全局CSI可以降低擦除概率,同时降低编码复杂度。
{"title":"On network coding with finite channel state information","authors":"Ming Xiao, M. Skoglund","doi":"10.1109/ISWCS.2011.6125407","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125407","url":null,"abstract":"We study network coding for wireless networks with finite channel state information (CSI) at intermediate nodes (relays). Based on the CSI of the relay-sink channels, we adapt the network codes at the relays. For a specific network with two sources, four relays and two sinks, the analytic results show that one bit CSI of all relay-sink channels (global CSI) can reduce complexity (field size), and simultaneously decrease the erasure probability. Then, we generalize the results to relay networks with M users, N relays and J sinks. We show that fixed network codes without CSI cannot achieve instantaneous min-cut, i.e., min-cut under current channel state. We also show that with one bit global CSI, we can achieve instantaneous min-cut by adapting the network codes using an alphabet size L, where L is the number of sinks connecting to a relay. Yet, the fixed MDS network codes use an alphabet size L(M−1N−1). For the networks with perfect or imperfect source-relay channels, adaptive network codes with one bit global CSI have lower erasure probability than the codes without CSI. Thus, one bit global CSI can reduce the erasure probability, and simultaneously reduce coding complexity.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126461960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Primary user capacity maximization in cooperative detection network using m out of N fusion rule 基于m of N融合规则的协同检测网络主用户容量最大化
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125406
Vesh Raj S. Banjade, Nandana Rajatheva
Cooperative detection is a well accepted notion for alleviating the “hidden terminal problem” in cognitive radio (CR) networks. Furthermore, a number of CRs cooperating with each other significantly boosts the reliability of identification of any spectral opportunity. We consider a situation in which the primary user (PU) of the spectrum tries to communicate at a maximum possible rate with the primary receiver which could be a base station (BS) in presence of an N number of energy detector based CRs. Deploying the m out of N fusion rule at the BS, we formulate the problem of allocating the total PU power across its different transmission slots in a bid to maximize the PUBS capacity such that the fused probability of detection is lower bounded by a specific level guaranteeing a prescribed reliability of detection. The problem is shown to possess convexity and is solved to allocate the available PU transmission power optimally. Analysis of m out of N fusion rule on the PU capacity and on the fused detection probability is presented. The effect of time-bandwidth product of the energy detector on the system metrics is also analyzed.
协作检测是缓解认知无线电(CR)网络中“终端隐藏问题”的一种公认的方法。此外,许多CRs相互合作显著提高了识别任何光谱机会的可靠性。我们考虑了这样一种情况,即频谱的主用户(PU)试图以最大可能的速率与主接收器(可能是基站(BS))进行通信,而主接收器存在N个基于能量探测器的cr。在BS上部署m out of N融合规则,我们制定了在其不同传输槽中分配总PU功率的问题,以最大限度地提高pub容量,从而使检测的融合概率低于保证规定检测可靠性的特定水平。证明了该问题具有凸性,并对其进行了求解,使可用PU传输功率得到最优分配。分析了m out of N熔接规律对PU容量和熔接检测概率的影响。分析了能量检测器的时带宽积对系统指标的影响。
{"title":"Primary user capacity maximization in cooperative detection network using m out of N fusion rule","authors":"Vesh Raj S. Banjade, Nandana Rajatheva","doi":"10.1109/ISWCS.2011.6125406","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125406","url":null,"abstract":"Cooperative detection is a well accepted notion for alleviating the “hidden terminal problem” in cognitive radio (CR) networks. Furthermore, a number of CRs cooperating with each other significantly boosts the reliability of identification of any spectral opportunity. We consider a situation in which the primary user (PU) of the spectrum tries to communicate at a maximum possible rate with the primary receiver which could be a base station (BS) in presence of an N number of energy detector based CRs. Deploying the m out of N fusion rule at the BS, we formulate the problem of allocating the total PU power across its different transmission slots in a bid to maximize the PUBS capacity such that the fused probability of detection is lower bounded by a specific level guaranteeing a prescribed reliability of detection. The problem is shown to possess convexity and is solved to allocate the available PU transmission power optimally. Analysis of m out of N fusion rule on the PU capacity and on the fused detection probability is presented. The effect of time-bandwidth product of the energy detector on the system metrics is also analyzed.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125898386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Iterative enhanced packet combining over hybrid-ARQ 基于混合arq的迭代增强分组合并
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125302
O. Rehman, N. Zivic, S. A. H. Tabatabaei
Many widely used wireless networking protocols, such as WiMAX, UMTS and 3GPP Long Term Evolution use Hybrid ARQ for error control. H-ARQ improves the bit error rate performance and reduces the number of retransmissions. If the packet is in error even after forward error correction, then a retransmission request is made by the receiver. In order to reduce the retransmissions, different methods to combine the retransmitted erroneous packet(s) with the previous copies have been proposed earlier. In this paper, an enhanced packet combining method is presented that corrects both the even and odd errors in an erroneous packet by combining the current erroneous copy with the previous one and thereafter performing iterative decoding. The combining method uses both soft and hard information for better performance. A performance comparison is given with certain existing packet combining methods. The proposed method not only reduces the number of retransmissions, but also detects all the errors, with a high probability as given, if the number of errors remains within a certain threshold. The probability of the success of packet recovery for the proposed method is presented. Finally, simulation results for bit error rate, packet acceptance rate and retransmission rates for different packet sizes are presented for comparison.
许多广泛使用的无线网络协议,如WiMAX、UMTS和3GPP长期演进都使用混合ARQ进行错误控制。H-ARQ提高了误码率性能,减少了重传次数。如果数据包在前向纠错后仍然出错,则接收方会发出重传请求。为了减少重传,前面已经提出了不同的方法来将重传的错误包与之前的副本结合起来。本文提出了一种改进的分组合并方法,通过将当前的错误副本与前一个错误副本合并,然后进行迭代解码,来纠正错误数据包中的奇偶错误。结合方法同时使用软信息和硬信息以获得更好的性能。并与现有的几种分组组合方法进行了性能比较。该方法不仅减少了重传次数,而且在错误数保持在一定阈值内的情况下,能够以较高的概率检测出所有错误。给出了该方法成功恢复数据包的概率。最后给出了不同数据包大小下误码率、数据包接受率和重传率的仿真结果进行比较。
{"title":"Iterative enhanced packet combining over hybrid-ARQ","authors":"O. Rehman, N. Zivic, S. A. H. Tabatabaei","doi":"10.1109/ISWCS.2011.6125302","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125302","url":null,"abstract":"Many widely used wireless networking protocols, such as WiMAX, UMTS and 3GPP Long Term Evolution use Hybrid ARQ for error control. H-ARQ improves the bit error rate performance and reduces the number of retransmissions. If the packet is in error even after forward error correction, then a retransmission request is made by the receiver. In order to reduce the retransmissions, different methods to combine the retransmitted erroneous packet(s) with the previous copies have been proposed earlier. In this paper, an enhanced packet combining method is presented that corrects both the even and odd errors in an erroneous packet by combining the current erroneous copy with the previous one and thereafter performing iterative decoding. The combining method uses both soft and hard information for better performance. A performance comparison is given with certain existing packet combining methods. The proposed method not only reduces the number of retransmissions, but also detects all the errors, with a high probability as given, if the number of errors remains within a certain threshold. The probability of the success of packet recovery for the proposed method is presented. Finally, simulation results for bit error rate, packet acceptance rate and retransmission rates for different packet sizes are presented for comparison.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128475670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
On pilot design for interference limited OFDM systems 限制干扰OFDM系统的导频设计
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125413
P. Karunakaran, P. Suryasarman, Vinod Ramaswamy, K. Kuchi, Deviraj Klutto Milleth Jeniston, B. Ramamurthi
Modern cellular networks are inherently interference limited, and therefore, pilot design is extremely important to the overall system performance. The pilots have to be carefully arranged and modulated to track the fading channel as well as to suppress the interference efficiently. 4G wireless systems based on OFDMA use pilot design strategies that can be classified as ‘Data on Pilot’ and ‘Pilot on Pilot’. In this paper, a ‘Null on Pilot’ scheme that uses null tones and pilot tones to avoid most of the interference on the pilots is considered. Various design aspects of these three pilot schemes are discussed in detail. The channel estimation, interference covariance estimation, link performance with different interference profiles, and system throughput are analyzed and compared with these pilot schemes. It is shown that the popular approach of ‘Data on Pilot’ scheme is inferior to the other two approaches in exploiting the post-processing SNR gain of MMSE interference suppression receivers. The performances of ‘Null on Pilot’ and ‘Pilot on Pilot’ are quite similar.
现代蜂窝网络具有固有的干扰限制,因此,导频设计对系统整体性能至关重要。为了跟踪衰落信道并有效地抑制干扰,必须对导频进行精心布置和调制。基于OFDMA的4G无线系统使用先导设计策略,可分为“数据先导”和“先导先导”。本文考虑了一种“导频空”方案,该方案使用零音和导频音来避免对导频的大部分干扰。详细讨论了这三个试验方案的各个设计方面。分析和比较了这些试验方案的信道估计、干扰协方差估计、不同干扰情况下的链路性能和系统吞吐量。结果表明,在利用MMSE干扰抑制接收机的后处理信噪比增益方面,常用的“导频数据”方案不如其他两种方法。“Null on Pilot”和“Pilot on Pilot”的性能非常相似。
{"title":"On pilot design for interference limited OFDM systems","authors":"P. Karunakaran, P. Suryasarman, Vinod Ramaswamy, K. Kuchi, Deviraj Klutto Milleth Jeniston, B. Ramamurthi","doi":"10.1109/ISWCS.2011.6125413","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125413","url":null,"abstract":"Modern cellular networks are inherently interference limited, and therefore, pilot design is extremely important to the overall system performance. The pilots have to be carefully arranged and modulated to track the fading channel as well as to suppress the interference efficiently. 4G wireless systems based on OFDMA use pilot design strategies that can be classified as ‘Data on Pilot’ and ‘Pilot on Pilot’. In this paper, a ‘Null on Pilot’ scheme that uses null tones and pilot tones to avoid most of the interference on the pilots is considered. Various design aspects of these three pilot schemes are discussed in detail. The channel estimation, interference covariance estimation, link performance with different interference profiles, and system throughput are analyzed and compared with these pilot schemes. It is shown that the popular approach of ‘Data on Pilot’ scheme is inferior to the other two approaches in exploiting the post-processing SNR gain of MMSE interference suppression receivers. The performances of ‘Null on Pilot’ and ‘Pilot on Pilot’ are quite similar.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128484457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On dispersion of modulo lattice additive noise channels 模晶格加性噪声信道的色散
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125346
Jinjing Jiang, Tie Liu
Modulo lattice additive noise (MLAN) channels appear in the analysis of structured lattice codes with lattice decoding for Costa's dirty-paper channel and the additive white Gaussian noise (AWGN) channel. Building on the recent result on the optimal density of an infinite constellation over an AWGN channel, in this paper, it is shown that with a proper choice of the shaping lattice and the scaling parameter, the dispersion of the MLAN channel is asymptotically the same as that of the (zero-interference) AWGN channel at the same signal-to-noise ratio.
在对Costa的脏纸信道和加性高斯白噪声信道进行格解码的结构格码分析中,出现了模格加性噪声信道(MLAN)。本文在最近关于AWGN信道上无限星座最优密度的研究结果的基础上,证明了在相同信噪比下,只要选择合适的整形晶格和标度参数,MLAN信道的色散与(零干扰)AWGN信道的色散是渐近相同的。
{"title":"On dispersion of modulo lattice additive noise channels","authors":"Jinjing Jiang, Tie Liu","doi":"10.1109/ISWCS.2011.6125346","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125346","url":null,"abstract":"Modulo lattice additive noise (MLAN) channels appear in the analysis of structured lattice codes with lattice decoding for Costa's dirty-paper channel and the additive white Gaussian noise (AWGN) channel. Building on the recent result on the optimal density of an infinite constellation over an AWGN channel, in this paper, it is shown that with a proper choice of the shaping lattice and the scaling parameter, the dispersion of the MLAN channel is asymptotically the same as that of the (zero-interference) AWGN channel at the same signal-to-noise ratio.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128525972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Optimal power allocation under QoS constraints in cognitive radio systems 认知无线电系统QoS约束下的最优功率分配
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125418
S. Vassaki, M. Poulakis, A. Panagopoulos, P. Constantinou
Cognitive radio technology aims at the efficient utilization of the limited radio resources and the improvement of flexibility of spectrum usage in wireless networks. The main idea of this technology is the development of intelligent networks where the unlicensed secondary users may coexist with the licensed primary users, always limited by the obligation not to affect their communication. In this paper, we consider a spectrum underlay cognitive radio system operating in fading environment. Guaranteeing that the average interference limit constraint to primary users is satisfied, we propose a quality of service (QoS)-driven power allocation scheme, with a view to maximizing the effective capacity of the secondary users. The proposed scheme takes into consideration the interference of primary user to the secondary user, in order to accomplish the optimal allocation more realistically. Finally, the proposed allocation scheme has been evaluated through numerical simulations that confirm the presented theoretical analysis.
认知无线电技术旨在有效利用有限的无线电资源,提高无线网络频谱使用的灵活性。该技术的主要思想是发展智能网络,在智能网络中,未经许可的次要用户可以与已许可的主要用户共存,并始终受到不影响其通信的义务的限制。本文研究了一种在衰落环境下工作的频谱底层认知无线电系统。在保证满足主用户平均干扰限制约束的前提下,提出了一种服务质量驱动的功率分配方案,以最大限度地提高辅助用户的有效容量。该方案考虑了主用户对辅助用户的干扰,使优化分配更加现实。最后,通过数值模拟对所提出的分配方案进行了评价,验证了理论分析的正确性。
{"title":"Optimal power allocation under QoS constraints in cognitive radio systems","authors":"S. Vassaki, M. Poulakis, A. Panagopoulos, P. Constantinou","doi":"10.1109/ISWCS.2011.6125418","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125418","url":null,"abstract":"Cognitive radio technology aims at the efficient utilization of the limited radio resources and the improvement of flexibility of spectrum usage in wireless networks. The main idea of this technology is the development of intelligent networks where the unlicensed secondary users may coexist with the licensed primary users, always limited by the obligation not to affect their communication. In this paper, we consider a spectrum underlay cognitive radio system operating in fading environment. Guaranteeing that the average interference limit constraint to primary users is satisfied, we propose a quality of service (QoS)-driven power allocation scheme, with a view to maximizing the effective capacity of the secondary users. The proposed scheme takes into consideration the interference of primary user to the secondary user, in order to accomplish the optimal allocation more realistically. Finally, the proposed allocation scheme has been evaluated through numerical simulations that confirm the presented theoretical analysis.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130778380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
On the delay and energy performance in coded two-hop line networks with bursty erasures 具有突发擦除的编码两跳网络的时延和能量性能
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125410
D. Lucani, J. Kliewer
We consider two-hop line networks where the communication links are bursty packet erasure channels modeled as a simple two-state Gilbert-Elliott channel. The first and second node in the line have local information with Poisson-distributed arrivals available and intend to communicate this information to the receiving node in the line. We consider an online approach and random linear network coding for erasure correction. We provide a queueing-theoretic analysis of two different models, a genie aided full duplex model and a partially genie aided half-duplex model, where the genie only provides the channel state information. Channel-aware policies are shown to reduce delay by up to a factor of 3 in our examples and significantly increase the network's stable throughput region compared to a simple queue-length driven policy.
我们考虑两跳线路网络,其中通信链路是突发数据包擦除通道,建模为简单的两状态吉尔伯特-艾略特通道。线路中的第一个和第二个节点拥有泊松分布到达的本地信息,并打算将此信息传递给线路中的接收节点。我们考虑了一种在线方法和随机线性网络编码来进行擦除校正。本文对精灵辅助的全双工模型和部分精灵辅助的半双工模型进行了队列理论分析,其中精灵只提供信道状态信息。在我们的示例中,与简单的队列长度驱动策略相比,通道感知策略可以将延迟减少3倍,并显着增加网络的稳定吞吐量区域。
{"title":"On the delay and energy performance in coded two-hop line networks with bursty erasures","authors":"D. Lucani, J. Kliewer","doi":"10.1109/ISWCS.2011.6125410","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125410","url":null,"abstract":"We consider two-hop line networks where the communication links are bursty packet erasure channels modeled as a simple two-state Gilbert-Elliott channel. The first and second node in the line have local information with Poisson-distributed arrivals available and intend to communicate this information to the receiving node in the line. We consider an online approach and random linear network coding for erasure correction. We provide a queueing-theoretic analysis of two different models, a genie aided full duplex model and a partially genie aided half-duplex model, where the genie only provides the channel state information. Channel-aware policies are shown to reduce delay by up to a factor of 3 in our examples and significantly increase the network's stable throughput region compared to a simple queue-length driven policy.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129893583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Dimensionality reduction for the golden code with worst-case decoding complexity of O(m2) 最坏情况译码复杂度为0 (m2)的黄金码降维
Pub Date : 2011-11-01 DOI: 10.1109/ISWCS.2011.6125384
S. Kahraman, M. Çelebi
In this paper we introduce an efficient decoding method which is based on the dimensionality reduction of the sphere decoder search tree for the golden code. A codeword of the golden code has four independent m-QAM data symbols, hence, the required complexity of the exhaustive-search decoder is m4. An efficient implementation of the maximum-likelihood decoder for the golden code with a worst-case complexity is known to be proportional to m2.5. Our motivation is for an efficient decoder with a worst-case complexity of no more than m2.5. In this purpose, we show that our proposed method has m2 complexity in the worst-case with a loss of only 1 dB with respect to optimal decoding.
本文介绍了一种基于球解码器搜索树降维的高效黄金码解码方法。黄金码的一个码字有四个独立的m-QAM数据符号,因此,穷举搜索解码器所需的复杂度为m4。已知具有最坏情况复杂度的黄金码的最大似然解码器的有效实现与m2.5成正比。我们的动机是开发一种最坏情况复杂度不超过m2.5的高效解码器。为此,我们证明了我们提出的方法在最坏情况下具有m2复杂度,相对于最佳解码仅损失1 dB。
{"title":"Dimensionality reduction for the golden code with worst-case decoding complexity of O(m2)","authors":"S. Kahraman, M. Çelebi","doi":"10.1109/ISWCS.2011.6125384","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125384","url":null,"abstract":"In this paper we introduce an efficient decoding method which is based on the dimensionality reduction of the sphere decoder search tree for the golden code. A codeword of the golden code has four independent m-QAM data symbols, hence, the required complexity of the exhaustive-search decoder is m4. An efficient implementation of the maximum-likelihood decoder for the golden code with a worst-case complexity is known to be proportional to m2.5. Our motivation is for an efficient decoder with a worst-case complexity of no more than m2.5. In this purpose, we show that our proposed method has m2 complexity in the worst-case with a loss of only 1 dB with respect to optimal decoding.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116166364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
期刊
2011 8th International Symposium on Wireless Communication Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1