30.01.2013 Views

TSI report for the period 2005-2009 - Département Traitement du ...

TSI report for the period 2005-2009 - Département Traitement du ...

TSI report for the period 2005-2009 - Département Traitement du ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

12. Statistics and Applications (STA) 12.2. Main Results<br />

Projects Euopean REX network NewCom; ANR project MalCom (Random matrices <strong>for</strong> communications);<br />

ANR project SESAME (inference <strong>for</strong> random matrices and communicaton)<br />

; Contracts DEMORO (with CS), Blind demo<strong>du</strong>lation (with I2E), Aintercom (with DGA),<br />

WAVECOM (one <strong>the</strong>sis) and France Telecom R&D (one <strong>the</strong>sis).<br />

Our interest lies in applications of ma<strong>the</strong>matical and statistical tools to per<strong>for</strong>mance evaluation<br />

and optimization of <strong>the</strong> physical layer of wireless communications systems. Such approaches<br />

have been particularly fruitful in many areas of interest in <strong>the</strong> last decade.<br />

The first topic of interest is <strong>the</strong> per<strong>for</strong>mance analysis of Multiple Input Multiple Output<br />

(MIMO) communications. MIMO systems are widely acknowledged as a mean <strong>for</strong> increasing<br />

<strong>the</strong> spectral efficiency of wireless communication systems. In order to design efficient MIMO<br />

communications, a crucial issue is to evaluate <strong>the</strong> per<strong>for</strong>mance of MIMO transmissions in terms<br />

of capacity or outage probability. Random matrix <strong>the</strong>ory is a powerful tool which allows to evaluate<br />

such per<strong>for</strong>mance indicators [2427, 2428]. Whereas <strong>the</strong> pioneer works in this field usually<br />

assume simplistic communication models, our activity consists in developing new tools <strong>for</strong> random<br />

matrices in order to encompass a wider class of communication models, including realistic<br />

propagation channel models and involved transmit/receive architectures.<br />

On <strong>the</strong> o<strong>the</strong>r hand, geo-localization and tracking of base stations and mobile stations of<br />

GSM network have been considered (in <strong>the</strong> context of <strong>the</strong> DEMORO project, and N. Castaneda’s<br />

<strong>the</strong>sis). This study used both GSM signals with a multiple sensor array and traffic in<strong>for</strong>mations<br />

and took into account multipath propagation and presence of outliers. Different approaches have<br />

been considered: Expectation-Maximization (EM) algorithm and recursive EM <strong>for</strong> DOA estimation<br />

applications but also Monte Carlo methods (or particle filtering) in <strong>the</strong> context of Bearing Only<br />

Tracking [2532, 2531].<br />

A final field of interest <strong>for</strong> non-cooperative communications is blind signal processing. In<br />

this context, it is assumed that <strong>the</strong> signal coming from an unknown transmitter has been intercepted.<br />

The received signal is corrupted by an unknown propagation channel. The aim is to<br />

demo<strong>du</strong>late <strong>the</strong> received signal in order to recover <strong>the</strong> transmitted data and to estimate <strong>the</strong> value<br />

of <strong>the</strong> technical parameters used by <strong>the</strong> transmitter. In order to achieve attractive per<strong>for</strong>mance in<br />

terms of Bit Error Rate, our aim is to develop blind demo<strong>du</strong>lation approaches using approximate<br />

Maximum Likelihood methods. One of <strong>the</strong> main stake is to propose methods which are suitable<br />

to mo<strong>du</strong>lations with high spectral efficiency, that is, in <strong>the</strong> case where <strong>the</strong> size of <strong>the</strong> alphabet<br />

used by <strong>the</strong> transmitter is large (Aintercom project, I2E contract).<br />

12.2.4 Monte Carlo Methods<br />

Contributors O. Cappé, S. Clémençon, G. Fort, E. Moulines.<br />

Projects/Main events ANR project ADAP’MC (Adaptive Monte Carlo Methods); ANR project<br />

BigMC (Issues in large scale Monte Carlo)); Organization of <strong>the</strong> international workshop<br />

New directions in Monte Carlo Methods in Fleurance, 2007.<br />

The team has acquired a high reputation in <strong>the</strong> domain of Monte Carlo methods by working<br />

on sequential Monte Carlo methods or particles filtering, Markov chain Monte Carlo methods as<br />

well as so-called Population Monte Carlo. Its activity has a strong emphasis on methodological<br />

and <strong>the</strong>oretical developments in Monte Carlo methods.<br />

When applying Sequential Monte Carlo methods (SMC), a well-known problem is <strong>the</strong> degeneracy<br />

of <strong>the</strong> approximations intro<strong>du</strong>ced by <strong>the</strong> resampling steps. We obtained results on<br />

optimal sampling allocation [2465]. We also developed methods <strong>for</strong> statistical inference in Hidden<br />

Markov Models, which exploits <strong>the</strong> <strong>for</strong>getting properties of <strong>the</strong> conditional hidden chains<br />

[2445, 2408, 2412] [coll. with Univ. of Lund, Sweden; and Univ. of Jerusalem, Israël].<br />

The efficiency of <strong>the</strong> Markov chain Monte Carlo (MCMC) methods relies on <strong>the</strong> tuning of<br />

design parameters. New algorithms are based on self-tuning of <strong>the</strong> parameters on <strong>the</strong> fly without<br />

relying on a priori expert parameter tuning, thus yielding to adaptive MCMC algorithms. We<br />

225

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!