<?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>2009</year>
		<month>November </month>
		<day>06</day>
		<item>
			<title><![CDATA[IEEE Communications Letters - cover]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288440]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288440]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>c1</startPage>
			<endPage>c2</endPage>
			<fileSize>70</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Oversampled M-sequences for joint data and bit epoch estimation in DSSS transmissions]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288441]]></link>
			<description><![CDATA[The Maximum Likelihood (ML) estimator for the bit synchronization epoch and data bit values in Direct-Sequence Spread-Spectrum (DSSS) transmission consists of determining the binary sequence that maximizes the correlation with the recovered data samples. This requires the exhaustive test of all sequences generated by the different bit combinations and alignments, resulting in a computationally intensive process. In this letter, the properties of maximum length sequences (msequences) are exploited for testing all the bit combinations and alignments in parallel, leading to a computationally efficient implementation of theML estimator. The case where the data bits are modulated by an overlay or secondary code is also considered and the proposed algorithm is generalized to include the effect of this additional modulation.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288441]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>721</startPage>
			<endPage>723</endPage>
			<fileSize>285</fileSize>
			<authors><![CDATA[Borio, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Robust channel estimation for OFDM/OQAM]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288442]]></link>
			<description><![CDATA[When orthogonal frequency division multiplexing offset-QAM (OFDM/OQAM), termed OQAM in short, was revealed to possess several advantages compared to OFDM, the channel estimation (CE) technique became a crucial issue for OQAM to make a practical sense. Based on the previous proposal on CE of OQAM, this letter addresses the study of a decisive factor that directly determines the CE performance. The idea is to relax the orthogonality constraint of the prototype filter used for transmitting the preamble. This provides a larger degree of freedom for finding a good balance between its time and frequency localization (TL and FL). Two prototype filter design algorithms are proposed and show that the proposed preamble-based CE method can almost attain the perfect CE.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288442]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>724</startPage>
			<endPage>726</endPage>
			<fileSize>267</fileSize>
			<authors><![CDATA[Hao Lin;Siohan, P.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Direct sequence spread spectrum scheme for an unmanned aerial vehicle PPM control signal protection]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288443]]></link>
			<description><![CDATA[In this letter, a new direct sequence spread spectrum scheme for protection of an unmanned aerial vehicle (UAV) binary pulse-position modulated (PPM)control signal is proposed. The UAV PPM control signal consists of data frames. Each of them contains a synchronizing pulse followed by a number of shorter pulses equal to the number of channels N. At the beginning of any pulse is the pause long 0.3 ms. The proposed scheme uses (N + 1) pseudonoise (PN) codes: one of them (PN<sub>0</sub>) is assigned to the synchronizing pulse while the each of the remaining N codes (PN<sub>1</sub>, PN<sub>2</sub>, ... PN<sub>N</sub>) corresponds to the appropriate channel. The same PN code is transmitted during the pause and the pulse which follows the pause. At the receiving side, the set of (N + 1) passive correlators is used to detect respective PN codes. Proposed scheme requires neither PN code tracking process nor data demodulation, so is resistant to timing jitter. Performance measures of the proposed scheme are calculated.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288443]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>727</startPage>
			<endPage>729</endPage>
			<fileSize>336</fileSize>
			<authors><![CDATA[Todorovic, B.;Orlic, V.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On joint estimation and decoding for channels with noise memory]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288444]]></link>
			<description><![CDATA[In this letter we consider coded transmission over interference channels where the interference occurs in bursts and hence is considered to be impulsive. The bursty nature of the interference leads to memory in the overall noise process which is modeled as a 2-state Markov chain. Recent work on coded transmission for such channels has proposed decoding techniques assuming that perfect knowledge of the interference statistics are available at the receiver. In this work, we aim at completing the picture by proposing a novel algorithm that decodes without the knowledge of the interference statistics and highlighting the differences between the two cases.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288444]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>730</startPage>
			<endPage>732</endPage>
			<fileSize>203</fileSize>
			<authors><![CDATA[Mitra, J.;Lampe, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[BER analysis for MPAM signal constellations in the presence of fading and ADC quantization noise]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288445]]></link>
			<description><![CDATA[In this letter, closed-form expressions for the bit error rate of M-ary pulse amplitude modulated signal constellations as a function of the analog-to-digital converter word length, the signal-to-noise ratio and the fading distribution, are derived. These results allow for a rapid and accurate evaluation of the system performance when the analog-to-digital converter resolution is limited, as is generally the case in high sampling rate communication systems, and thus provide a useful tool for system design, analysis and optimization.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288445]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>733</startPage>
			<endPage>735</endPage>
			<fileSize>186</fileSize>
			<authors><![CDATA[Rizvi, U.;Janssen, G.;Weber, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Soft MIMO ML demodulation based on bitwise constellation partitioning]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288446]]></link>
			<description><![CDATA[In this letter, we propose a soft-decoding ML MIMO demodulation method that lowers the complexity of the existing ML method. The proposed method finds the nearest point without calculating the Euclidean distance by exploiting the regular structure of bit-to-symbol mapping. It enables significant reduction of the number of distance calculations which is a major complexity burden.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288446]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>736</startPage>
			<endPage>738</endPage>
			<fileSize>205</fileSize>
			<authors><![CDATA[Jungwon Lee;Ji-Woong Choi;Hui-Ling Lou;Jongsun Park;]]></authors>
		</item>
		<item>
			<title><![CDATA[Comments on ¿analysis of cognitive radio spectrum access with optimal channel reservation¿]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288447]]></link>
			<description><![CDATA[We claim that some of the expressions, results and the conclusion of X. Zhu et al., (2007) are not correct. The correct expressions, results and conclusion are discussed in this letter.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288447]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>739</startPage>
			<endPage>739</endPage>
			<fileSize>165</fileSize>
			<authors><![CDATA[Martinez-Bauset, J.;Pla, V.;Pacheco-Paramo, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[General gap-utilizing strategy for non-persistent traffic in wireless networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288448]]></link>
			<description><![CDATA[We focus on a general strategy which exploits nonpersistent traffic gaps to reduce data delay/loss caused by some communication-breaking actions, e.g. handover and neighbor scanning. Those actions usually interrupt transmission or take up transferring chances for a period time, hence incur QoS downgrades. Our study discusses the details on how to choose the optimal gaps for them in order to minimize the bad impact, which provides a potential guidance for protocol and system design.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288448]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>740</startPage>
			<endPage>742</endPage>
			<fileSize>230</fileSize>
			<authors><![CDATA[Jia Liu;Chuang Lin;Fengyuan Ren;]]></authors>
		</item>
		<item>
			<title><![CDATA[Avoiding collision with hidden nodes in IEEE 802.11 wireless networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288449]]></link>
			<description><![CDATA[In wireless networks, collision is a major factor of performance degradation. In this letter, we propose a scheme for reducing collision in IEEE 802.11 networks. Each node can avoid collision by maintaining a disjoint set of time slots for transmission. Through simulation, we show that the proposed scheme is effective to reduce collision even in the presence of hidden nodes.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288449]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>743</startPage>
			<endPage>745</endPage>
			<fileSize>169</fileSize>
			<authors><![CDATA[Jinkyu Lee;Ikjun Yeom;]]></authors>
		</item>
		<item>
			<title><![CDATA[Probabilistic call admission control in wireless multiservice networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288450]]></link>
			<description><![CDATA[A new probabilistic call admission control scheme is proposed for multiservice wireless networks. The new scheme gradually suppresses the admission rate of the new calls and of the calls of each service class (SC) supported considering their priorities independently. The scheme is examined both for a single SC and for multiple SCs under general conditions. The analysis employs Markov chain theory and yields analytical expressions for the call blocking probabilities. The proposed analytical method was validated via simulations employing different distributions for the channel holding time; the simulations demonstrated the accuracy of the proposed framework.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288450]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>746</startPage>
			<endPage>748</endPage>
			<fileSize>208</fileSize>
			<authors><![CDATA[Stratogiannis, D.G.;Tsiropoulos, G.I.;Kanellopoulos, J.D.;Cottis, P.G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Alamouti-codes based four-antenna transmission schemes with phase feedback]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288451]]></link>
			<description><![CDATA[We present a new transmit scheme based on Alamouti codes for four transmit antenna systems with phase feedback. We propose a pre-processor for combining two Alamouti codes in terms of Frobenius norm maximization. For the proposed scheme, full diversity is achieved by the combining effect at the pre-processor. Also the phase feedback is utilized to increase an array gain. Simulation results show that the performance degradation due to the quantized feedback in the proposed scheme is small, and thus the proposed scheme exhibits a performance gain over existing closed-loop schemes with the same number of feedback bits.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288451]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>749</startPage>
			<endPage>751</endPage>
			<fileSize>212</fileSize>
			<authors><![CDATA[Ilhwan Choi;Jong-Kyu Kim;Heunchul Lee;Inkyu Lee;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multiple WNIC-based handoff in IEEE 802.11 WLANs]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288452]]></link>
			<description><![CDATA[We propose a novel scanning scheme for IEEE 802.11 by equipping Access Points (APs) with multiple Wireless Network Interface Cards (Multi-WNICs), one of which is set to operate in an exclusively reserved channel for the scanning purpose. In this environment, a STAtion (STA) can easily search neighboring APs by scanning the reserved channel. Our simulation results demonstrate that the proposed scheme ultimately reduces the overall scanning time to improve the handoff latency.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288452]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>752</startPage>
			<endPage>754</endPage>
			<fileSize>354</fileSize>
			<authors><![CDATA[Sunggeun Jin;Munhwan Choi;Sunghyun Choi;]]></authors>
		</item>
		<item>
			<title><![CDATA[Efficient handoff algorithm for inbound mobility in hierarchical macro/femto cell networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288453]]></link>
			<description><![CDATA[To improve indoor coverage and network capacity, the use of hierarchical macro/femto cell networks is regarded as the most promising approach. We present an efficient handoff algorithm to support the inbound mobility from macro cells to femto cells under the consideration of large asymmetry in the transmit power of the cells. Numerical analysis reveals that the proposed algorithm yields a higher probability that the user will be correctly assigned to the femto cell while maintaining the number of handoffs at the same level.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288453]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>755</startPage>
			<endPage>757</endPage>
			<fileSize>224</fileSize>
			<authors><![CDATA[Jung-Min Moon;Dong-Ho Cho;]]></authors>
		</item>
		<item>
			<title><![CDATA[Efficient CQI feedback via network coding for wireless relay networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288454]]></link>
			<description><![CDATA[For the efficacy of radio resource management in downlink wireless relay networks, the channel quality indicator (CQI) between a mobile station (MS) and a relay station (RS) should be fed back from the RS to its base station (BS), at the cost of additional feedback overhead. In this letter, we propose an efficient feedback scheme based on network coding between a pilot sequence and the CQI of MS-RS link, through which the BS can have both CQIs of MS-RS and RS-BS links without overhead. Numerical results reveal that the proposed CQI reporting scheme has as good feedback performance as conventional one which generally requires additional feedback burden.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288454]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>758</startPage>
			<endPage>760</endPage>
			<fileSize>247</fileSize>
			<authors><![CDATA[Jinyoung Oh;Jin-Yup Hwang;Jeongchan Kim;Youngnam Han;]]></authors>
		</item>
		<item>
			<title><![CDATA[A novel routing algorithm in distributed IEEE 802.16 mesh networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288455]]></link>
			<description><![CDATA[In this paper, we propose a novel distributed routing algorithm for IEEE 802.16/WiMax based mesh networks. Our algorithm aims at providing routes for traffic flows with minimum end-to-end delays. Based on the underlying IEEE802.16 standard distributed scheduling mechanism, our routing algorithm is incorporated into the medium access control (MAC) layer. Each node determines the next-hop nodes for the passing flows according to the scheduling information and attempts to forward packets in the very earliest slots. In addition, a loop cancelation mechanism is proposed to avoid being trapped in path loops and thus guarantees the accessibility of our algorithm. The simulation results show that our proposal can considerably reduce the delay of traffic flows and also achieve load balance to a certain degree.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288455]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>761</startPage>
			<endPage>763</endPage>
			<fileSize>219</fileSize>
			<authors><![CDATA[Yajun Li;Yuhang Yang;Chengyu Cao;]]></authors>
		</item>
		<item>
			<title><![CDATA[Mathematical modeling of rayleigh fading channels based on finite state markov chains]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288456]]></link>
			<description><![CDATA[To mathematically model the Rayleigh fading channel, we propose a new method to partition the received Signalto-Noise ratio (SNR) range into a finite number of states and construct a finite state Markov chain (FSMC). Our method is based on the assumption that the transitions of the FSMC occur only between adjacent states. We provide numerical and simulation results to verify that our method constructs an accurate FSMC and our method outperforms existing methods.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288456]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>764</startPage>
			<endPage>766</endPage>
			<fileSize>224</fileSize>
			<authors><![CDATA[Jae Man Park;Gang Hwang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Time hopped transmitted reference with multiple autocorrelation sampling for ultra wideband radio]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288457]]></link>
			<description><![CDATA[Transmitted reference (TR) schemes for ultra wideband (UWB) eliminate the need for channel estimation, reducing receiver complexity at the cost of reduced performance. This letter proposes a transmitted reference (TR) scheme with multiple autocorrelation sampling detection. The proposed receiver captures the energy in the received signal's autocorrelation side lobes, outperforming the traditional TR scheme for the operational range of signal to noise ratio (SNR) values. Time hoping, as well as the use of bandwidth efficient signaling with favorable spectral characteristics, facilitate significant improvement in system capacity in comparison to a similar scheme using orthogonal chirp signals in multipath spread channels.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288457]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>767</startPage>
			<endPage>769</endPage>
			<fileSize>230</fileSize>
			<authors><![CDATA[Hen-Geul Yeh;Shabaik, K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Low-complexity hierarchical spectrum sharing scheme in cognitive radio networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288458]]></link>
			<description><![CDATA[Fair and efficient spectrum sharing is an important problem in cognitive radios. In view of the clustering cognitive radio network with capacity-limited common channels, this letter proposes a low-complexity hierarchical spectrum sharing method, which is carried out in two steps. First, the spectrum holes are allocated to clusters in a fair and distributed way by using the list-coloring method. Then, all the channels in every spectrum hole are allocated by cluster head to minimize the outage probability by using the maximum matching method. Such a scheme not only takes a great advantage of the low signaling overhead and computation complexity, but also achieves the suboptimal outage performance which is close to that of the exhaustive search.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288458]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>770</startPage>
			<endPage>772</endPage>
			<fileSize>253</fileSize>
			<authors><![CDATA[Bai, B.;Chen, W.;Cao, Z.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Geodesical codebook design for precoded MIMO systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288459]]></link>
			<description><![CDATA[We propose a numerical method for finding packings of multiple-input and multiple-output (MIMO) semi-unitary precoding matrices in Grassmannian manifolds with different metrics. The proposed expansion¿compression algorithm (ECA) is practical, simple and produces efficient packings without the need for a sophisticated initialization. With chordal distance metric, the algorithm tends to converge into a degenerated point constellation, where two points contain identical as well as orthogonal columns and distance between them cannot increase further along geodesic. Therefore, we alternate between max-min and min-max clustering parts of ECA algorithm, where the latter prevents degenerated constellations. With Fubini-Study distance metric, the algorithm converges to best known packings without extra min-max processing.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288459]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>773</startPage>
			<endPage>775</endPage>
			<fileSize>160</fileSize>
			<authors><![CDATA[Schober, K.;Janis, P.;Wichman, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A precoding scheme for DFT-based OFDM to suppress sidelobes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288460]]></link>
			<description><![CDATA[In spectrum pooling scenario, the spectral leakage of DFT-based OFDM signal can be divided into in-band-out-ofsubband (IBOSB) radiation and out-of-band (OOB) radiation. A precoding scheme is proposed to suppress the IBOSB sidelobes. The precoding design is based on the generalized eigenvalue problem. Simulation results demonstrate that the proposed scheme can suppress the sidelobes significantly in contrast to the uncoded schemes. At the same time, the Bit-Error-Rate (BER) performance of the precoded system over multipath fading channel is improved due to the frequency diversity.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288460]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>776</startPage>
			<endPage>778</endPage>
			<fileSize>313</fileSize>
			<authors><![CDATA[Xu, R.;Chen, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Cross-layer cut-through switching mechanism for IEEE 802.16d/e wireless networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288461]]></link>
			<description><![CDATA[This paper proposes a fast cross-layer cut-through switching mechanism (CCSM) for supporting media access control (MAC) layer packet switching in IEEE 802.16-based broadband wireless access (BWA) networks. The local traffic, which means subscriber stations (SSs) communicating with each other within the cell, can be switched via the MAC layer without involving the network layer. The average access delay of request from SSs is studied and analyzed in this paper. Finally, the simulation and numerical results show that the performance of CCSM is superior to that of the legacy IEEE 802.16d/e protocol.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288461]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>779</startPage>
			<endPage>781</endPage>
			<fileSize>174</fileSize>
			<authors><![CDATA[Jenhui Chen;Chih-Chieh Wang;]]></authors>
		</item>
		<item>
			<title><![CDATA[An algorithm for prediction of link lifetime in MANET based on unscented kalman filter]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288462]]></link>
			<description><![CDATA[We propose an algorithm to predict the link lifetime in MANETs by the Unscented Kalman Filter (UKF). The algorithm recursively computes the UKF states, modeled as a nonlinear system, using periodically measured distances as inputs. The UKF states are then utilized to compute the estimates of the remaining link lifetime. Evaluation of the proposed algorithm demonstrates robust performance in computing the MANET link lifetime for various mobility models and in the presence of velocity changes.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288462]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>782</startPage>
			<endPage>784</endPage>
			<fileSize>265</fileSize>
			<authors><![CDATA[Hua, E.Y.;Haas, Z.J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Design of serially concatenated continuous phase modulation with symbol-wise interleaving]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288463]]></link>
			<description><![CDATA[In this letter we consider serially concatenated continuous phase modulation (SCCPM) schemes with symbolwise interleaving and an additional intra-symbol interleaving. We use extrinsic information transfer (EXIT) chart to optimize the outer code and intra-symbol interleaver. We show that, for various continuous phase modulation (CPM) parameters, the outer code with memory 2 may not always be the best choice. For CPM with modulation index h = 1/2, considerable improvements can be achieved by moderately increasing the outer code memory.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288463]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>785</startPage>
			<endPage>787</endPage>
			<fileSize>168</fileSize>
			<authors><![CDATA[Jun Ning;Minyue Fu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Serially-concatenated LDGM codes for correlated sources over gaussian broadcast channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288464]]></link>
			<description><![CDATA[We propose a superposition scheme, based on the use of serially-concatenated LDGM codes, for the transmission of spatially correlated sources over Gaussian broadcast channels. The messages intended for each receiver are independently encoded using the same code. In this manner, a strong degree of correlation is kept between the encoded sequences,which are then modulated with different energies and symbolwise added. By properly designing the encoding process, simulation results show that our proposed scheme easily outperforms the suboptimal theoretical limit assuming separation between source and channel coding.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288464]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>788</startPage>
			<endPage>790</endPage>
			<fileSize>221</fileSize>
			<authors><![CDATA[Hernaez, M.;Crespo, P.;Del Ser, J.;Garcia-Frias, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Short-delay clock recovery for CBR services in PTN]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288465]]></link>
			<description><![CDATA[PTN (Packet Transport Network) network supports multiple services, including legacy TDM service. Clock recovery mechanism is essential technology for TDM over packet networks. In this paper, a novel buffer level clock recovery method, called Zigzag is proposed. The new method not only removes the negative contribution of packet delay jitter but also takes an effective operation to keep the buffer size small, and reduce the buffering delay of the incoming packets.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288465]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>791</startPage>
			<endPage>793</endPage>
			<fileSize>312</fileSize>
			<authors><![CDATA[Lv, S.;Lu, Y.;Ji, Y.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Block-based precoding for serially concatenated codes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288466]]></link>
			<description><![CDATA[Precoders have been shown to facilitate iterative decoding convergence towards the maximum likelihood (ML) performance in serially concatenated schemes. In this letter, we propose a novel block-based precoder as an alternative to classic convolutional precoders. Furthermore, we demonstrate that the proposed block-based precoder facilitates operation at significantly reduced channel Signal to Noise Ratios (SNRs) in practical schemes, having limited latencies, as well as limited implementational and computational decoding complexities.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288466]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>794</startPage>
			<endPage>796</endPage>
			<fileSize>170</fileSize>
			<authors><![CDATA[Maunder, R.;Hanzo, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Modeling the slotted nonpersistent CSMA protocol for wireless access networks with multiple packet reception]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288467]]></link>
			<description><![CDATA[In this paper, we propose probability models for performance analysis of the slotted nonpersistent CSMA protocol in wireless networks with multiple packet reception. Variants of the CSMA protocol are well-known and play important roles in medium access control. Most of the previous works on CSMA use the conventional (0, 1, e) channel model, which prohibits an access point from concurrently receiving multiple packets from distinct nodes. In this paper, we use the Poisson random traffic model to study the performance of the slotted nonpersistent CSMA protocol when the access point could simultaneously receive two or more packets from different nodes in wireless access networks. We show that in terms of the network throughput, our analytical results are consistent with simulation results.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288467]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>797</startPage>
			<endPage>799</endPage>
			<fileSize>196</fileSize>
			<authors><![CDATA[Rung-Hung Gau;]]></authors>
		</item>
		<item>
			<title><![CDATA[Protecting SIP server from CPU-based DoS attacks using history-based IP filtering]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288468]]></link>
			<description><![CDATA[Voice over IP (VoIP) telephony is vulnerable to a range of attacks, since its operation relies on the underlying IP network. The centralized design of the major VoIP signalling protocols such as the Session Initiation Protocol (SIP) makes the registration server a target for CPU-based denial of service (DoS) attacks. In this paper, we propose a history-based IP filtering layer to defeat these DoS attacks by blocking the SIP packets from previously unseen sources. Our empirical evaluation shows that our approach achieves significant improvement in CPU utilization under DoS attacks.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288468]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>800</startPage>
			<endPage>802</endPage>
			<fileSize>197</fileSize>
			<authors><![CDATA[Zhou, C.V.;Leckie, C.;Ramamohanarao, K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A heuristic method of finding heavy hitter prefix pairs in IP traffic]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288469]]></link>
			<description><![CDATA[This paper describes a heuristic method of finding prefix pairs in IP traffic, which represent more than a prescribed threshold of global traffic. Two Patricia trees are used for finding those source and destination prefixes with a sufficient amount of traffic. A heuristic method is then proposed to identify those pairs of prefixes with a total amount of traffic exceeding a given proportion of global traffic. The proposed algorithm is tested against NetFlow data from Orange¿s transit IP network.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288469]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>803</startPage>
			<endPage>805</endPage>
			<fileSize>165</fileSize>
			<authors><![CDATA[Truong, P.;Guillemin, F.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Two schemes to reduce latency in short lived TCP flows]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288470]]></link>
			<description><![CDATA[Motivated by the amount of short-lived TCP traffic due to interactive applications like web browsing, we propose two schemes to reduce the download time of TCP flows. Both schemes explicitly try to overcome the long delay suffered when TCP has to recover from the loss of the last data segment in a flow, loss for which Fast Retransmit cannot be triggered. The first scheme consists in transmitting twice the last segment, while the second one exploits the reception of the duplicate ACK caused by the delivery of the FIN segment. Both schemes allow the transmitter to recover the loss without waiting for a Retransmission Timeout expiration, thus providing quicker recovery with up to 50% gain.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288470]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>806</startPage>
			<endPage>808</endPage>
			<fileSize>173</fileSize>
			<authors><![CDATA[Ciullo, D.;Mellia, M.;Meo, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A proof of convergence of the B-RED and P-RED algorithms for random early detection]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288471]]></link>
			<description><![CDATA[In [8], we recently presented two computationally efficient algorithms named B-RED and P-RED for random early detection. In this letter, we present the mathematical proof of convergence of these algorithms under general conditions to local minima.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288471]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>809</startPage>
			<endPage>811</endPage>
			<fileSize>149</fileSize>
			<authors><![CDATA[Bhatnagar, S.;Patro, R.K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Bounding virus proliferation in P2P networks with a diverse-parameter trust management scheme]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288472]]></link>
			<description><![CDATA[Peer-to-peer (P2P) networking has the potential of providing wide channels for file exchange. At the same time, P2P is prone to the proliferation of viruses. Peer trust reputation can be used to prevent virus dissemination. However, when viruses have infectious properties, peer reputation may not be enough to limit their proliferation. This letter shows the inefficiency of simple peer reputation to bound epidemics in an infectious environment and introduces a trust management algorithm that uses the combination of trust values of peers and infection values of both peers and content to bound the proliferation of viruses in P2P networks. The proposed trust management scheme can bound virus proliferation to a small number of peers without inhibiting file-download activity.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288472]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>812</startPage>
			<endPage>814</endPage>
			<fileSize>304</fileSize>
			<authors><![CDATA[Lin Cai;Rojas-Cessa, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Correction to "Simplifying the error probability analysis in optical direct detection DPSK systems" [Jun 09 369-371]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288473]]></link>
			<description><![CDATA[In the above titled paper (ibid., vol. 13, no. 6, pp. 369-371, Jun. 09), an incorrect figure was submitted for Fig. 3. The correct figure is presented here.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288439&arnumber=5288473]]></guid>
			<volume>13</volume>
			<issue>10</issue>
			<startPage>815</startPage>
			<endPage>815</endPage>
			<fileSize>38</fileSize>
			<authors><![CDATA[Pires, J.J.O.;Cancela, L.G.C.;]]></authors>
		</item>
	</channel>
</rss>