{"title":"Max-min beamforming for multicell downlink systems using long-term channel statistics","authors":"Xitao Gong, M. Jordan, Guido Dartmann, G. Ascheid","doi":"10.1109/PIMRC.2009.5449866","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5449866","url":null,"abstract":"This paper investigates max-min beamforming for the multicell downlink transmission, where multiple base stations (BSs) cooperatively optimize their transmit beamforming vectors using long-term channel statistics. Based on Lagrangian duality, we reformulate the original problem into a dual uplink problem, which is expected to achieve the same optimal signal to interference plus noise ratio (SINR) as the primal downlink problem. The normalized dual uplink beamformer is the dominant eigenvector of a generalized eigenvalue decomposition (GEVD) problem, and the dual uplink transmit power can be solved iteratively. According to the duality theory, we develop an iterative algorithm and compare it with the beamformer-power iterative algorithm extended from [1]. Simulation results verify the computational efficiency of the proposed algorithm.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130053952","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}
{"title":"A network coded ARQ protocol for broadcast streaming over hybrid satellite systems","authors":"Sameh Sorour, S. Valaee","doi":"10.1109/PIMRC.2009.5449889","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5449889","url":null,"abstract":"Due to the high round trip delay in satellite systems, the retransmission of lost packets using conventional ARQ schemes is performed in a very rigid manner and after a very long time of the initial packet transmission. This results in a high average packet delay and packet drop rate in broadcast streaming applications. Moreover, conventional ARQ schemes are generally inefficient in broadcast scenarios. In this paper, we propose a network coded ARQ protocol that performs both proactive and reactive packet retransmissions in hybrid satellite systems. The proposed protocol employs a network coding approach to generate efficient proactive retransmission packets without the knowledge of lost packets. This not only allows the transmission of these coded retransmissions before the arrival of the initial packets to their destinations but also achieves more efficient packet recovery compared to conventional ARQ. Reactive retransmissions in response to packet acknowledgments are then employed if one or more packets are still lost. Simulation results show considerable gains for our proposed protocol over the selective repeat ARQ protocol in terms of average packet delay, packet drop rate and goodput.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134521256","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}
{"title":"Non-cooperative game for power allocation in interfering wireless networks","authors":"W. P. Tam, T. Lok","doi":"10.1109/PIMRC.2009.5449791","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5449791","url":null,"abstract":"We investigate the power allocation problem in interfering wireless networks. In the network, there are multiple sources with each transmitting to multiple destinations. By proposing a game, we are able to allocate power for each destination in a distributed way. Due to the possibility that the feasible set can be empty, our game can terminate the power allocation process upon detecting any infeasibility. We show that our game allocates power in a way such that the total transmit power is minimized. In general, the game works for interfering networks with arbitrary interference cancellation for the transmissions from the same source. As examples, we consider two schemes, namely interference transmission and cooperative broadcasting interference transmission. For converging cases, the schemes require within 60 iterations for convergence for over 90% of realizations. For cases without feasible solutions, the schemes require within 6 iterations for detecting the infeasibility for over 90% of realizations.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133978217","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}
{"title":"Weighted phase averager for frequency estimation of a noisy single sinusoid: Application of the observation phase noise model","authors":"Hua Fu, P. Kam","doi":"10.1109/PIMRC.2009.5450336","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5450336","url":null,"abstract":"The exact statistical models for the observation phase noise (OPN) and their approximations in time-domain, phase-based estimation of the frequency and phase of a noisy single sinusoid are summarized, and the underlying physical interconnections are highlighted. The application of the various OPN models to the design of the weighted phase averager (WPA) estimator is developed. Simulation results show that using the time-varying OPN variance information which can intelligently indentify those phase samples with large errors, the performance of the WPA estimators can be improved, especially for low SNR.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131770488","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}
{"title":"Subcarrier SNR ML estimators and Cramér-Rao bounds in multicarrier transmission","authors":"Jean-Guy Descure, F. Bellili, S. Affes","doi":"10.1109/PIMRC.2009.5449988","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5449988","url":null,"abstract":"In this paper, considering a multicarrier transmissions system, we propose two techniques of maximum-likelihood (ML) subcarrier signal-to-noise ratio (SNR) estimation, in both data-aided (DA) and non-data-aided (NDA) schemes, and derive the corresponding Crame¿r-Rao lower bounds (CRLBs). The channel gains and phases are assumed to be constant over the observation window and the received signal is assumed to be corrupted by additive white Gaussian noise (AWGN). The proposed SNR estimators both exploit the mutual information between the different subcarriers and reach the corresponding CRLBs, as shown by Monte-Carlo simulations.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"8 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131110048","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}
M. J. Rahman, Xianbin Wang, Hsiao-Chun Wu, S. Park, H. Kim
{"title":"An improved PCP signaling detector with reduced implementation complexity","authors":"M. J. Rahman, Xianbin Wang, Hsiao-Chun Wu, S. Park, H. Kim","doi":"10.1109/PIMRC.2009.5450064","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5450064","url":null,"abstract":"An adaptive Orthogonal Frequency Division Multiplexing (OFDM) system, having precoded cyclic prefix (PCP) was proposed earlier as a way to carry the control signaling parameters to provide much needed flexible transmission techniques in cognitive radio (CR) communications [1]. The ultimate goal of the PCP-OFDM system is to achieve concurrent transmission of CR control signaling parameters with data information. Therefore, hardware and computational efficient demodulation of PCP is of huge importance to recover the signaling parameters and for the design of fair spectrum sharing mechanism in cognitive radio scenario. But due to the hardware and computational complexity of the conventional optimal matched filter [2], recently a demodulator was proposed in paper [3] which has reduced complexity than the conventional approach. However, the complexity is still high which is often very difficult to implement and also not cost-effective. In this paper, we propose a low complexity demodulator for the efficient demodulation of the signaling information carried by the PCPs. Design of this demodulator is presented and performance is evaluated through the simulations in different channel scenarios. Along with a peak combining technique, impact of the multipath impairment can be mitigated to a reasonable extent. More importantly, the hardware and computational complexity is reduced substantially compared with the other techniques proposed earlier. It is also found from the numerical simulation results that this demodulation scheme provides the same performance as the conventional optimal matched filter, with significantly reduced hardware and computational complexity, therefore reducing the overall complexity and cost of the PCP-OFDM receiver.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133622292","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}
{"title":"MAC framework for Intermittently Connected Cognitive Radio networks","authors":"T. Wysocki, A. Jamalipour","doi":"10.1109/PIMRC.2009.5449739","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5449739","url":null,"abstract":"This paper presents a customizable framework for employing Cognitive Radio in Intermittently Connected Wireless Networks, which aims to maximize transmission opportunities that arise when fully connected network partitions are formed. Various layer 3 routing and information dissemination protocols would benefit from increased opportunity utility. We propose to use Cognitive Radio to permit multiple flows to occur in close proximity while minimizing spectrum wastage. We provide an example implementation of the proposed MAC framework which could increase the MAC throughput of networks exhibiting intermittent connectivity and network partition.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133440424","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}
Keke Liu, Zesong Fei, Jingming Kuang, Xiangming Li
{"title":"A novel algorithm for removing cycles in quasi-cyclic LDPC codes","authors":"Keke Liu, Zesong Fei, Jingming Kuang, Xiangming Li","doi":"10.1109/PIMRC.2009.5450003","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5450003","url":null,"abstract":"In this paper, an algorithm for removing cycles in quasi-cyclic(QC) LDPC codes is presented. This algorithm can ensure that the code after cycle removal process preserves the quasi-cyclic structure and significantly improves the flexibility in parameter selection (such as the length of the code) of algebraic constructions of QC-LDPC codes. Besides, it has far lower computational complexity than the existing cycle removal algorithm. Experimental results show that this algorithm is very effective in improving the performance of the QC-LDPC codes and can construct code which has better performance than the corresponding binary LDPC code based on IEEE 802.16e standard.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"423 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133141288","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}
{"title":"QRD-based antenna selection for maximum-likelihood MIMO detection","authors":"Chun-Tao Lin, Wen-Rong Wu","doi":"10.1109/PIMRC.2009.5449775","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5449775","url":null,"abstract":"Antenna selection is a simple but effective method to exploit the transmit diversity in multiple-input multiple-output (MIMO) wireless communications. For maximum-likelihood (ML) detectors, the criterion for the selection is to maximize the free distance of the MIMO system. Since the optimum selection is difficult to conduct, a lower bound of the free distance is typically used as the selection criterion instead. The singular-value-decomposition (SVD) based selection criterion is well known in the literature. In this paper, we propose a QR decomposition (QRD) based selection criterion for antenna selection with the ML detector. Using some matrix properties, we theoretically prove that the lower bound achieved with the QRD-based criterion is tighter than that with the SVD-based criterion. We also propose another QRD-based criterion that can further tighten the lower bound. The proposed algorithms can be directly applied to the receive, and joint transmit/receive antenna selection schemes. Simulations show that the performance of the proposed selection criteria can significantly outperform the SVD-based selection criterion.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131438627","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}
Yinglei Teng, Yong Zhang, Mei Song, Yuewu Dong, Li Wang
{"title":"Genetic algorithm based adaptive resource allocation in OFDMA system for heterogeneous traffic","authors":"Yinglei Teng, Yong Zhang, Mei Song, Yuewu Dong, Li Wang","doi":"10.1109/PIMRC.2009.5450014","DOIUrl":"https://doi.org/10.1109/PIMRC.2009.5450014","url":null,"abstract":"An adaptive resource allocation scheme for QoS oriented OFDMA system, which schedules two different utility functions for the Real-time/Non Real-time traffic simultaneously, is proposed in this paper. Instead of partial consideration of uniform kinds of QoS, we introduce an updating ratio factor to schedule users of heterogeneous traffic. Due to the complex optimization objective, the general convex optimal methods are no longer feasible. We are motivated to study a heuristic natural genetic approach to solve this problem. Due to the weak convergence of Genetic Algorithm (GA), we improve it by a well-selected initial population. Numerical results are presented to illustrate that our scheme not only tackles the diverse QoS requirement but also alleviates the unfairness between real-time and non-real-time services under various traffic loads.","PeriodicalId":110448,"journal":{"name":"2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131314119","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}