<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Communications Letters, IEEE - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 4234 </description>
		<year>2013</year>
		<month>May      </month>
		<day>16</day>
		<item>
			<title><![CDATA[Table of contents]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511516]]></link>
			<description><![CDATA[Presents the table of contents for this issue of this periodical.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511516]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>c1</startPage>
			<endPage>c4</endPage>
			<fileSize>105</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Staff list]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511517]]></link>
			<description><![CDATA[Provides a listing of current staff, committee members and society officers.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511517]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>c2</startPage>
			<endPage>c2</endPage>
			<fileSize>59</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Extension of Quickest Spectrum Sensing to Multiple Antennas and Rayleigh Channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511518]]></link>
			<description><![CDATA[In this letter, we study quickest spectrum sensing for cognitive radios with multiple receive antennas in Gaussian and Rayleigh channels. We derive the probability density function for the fading case and analytically compute the upper bound and asymptotic worst-case detection delay for both of the cases. The extension into multiple antennas allows us to gain insights into the reduction in detection delay that multiple antennas can provide. Although sensing in a Rayleigh channel is more challenging, good sensing performance is still demonstrated.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511518]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>625</startPage>
			<endPage>628</endPage>
			<fileSize>158</fileSize>
			<authors><![CDATA[Hanafi, Effariza;Martin, Philippa A.;Smith, Peter J.;Coulson, Alan J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Bloom-Filter Aided Two-Layered Structured Overlay for Highly-Dynamic Wireless Distributed Storage]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6459500]]></link>
			<description><![CDATA[In this letter, we propose a novel two-layered structured overlay, called a distributed Bloom filter table (DBFT), which is capable of substantially reducing overhead imposed by highly-dynamic peer-to-peer (P2P) distributed storage systems. More specifically, in our DBFT scheme, each node's ID remains unchanged, when the associated cluster changes due to the physical movement of the node. This provides us with an exclusive benefit of maintaining the rule of structured overlay without imposing any additional overhead to reconfigure index between saved information and its stored node, which cannot be achieved by the previous P2P techniques designed for mobile ad hoc networks. Moreover, another merit of the proposed scheme is that stored packets per node become more equally distributed than {in} the conventional schemes, because each node maintains to have its own {addressing- and content-}data when it moves within a storage area.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6459500]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>629</startPage>
			<endPage>632</endPage>
			<fileSize>246</fileSize>
			<authors><![CDATA[Sasaki, Kengo;Sugiura, Shinya;Makido, Satoshi;Suzuki, Noriyoshi;]]></authors>
		</item>
		<item>
			<title><![CDATA[Adaptive Linear Minimum BER Reduced-Rank Interference Suppression Algorithms Based on Joint and Iterative Optimization of Filters]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464497]]></link>
			<description><![CDATA[In this letter, we propose a novel adaptive reduced-rank strategy based on joint iterative optimization (JIO) of filters according to the minimization of the bit error rate (BER) cost function. The proposed optimization technique adjusts the weights of a subspace projection matrix and a reduced-rank filter jointly. We develop stochastic gradient (SG) algorithms for their adaptive implementation and introduce a novel automatic rank selection method based on the BER criterion. Simulation results for direct-sequence code-division-multiple-access (DS-CDMA) systems show that the proposed adaptive algorithms significantly outperform the existing schemes.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464497]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>633</startPage>
			<endPage>636</endPage>
			<fileSize>211</fileSize>
			<authors><![CDATA[Cai, Yunlong;de Lamare, Rodrigo C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Energy-Efficient Optimization for Physical Layer Security in Multi-Antenna Downlink Networks with QoS Guarantee]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476945]]></link>
			<description><![CDATA[In this letter, we consider a multi-antenna downlink network where a secure user (SU) coexists with a passive eavesdropper. There are two design requirements for such a network. First, the information should be transferred in a secret and efficient manner. Second, the quality of service (QoS), i.e. delay sensitivity, should be take into consideration to satisfy the demands of real-time wireless services. In order to fulfill the two requirements, we combine the physical layer security technique based on switched beam beamforming with an energy-efficient power allocation. The problem is formulated as the maximization of the secrecy energy efficiency subject to delay and power constraints. By solving the optimization problem, we derive an energy-efficient power allocation scheme. Numerical results validate the effectiveness of the proposed scheme.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476945]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>637</startPage>
			<endPage>640</endPage>
			<fileSize>130</fileSize>
			<authors><![CDATA[Chen, Xiaoming;Lei, Lei;]]></authors>
		</item>
		<item>
			<title><![CDATA[On Higher Order Modulations for OFDM in Frequency-Selective Fading Channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464493]]></link>
			<description><![CDATA[It has been shown that adaptive modulation in OFDM significantly improves performance with perfect channel state information (CSI) at the transmitter. However, it is often difficult to obtain perfect CSI at the transmitter due to feedback overhead and estimation errors. In this letter, we study the optimal constellation size and coding rate when CSI is not available at the transmitter in frequency-selective fading channels. Our results indicate that increasing the constellation size uniformly for all subcarriers does not decrease the outage capacity. Moreover, we show that, rather than adapting the size of the constellation based on the receiver SNR and estimated root-mean-square delay spread, one should adapt the rate of the error control code.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464493]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>641</startPage>
			<endPage>644</endPage>
			<fileSize>155</fileSize>
			<authors><![CDATA[Lim, Gubong;Wilson, Sarah Kate;Cimini Jr, Leonard J.;Taylor, Desmond P.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Diffusion-Based Nanonetworking: A New Modulation Technique and Performance Analysis]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6471723]]></link>
			<description><![CDATA[In this letter, a new molecular modulation scheme for nanonetworks is proposed. To evaluate the scheme, a system model based on the Poisson distribution is introduced. The error probability of the proposed scheme as well as that of two previously known schemes, the concentration and molecular shift keying modulations, are derived for the Poisson model by taking into account the error propagation effect of previously decoded symbols. The proposed scheme is shown to outperform the previously introduced schemes. This is due to the fact that the decoding of the current symbol in the proposed scheme does not encounter propagation of error, as the decoding of the current symbol does not depend on the previously transmitted and decoded symbols. Finally, fundamental limits on the probability of error of a practical set of encoders and decoders are derived using information theoretical tools.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6471723]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>645</startPage>
			<endPage>648</endPage>
			<fileSize>150</fileSize>
			<authors><![CDATA[Arjmandi, Hamidreza;Gohari, Amin;Kenari, Masoumeh Nasiri;Bateni, Farshid;]]></authors>
		</item>
		<item>
			<title><![CDATA[Power-Aware Link Quality Estimation for Vehicular Communication Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484078]]></link>
			<description><![CDATA[The use of link quality estimates has been shown to improve multi-hop packet forwarding in wireless ad-hoc networks, and in particular in Vehicular Ad-Hoc Networks (VANETs). The link quality estimated at a receiver strongly depends on the transmitters' communication settings. As a result, adaptive transmission schemes such as power control can complicate the identification of reliable forwarders. In this context, this letter proposes and evaluates PoLiQ (Power-Aware Link Quality estimation), a novel technique designed to estimate the link quality in vehicular networks, taking into account the transmission parameters of each vehicle. This study shows that PoLiQ helps selecting reliable forwarders, and improves the performance of multi-hop vehicular communications.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484078]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>649</startPage>
			<endPage>652</endPage>
			<fileSize>129</fileSize>
			<authors><![CDATA[Bauza, Ramon;Gozalvez, Javier;Sepulcre, Miguel;]]></authors>
		</item>
		<item>
			<title><![CDATA[Detection for an AF Cooperative Diversity Network in the Presence of Interference]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484070]]></link>
			<description><![CDATA[We consider an amplify-and-forward (AF) cooperative diversity network consisting of one source, multiple relays, one destination, and multiple interferers. It is assumed that only partial channel information of the interferers is known at the system. For this scenario, we derive an optimum/suboptimum detection rule. Furthermore, we propose an optimum relay power allocation scheme to maximize the instantaneous signal-to-interference-plus-noise-ratio (SINR). An exact and closed-form instantaneous BER expression is also presented. Numerical results demonstrate that the proposed scheme considerably outperforms the existing schemes.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484070]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>653</startPage>
			<endPage>656</endPage>
			<fileSize>180</fileSize>
			<authors><![CDATA[Ramezani-Kebrya, Ali;Kim, Il-Min;Chan, Francois;Inkol, Robert;Song, Hyoung-Kyu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Ternary Hypothesis Testing Scheme for Rapidly Opportunistic Spectrum Access]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464496]]></link>
			<description><![CDATA[This letter presents a partially observable Markov decision process framework for the opportunistic spectrum access model, where a ternary hypothesis testing scheme is proposed to perform sensing with the goodness of fit testing. Except for idle and busy states, the proposed ternary hypothesis testing also considers the transition state, which reflects the real state of a licensed channel more precisely. Simulation results indicate that the proposed ternary hypothesis testing scheme achieves better performances in channel utilization and collision rate compared with those of the conventional binary hypothesis testing scheme, especially for the rapid variations of the primary user activities.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464496]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>657</startPage>
			<endPage>660</endPage>
			<fileSize>153</fileSize>
			<authors><![CDATA[Feng, Qi;Li, Wenfeng;Ye, Zhihui;Shen, Keqin;Zhang, Naitong;]]></authors>
		</item>
		<item>
			<title><![CDATA[PHY-MAC Cross-Layer Approach to Energy-Efficiency and Packet-Loss Trade-off in Low-Power, Low-Rate Wireless Communications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511519]]></link>
			<description><![CDATA[In this paper we analyze energy-efficiency and packet-loss trade-off at physical and medium access control layers. The trade-off can be tuned by proper setting of packet length, transmission power and maximal number of allowed transmissions per packet. Our approach is multi-objective without decision making preferences. We show how energy-efficiency vs. packet-loss Pareto Frontier can be determined. We present numerical results for the case when CC1000 transceiver is used. Contrary to intuition, we find that Pareto Frontier is not a continual locus, meaning that energy-efficiency and packet-loss can not be traded continually in Pareto Optimality sense.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511519]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>661</startPage>
			<endPage>664</endPage>
			<fileSize>137</fileSize>
			<authors><![CDATA[Zogovic, Nikola;Dimic, Goran;Bajic, Dragana;]]></authors>
		</item>
		<item>
			<title><![CDATA[On the Performance Analysis of MISO Broadcast Channels with Spatial Heterogeneity]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476940]]></link>
			<description><![CDATA[We consider the sum-rate performance of multiple-input/single-output broadcast channels in which each user has a different average signal-to-noise ratio (SNR) corresponding to their distance from the base station. Although there are already studies investigating the sum-rate growth under this channel assumption, their proofs are limited to the cases where the pathloss exponent is equal to one or two. However, the pathloss exponent is greater than two in realistic wireless environments. Therefore, by deriving the cumulative distribution function of the channel gain, which differs from the previous results, we can provide an asymptotic sum-rate and a general proof for the sum-rate growth regardless of the value of the pathloss exponent.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476940]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>665</startPage>
			<endPage>668</endPage>
			<fileSize>187</fileSize>
			<authors><![CDATA[Min, Moonsik;Kim, Hyun-Myung;Im, Gi-Hong;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimal Power Allocation for Wideband Cognitive Radio Networks Employing SC-FDMA]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511520]]></link>
			<description><![CDATA[In this paper, we investigate the optimal power allocation (OPA) strategy of secondary user (SU) transmitters in wideband cognitive radio networks employing single-carrier frequency-division multiple access (SC-FDMA). To protect the link of the primary user, we study two types of constraints on the SUs: Individual per-tone interference power constraints (IPCs) for each SU and a joint aggregate IPC across all frequency tones and users. Using tools from convex optimization, we derive the sum rate optimal OPA across frequency tones for the SU transmitters for both types of constraints. Simulation results show that the proposed OPA schemes can considerably improve the achievable sum rate of SC-FDMA based SU systems compared to equal power allocation and conventional power allocation schemes.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511520]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>669</startPage>
			<endPage>672</endPage>
			<fileSize>170</fileSize>
			<authors><![CDATA[Wu, Peiran;Schober, Robert;Bhargava, Vijay K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Reducing Pattern Noise in Blind Energy Detection of Nonnegative PAM Symbols]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511521]]></link>
			<description><![CDATA[In this paper, we consider blind initialization of decision-directed (BDD) parameter estimation for energy detection of nonnegative pulse-amplitude-modulated (PAM) symbols. Short pulses and guard intervals are used to mitigate intersymbol interference. In the previous work, no analytical model has been given to predict how the BDD approach converges, hindering the usage of the approach. We present analytical mean square error expressions to infer a sufficient observation interval that makes the effect of the pattern noise negligible in comparison with the noise component originated from the thermal noise of the receiver. Using a proper observation interval, the symbol error rate of the BDD method is demonstrated to be comparable with that of a corresponding data-aided estimator which, unlike the BDD approach, needs a periodical training signal.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511521]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>673</startPage>
			<endPage>676</endPage>
			<fileSize>150</fileSize>
			<authors><![CDATA[Anttonen, Antti;Kotelba, Adrian;Mammela, Aarne;]]></authors>
		</item>
		<item>
			<title><![CDATA[A QoE-Aware Scheduler for HTTP Progressive Video in OFDMA Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511522]]></link>
			<description><![CDATA[HTTP progressive video downloading is becoming increasingly relevant in wireless and mobile networks. Therefore, improving the quality of experience (QoE) for this service is important for customer satisfaction. In this letter we propose a QoE-aware scheduling solution for the HTTP progressive video downloading in OFDMA systems. Whereas most scheduling strategies consider QoS metrics such as delay, jitter or throughput, our proposal takes into account a metric that directly affects the end-user??s experience. In particular, we propose to use an estimation of the amount of video data stored in the player buffer as the main criterion for resource assignment. The ultimate goal of using this criterion is the avoidance of playback interruptions. In particular, we have evaluated this scheduler in an LTE network simulator for the YouTube service, which is the most visited HTTP video streaming site. Our results show a significant improvement compared to the Multicarrier Proportional Fair scheduler, e.g. the number of videos with pauses decrease from 16.1% to 0% for 12 Mbps of cell offered load.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511522]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>677</startPage>
			<endPage>680</endPage>
			<fileSize>1237</fileSize>
			<authors><![CDATA[Navarro-Ortiz, Jorge;Ameigeiras, Pablo;Lopez-Soler, Juan M.;Lorca-Hernando, Javier;Perez-Tarrero, Quiliano;Garcia-Perez, Raquel;]]></authors>
		</item>
		<item>
			<title><![CDATA[Precoder Design for K-User Interference Channels with Finite Alphabet Signals]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464499]]></link>
			<description><![CDATA[We consider a MIMO K-user interference channel with finite alphabet signaling, and design an optimal precoder for maximizing the sum mutual information between all transmitter-receiver pairs. Perfect channel knowledge is assumed to be available at all the transmitters, but, decoding of the interfering signals is not done at any receiver. A gradient descent algorithm is employed for maximizing the sum mutual information. Simulation results for the three user interference channel show that when compared to conventional schemes which maximize the signal-to-interference plus noise ratio or minimize the mean squared error, the proposed design achieves a significantly better bit error rate performance. Along with the proposed precoder, the minimum distance detector which decodes the desired signal (while treating interference as colored Gaussian noise with a known covariance) was utilized at all the receivers, in order to get this enhanced performance.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464499]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>681</startPage>
			<endPage>684</endPage>
			<fileSize>197</fileSize>
			<authors><![CDATA[Ram, B Hari;Li, Wei;Ayyar, Arun;Lilleberg, Jorma;Giridhar, K;]]></authors>
		</item>
		<item>
			<title><![CDATA[Cognitive Radio Networks with Orthogonal Space-Time Block Coding and Multiuser Diversity]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476941]]></link>
			<description><![CDATA[This paper considers a multiuser spectrum sharing (SS) system operating in a Rayleigh fading environment and in which every node is equipped with multiple antennas. The system employs orthogonal space-time block coding at the secondary users. Under such a framework, the average capacity and error performance under a peak interference constraint are first analyzed. For a comparison purpose, an analysis of the transmit antenna selection scheme is also presented. Finally, some selected numerical results are presented to corroborate the proposed analysis.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476941]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>685</startPage>
			<endPage>688</endPage>
			<fileSize>161</fileSize>
			<authors><![CDATA[Yang, Liang;Qaraqe, Khalid;Serpedin, Erchin;Alouini, Mohamed-Slim;Liu, Weiping;]]></authors>
		</item>
		<item>
			<title><![CDATA[Robust Relay Precoding Design for Two Way Relay Systems with Delayed and Limited Feedback]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511523]]></link>
			<description><![CDATA[This letter addresses the robust linear precoding design at the relay node in two way relay systems with independent source-relay and relay-source channels. An antenna configuration in which both the two source nodes S1 and S2 and the relay node R are equipped with multiple antennas, is assumed. Due to delayed and finite-rate feedback, only outdated and quantized channel direction information (CDI) of the downlink channel is available at the transmitter of the relay during the broadcast (BC) phase. To tackle the performance degradation caused by the joint effects of channel quantization error and feedback delay, we propose a robust precoding scheme based on minimizing the expected weighted sum mean squared error (WS-MSE) conditioned on the induced channel uncertainties subject to relay power constraints. We also find that CDI-only feedback is sufficient for calculating the robust precoding matrix. Numerical results validate the robustness of the proposed scheme.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511523]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>689</startPage>
			<endPage>692</endPage>
			<fileSize>222</fileSize>
			<authors><![CDATA[Wang, Ji;Wang, Yifei;Gui, Xin;Zhang, Ping;]]></authors>
		</item>
		<item>
			<title><![CDATA[Radio Map Update Automation for WiFi Positioning Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484074]]></link>
			<description><![CDATA[This paper presents a novel method to reduce the recalibration costs of a radio map by automatically updating the radio map. The appearance frequencies of access points (APs) detected from user feedback data are mainly used for the update. The proposed method appeared superior to previous methods, especially in its ability to update newly installed APs in the radio map. According to the experiment conducted for the radio map of 233 Seoul subway stops, the proposed method was effective for updating APs with weak as well as strong signal strengths.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484074]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>693</startPage>
			<endPage>696</endPage>
			<fileSize>722</fileSize>
			<authors><![CDATA[Lim, Jun-Sung;Jang, Woo-Hyuk;Yoon, Gi-Wan;Han, Dong-Soo;]]></authors>
		</item>
		<item>
			<title><![CDATA[Outage Analysis of N^{th}-Best DF Relay Systems in the Presence of CCI over Rayleigh Fading Channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464501]]></link>
			<description><![CDATA[This letter investigates the outage behavior of a dual-hop N^{th}-best decode-and-forward (DF) relay system in which the relay and the destination undergo independent sources of co-channel interference (CCI). The fading envelopes associated with the desired and interfering users are assumed to follow independent but non-identically distributed (i.n.d.) Rayleigh fading models. Through the analysis, exact and approximate outage probability are derived based on which the diversity order and coding gain are obtained. Our findings suggest that the diversity order linearly increases with the number of relays and decreases with the order of the relay. Furthermore, results reveal that the system is still able to achieve full diversity gain in the presence of finite number of interferers with finite powers. The analytical results are supported and validated by Monte-Carlo simulations.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464501]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>697</startPage>
			<endPage>700</endPage>
			<fileSize>166</fileSize>
			<authors><![CDATA[Salhab, Anas M.;Al-Qahtani, Fawaz;Zummo, Salam A.;Alnuweiri, Hussein;]]></authors>
		</item>
		<item>
			<title><![CDATA[Channel Prediction Using IAA-Based Spectral Estimation in Precoded TDD-MIMO Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476944]]></link>
			<description><![CDATA[This letter proposes a channel prediction scheme for precoded time division duplex multiple-input multiple-output (TDD-MIMO) systems. Based on the sum-of-sinusoidal (SoS) channel model, the proposed scheme first uses iterative adaptive approach (IAA)-based spectral estimation algorithm for sinusoidal components estimation according to the channel state information (CSI) detected in the discontinuous uplink periods. Then the minimum description length (MDL) criterion is used to choose the proper number of sinusoidal components for the channel model. Finally, time extrapolation is performed to the estimated channel model to predict the future downlink CSI that is needed for transmit precoding. The scheme is verified by simulations.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476944]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>701</startPage>
			<endPage>704</endPage>
			<fileSize>200</fileSize>
			<authors><![CDATA[Sun, Dechun;Liu, Zujun;Ma, Shuai;Yi, Kechu;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Jain's Index Perspective on &#x03b1;-Fairness Resource Allocation over Slow Fading Channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511524]]></link>
			<description><![CDATA[In this letter, by focusing on &#x03b1;-fairness resource allocation in single channel TDMA system with slow Rayleigh fading, we study the impacts of &#x03b1; on the system efficiency and Jain's index which is widely used as a fairness measure. Also, we prove that increasing &#x03b1; results in higher efficiency but lower Jain's index and reveal the role of &#x03b1; in controlling the tradeoff between efficiency and fairness. Furthermore, an algorithm is proposed to find the optimal &#x03b1; under a system efficiency constraint or a Jain's index constraint with fast convergence and low complexity.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511524]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>705</startPage>
			<endPage>708</endPage>
			<fileSize>206</fileSize>
			<authors><![CDATA[Guo, Chongtao;Sheng, Min;Zhang, Yan;Wang, Xijun;]]></authors>
		</item>
		<item>
			<title><![CDATA[Pareto Optimal Power Control via Bisection Searching in Wireless Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484076]]></link>
			<description><![CDATA[In this letter, we first prove that the upper boundary of the feasible signal to interference-plus-noise ratio (SINR) region achieved by power control is Pareto optimal under the constraints of minimum SINR requirements and limited power. Thanks to the Pareto optimal nature, we further propose a bisection searching based low-complexity algorithm that achieves arbitrary Pareto optimal power control over the entire feasible SINR region. More importantly, we can easily approach the upper boundary of the feasible SINR region through the proposed algorithm.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484076]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>709</startPage>
			<endPage>712</endPage>
			<fileSize>209</fileSize>
			<authors><![CDATA[Qian, Li Ping;Wu, Yuan;Zhang, Shengli;Chen, Qingzhang;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Worst-Case Robust Beamforming Design for Multi-Antenna AF Relaying]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476947]]></link>
			<description><![CDATA[In this paper, we consider relay precoder optimization for a multi-antenna amplify-and-forward (AF) relaying system using imperfect channel state information (CSI) with either additive or multiplicative deterministic uncertainties. Adopting worst-case robustness, we aim to maximize the worst-case received signal-to-noise ratio (SNR) at the destination subject to the power constraint at the relay. Despite the non-convexity of the design problem, we obtain a closed-form solution and discover that beamforming along the nominal channel direction achieves the best performance with channel uncertainties. Based on the optimal solution, we further analyze the impact of imperfect CSI on the performance of the robust multi-antenna AF relaying system and carry out simulations to verify our analysis.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476947]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>713</startPage>
			<endPage>716</endPage>
			<fileSize>222</fileSize>
			<authors><![CDATA[Shen, Hong;Xu, Wei;Wang, Jiaheng;Zhao, Chunming;]]></authors>
		</item>
		<item>
			<title><![CDATA[Environmental-Adaptive Bias Calibration in Wireless Localization]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511525]]></link>
			<description><![CDATA[This paper presents a simple bias calibration method in wireless localization networks. Based on measured distances between a mobile sensor node and reference beacon sensor nodes fixed at known points, the proposed method estimates the bias error. To compute the bias error accurately, an optimization problem is formulated. Through numerous experiments, the performance of the proposed calibration algorithm is evaluated.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511525]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>717</startPage>
			<endPage>720</endPage>
			<fileSize>899</fileSize>
			<authors><![CDATA[Lee, Byung-Hun;Hur, Hwan;Ahn, Hyo-Sung;]]></authors>
		</item>
		<item>
			<title><![CDATA[Adaptive Carry-Store Forward Scheme in Two-Hop Vehicular Delay Tolerant Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476948]]></link>
			<description><![CDATA[Stationary roadside units (RSUs) deployed along highways are generally considerably distant with each other, which leads to large areas that are not covered by any RSU. When mobile vehicles enter these areas, their communications are in outage. In order to reduce the outage time, an adaptive carry-store forward (ACSF) scheme is proposed in this letter, where a vehicle is selected to relay the communications for a target vehicle in the uncovered areas. To keep the target and the relaying vehicles to have continuous communications in the uncovered areas, the relaying vehicle should carry and store a sufficient amount of data that are destined to the target vehicle in advance, and the moving speed of the target vehicle can be adaptively changed according to the relaying vehicle. The optimum moving speeds of the target vehicle are solved and the best relaying vehicle is selected in order to minimize the communication outage time of the target vehicle. Numerical results demonstrate that the proposed ACSF scheme can greatly reduce the communication outage time.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476948]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>721</startPage>
			<endPage>724</endPage>
			<fileSize>360</fileSize>
			<authors><![CDATA[Wu, Di;Zhu, Gang;Zhao, Dongmei;]]></authors>
		</item>
		<item>
			<title><![CDATA[Increasing the Throughput of Polar Decoders]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464502]]></link>
			<description><![CDATA[The serial nature of successive-cancellation decoding results in low polar decoder throughput. In this letter we present an improved version of the simplified successive-cancellation decoding algorithm that increases decoding throughput without degrading the error-correction performance. We show that the proposed algorithm has up to three times the throughput of the simplified successive-cancellation decoding algorithm and up to twenty-nine times the throughput of a standard successive-cancellation decoder while using the same number of processing elements.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464502]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>725</startPage>
			<endPage>728</endPage>
			<fileSize>117</fileSize>
			<authors><![CDATA[Sarkis, Gabi;Gross, Warren J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Subset Codes for Packet Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476937]]></link>
			<description><![CDATA[In this paper, we present a coding-theoretic framework for message transmission over packet-switched networks. Network is modeled as a channel which can induce packet errors, deletions, insertions, and out of order delivery of packets. The proposed approach can be viewed as an extension of the one introduced by Kotter and Kschischang for networks based on random linear network coding. Namely, while their framework is based on subspace codes and designed for networks in which network nodes perform random linear combining of the packets, ours is based on the so-called subset codes, and is designed for networks employing routing in network nodes.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476937]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>729</startPage>
			<endPage>732</endPage>
			<fileSize>120</fileSize>
			<authors><![CDATA[Kovacevic, Mladen;Vukobratovic, Dejan;]]></authors>
		</item>
		<item>
			<title><![CDATA[On Multiple Users Scheduling Using Superposition Coding over Rayleigh Fading Channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464495]]></link>
			<description><![CDATA[In this letter, numerical results are provided to analyze the gains of multiple users scheduling via superposition coding with successive interference cancellation in comparison with the conventional single user scheduling in Rayleigh block-fading broadcast channels. The information-theoretic optimal power, rate and decoding order allocation for the superposition coding scheme are considered and the corresponding histogram for the optimal number of scheduled users is evaluated. Results show that at optimality there is a high probability that only two or three users are scheduled per channel transmission block. Numerical results for the gains of multiple users scheduling in terms of the long term throughput under hard and proportional fairness as well as for fixed merit weights for the users are also provided. These results show that the performance gain of multiple users scheduling over single user scheduling increases when the total number of users in the network increases, and it can exceed 10% for high number of users.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464495]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>733</startPage>
			<endPage>736</endPage>
			<fileSize>137</fileSize>
			<authors><![CDATA[Zafar, Ammar;Shaqfeh, Mohammad;Alouini, Mohamed-Slim;Alnuweiri, Hussein;]]></authors>
		</item>
		<item>
			<title><![CDATA[Expanded Trellis Designs for Noncoherent Communications with Frequency Offset]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464498]]></link>
			<description><![CDATA[In this letter, we propose a noncoherent communication system that can be used in the communication environment in which the frequency estimation is only roughly obtained and the phase synchronization is not employed. The transmitter side has the serial turbo coding structure composed of a convolutional encoder followed by an interleaver, an MPSK signal mapper and a differential modulator. At the receiver side an expanded trellis is employed to represent not only the possible paths of the differentially encoded MPSK but also the paths resultant from the possible phase variations due to the frequency offset and the phase noise.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464498]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>737</startPage>
			<endPage>740</endPage>
			<fileSize>146</fileSize>
			<authors><![CDATA[Tsai, Hua-Lung;Chang, Chen-Yi;Lee, Shih-Kai;Tang, Hung-Hua;Lin, Mao-Chao;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimizing Chien Search Usage in the BCH Decoder for High Error Rate Transmission]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484071]]></link>
			<description><![CDATA[In hybrid automatic repeat request (HARQ), Bose-Chaudhuri-Hocquenghem (BCH) coders can be used before transmission over noisy channel. A sent message is retrieved correctly via decoding, whenever it is correctable. For uncorrectable message, a retransmission is requested by the receiver. In this paper, the detection time for uncorrectable words is reduced. In particular, "Chien" search usage is optimized. It is only used when all roots of the error locator polynomial belong to F_{2^m}^* = GF(2^m) {0}. Two binary primitive narrow sense BCH codes are considered; the short length BCH(63,39,9) and the long length BCH(16383,16215,25) codes.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484071]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>741</startPage>
			<endPage>744</endPage>
			<fileSize>148</fileSize>
			<authors><![CDATA[El-Din, Ramy F.Taki;El-Hassani, Rabab M.;El-Ramly, Salwa H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Low-Complexity Near-Optimal Decoding for Analog Joint Source Channel Coding Using Space-Filling Curves]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511526]]></link>
			<description><![CDATA[Analog Joint Source-Channel Coding (JSCC) is a communication strategy that does not follow the separation principle of conventional digital systems but approaches the optimal distortion-cost tradeoff over AWGN channels. Conventional Maximum Likelihood (ML) analog JSCC decoding schemes suffer performance degradation at low Channel Signal to Noise Ratio (CSNR) values, while Minimum Mean Square Error (MMSE) decoding presents high complexity. In this letter we propose an alternative two step decoding approach which achieves the near-optimal performance of MMSE decoding at all CSNR values while maintaining a low complexity comparable to that of ML decoding. An additional advantage of the proposed analog JSCC decoding approach is that it can also be used in Multiple Input Multiple Output (MIMO) fading channels.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511526]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>745</startPage>
			<endPage>748</endPage>
			<fileSize>132</fileSize>
			<authors><![CDATA[Fresnedo, O.;Vazquez-Araujo, F.J.;Castedo, L.;Garcia-Frias, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Design of Physical Layer Network Coded LDPC Code for a Multiple-Access Relaying System]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511527]]></link>
			<description><![CDATA[In this letter we propose a novel physical layer network coded LDPC code structure, named PNC-LDPC code, for a non-orthogonal multiple access relay channel. An iterative detection-and-decoding receiver is designed to tackle the multi-user interference at the destination. Based on the code structure and the iterative receiver, we optimize the PNC-LDPC code profile to approach the system achievable rate by utilizing the extrinsic mutual information transfer (EXIT) chart. Simulations show that the performance of our PNC-LDPC code outperforms other conventional network coding based LDPC codes.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511527]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>749</startPage>
			<endPage>752</endPage>
			<fileSize>360</fileSize>
			<authors><![CDATA[Li, Jun;Chen, Wen;Lin, Zihuai;Vucetic, Branka;]]></authors>
		</item>
		<item>
			<title><![CDATA[Finite-SNR Diversity-Multiplexing Tradeoff for Rayleigh MIMO Channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484075]]></link>
			<description><![CDATA[In this paper, exact diversity-multiplexing tradeoff (DMT) at finite signal to noise ratio (SNR) for multiple-input multiple-output (MIMO) systems with dual antennas at the transmitter (2 x N_r) and/or at the receiver (N_tx 2) is derived over Rayleigh fading channels. We derive the outage probability of the mutual information between transmitted and received signals versus SNR. It is shown that at realistic SNRs, achievable diversity gains are significantly lower than asymptotic values. While space-time codes (STCs) for MIMO systems are conventionally designed to achieve the asymptotic DMT frontier, this finite-SNR DMT could provide a new insight to design STCs for practical MIMO systems optimized at operational SNRs.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484075]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>753</startPage>
			<endPage>756</endPage>
			<fileSize>148</fileSize>
			<authors><![CDATA[El Falou, Ammar;Hamouda, Walaa;Langlais, Charlotte;Abdel Nour, Charbel;Douillard, Catherine;]]></authors>
		</item>
		<item>
			<title><![CDATA[Partial Third-Party Information Exchange with Network Coding]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484077]]></link>
			<description><![CDATA[In this paper, we consider the problem of exchanging channel state information in a wireless network such that a subset of the clients can obtain the complete channel state information of all the links in the network. We first derive the minimum number of required transmissions for such partial third-party information exchange problem. We then design an optimal transmission scheme by determining the number of packets that each client should send, and designing a deterministic encoding strategy such that the subset of clients can acquire complete channel state information of the network with minimal number of transmissions. Numerical results show that network coding can efficiently reduce the number of transmissions, even with only pairwise encoding.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484077]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>757</startPage>
			<endPage>760</endPage>
			<fileSize>116</fileSize>
			<authors><![CDATA[Wang, Xiumin;Yuen, Chau;]]></authors>
		</item>
		<item>
			<title><![CDATA[First Path Detection Using Rank Test in IR UWB Ranging with Energy Detection Receiver under Harsh Environments]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476934]]></link>
			<description><![CDATA[To estimate time of arrival (TOA) in impulse radio (IR) ultra wideband (UWB) ranging under harsh environments, the rank test is adopted in the study to detect the first path (FP) in dense multipath with energy detection (ED) receiver. Most TOA estimation methods work well in the additive white Gaussian noise (AWGN). Actually, the background noise could be non-Gaussian. Moreover, the received signal could be polluted by outliers. In these cases, traditional threshold based methods perform badly, as there may be extraordinary large samples in the output of the receiver. These samples will interfere with the detection of the sample containing the FP. A novel and practical method based on the rank test is proposed to deal with these problems. The FP detection is based on the ranks of the received data samples instead of the samples. Simulations are carried out to demonstrate its effectiveness in the IEEE 802.15.4a channels.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476934]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>761</startPage>
			<endPage>764</endPage>
			<fileSize>887</fileSize>
			<authors><![CDATA[Ding, Hong;Liu, Wenyan;Huang, Xiaotao;Zheng, Linhua;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Concave-Convex Procedure for TDOA Based Positioning]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6459502]]></link>
			<description><![CDATA[This letter investigates the time-difference-of-arrival based positioning problem in wireless sensor networks. We consider the least-mean absolute, i.e., the ell_1 norm, minimization of the residual errors and formulate the positioning problem as a difference of convex functions (DC) programming. We then employ a concave-convex procedure to solve the corresponding DC programming. Simulation results illustrate the improved performance of the proposed approach compared to existing methods.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6459502]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>765</startPage>
			<endPage>768</endPage>
			<fileSize>135</fileSize>
			<authors><![CDATA[Gholami, Mohammad Reza;Gezici, Sinan;Strom, Erik G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Elimination of Pre-Steering Delays in Space-Time Broadband Beamforming Using Frequency Domain Constraints]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476946]]></link>
			<description><![CDATA[One of the most popular methods in broadband beamforming is the Frost space-time processing. In this method, a pre-steering delay is followed by a tapped delay line (TDL) filter in each branch of the beamformer. Pre-steering delays are used to compensate for the effect of misalignment between the array geometry and the look direction. However, any error in implementing these delays drastically degrades the performance of the array. In this letter, a new set of constrains are introduced to substitute the pre-steering delays. These constraints are defined in frequency domain and adjust the beamformer weights such that the desired signal is passed without any distortion. Setting nulls at interference directions can also be incorporated in these constraints and can further improve the performance of the beamformer.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476946]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>769</startPage>
			<endPage>772</endPage>
			<fileSize>603</fileSize>
			<authors><![CDATA[Ebrahimi, Reza;Seydnejad, Saeid R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On Decoding Complexity of Reed-Solomon Codes on the Packet Erasure Channel]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511528]]></link>
			<description><![CDATA[We study the finite-length complexity of the Berlekamp-Massey algorithm (BM) and of the Gaussian elimination algorithm (GE) for decoding a Reed-Solomon (RS) code of length n on thepacket erasure channel (PEC). In particular, we are interested in the dependency of the complexity on the packet size g. We show that, for large packet sizes, the complexity of both algorithms is O(g) and the constants hidden by the O-notation are comparable. As an example, we consider a RS code from the Digital Video Broadcasting - Handhelds (DVB-H) standard and we show that, although the asymptotic complexity of the GE is O(n^3) and the one of the BM is O(n^2), the finite-length complexity of both algorithms is comparable already for small/moderate packet sizes, in particular for all packet sizes considered within the standard, making the GE not inferior to the BM, in this context.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511528]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>773</startPage>
			<endPage>776</endPage>
			<fileSize>158</fileSize>
			<authors><![CDATA[Garrammone, Giuliano;]]></authors>
		</item>
		<item>
			<title><![CDATA[Design of Binary and Nonbinary Codes from Lifting of Girth-8 Cycle Codes with Minimum Lengths]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6459503]]></link>
			<description><![CDATA[In this paper, some regular and irregular girth-8 cycle codes with arbitrarily high code rates are presented which have minimum lengths among all girth-8 cycle codes having parity-check matrices of the same row regularity. The parity-check matrices of the constructed girth-8 cycle codes can be considered as the mother matrices of some quasi-cyclic (QC) cycle codes with maximum-achievable girth 24 having better rates rather than the girth-24 Geometric and Cylinder-type cycle codes. Simulation results show that the binary and non-binary constructed cycle codes perform better than the repeat accumulate (RA) codes, progressive edge growth (PEG) codes and random-like LDPC codes of the same lengths and rates.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6459503]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>777</startPage>
			<endPage>780</endPage>
			<fileSize>156</fileSize>
			<authors><![CDATA[Gholami, Mohammad;Samadieh, Mehdi;]]></authors>
		</item>
		<item>
			<title><![CDATA[Cooperative Caching Scheme for Content Oriented Networking]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6459497]]></link>
			<description><![CDATA[In this letter, we propose a novel cooperative caching scheme for the next-generation Internet &#x2014; content oriented networking (CON), trying to minimize the content access delay for mobile users. We formulate the caching problem as a mixed integer programming model and propose a heuristic solution based on Lagrangian relaxation. Simulation results show that this scheme can greatly reduce content access delay.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6459497]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>781</startPage>
			<endPage>784</endPage>
			<fileSize>249</fileSize>
			<authors><![CDATA[Liu, Ran;Yin, Hao;Cai, Xuejun;Zhu, Guangxi;Yu, Li;Fan, Qilin;Xu, Jie;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Node Clustering Algorithm for the CANON Architecture]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511529]]></link>
			<description><![CDATA[In this article, we present an algorithm for clustering a mesh network implementing the Clustering Architecture of Nodes in Optical Networks (CANON). In order to evaluate the impact of the resulting clustering solutions on actual network efficiency, specific cost criteria are used.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511529]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>785</startPage>
			<endPage>788</endPage>
			<fileSize>189</fileSize>
			<authors><![CDATA[Drakos, Andreas;Matrakidis, Chris;Orphanoudakis, Theofanis G.;Stavdas, Alexandros;]]></authors>
		</item>
		<item>
			<title><![CDATA[Theoretical Analyses of Lightpath Blocking Performance in CO-OFDM Optical Networks with/without Spectrum Conversion]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464494]]></link>
			<description><![CDATA[This paper provides the first analysis of the impact of spectrum conversion on the lightpath blocking performance in the CO-OFDM optical networks. Two analytical models for the cases of using and not using spectrum convertors are developed for an H-hop end-to-end lightpath and a network, respectively. Numerical results show that the use of spectrum convertors can significantly improve the lightpath blocking performance.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464494]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>789</startPage>
			<endPage>792</endPage>
			<fileSize>173</fileSize>
			<authors><![CDATA[Peng, Limei;Youn, Chan-Hyun;Qiao, Chunming;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Efficient Genetic Algorithm for the Design of Hub-and-Spoke Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511530]]></link>
			<description><![CDATA[We propose an efficient genetic algorithm (GA) for the design of hub-and-spoke networks with single allocation. The creation of the initial population is based on the greedy randomized search procedure, which provides high quality individuals. Furthermore, new crossover and mutation operators were implemented in order to improve the solution over the evolutionary process. Additionally, a local search procedure is applied in the best individuals. The adapted GA is tested in the Australian Post (AP) and Civil Aeronautics Board (CAB) data sets and clearly outperforms four other evolutionary algorithms of the literature, both in solution quality and CPU time.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511530]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>793</startPage>
			<endPage>796</endPage>
			<fileSize>191</fileSize>
			<authors><![CDATA[Gomes, Bruno N.;Martins, Alexandre X.;de Camargo, Ricardo S.;Ramirez, Jaime A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Energy-Efficient In-Network Caching for Content-Centric Networking]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484072]]></link>
			<description><![CDATA[This work studies on the issue of energy efficient caching for Content-centric Networking (CCN) architecture. We first build the energy consumption model for content distribution in an Internet Service Provider (ISP) and find that the objective of energy optimization can translate into that of minimizing average response hops. We then develop an aging popularity-based in-network caching scheme (APC), where each router implements caching policy using its local information but relying little on coordination. Simulation results show that APC has significant advantage over the widely used Leaving Copies Everywhere (LCE) in terms of the saved energy consumption, cache hit rate and the average number of response hops, so it helps improve user access experience and reduce network traffic other than the energy optimization. Encouragingly, APC can save up to 70% energy.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484072]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>797</startPage>
			<endPage>800</endPage>
			<fileSize>121</fileSize>
			<authors><![CDATA[Li, Jun;Liu, Bin;Wu, Hao;]]></authors>
		</item>
		<item>
			<title><![CDATA[Distributed Flow Scheduling in Energy-Aware Data Center Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484073]]></link>
			<description><![CDATA[Recently, the strategy of powering off unneeded network devices is proposed for energy-aware data center networks (DCNs). However, efficient flow scheduling is required for balancing the load of numerous traffic flows in the irregular topologies. In this paper, we propose distributed flow scheduling (DFS) for energy-aware DCNs. DFS leverages multiple distributed schedulers and schedules elephant flows to suitable routes. Compared with previous solutions, DFS achieves ideal network performance with better scalability and efficiency. Finally, the evaluations demonstrate that DFS is a feasible system to be implemented in energy-aware DCNs.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6484073]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>801</startPage>
			<endPage>804</endPage>
			<fileSize>538</fileSize>
			<authors><![CDATA[Liu, Ruoyan;Gu, Huaxi;Yu, Xiaoshan;Nian, Xiumei;]]></authors>
		</item>
		<item>
			<title><![CDATA[Comments on "Security Improvement of an RFID Security Protocol of ISO/IEC WD 29167-6"]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464500]]></link>
			<description><![CDATA[Song et al. recently scrutinized the security of a mutual authentication protocol published as a part of ISO/IEC WD 29167-6, denoted as Protocol 1, and showed its lack of protection against man-in-the-middle attacks . In addition, they proposed an improved version, called Protocol 1+, and claimed resistance against this sort of attacks. Nevertheless, in this letter we show that the new protocol is as insecure as the original protocol against man-in-the-middle attacks.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6464500]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>805</startPage>
			<endPage>807</endPage>
			<fileSize>94</fileSize>
			<authors><![CDATA[Bagheri, Nasour;Safkhani, Masoumeh;Peris-Lopez, Pedro;Tapiador, Juan E.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Load-Balancing Proxy Mobile IPv6 Networks with Mobility Session Redirection]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476935]]></link>
			<description><![CDATA[This letter presents a mobility session redirection scheme for Proxy Mobile IPv6 networks (PMIPv6-MSR), facilitating LMA changes in the middle of a mobility session for, e.g. load-balancing purpose. Analytical results confirm that the proposed PMIPv6-MSR shows lower blocking and dropping probability than PMIPv6 without load control (PMIPv6-NLC), as offered load increases.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6476935]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>808</startPage>
			<endPage>811</endPage>
			<fileSize>183</fileSize>
			<authors><![CDATA[Jeon, Seil;Aguiar, Rui L.;Kang, Namhi;]]></authors>
		</item>
		<item>
			<title><![CDATA[Message-Passing Algorithms for Coordinated Spectrum Sensing in Cognitive Radio Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511531]]></link>
			<description><![CDATA[This letter presents distributed algorithms that enable efficient spectrum sensing in cognitive radio networks. In the proposed setting, each node in the system detects different channels in a cooperative fashion in order to improve access to the spectral resources available to the cognitive radio network. The developed scheme utilizes a message-passing framework for efficient channel assignment. Simulation results establish that this class of algorithms outperform existing techniques and improves the overall sensing performance of the system.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511531]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>812</startPage>
			<endPage>815</endPage>
			<fileSize>238</fileSize>
			<authors><![CDATA[Lee, Sang Hyun;Shamaiah, Manohar;Vikalo, Haris;Vishwanath, Sriram;]]></authors>
		</item>
		<item>
			<title><![CDATA[Staff list]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511532]]></link>
			<description><![CDATA[Provides a listing of current staff, committee members and society officers.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6511532]]></guid>
			<volume>17</volume>
			<issue>4</issue>
			<startPage>c3</startPage>
			<endPage>c3</endPage>
			<fileSize>45</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>