{"title":"A Convex Optimization Approach to Blind Channel Shortening in Multicarrier Modulations","authors":"Huy-Dung Han, Z. Ding","doi":"10.1109/GLOCOM.2009.5425771","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425771","url":null,"abstract":"We study the problem of channel shortening in multicarrier modulation systems without training. We reformulate two existing methods, the sum-squared and the sum-absolute autocorrelation minimization algorithms (SAM and SAAM), into semidefinite programming to overcome their shortcoming of local convergence. We present the original SAM and SAAM cost functions into as a batch optimization problem before relaxing the original problem into globally convergent semidefinite programming algorithms. Our batch processor is superior to the original stochastic gradient algorithms in terms of achievable bit rate and signal to interference and noise ratio (SINR).","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"617 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116077376","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}
G. Min, Yulei Wu, M. Ould-Khaoua, H. Yin, Keqiu Li
{"title":"Performance Modelling and Analysis of Interconnection Networks with Spatio-Temporal Bursty Traffic","authors":"G. Min, Yulei Wu, M. Ould-Khaoua, H. Yin, Keqiu Li","doi":"10.1109/GLOCOM.2009.5425426","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425426","url":null,"abstract":"The k-ary n-cube which has an n-dimensional grid structure with k nodes in each dimension has been a popular topology for interconnection networks. Analytical models for k- ary n-cubes have been widely reported under the assumptions that the message destinations are uniformly distributed over all network nodes and the message arrivals follow a nonbursty Poisson process. Recent studies have convincingly demonstrated that the traffic pattern in interconnection networks reveals the bursty nature in the both spatial domain (i.e., non-uniform distribution of message destinations) and temporal domain (i.e., bursty message arrival process). With the aim of capturing the characteristics of the realistic traffic pattern and obtaining a comprehensive understanding of the performance behaviour of interconnection networks, this paper presents a new analytical model for k-ary n-cubes in the presence of spatio-temporal bursty traffic. The accuracy of the model is validated through extensive simulation experiments of an actual system.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"10 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116217591","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":"SNR Estimation for a Non-Coherent Binary Frequency Shift Keying Receiver","authors":"Syed Ali Hassan, M. A. Ingram","doi":"10.1109/GLOCOM.2009.5425572","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425572","url":null,"abstract":"This paper deals with the problem of estimating the average signal-to-noise ratio (SNR) for a communication system employing non-coherent binary frequency shift keying (NCBFSK) over fading channels with white Gaussian noise (AWGN). The maximum likelihood (ML) estimator and one using data statistics have been derived and simulated for various scenarios including data-aided (DA), non-data aided (NDA) and joint estimation using both the data and pilot sequences. We also derive the Cramer-Rao bound (CRB) for the estimators. The results show that for a particular region of interest (e.g. high SNR or low SNR) and depending upon the availability of pilot sequence, a particular SNR estimation scheme is suitable.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116521019","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 Spectrum Sensing with Dynamic Threshold Adaptation","authors":"Dae-Young Seol, H. Lim, G. Im","doi":"10.1109/GLOCOM.2009.5425816","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425816","url":null,"abstract":"Spectrum sensing is a key enabling technology of cognitive radio. Reliable detection increases access opportunity to temporarily unused bands and prevents harmful interference to the licensed users. Due to the receiver noise, signal attenuation, and multi-path fading effect, however, it is usually not possible to determine the existence of primary signal with absolute certainty. By extracting a global decision from shared local sensing results, cooperative sensing achieves high reliability over fading channels. In this paper, we assume that the traffic statistic of primary system is logged into the radio environment map (REM) and can be accessed by the secondary systems. The threshold of each energy detector is dynamically adapted according to the utility values and a priori information from REM. Then, decision results and corresponding operating points are collected by a fusion center, which makes a global decision with high confidence.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122312849","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":"An Adaptive Approach to Estimation and Compensation of Frequency-Dependent I/Q Imbalances in MIMO-OFDM Systems","authors":"Shichuan Ma, D. Duran, H. Sharif, Yaoqing Yang","doi":"10.1109/GLOCOM.2009.5425466","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425466","url":null,"abstract":"In this paper, a novel adaptive approach based on Alamouti scheme is proposed to estimate and compensate frequency-dependent In-phase/Quadrature-phase (I/Q) imbalances in space-time coded MIMO-OFDM communication systems. The I/Q imbalances may be present at both ends of transmitter (TX) and receiver (RX). Although different methods have been proposed to utilize the Alamouti scheme in order to obtain spatial diversity in a MIMO-OFDM system, the inaccurate channel estimation caused by I/Q imbalances degrades the system performance. A new combining scheme is introduced to overcome this significant drawback by using joint estimation and compensation of the multipath fading channel and I/Q imbalances. The simulation results show that the proposed adaptive method can effectively mitigate the effect of the frequency-dependent TX and RX I/Q imbalances in the MIMO-OFDM systems.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122695799","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":"Optimizing Aggregate Throughput in 802.11 Networks through Balancing Spatial Reuse and Transmission Rate","authors":"Junmei Qu, Z. Zhao, Lianfang Zhang, Y. Shu","doi":"10.1109/GLOCOM.2009.5425931","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425931","url":null,"abstract":"Traditional medium access control (MAC) protocols utilize temporal mechanism to do contention resolution. This paper explores an alternative approach by adapting the space occupied by a transmission to resolve contention. Each successful transmission in a wireless network needs to occupy a certain part of space in which there are no other simultaneous transmissions. The size of the space occupied depends on the transmission rate and it consequently determines the level of spatial reuse. To optimize the aggregate network throughput needs to balance the transmission rate and the level of spatial reuse. This paper firstly derives the optimal transmission rate by analyzing the relationship between the transmission rate and the occupied space size, then a distributed algorithm is proposed to achieve the optimal spatial allocation approximately through tuning the carrier sense threshold and the transmission rate. Simulation results show that, the distributed algorithm works well in balancing the transmission rate and the level of spatial reuse, and the aggregate network throughput can approximate the theoretical one and is higher than that can be gained by other similar algorithms.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122707373","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":"Achieving Full Diversity by Selection in Arbitrary Multi-Hop Amplify-and-Forward Relay Networks","authors":"W. Shi, Sumit Roy","doi":"10.1109/GLOCOM.2009.5425579","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425579","url":null,"abstract":"Although several cooperative diversity strategies have been proposed for simple 2-hop multiple-relay networks, practical and efficient strategies that guarantee maximum diversity order for arbitrary, multi-hop amplify-and-forward relay networks are not yet available. In this paper, the maximum achievable diversity order for a given connectivity is shown to be determined by the number of links on the minimum cut set, and achieved by a selection strategy which maximizes end-to-end SNR. The optimal selection requires the channel information of all the links and serves as a performance bound. A sub-optimal selection method is then proposed to achieve full diversity in a distributed and low-complexity manner. The performance loss of the sub-optimal selection is shown to be small by both theoretic analysis and simulations.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122490398","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":"Dynamic Routing and Scheduling for Variable Bandwidth Circuit Switching","authors":"A. Patel, J. Jue","doi":"10.1109/GLOCOM.2009.5425446","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425446","url":null,"abstract":"Variable bandwidth circuit switching is an approach in which a variable amount of bandwidth is reserved over the duration of circuit, in contrast to the fixed amount of bandwidth reserved in traditional circuit switching and advance reservation. In this paper, we focus on the routing and scheduling problem in variable bandwidth circuit switching. We develop three heuristics and compare the performances of the proposed heuristics to an optimal algorithm, which minimizes the net file transfer time. While the optimal algorithm minimizes the net file transfer time for a single given request, it may end up allocating excessive resources in the network, leading to higher blocking and end-to-end delay for subsequent requests. The results demonstrate that in a dynamic traffic scenario, the proposed heuristics outperform the optimal algorithm in terms of request blocking, end-to-end delay, and throughput with significantly lower time complexity.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122762333","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":"Achievable Rate of Gaussian Cognitive Z-Interference Channel with Partial Side Information","authors":"Yong Peng, D. Rajan","doi":"10.1109/GLOCOM.2009.5426052","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426052","url":null,"abstract":"In this paper, we compute an achievable rate of a Gaussian Z-interference channel as shown in Fig. 1, when transmit node C has causal, imperfect cognitive knowledge of the signal sent by transmit node A. This achievable rate is derived using a two-phase transmission scheme in which node C uses a combination of a linear minimum mean square error (LMMSE) estimator and dirty paper code and node D employs a combination of LMMSE estimator and partial interference canceler. Numerical results indicate that the achievable rate of the Gaussian Z-interference channel increases significantly with cognition under certain channel conditions. We also derive an upper bound on the capacity of this channel with cognition and quantify the channel conditions under which the proposed achievable scheme equals the upper bound.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114182034","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":"Scalable Video Multicast on Broadcast Channels","authors":"Jun Xu, Raju Hormis, Xiaodong Wang","doi":"10.1109/GLOCOM.2009.5426084","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426084","url":null,"abstract":"We propose a framework for multicasting layers of scalable video over a broadcast channel to multiple users simultaneously. The framework ensures that all users receive the content, but at differentiated levels of quality depending on channel conditions. A coding scheme well-suited to this purpose is Scalable Video Coding (SVC). In particular, we employ medium-grain scalability (MGS), which allows us to generate quality-scalable layers from a single video sequence. For transport, we assume that both the transmitter and end-users are equipped with multiple-input multiple-output (MIMO) transceivers. The transmitter employs the zero-forcing (ZF) precoding technique, which yields good performance with low complexity. With these assumptions, the scheme proposed here computes a block-diagonal ZF-precoder at fixed intervals, subject to a power constraint at the transmitter. Crucially, the algorithm assigns quality-scalable layers of video to the end-users jointly with precoder computation. The framework also ensures that delay and buffer constraints are met, which is necessary for real-time video. In terms of solution approach, the problem turns out to be a difficult mixed-integer nonlinear optimization problem.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114458707","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}