Pub Date : 2011-11-01DOI: 10.1109/ISWCS.2011.6125285
Meng Wu, Wenyao Xue, D. Wübben, A. Dekorsy, S. Paul
We consider distributed relaying networks using space-time block codes (STBC) to exploit cooperative diversity. In order to mitigate the impact of error propagation for Decode-Forward (DF), an inter-relay cooperation (IRC) scheme is proposed that allows message exchanges between the relays based on punctured channel codes. Specifically, one of the error-free relays broadcasts punctured bits as side information to help failed relays to re-decode. Consequently, only relays capable of successful decoding transmit to the destination using STBC. Furthermore, an energy model for relays is introduced, so that the proposed IRC scheme can be evaluated with respect to throughput and energy consumptions for transmission, baseband and RF circuit at all relays. Simulation results show the superior performance using IRC, which should be properly designed under the influence of energy considerations.
{"title":"Energy-aware design of inter-relay cooperation for distributed relaying networks","authors":"Meng Wu, Wenyao Xue, D. Wübben, A. Dekorsy, S. Paul","doi":"10.1109/ISWCS.2011.6125285","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125285","url":null,"abstract":"We consider distributed relaying networks using space-time block codes (STBC) to exploit cooperative diversity. In order to mitigate the impact of error propagation for Decode-Forward (DF), an inter-relay cooperation (IRC) scheme is proposed that allows message exchanges between the relays based on punctured channel codes. Specifically, one of the error-free relays broadcasts punctured bits as side information to help failed relays to re-decode. Consequently, only relays capable of successful decoding transmit to the destination using STBC. Furthermore, an energy model for relays is introduced, so that the proposed IRC scheme can be evaluated with respect to throughput and energy consumptions for transmission, baseband and RF circuit at all relays. Simulation results show the superior performance using IRC, which should be properly designed under the influence of energy considerations.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"30 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":"124927742","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.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.6125349
D. Schmidt, W. Utschick
The “max-SINR” algorithm and a number of related algorithms have been shown to be very useful for determining good strategies in MIMO interference networks and achieving spatial interference alignment at high SNR. These algorithms, however, rely on being initialized with a “proper” configuration of streams per user, as they do not have the capability of reducing a user's power or deactivating users completely. Alternatively, algorithms for MIMO interference networks can be designed to perform power control, so that interference alignment can be achieved even from an improper initialization. In this paper, we examine one particularly promising such design. We discuss in detail an update procedure based on maximizing the own rate minus a linearized cost of causing interference to other users, a technique known as "interference pricing" for simplicity, we restrict our attention to the case of one stream per user. As previously proposed, we combine the pricing updates with a gradual increase of the transmit power or SNR, which greatly improves the numerical properties. We show with numerical experiments that in an improper system our proposed pricing algorithm with incremental SNR achieves better performance than other algorithms with power control; the fixed-power algorithms, such as the max-SINR algorithm, perform poorly at high SNR.
{"title":"Algorithms for improper single-stream MIMO interference networks","authors":"D. Schmidt, W. Utschick","doi":"10.1109/ISWCS.2011.6125349","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125349","url":null,"abstract":"The “max-SINR” algorithm and a number of related algorithms have been shown to be very useful for determining good strategies in MIMO interference networks and achieving spatial interference alignment at high SNR. These algorithms, however, rely on being initialized with a “proper” configuration of streams per user, as they do not have the capability of reducing a user's power or deactivating users completely. Alternatively, algorithms for MIMO interference networks can be designed to perform power control, so that interference alignment can be achieved even from an improper initialization. In this paper, we examine one particularly promising such design. We discuss in detail an update procedure based on maximizing the own rate minus a linearized cost of causing interference to other users, a technique known as \"interference pricing\" for simplicity, we restrict our attention to the case of one stream per user. As previously proposed, we combine the pricing updates with a gradual increase of the transmit power or SNR, which greatly improves the numerical properties. We show with numerical experiments that in an improper system our proposed pricing algorithm with incremental SNR achieves better performance than other algorithms with power control; the fixed-power algorithms, such as the max-SINR algorithm, perform poorly at high SNR.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"34 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":"117062292","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.6125396
Katerina Smiljkovic, Z. Hadzi-Velkov
We derive simple asymptotic expressions for the outage probability (OP) and the average error probability (AEP) of dual-hop fixed-gain amplify-and-forward relaying system with or without direct path in a Rayleigh fading environment and high signal-to-noise ration (SNR). We show that, when direct path is not utilized, both OP and EP decay as log(SNR)/SNR, whereas, when the direct path is utilized, OP and EP decay as log(SNR)/SNR2 at high SNRs.
{"title":"Asymptotic performance of dual-hop non-regenerative cooperative systems with or without direct path","authors":"Katerina Smiljkovic, Z. Hadzi-Velkov","doi":"10.1109/ISWCS.2011.6125396","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125396","url":null,"abstract":"We derive simple asymptotic expressions for the outage probability (OP) and the average error probability (AEP) of dual-hop fixed-gain amplify-and-forward relaying system with or without direct path in a Rayleigh fading environment and high signal-to-noise ration (SNR). We show that, when direct path is not utilized, both OP and EP decay as log(SNR)/SNR, whereas, when the direct path is utilized, OP and EP decay as log(SNR)/SNR2 at high SNRs.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"11 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114010672","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.6125308
Da Lio, F. Rossetto, L. Vangelista
Accurate channel estimation may require complex algorithms for effective results, especially in the case of a multiuser detector. The introduction of Graphic Processing Units (GPUs) has opened up new possibilities for the implementation of numerically intensive channel estimation algorithms. This paper studies the implementation on GPUs of channel estimation algorithms for channels affected by strong phase noise. While classic Maximum Likelihood estimation is still the most competitive in terms of throughput and memory bandwidth, Steepest Ascent algorithms show the largest speed improvement due to their structure, which is the most suitable for implementation on a parallel processor like the GPU.
{"title":"Design considerations for massively parallel channel estimation algorithms","authors":"Da Lio, F. Rossetto, L. Vangelista","doi":"10.1109/ISWCS.2011.6125308","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125308","url":null,"abstract":"Accurate channel estimation may require complex algorithms for effective results, especially in the case of a multiuser detector. The introduction of Graphic Processing Units (GPUs) has opened up new possibilities for the implementation of numerically intensive channel estimation algorithms. This paper studies the implementation on GPUs of channel estimation algorithms for channels affected by strong phase noise. While classic Maximum Likelihood estimation is still the most competitive in terms of throughput and memory bandwidth, Steepest Ascent algorithms show the largest speed improvement due to their structure, which is the most suitable for implementation on a parallel processor like the GPU.","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":"115335847","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.6125304
Mahesh Gupta Vutukuri, R. Malladi, K. Kuchi, R. D. Koilpillai
Voice services over Adaptive Multiuser channel in One Slot (VAMOS) performance in the presence of GMSK interferer is presented. Widely-Linear (WL) MMSE filtering is used to cancel the co-channel GMSK interferer while performing α-QPSK detection. In this paper, two ways of estimating the Sub Channel Power Imbalance Ratio (SCPIR) are discussed. Due to the colouration of the resultant impairment after filtering, WL metric is proposed which incorporates error covariance between I/Q components in the metric computation. WL RSSE is used as the equalizer. Simulation results using the proposed receiver architecture show significant performance important over conventional VAMOS receivers.
{"title":"SAIC receiver algorithms for VAMOS downlink transmission","authors":"Mahesh Gupta Vutukuri, R. Malladi, K. Kuchi, R. D. Koilpillai","doi":"10.1109/ISWCS.2011.6125304","DOIUrl":"https://doi.org/10.1109/ISWCS.2011.6125304","url":null,"abstract":"Voice services over Adaptive Multiuser channel in One Slot (VAMOS) performance in the presence of GMSK interferer is presented. Widely-Linear (WL) MMSE filtering is used to cancel the co-channel GMSK interferer while performing α-QPSK detection. In this paper, two ways of estimating the Sub Channel Power Imbalance Ratio (SCPIR) are discussed. Due to the colouration of the resultant impairment after filtering, WL metric is proposed which incorporates error covariance between I/Q components in the metric computation. WL RSSE is used as the equalizer. Simulation results using the proposed receiver architecture show significant performance important over conventional VAMOS receivers.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"122 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":"115512626","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
扫码关注我们
求助内容：
应助结果提醒方式：