{"title":"User Resource Structure Design with Enhanced Diversity for OFDMA in Time-Varying Channels","authors":"H. Minn, Chia-Chin Chong","doi":"10.1109/WCNC.2009.4918014","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4918014","url":null,"abstract":"It is a significant challenge to support high data rate services at high mobile speeds. In this paper, an efficient diversity-exploiting user resource structure, namely evolving-type resource structure, for fast time-varying frequency-selective fading channel environments is designed. This newly proposed resource structure enjoys the advantages of both band-type and interleaved-type structures and avoids their disadvantages by exploiting both the multiuser diversity and the frequency diversity under fast time-varying channels. Simulation results corroborate the performance improvement of the new resource structure over the existing ones under various mobility scenarios.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126738692","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 TH-UWB Receiver with Near-MUD Performance for Multiple Access Interference Environments","authors":"Iraj Hosseini, N. Beaulieu","doi":"10.1109/WCNC.2009.4917549","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917549","url":null,"abstract":"The multiple access interference (MAI) in a time-hopping (TH) ultra-wideband (UWB) system is known to be non-Gaussian even when the system has a moderately large number of active users. Therefore, the conventional matched filter (CMF) receiver, the optimal structure for Gaussian noise which maximizes the signal-to-noise ratio (SNR) and minimizes the probability of detection error in the absence of non-Gaussian interference, is not necessarily optimal. We express and prove a stronger claim that even the outputs of the matched filters in the conventional UWB receiver can not provide a sufficient decision statistic for detecting the information bits transmitted by the desired user. Further, a novel TH-UWB receiver is introduced which uses a similar methodology to the optimal multiuser detection (MUD) algorithm for detecting the information bits. However, the complexity of this new receiver is much less than that of the optimal MUD algorithm. It employs only one matched filter instead of a bank of matched filters resulting in a simple and low-cost TH-UWB receiver. Simulation results show that the new receiver outperforms previous single-user TH-UWB receivers and achieves essentially the performance of the CMF receiver operating in a single-user system.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126750464","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 Joint MLSD Receiver for Meteor Burst Communication","authors":"Zan Li, Jiangbo Si, Feng Lan, Xiaojun Chen","doi":"10.1109/WCNC.2009.4917509","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917509","url":null,"abstract":"According to the characteristics of meteor burst channels, variable rate data transmission is often employed to improve the average system throughput, and the time-varying meteor channel in the presence of multi-path rays brings difficulties in both data detection and channel estimation at the receiver. As we know, per-survivor processing (PSP) based on the joint data and channel estimation of maximum likelihood sequence detection (MLSD) is often considered to obtain the optimal detection performance for time-varying channels. However, the great computational complexity of PSP is the major problem in practice. In this paper we propose an adaptive state reduction of PSP (ASRP) algorithm with few states in the trellis diagram for exponential decay of meteor channels. Based on the estimation of the meteor channel parameters, the adaptive threshold is derived to select the states close to the right one in the trellis to reduce the complexity of PSP. Theoretical analysis and computer simulations results show that the ASRP we proposed provides suboptimal performance and makes good tradeoff between the performance and the computational complexity, so that the reliable data transmission can be realized for MBC systems with adaptive modulation and coding (AMC).","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121320663","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 Distributed Network Selection Scheme in Next Generation Heterogeneous Wireless Networks","authors":"Pengbo Si, F. Yu, Hong Ji, Victor C. M. Leung","doi":"10.1109/WCNC.2009.4917499","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917499","url":null,"abstract":"The network selection problem in next generation heterogeneous wireless networks is one of the key issues to integrate a wide range of radio access technologies. In most previous work, the network selection problem is modeled as a centralized system, without considering the distributed nature of heterogeneous wireless networks. In this paper, we propose a distributed network selection scheme in heterogeneous wireless networks. The the heterogeneous wireless networks are formulated as a restless bandit system, which has an \"indexability\" property that dramatically reduces the complexity. Extensive simulation results are presented to illustrate the performance improvement of the proposed scheme.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126273463","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}
B. Fan, Wenbo Wang, Yicheng Lin, Lin Huang, K. Zheng
{"title":"Spatial Multi-User Pairing for Uplink Virtual-MIMO Systems with Linear Receiver","authors":"B. Fan, Wenbo Wang, Yicheng Lin, Lin Huang, K. Zheng","doi":"10.1109/WCNC.2009.4917973","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917973","url":null,"abstract":"This paper investigates the spatial resource allocation algorithms for the uplink Virtual-MIMO (Multiple Input and Multiple Output) systems, where K client users (each with one or multiple antennas) are served by one multiple-antenna BS (Base Station). To fully exploit the spatial multi-user diversity gain, the finding of the optimal spatial co-channel users is discussed, which is formulated as a mixed binary integer programming problem. Based on the property of hermitian matrix, simulated annealing is used to recursively find the suboptimal spatial co-channel user group. By simulation results, our proposed strategy has almost the same system throughput performance as the optimal greedy algorithm, and can maintain lower computation complexity.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126324942","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":"Conversion of the Spatio-Temporal Correlation from Uplink to Downlink in FDD Systems","authors":"M. Jordan, Xitao Gong, G. Ascheid","doi":"10.1109/WCNC.2009.4917640","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917640","url":null,"abstract":"In FDD systems, uplink spatio-temporal correlation knowledge can be obtained via uplink measurements and time-averaging. Many algorithms however require the knowledge of the downlink correlation, such as base-station transmit beam-forming in the case of spatial correlation and user SNR prediction algorithms in the case of temporal correlation. This paper presents two possible algorithms for the conversion of the uplink spatio-temporal correlation to its downlink counterpart and compares their performance in terms of the link-level conversion error.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122237256","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":"Performance Comparison of Feasible MMSE-PIC Algorithms with Channel Estimation for HSUPA","authors":"Ilkka Moilanen, Paavo Hahtola","doi":"10.1109/WCNC.2009.4917893","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917893","url":null,"abstract":"In this paper, we study the speech user performance of selected parallel interference cancellation (PIC) algorithms in a single-cell high speed uplink packet access (HSUPA) system. To combat intersymbol interference (ISI), single-user chip-level minimum mean-squared error (MMSE) equalizer is used to detect the data users. PIC is applied to suppress the interference from data users to speech users, and RAKE to detect the speech users. As an input to the PIC stage, we may use the hard or soft symbol decisions (HD, SD) from the data users' demodulator or decoder outputs. The latter requires re-encoding of the decoded symbols. This adds to complexity, but increases also the reliability of the interference estimates. Results and analysis are provided for both ideal and MMSE channel estimation (CE). We show that the combination of PIC and RAKE outperforms the simple MMSE equalization in all studied cases. Using re-encoded soft symbol decisions for interference estimate calculation always leads to the best performance. However, in some scenarios the performance loss due to using the soft symbol decisions from the demodulator output is almost negligible.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125718572","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":"Resource Allocation Algorithms with Reduced Complexity in MIMO Multi-Hop Fading Channels","authors":"Feng Li, H. Jafarkhani","doi":"10.1109/WCNC.2009.4917945","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917945","url":null,"abstract":"MIMO multi-hop channel plays an important role in wireless ad hoc networks. In this paper, we investigate the resource allocation optimization problem in order to achieve throughput maximization with given resource constraints. We propose algorithms with low complexity to achieve maximum capacity. The main idea is to determine the rank of the optimal transmit covariance matrix and the optimal power allocation of each node separately using our low-complexity algorithm. Further, we reduce the complexity of our algorithm by adding another pre-processing algorithm. Using our algorithms, we find that while dynamical allocation of time and power could increase channel capacity, equal time and power allocation among different nodes may not cause much capacity loss.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126077189","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":"Precoding of (Non) Orthogonal Space-Time Block Codes over Arbitrarily Correlated Rayleigh Channel","authors":"M. Bhatnagar, A. Hjørungnes","doi":"10.1109/WCNC.2009.4917917","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917917","url":null,"abstract":"We consider the performance of orthogonal and non-orthogonal space-time block codes (STBCs) over arbitrarily correlated Rayleigh fading multiple-input multiple-output (MIMO) channels. A pairwise error probability (PEP) bound of arbitrary STBC is derived. Based on this PEP bound, we design a precoder to improve the performance of the orthogonal and non-orthogonal STBC over arbitrarily correlated channels.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115622616","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":"Cooperative Network Localization Via Node Velocity Estimation","authors":"Liang Dong","doi":"10.1109/WCNC.2009.4917646","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917646","url":null,"abstract":"This paper addresses cooperative localization for mobile ad-hoc networks that benefits from the node velocity estimation. Given pair-wise range measurement and relative speed measurement between communicating nodes, the relative node positions are estimated using an extended Kalman filter. The state-space equation of the Kalman filter incorporates the node positions with their velocities. The measurement equation takes into account the log-normal distribution of the received signal power and the Gaussian distribution of the relative speed measurement error. Distributed algorithm is derived for practical use. The simulation results show the performance of the network localization with the assistance of node velocity estimation. The velocities are, however, not tracked using the Kalman filter; Separated method is proposed to estimate the node velocities.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115653037","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}