Pub Date : 2011-11-01DOI: 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.
{"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}
Pub Date : 2011-11-01DOI: 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}
Pub Date : 2011-11-01DOI: 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.
{"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}
Pub Date : 2011-11-01DOI: 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}
Pub Date : 2011-11-01DOI: 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.
{"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}
Pub Date : 2011-11-01DOI: 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}
Pub Date : 2011-11-01DOI: 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.
{"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}
Pub Date : 2011-11-01DOI: 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}
Pub Date : 2011-11-01DOI: 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.
{"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}
Pub Date : 2011-11-01DOI: 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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：