<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Communications, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 26 </description>
		<year>2009</year>
		<month>November </month>
		<day>06</day>
		<item>
			<title><![CDATA[IEEE Transactions on Communications - Cover]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288475]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288475]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>c1</startPage>
			<endPage>c3</endPage>
			<fileSize>92</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Performance of channel coded noncoherent systems: modulation choice, information rate, and Markov chain Monte Carlo detection]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288476]]></link>
			<description><![CDATA[This paper investigates performance of channel coded noncoherent systems over block fading channels. We consider an iterative system where an outer channel code is serially concatenated with an inner modulation code amenable to noncoherent detection. We emphasize that, in order to obtain near-capacity performance, the information rates of modulation codes should be close to the channel capacity. For certain modulation codes, a single-input single-output (SISO) system with only one transmit antenna may outperform a dual-input and single-output (DISO) system with two transmit antennas. This is due to the intrinsic information rate loss of these modulation codes compared to the DISO channel capacity. We also propose a novel noncoherent detector based on Markov Chain Monte Carlo (MCMC). Compared to existing detectors, the MCMC detector achieves comparable or superior performance at reduced complexity. The MCMC detector does not require explicit amplitude or phase estimation of the channel fading coefficient, which makes it an attractive candidate for high rate communication employing quadrature amplitude modulation (QAM) and for multiple antenna channels. At transmission rates of 1 ~ 1.667 bits/sec/Hz, the proposed SISO systems employing 16QAM and MCMC detection perform within 1.6-2.3 dB of the noncoherent channel capacity achieved by optimal input.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288476]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2841</startPage>
			<endPage>2845</endPage>
			<fileSize>322</fileSize>
			<authors><![CDATA[Rong-Rong Chen;Ronghui Peng;]]></authors>
		</item>
		<item>
			<title><![CDATA[Comments on successive relaxation for decoding of LDPC codes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288477]]></link>
			<description><![CDATA[The application of successive relaxation (SR) to the fixed-point problem associated with the iterative decoding of low-density parity-check (LDPC) codes was proposed by Hemati et al.. The simulation results presented by Hemati et al. for the SR version of belief propagation (BP) in the likelihood ratio (LR) domain and that of min-sum (MS) in the log-likelihood ratio (LLR) domain are based on the assumption of all-zero codeword transmission. This assumption however results in erroneous error rates when SR is applied in the LR domain. Here, we correct the simulation results reported by Hemati et al. for SR-BP in the LR domain. Furthermore, we investigate the performance of SR-BP and SR-MS in the LLR and LR domains, respectively. The results for a binary input additive white Gaussian noise (BIAWGN) channel show that for both BP and MS, the application of SR in the two domains of LR and LLR results in different error correcting performance. In particular, for the tested codes, it is shown that among the four algorithms, SR-MS-LLR has the best performance. It outperforms standard MS and BP by up to about 0.6 dB and 0.3 dB, respectively, offering an attractive solution in terms of performance/complexity tradeoff.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288477]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2846</startPage>
			<endPage>2848</endPage>
			<fileSize>260</fileSize>
			<authors><![CDATA[Hua Xiao;Banihashemi, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[The lowest-possible BER and FER for any discrete memoryless channel with given capacity]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288478]]></link>
			<description><![CDATA[We investigate properties of a channel coding scheme leading to the minimum-possible frame error ratio when transmitting over a memoryless channel with rate R &gt; C. The results are compared to the well-known properties of a channel coding scheme leading to minimum bit error ratio. It is concluded that these two optimization requests are contradicting. A valuable application of the derived results is presented.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288478]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2849</startPage>
			<endPage>2852</endPage>
			<fileSize>241</fileSize>
			<authors><![CDATA[Huber, J.;Hehn, T.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Bandwidth-efficient noncoherent Trellis-coded MPSK]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288479]]></link>
			<description><![CDATA[In this letter, we propose a novel bandwidth-efficient noncoherent trellis-coded MPSK scheme, in which a particularlydesigned differential encoder is added in front of the trellis encoder. With this differential encoder, trellis-coded MPSK proposed by Ungerboeck is no longer noncoherently catastrophic and thus achieves better error performance. Moreover, new trellis codes which, for the proposed scheme, have better bit error rates than Ungerboeck¿s codes are found by computer searches.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288479]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2853</startPage>
			<endPage>2856</endPage>
			<fileSize>365</fileSize>
			<authors><![CDATA[Ruey-Yi Wei;Chang-Chih Huang;]]></authors>
		</item>
		<item>
			<title><![CDATA[A lattice-based systematic recursive construction of quasi-cyclic LDPC codes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288480]]></link>
			<description><![CDATA[This paper presents a low-complexity recursive and systematic method to construct good well-structured low-density parity-check (LDPC) codes. The method is based on a recursive application of a partial Kronecker product operation on a given &#x003B3; x q, q &#x02A7E; 3 a prime, integer lattice L(&#x003B3; x q). The (n - 1)- fold product of L(&#x003B3; x q) by itself, denoted L<sup>n</sup>(&#x003B3; x q), represents a regular quasi-cyclic (QC) LDPC code, denoted (see PDF), of high rate and girth 6. The minimum distance of (see PDF) is equal to that of the core code (see PDF) introduced by L(&#x003B3; x q). The support of the minimum weight codewords in (see PDF) are characterized by the support of the same type of codewords in (see PDF). From performance perspective the constructed codes compete with the pseudorandom LDPC codes.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288480]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2857</startPage>
			<endPage>2863</endPage>
			<fileSize>360</fileSize>
			<authors><![CDATA[Esmaeili, M.;Tadayon, M.H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Turbo decoding of product codes using adaptive belief propagation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288481]]></link>
			<description><![CDATA[The adaptive belief propagation (ABP) algorithm was recently proposed by Jiang and Narayanan for the soft decoding of Reed-Solomon (RS) codes. In this paper, simplified versions of this algorithm are investigated for the turbo decoding of product codes. The complexity of the turbo-oriented adaptive belief propagation (TAB) algorithm is significantly reduced by moving the matrix adaptation step outside of the belief propagation iteration loop. A reduced-complexity version of the TAB algorithm that offers a trade-off between performance and complexity is also proposed. Simulation results for the turbo decoding of product codes show that belief propagation based on adaptive parity check matrices is a practical alternative to the currently very popular Chase-Pyndiah algorithm.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288481]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2864</startPage>
			<endPage>2867</endPage>
			<fileSize>464</fileSize>
			<authors><![CDATA[Jego, C.;Gross, W.J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Design of scalable decoders for sensor networks via Bayesian network learning]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288482]]></link>
			<description><![CDATA[Minimum mean square error (MMSE) decoding in a large-scale sensor network which employs distributed quantization is considered. Given that the computational complexity of the optimal decoder is exponential in the network size, we present a framework based on Bayesian networks for designing a near-optimal decoder whose complexity is only linear in network size (hence scalable). In this approach, a complexity-constrained factor graph, which approximately represents the prior joint distribution of the sensor outputs, is obtained by constructing an equivalent Bayesian network using the maximum likelihood (ML) criterion. The decoder executes the sum-product algorithm on the simplified factor graph. Our simulation results have shown that the scalable decoders constructed using the proposed approach perform close to optimal, with both Gaussian and non-Gaussian sensor data.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288482]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2868</startPage>
			<endPage>2871</endPage>
			<fileSize>278</fileSize>
			<authors><![CDATA[Yasaratna, R.;Yahampath, P.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Symbol-level adaptive modulation for coded OFDM on block fading channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288483]]></link>
			<description><![CDATA[It has recently been recognized by many researchers that adaptive modulation is most effective when the channel diversity order is small. In this letter, we propose a simple adaptive modulation scheme for orthogonal frequency division multiplexing (OFDM) systems on channels that provide a small order of diversity. The proposed adaptation algorithm is based on a novel and very simple analytical formula we derive for the performance of BICM on block fading channels. Simulation results show that the derived analytical formula is very tight when the targeted bit error probability is small. OFDM systems on indoor channels provide small orders of diversity and form an ideal scenario for adaptation. In order to keep system complexity and feedback requirements at a minimum, we will consider symbol-level adaptive modulation wherein all the subcarriers in an OFDM symbol use the same modulation.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288483]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2872</startPage>
			<endPage>2875</endPage>
			<fileSize>249</fileSize>
			<authors><![CDATA[Nagaraj, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[M-ary symbol error outage over Nakagami-m fading channels in shadowing environments]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288484]]></link>
			<description><![CDATA[This letter addresses the problem of finding a tractable expression for the symbol error outage (SEO) in flat Nakagami-m fading and shadowing channels. We deal with M-ary phase shift keying (M-PSK) and quadrature amplitude modulation (M-QAM) which extends our previous results on BPSK signaling. We propose a new tight approximation of the symbol error probability (SEP) holding for M-PSK and M-QAM signals which is accurate over all signal to noise ratios (SNRs) of interest. We derive a new generic expression for the inverse SEP which facilitates the derivation of a tight approximation of the SEO in a lognormal shadowing environment.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288484]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2876</startPage>
			<endPage>2879</endPage>
			<fileSize>272</fileSize>
			<authors><![CDATA[Mary, P.;Dohler, M.;Gorce, J.-M.;Villemaud, G.;Arndt, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Error probability analysis of FFH/MFSK receivers over frequency-selective Rician-fading channels with partial-band-noise jamming]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288485]]></link>
			<description><![CDATA[An optimum maximum-likelihood (ML) receiver structure for a fast frequency-hopped M-ary frequency-shift keying system over frequency-selective Rician-fading channels against partial-band-noise jamming and additive white Gaussian noise is proposed. In addition, we propose two suboptimum ML receivers and derive their corresponding analytical bit-error rate expressions.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288485]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2880</startPage>
			<endPage>2885</endPage>
			<fileSize>294</fileSize>
			<authors><![CDATA[Jiliang Zhang;Kah Chan Teh;Kwok Hung Li;]]></authors>
		</item>
		<item>
			<title><![CDATA[On noncoherent receivers for DSTM in spatially correlated fading]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288486]]></link>
			<description><![CDATA[In this letter, we derive a multiple-symbol differential detection (MSDD) and a novel MSDD-based decision-feedback differential detection (MS-DFDD) receiver for differential space-time modulation transmitted over spatially correlated multiple-input multiple-output fading channels. We show that MS-DFDD outperforms previously proposed DFDD schemes that are based on scalar and vector prediction (SP-DFDD and VP-DFDD). In addition, we prove that at high signal-to-noise ratio (SNR) VP-DFDD is equivalent to SP-DFDD and thus fails to properly exploit the spatial fading correlations.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288486]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2886</startPage>
			<endPage>2890</endPage>
			<fileSize>253</fileSize>
			<authors><![CDATA[Zhu, C.;Yiu, S.;Schober, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Constellation-switching precoding for blind detection of co-channel signals: application to 8-ary signaling]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288487]]></link>
			<description><![CDATA[Blind detection of co-channel signals in wireless scenarios may be achieved with the help of data precoding techniques [6]-[9]. In this letter we propose a new data precoding / blind detection approach that is based on a unique modification to the signal constellation of each of the co-channel signals. Detection is based on exploiting the embedded constellation property. The new approach can be seen as a generalization to some earlier precoding techniques [8][9] that were based on phase modifications. Demonstration of the proposed method involves application to 8-ary amplitude-phase modulations, with performance shown to be reasonably close to an MMSE receiver. Performance results for a semi-blind receiver for 4-ary signaling are also given to demonstrate further possible applications of the new scheme.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288487]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2891</startPage>
			<endPage>2894</endPage>
			<fileSize>236</fileSize>
			<authors><![CDATA[Al-Bayati, A.K.S.;Aloquili, O.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A low-complexity noncoherent iterative space-time demodulator]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288488]]></link>
			<description><![CDATA[Turbo coded unitary space-time modulation (USTM) can provide large coding gain as compared to uncoded USTM. Because the noncoherent space-time maximum a posteriori demodulator is very complicated, in this letter, we propose a new low-complexity noncoherent iterative space-time demodulator for the USTM constructed from pilot symbolassisted modulation. The proposed demodulator utilizes both hard and soft decisions from the turbo decoder to simplify the computational task as well as produce reliable soft outputs. Several examples demonstrate that this demodulator has both low complexity and good error performance.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288488]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2895</startPage>
			<endPage>2898</endPage>
			<fileSize>251</fileSize>
			<authors><![CDATA[Ruey-Yi Wei;Yu-Wei Hsu;Chih-Chong Pan;]]></authors>
		</item>
		<item>
			<title><![CDATA[Outage probability of the free-space optical channel with doubly stochastic scintillation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288489]]></link>
			<description><![CDATA[We study the asymptotic outage probability of multiple-input multiple-output free-space optical communication with pulse-position modulation. In particular, we consider doubly stochastic scintillation models, lognormal-Rice and I-K distributions. First we consider the case when channel state information is available at the receiver only. Then we consider the case when it is also available at the transmitter.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288489]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2899</startPage>
			<endPage>2902</endPage>
			<fileSize>208</fileSize>
			<authors><![CDATA[Letzepis, N.;Guillen i Fabregas, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A distributed coordination scheme to improve the performance of IEEE 802.11 in multi-hop networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288490]]></link>
			<description><![CDATA[This paper investigates the performance of IEEE 802.11 in multi-hop scenarios and shows how its aggressive behavior can throttle the spatial reuse and reduce bandwidth efficiency. An adaptive, layer-2, distributed coordination scheme for 802.11 using explicit medium access control (MAC) feedback is then proposed to pace the transmissions on adjacent nodes, thereby assisting the MAC protocol to operate around its saturation state while minimizing resource contention. Simulation results show that the proposed scheme outperforms the original 802.11 MAC.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288490]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2903</startPage>
			<endPage>2908</endPage>
			<fileSize>436</fileSize>
			<authors><![CDATA[Fengji Ye;Haiming Yang;Hua Yang;Sikdar, B.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Switching rates of dual selection diversity in noisy fading channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288491]]></link>
			<description><![CDATA[The effect of noise on the switching rate of a dual branch selection diversity combiner in noisy fading channels is examined. A closed-form solution is derived for independent and identically distributed (i.i.d.) and independent and nonidentically distributed (i.n.d.) fading channels. The switching rate in noisy fading channels is compared to that in noise-free conditions.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288491]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2909</startPage>
			<endPage>2913</endPage>
			<fileSize>296</fileSize>
			<authors><![CDATA[Xin Wang;Beaulieu, N.C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On achievable rates of two-path successive relaying]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288492]]></link>
			<description><![CDATA[This letter studies the achievable rates of the twopath relay channel (TPRC), where two half-duplex relays successively in turn forward messages from a source to a destination. It is shown that the conventional analogue and digital relaying schemes incur non-negligible throughput losses due to a socalled "inter-relay-interference (IRI)" phenomenon. This letter presents a new digital relaying scheme at the source transmitter to mitigate the IRI by applying the "dirty-paper-coding (DPC)" technique. It is shown that the proposed scheme achieves the capacity of the symmetric TPRC.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288492]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2914</startPage>
			<endPage>2917</endPage>
			<fileSize>271</fileSize>
			<authors><![CDATA[Zhang, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Strict suboptimality of selection amplify-and-forward relaying under global channel information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288493]]></link>
			<description><![CDATA[Selection amplify-and-forward (SAF) relaying, which has been shown to be optimal under the constraints of localized channel information at the relays and a constant relay power allocation (PA) template, is shown to be globally strictly suboptimal. A necessary condition for the outage optimality of the SAF PA, and an exponentially vanishing upper bound on the probability of the SAF optimality are derived.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288493]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2918</startPage>
			<endPage>2922</endPage>
			<fileSize>199</fileSize>
			<authors><![CDATA[Nikjah, R.;Beaulieu, N.C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[New closed-form bounds on the performance of coding in correlated Rayleigh fading]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288494]]></link>
			<description><![CDATA[New, simple bounds are presented for the probability of error in a binary hypothesis test for communications using diversity signaling in correlated Rayleigh fading. The bounds are developed in the context of pairwise error-event probabilities in decoding an error-correction code. A long-standing conjecture regarding the form of worst-case error events in exponentially correlated Rayleigh fading is also proven. The utility of the results is illustrated by their application to transfer-function bounds on the probability of bit error for a system using a convolutional code. The closed-form transfer-function bounds are shown to be tighter than previously developed transfer-function bounds for communications in exponentially correlated Rayleigh fading.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288494]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2923</startPage>
			<endPage>2931</endPage>
			<fileSize>376</fileSize>
			<authors><![CDATA[Hutchenson, D.K.;Noneaker, D.L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Nonlinear coding and estimation for correlated data in wireless sensor networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288495]]></link>
			<description><![CDATA[The problem of designing simple and energy efficient nonlinear distributed source-channel codes is considered. By demonstrating similarities between this problem and the problem of bandwidth expansion, a structure for source-channel codes is presented and analyzed. Based on this analysis an understanding about desirable properties for such a system is gained and used to produce an explicit source-channel code which is then analyzed and simulated. One of the main advantages of the proposed scheme is that it is implementable for many sources, contrary to most existing nonlinear distributed source-channel coding systems.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288495]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2932</startPage>
			<endPage>2939</endPage>
			<fileSize>419</fileSize>
			<authors><![CDATA[Wernersson, N.;Skoglund, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Performance of sphere decoding of block codes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288496]]></link>
			<description><![CDATA[A sphere decoder searches for the closest lattice point within a certain search radius. The search radius provides a tradeoff between performance and complexity. We focus on analyzing the performance of sphere decoding of linear block codes. We analyze the performance of soft-decision sphere decoding on AWGN channels and a variety of modulation schemes. A harddecision sphere decoder is a bounded distance decoder with the corresponding decoding radius. We analyze the performance of hard-decision sphere decoding on binary and ¿¿-ary symmetric channels. An upper bound on the performance of maximumlikelihood decoding of linear codes defined over ¿¿¿¿ (e.g. Reed- Solomon codes) and transmitted over ¿¿-ary symmetric channels is derived and used in the analysis.We then discuss sphere decoding of general block codes or lattices with arbitrary modulation schemes. The tradeoff between the performance and complexity of a sphere decoder is then discussed.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288496]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2940</startPage>
			<endPage>2950</endPage>
			<fileSize>781</fileSize>
			<authors><![CDATA[El-Khamy, M.;Vikalo, H.;Hassibi, B.;McEliece, R.J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Time-frequency packing for linear modulations: spectral efficiency and practical detection schemes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288497]]></link>
			<description><![CDATA[We investigate the spectral efficiency, achievable by a low-complexity symbol-by-symbol receiver, when linear modulations based on the superposition of uniformly time- and frequency-shifted replicas of a base pulse are employed. Although orthogonal signaling with Gaussian inputs achieves capacity on the additive white Gaussian noise channel, we show that, when finite-order constellations are employed, by giving up the orthogonality condition (thus accepting interference among adjacent signals) we can considerably improve the performance, even when a symbol-by-symbol receiver is used. We also optimize the spacing between adjacent signals to maximize the achievable spectral efficiency. Moreover, we propose a more involved transmission scheme, consisting of the superposition of two independent signals with suitable power allocation and a two-stage receiver, showing that it allows a further increase of the spectral efficiency. Finally, we show that a more involved equalization algorithm, based on soft interference cancellation, allows to achieve an excellent bit-error-rate performance, even when error-correcting codes designed for the Gaussian-noise limited channel are employed, and thus does not require a complete redesign of the coding scheme.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288497]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2951</startPage>
			<endPage>2959</endPage>
			<fileSize>291</fileSize>
			<authors><![CDATA[Barbieri, A.;Fertonani, D.;Colavolpe, G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimization of multi-branch switched diversity systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288498]]></link>
			<description><![CDATA[A performance optimization based on the optimal switching threshold(s) for a multi-branch switched diversity system is discussed in this paper. For the conventional multi-branch switched diversity system with a single switching threshold, the optimal switching threshold is a function of both the average channel SNR and the number of diversity branches, where computing the optimal switching threshold is not a simple task when the number of diversity branches is high. The newly proposed multi-branch switched diversity system is based on a sequence of switching thresholds, instead of a single switching threshold, where a different diversity branch uses a different switching threshold for signal comparison. Thanks to the fact that each switching threshold in the sequence can be optimized only based on the number of the remaining diversity branches, the proposed system makes it easy to find these switching thresholds. Furthermore, some selected numerical and simulation results show that the proposed switched diversity system with the sequence of optimal switching thresholds outperforms the conventional system with the single optimal switching threshold.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288498]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2960</startPage>
			<endPage>2970</endPage>
			<fileSize>451</fileSize>
			<authors><![CDATA[Haewoon Nam;Alouini, M.-S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A simple SNR representation method for AMC schemes of MIMO systems with ML detector]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288499]]></link>
			<description><![CDATA[Adaptive modulation and coding (AMC) is a powerful technique to enhance the link performance by adjusting the transmission power, channel coding rates and modulation levels according to channel state information. In order to efficiently utilize the AMC scheme, an accurate signal-to-noise ratio (SNR) value is normally required for determining the AMC level. In this paper, we propose a simple method to represent the SNR values for maximum likelihood (ML) detector in multi-input multi-output (MIMO) systems. By analyzing the relation between the upper bound and the lower bound of the ML detector performance, we introduce an efficient way to determine the SNR for the ML receiver. Based on the proposed SNR representation, an AMC scheme for single antenna systems can be extended to MIMO systems with ML detector. From computer simulations, we confirm that the proposed SNR representation allows us to achieve almost the same system throughput as the optimum AMC systems in frequency selective channels with reduced complexity.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288499]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2971</startPage>
			<endPage>2976</endPage>
			<fileSize>480</fileSize>
			<authors><![CDATA[Jihoon Kim;Kyoung-Jae Lee;Chang Kyung Sung;Inkyu Lee;]]></authors>
		</item>
		<item>
			<title><![CDATA[Differential modulation for two-way wireless communications: a perspective of differential network coding at the physical layer]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288500]]></link>
			<description><![CDATA[This work considers two-way relay channels (TWRC), where two terminals transmit simultaneously to each other with the help of a relay node. For single antenna systems, we propose several new transmission schemes for both amplify-and-forward (AF) protocol and decode-and-forward (DF) protocol where the channel state information is not required. These new schemes are the counterpart of the traditional noncoherent detection or differential detection in point-to-point communications. Differential modulation design for TWRC is challenging because the received signal is a mixture of the signals from both source terminals. We derive maximum likelihood (ML) detectors for both AF and DF protocols, where the latter can be considered as performing differential network coding at the physical layer. As the exact ML detector is prohibitively complex, we propose several suboptimal alternatives including decision feedback detectors and prediction-based detectors. All these strategies work well as evidenced by the simulation results. The proposed protocols are especially useful when the required average data rate is high. In addition, we extend the protocols to the multiple-antenna case and provide the design criterion of the differential unitary space time modulation (DUSTM) for TWRC.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288500]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2977</startPage>
			<endPage>2987</endPage>
			<fileSize>455</fileSize>
			<authors><![CDATA[Tao Cui;Feifei Gao;Tellambura, C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[The effects of spatial diversity and imperfect channel estimation on wideband MC-DS-CDMA and MC-CDMA]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288501]]></link>
			<description><![CDATA[In our previous work, we compared the theoretical bit error rates of multi-carrier direct sequence code division multiple access (MC-DS-CDMA) and multi-carrier code division multiple access (MC-CDMA). To ensure a fair comparison, we constrained both schemes to the same bandwidth, information rate, and energy-per-bit, and these constraints resulted in a possible trade-off between diversity gain and channel estimation errors between the two schemes. While only a single-input single-output (SISO) system was considered in our previous work, in this paper, we extend the comparison to a multiple-input multiple-output (MIMO) system which employs Alamouti space-time block coding at each sub-carrier frequency to achieve spatial diversity. We consider only those cases where MC-CDMA has higher frequency diversity than MC-DS-CDMA. Since increases in diversity yield diminishing gains, we conclude that the addition of spatial diversity to this multi-carrier comparison benefits MC-DS-CDMA more than MC-CDMA. To determine whether these gains for MC-DS-CDMA are enough to offset the difference in frequency diversity between the two schemes, we derive closed-form expressions for the bit error probabilities of both schemes, and we compare the MIMO results against those of the SISO system for different information rates, number of users, and number of pilot symbols per channel estimate.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288501]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>2988</startPage>
			<endPage>3000</endPage>
			<fileSize>559</fileSize>
			<authors><![CDATA[Ling, A.;Milstein, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Near-optimal and suboptimal receivers for multiuser UWB impulse radio systems in multipath]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288502]]></link>
			<description><![CDATA[In this paper, near-optimal and suboptimal receivers are proposed for multiuser ultra-wideband (UWB) impulse radio (IR) systems in dense multipath channels, where non-Gaussian multiuser interference (MUI) seen at each finger of a RAKE receiver is taken into account. The receivers exploit two dimensional diversity that is offered by UWB signaling, namely multipath diversity and repetition diversity (i.e., repetition coding). Non-Gaussian modeling of the MUI results in employing a nonlinear process at each finger, jointly considering the desired users, path gain being estimated and the order associated with MUI statistics. For this, the MUI statistics are characterized in terms of their second and fourth order moments, especially considering the channel sparseness and cluster overlapping observed in realistic UWB channels, which leads to modeling the MUI by a generalized Gaussian distribution. It is shown that the MUI statistics exhibit non-Gaussian nature even for relatively large number of users, and the diversity gain against MUI can be significant when relatively small number of users coexist.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288502]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3001</startPage>
			<endPage>3011</endPage>
			<fileSize>670</fileSize>
			<authors><![CDATA[Dong In Kim;]]></authors>
		</item>
		<item>
			<title><![CDATA[Decentralized optimization for multichannel random access]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288503]]></link>
			<description><![CDATA[We consider schemes for decentralized cross-layer optimization of multichannel random access by exploiting local channel state and traffic information. In the network we are considering, users are not necessarily within the transmission ranges of all others; therefore, when a user is transmitting, it may only interfere with some users, which is different from most existing channel aware Aloha schemes. Besides, we also consider complicated traffic distribution, e.g. each user may choose to send packets to or receive packets from different users simultaneously. We develop decentralized optimization for multichannel random access (DOMRA). DOMRA consists of three steps: neighborhood information collection, transmission control of the MAC layer based on the instantaneous channel state information, and power allocation for each traffic flow on each subchannel. Simulation results demonstrated that DOMRA significantly outperforms existing channel aware Aloha schemes due to its exploitation of both multiuser diversity through cross-layer design and the inhomogeneous characteristics of traffic spatial distribution in the network. Besides, DOMRA performs closely to the globally optimum solution, which requires full network knowledge to be obtained. DOMRA can be applied to different types of wireless networks, such as wireless sensor networks and mobile ad hoc networks, to improve quality of service.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288503]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3012</startPage>
			<endPage>3023</endPage>
			<fileSize>658</fileSize>
			<authors><![CDATA[Guowang Miao;Li, G.Y.;Swami, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimal channel estimation and training design for two-way relay networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288504]]></link>
			<description><![CDATA[In this work, we consider the two-way relay network (TWRN) where two terminals exchange their information through a relay node in a bi-directional manner and study the training-based channel estimation under the amplify-andforward (AF) relay scheme. We propose a two-phase training protocol for channel estimation: in the first phase, the two terminals send their training signals concurrently to the relay; and in the second phase, the relay amplifies the received signal and broadcasts it to both terminals. Each terminal then estimates the channel parameters required for data detection. First, we assume the channel parameters to be deterministic and derive the maximum-likelihood (ML) -based estimator. It is seen that the newly derived ML estimator is nonlinear and differs from the conventional least-square (LS) estimator. Due to the difficulty in obtaining a closed-form expression of the mean square error (MSE) for the ML estimator, we resort to the Cramér-Rao lower bound (CRLB) on the estimation MSE for design of optimal training sequence. Secondly, we consider stochastic channels and focus on the class of linear estimators. In contrast to the conventional linear minimum-mean-square-error (LMMSE) -based estimator, we introduce a new type of estimator that aims at maximizing the effective receive signal-to-noise ratio (SNR) after taking into consideration the channel estimation errors, thus referred to as the linear maximum SNR (LMSNR) estimator. Furthermore, we prove that orthogonal training design is optimal for both the CRLB- and the LMSNR-based design criteria. Finally, simulations are conducted to corroborate the proposed studies.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288504]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3024</startPage>
			<endPage>3033</endPage>
			<fileSize>405</fileSize>
			<authors><![CDATA[Feifei Gao;Rui Zhang;Ying-Chang Liang;]]></authors>
		</item>
		<item>
			<title><![CDATA[End-to-end outage minimization in OFDM based linear relay networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288505]]></link>
			<description><![CDATA[Multi-hop relaying is an economically efficient architecture for coverage extension and throughput enhancement in future wireless networks. OFDM, on the other hand, is a spectrally efficient physical layer modulation technique for broadband transmission. As a natural consequence of combining OFDM with multi-hop relaying, the allocation of per-hop subcarrier power and per-hop transmission time is crucial in optimizing the network performance. This paper is concerned with the end-to-end information outage in an OFDM based linear relay network. Our goal is to find an optimal power and time adaptation policy to minimize the outage probability under a long-term total power constraint. We solve the problem in two steps. First, for any given channel realization, we derive the minimum short-term power required to meet a target transmission rate. We show that it can be obtained through two nested bisection loops. To reduce computational complexity and signalling overhead, we also propose a sub-optimal algorithm. In the second step, we determine a power threshold to control the transmission on-off so that the long-term total power constraint is satisfied. Numerical examples are provided to illustrate the performance of the proposed power and time adaptation schemes with respect to other resource adaptation schemes.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288505]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3034</startPage>
			<endPage>3044</endPage>
			<fileSize>720</fileSize>
			<authors><![CDATA[Xiaolu Zhang;Meixia Tao;Wenhua Jiao;Chun Sum Ng;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Collaborative sensor-fault detection scheme for robust distributed estimation in sensor networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288506]]></link>
			<description><![CDATA[This work addresses the problem of robust distributed estimation in the presence of sensor faults when the fusion center sequentially receives quantized messages from local sensors. The mean square error (MSE) of distributed estimation schemes increases dramatically if the information received from the faulty sensors within the network is not excluded from the estimation process. Accordingly, an efficient collaborative sensorfault detection (CSFD) scheme is proposed in which the results of a homogeneity test are used to identify the faulty nodes within the network such that their quantized messages can be filtered out when estimating the parameter of interest. Utilizing an asymptotic analytical technique, a lower bound is derived for the MSE of the proposed distributed estimation scheme. A good agreement is observed between the simulated MSE results and the lower bound values, and thus it is inferred that the lower bound provides a convenient and reliable means of predicting the performance of the proposed estimation scheme in real-world sensor networks. In addition, a low-complexity CSFD (LC-CSFD) scheme is proposed to identify faulty sensors in WSNs with a very large number of nodes. The simulation results confirm that the accuracy of the estimates obtained from the CSFD and LCCSFD schemes is significantly better than that obtained from a conventional estimation scheme when applied in sensor networks characterized by an unknown number of sensor faults of various types.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288506]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3045</startPage>
			<endPage>3058</endPage>
			<fileSize>645</fileSize>
			<authors><![CDATA[Tsang-Yi Wang;Li-Yuan Chang;Pei-Yin Chen;]]></authors>
		</item>
		<item>
			<title><![CDATA[Spectrum allocation in tiered cellular networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288507]]></link>
			<description><![CDATA[Two-tier networks, comprising a conventional cellular network overlaid with shorter range hotspots (e.g. femtocells, distributed antennas, or wired relays), offer an economically viable way to improve cellular system capacity. The capacitylimiting factor in such networks is interference. The cross-tier interference between macrocells and femtocells can suffocate the capacity due to the near-far problem, so in practice hotspots should use a different frequency channel than the potentially nearby high-power macrocell users. Centralized or coordinated frequency planning, which is difficult and inefficient even in conventional cellular networks, is all but impossible in a twotier network. This paper proposes and analyzes an optimum decentralized spectrum allocation policy for two-tier networks that employ frequency division multiple access (including OFDMA). The proposed allocation is optimal in terms of Area Spectral Efficiency (ASE), and is subjected to a sensible Quality of Service (QoS) requirement, which guarantees that both macrocell and femtocell users attain at least a prescribed data rate. Results show the dependence of this allocation on the QoS requirement, hotspot density and the co-channel interference from the macrocell and femtocells. Design interpretations are provided.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288507]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3059</startPage>
			<endPage>3068</endPage>
			<fileSize>617</fileSize>
			<authors><![CDATA[Chandrasekhar, V.;Andrews, J.G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A statistical inter-cell interference model for downlink cellular OFDMA networks under log-normal shadowing and multipath Rayleigh fading]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288508]]></link>
			<description><![CDATA[The probability density function (PDF) of the intercell interference for downlink cellular orthogonal frequency division multiple access networks under log-normal shadowing and multipath Rayleigh fading is derived. The derived PDF is observed to highly deviate from the Gaussian distribution, especially at moderate to small network loads. Based on the derived inter-cell interference statistics, the decoder performance can be significantly improved compared to the case when the traditional decoder optimized for the AWGN channel is employed. A simple suboptimum decoding algorithm that closely approximates the derived optimum decoder performance is also proposed.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288508]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3069</startPage>
			<endPage>3077</endPage>
			<fileSize>536</fileSize>
			<authors><![CDATA[Changkyu Seol;Kyungwhoon Cheun;]]></authors>
		</item>
		<item>
			<title><![CDATA[Interference avoidance in networks with distributed receivers]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288509]]></link>
			<description><![CDATA[Direct extensions of distributed greedy interference avoidance (IA) techniques developed for centralized networks to networks with multiple distributed receivers (as in ad hoc networks) are not guaranteed to converge. Motivated by this fact, we develop a waveform adaptation (WA) algorithm framework for IA based on potential game theory. The potential game model ensures the convergence of the designed algorithms in distributed networks and leads to desirable network solutions. Properties of the game model are then exploited to design distributed implementations of the algorithm that involve limited feedback in the network. Finally, variations of IA algorithms including IA with respect to legacy systems and IA with combined transmitpower and WA adaptations are investigated.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288509]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3078</startPage>
			<endPage>3091</endPage>
			<fileSize>1208</fileSize>
			<authors><![CDATA[Menon, R.;Mackenzie, A.B.;Buehrer, R.M.;Reed, J.H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Cooperative power allocation for broadcast/multicast services in cellular OFDM systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288510]]></link>
			<description><![CDATA[In this paper, we investigate the transmission power allocation for the support of broadcast/multicast services (BMSs) in multi-cell OFDM systems.We consider a cooperative architecture for distribution of the BMS data where the copies of the same data are transmitted by multiple base stations (BSs) in a synchronized manner and then aggregated at the receiving users. Under this architecture, we develop a power allocation scheme that optimizes the transmission power of the multiple BSs on each sub-channel to maximize the total data rate. The optimal power allocation turns out to take the form of iterative water-filling, particularly when heterogeneous modulation and coding schemes are allowed in each sub-channel. In addition, we study the two special cases where the BMS system has extended or limited capabilities: First, we consider the BMS system that supports a more sophisticated video coding technique, fine granularity scalability (FGS) video coding, which encodes the BMS data into base layer and enhancement layer. Taking the layered structure into account, we propose a power allocation scheme that maximizes the data rate of the enhancement layer while guaranteeing the minimum data rate requirement of the base layer. Second, we consider the BMS system that only allows average channel state information of users to be available at the resource manager. In this case, as it is not possible to guarantee successful transmission of every data due to instant deep fading, we propose a power allocation scheme that minimizes the probability of transmission failure. Simulation results reveal that the cooperative distribution system performs far better than the non-cooperative distribution system and the proposed power allocation schemes outperform the equal power allocation scheme significantly.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288510]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3092</startPage>
			<endPage>3102</endPage>
			<fileSize>527</fileSize>
			<authors><![CDATA[Kwon, H.;Lee, B.G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Power minimization for CDMA under colored noise]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288511]]></link>
			<description><![CDATA[Rate-constrained power minimization (PMIN) over a code division multiple-access (CDMA) channel with correlated noise is studied. PMIN is shown to be an instance of a separable convex optimization problem subject to linear ascending constraints. PMIN is further reduced to a dual problem of sumrate maximization (RMAX). The results highlight the underlying unity between PMIN, RMAX, and a problem closely related to PMIN but with linear receiver constraints. Subsequently, conceptually simple sequence design algorithms are proposed to explicitly identify an assignment of sequences and powers that solve PMIN. The algorithms yield an upper bound of 2N - 1 on the number of distinct sequences where N is the processing gain. The sequences generated using the proposed algorithms are in general real-valued. If a rate-splitting and multi-dimensional CDMA approach is allowed, the upper bound reduces to N distinct sequences, in which case the sequences can form an orthogonal set and be binary plusmn1-valued.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288511]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3103</startPage>
			<endPage>3112</endPage>
			<fileSize>337</fileSize>
			<authors><![CDATA[Padakandla, A.;Sundaresan, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[LMSE-based parameter acquisition for multicarrier CDMA systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288512]]></link>
			<description><![CDATA[An acquisition scheme, based on the least meansquared error (LMSE), for the symbol timing, carrier phases, and multipath gains for multicarrier code-division multiple-access (MC-CDMA) systems is proposed. A new coefficient called the quasi-mean-squared accuracy coefficient (QMSAC) is introduced. This allows the search for multiple optimal parameters to be split into simpler single-parameter estimates. The symbol timing is acquired with a comparison of the QMSACs followed by a linear interpolation scheme or a search of a minimizing variable. Carrier phases and multipath gain coefficients are then estimated via some algebraic computations based only on the estimated symbol timing and the QMSACs. The spreading sequence of the desired user is the only prior knowledge required for the proposed approach. Simulation results demonstrate the near-far resistance of the approach and show that the error performance of minimum mean-squared error (MMSE) detection with acquired parameters is only a few decibels worse for the considered channel than the performance obtained with perfect knowledge about the channel impulse response.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288512]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3113</startPage>
			<endPage>3122</endPage>
			<fileSize>612</fileSize>
			<authors><![CDATA[Shun-Te Tseng;Lehnert, J.S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Error performance analysis of signal superposition coded cooperative diversity]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288513]]></link>
			<description><![CDATA[This paper analyzes the error performance of a coded cooperative diversity system employing the Euclidean superposition of two BPSK-modulated signals. For an example using a convolutional code on block fading channels, the results show excellent agreement with computer simulations. The analysis makes it possible to optimize the power allocation between the local and relay signals numerically, circumventing the need for time consuming Monte Carlo simulations. Similarly, the analysis demonstrates how the power allocation can be "tuned" to compensate for unbalanced uplink channels and/or to provide unequal error protection to the data from the two cooperating nodes.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288513]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3123</startPage>
			<endPage>3131</endPage>
			<fileSize>804</fileSize>
			<authors><![CDATA[Lei Xiao;Fuja, T.;Kliewer, J.;Costello, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Memoryless relay strategies for two-way relay channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288514]]></link>
			<description><![CDATA[We propose relaying strategies for uncoded two-way relay channels, where two terminals transmit simultaneously to each other with the help of a relay. In particular, we consider a memoryless system, where the signal transmitted by the relay is obtained by applying an instantaneous relay function to the previously received signal. For binary antipodal signaling, a class of so called absolute (abs)-based schemes is proposed in which the processing at the relay is solely based on the absolute value of the received signal. We analyze and optimize the symbol-error performance of existing and new abs-based and non-abs-based strategies under an average power constraint, including abs-based and non-abs-based versions of amplify and forward (AF), detect and forward (DF), and estimate and forward (EF). Additionally, we optimize the relay function via functional analysis such that the average probability of error is minimized at the high signal-to-noise ratio (SNR) regime. The optimized relay function is shown to be a Lambert W function parameterized on the noise power and the transmission energy. The optimized function behaves like abs-AF at low SNR and like abs-DF at high SNR, respectively; EF behaves similarly to the optimized function over the whole SNR range. We find the conditions under which each class of strategies is preferred. Finally, we show that all these results can also be generalized to higher order constellations.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288514]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3132</startPage>
			<endPage>3143</endPage>
			<fileSize>489</fileSize>
			<authors><![CDATA[Tao Cui;Ho, T.;Kliewer, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Interference and noise reduction by beamforming in cognitive networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288515]]></link>
			<description><![CDATA[We consider beamforming in a cognitive network with multiple primary users and a secondary user sharing the same spectrum. Each primary and secondary user consists of a transmitter and a receiver. In particular, we assume that the secondary transmitter has N<sub>t</sub> antennas and transmits data to its single-antenna receiver using beamforming. The beamformer is designed to maximize the cognitive signal-to-interference ratio (CSIR). Using mathematical tools from random matrix theory, we derive both lower and upper bounds on the average interference created by the cognitive transmitter at the primary receivers and the average CSIR of the cognitive user. We further analyze and prove the convergence of these two performance measures asymptotically as the number of antennas N<sub>t</sub> or primary users N<sub>p</sub> increases. Specifically, we show that the average interference per primary receiver converges to E[d<sup>-alpha</sup>], the expected value of the path loss in the network, whereas the average CSIR decays as 1/c when c = N<sub>p</sub>/N<sub>t</sub> rarrinfin. In the special case of N<sub>t</sub> / N<sub>p</sub>, the lower bound of the average total interference approaches 0 and the upper bound of the average CSIR approaches N<sub>t</sub>E[d-<sup>alpha</sup>]/alpha<sup>2</sup>c where alpha<sup>2</sup>c is the noise variance at the cognitive receiver.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288515]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3144</startPage>
			<endPage>3153</endPage>
			<fileSize>473</fileSize>
			<authors><![CDATA[Yiu, S.;Mai Vu;Tarokh, V.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Windowing for multicarrier CDMA systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288516]]></link>
			<description><![CDATA[The windows for achieving good multiple-access performance of multicarrier code-division multiple-access (MCCDMA) systems employing minimum mean-squared error receivers are studied. The mean-squared error (MSE) is used as the performance metric for the optimization. In a simplified two-user system, the rectangular window is found to be optimum while regarded as an inferior window in orthogonal frequency-division multiplexing systems because of its spectral inefficiency. Necessary conditions are given for improving the performances of spectrally efficient windows by exploiting the cyclic prefix and oversampling in the frequency domain.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288516]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3154</startPage>
			<endPage>3163</endPage>
			<fileSize>556</fileSize>
			<authors><![CDATA[Shun-Te Tseng;Lehnert, J.S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Perron-root minimization for interference-coupled systems with adaptive receive strategies]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288517]]></link>
			<description><![CDATA[Interference in multiuser systems is often characterized by a non-negative and irreducible coupling matrix. The maximum eigenvalue (Perron root) of the weighted coupling matrix provides a single measure for the joint achievability of certain signal-to-interference ratios (SIR). In this paper, we address the more general case where the users are coupled by concave interference functions. This corresponds to a system with adaptive receive strategies which minimize the interference received by each user. A necessary and sufficient condition for feasibility is obtained by minimizing the Perron root over the set of possible receive strategies. This type of problem is directly related to the problem of (weighted) max-min-SIR balancing. This paper provides an analytical framework and an iterative algorithm that converges monotonically to a global optimum. We also study an alternative approach based on a fixed point iteration. This iteration is shown to converge to the global optimum if the SIR targets lie on the boundary of the region.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288517]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3173</startPage>
			<endPage>3164</endPage>
			<fileSize>705</fileSize>
			<authors><![CDATA[Boche, H.;Schubert, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Correction to "State Transparent Convolutional Codes and Their Novel Maximum-likelihood Decoding Algorithm" [Oct 07 1837-1844]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288518]]></link>
			<description><![CDATA[In the above titled paper (ibid., vol. 55, no. 10, pp. 1837-1844, Oct. 09), there was a typographical error on page 1839. The incorrect text and the corrected text appear here.]]></description>
			<pubDate><![CDATA[October  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5288474&arnumber=5288518]]></guid>
			<volume>57</volume>
			<issue>10</issue>
			<startPage>3174</startPage>
			<endPage>3174</endPage>
			<fileSize>28</fileSize>
			<authors><![CDATA[Sarrafzadeh, H.R.;]]></authors>
		</item>
	</channel>
</rss>