Accueil

Pascal Bianchi

  1. High-Rate Vector Quantization for the Neyman-Pearson Detection of Correlated Processes.

    Mon, 05/03/2010 - 15:01 — SomNambul
    Authors: Pascal Bianchi, Joffrey Villard
    Subjects: Information Theory
    Abstract

    This paper investigates the effect of quantization on the performance of the
    Neyman-Pearson test. We assume that a sensing unit observes samples of a
    correlated stationary ergodic multivariate process. Each sample is passed
    through an N-point quantizer and transmitted to a decision device which
    performs a binary hypothesis test. For any false alarm level, it is shown that
    the miss probability of the Neyman-Pearson test converges to zero exponentially
    as the number of samples tends to infinity, assuming that certain mixing
    conditions are satisfied by the observed process.

  2. Nearly Optimal Resource Allocation for Downlink OFDMA in 2-D Cellular Networks.

    Tue, 03/16/2010 - 16:01 — SomNambul
    Authors: Nassar Ksairi, Philippe Ciblat, Pascal Bianchi
    Subjects: Information Theory
    Abstract

    In this paper, we propose a resource allocation algorithm for the downlink of
    sectorized two-dimensional (2-D) OFDMA cellular networks assuming statistical
    Channel State Information (CSI) and fractional frequency reuse. The proposed
    algorithm can be implemented in a distributed fashion without the need to any
    central controlling units. Its performance is analyzed assuming fast fading
    Rayleigh channels and Gaussian distributed multicell interference.

  3. High-Rate Quantization for the Neyman-Pearson Detection of Hidden Markov Processes.

    Tue, 03/16/2010 - 16:01 — SomNambul
    Authors: Pascal Bianchi, Eric Moulines, Pablo Piantanida, Joffrey Villard
    Subjects: Information Theory
    Abstract

    This paper investigates the decentralized detection of Hidden Markov
    Processes using the Neyman-Pearson test. We consider a network formed by a
    large number of distributed sensors. Sensors' observations are noisy snapshots
    of a Markov process to be detected. Each (real) observation is quantized on
    log2(N) bits before being transmitted to a fusion center which makes the final
    decision. For any false alarm level, it is shown that the miss probability of
    the Neyman-Pearson test converges to zero exponentially as the number of
    sensors tends to infinity.

  4. Neyman-Pearson Detection of a Gaussian Source using Dumb Wireless Sensors.

    Wed, 01/27/2010 - 16:01 — SomNambul
    Authors: Pascal Bianchi, Francois Roueff, Jeremie Jakubowicz
    Subjects: Information Theory
    Abstract

    We investigate the performance of the Neyman-Pearson detection of a
    stationary Gaussian process in noise, using a large wireless sensor network
    (WSN). In our model, each sensor compresses its observation sequence using a
    linear precoder. The final decision is taken by a fusion center (FC) based on
    the compressed information. Two families of precoders are studied: random iid
    precoders and orthogonal precoders.

  5. Performance of Statistical Tests for Source Detection using Random Matrix Theory.

    Tue, 10/06/2009 - 17:01 — SomNambul
    Authors: Pascal Bianchi, Merouane Debbah, Mylène Maïda, Jamal Najim
    Subjects: Probability
    Abstract

    This paper introduces a unified framework for the detection of a source with
    a sensor array in the context where the noise variance and the channel between
    the source and the sensors are unknown at the receiver.

  6. Performance Analysis over Slow Fading Channels of a Half-Duplex Single-Relay Protocol: Decode or Quantize and Forward.

    Mon, 08/31/2009 - 17:16 — SomNambul
    Authors: Nassar Ksairi, Philippe Ciblat, Pascal Bianchi, Walid Hachem
    Subjects: Information Theory
    Abstract

    In this work, a new static relaying protocol is introduced for half duplex
    single-relay networks, and its performance is studied in the context of
    communications over slow fading wireless channels. The proposed protocol is
    based on a Decode or Quantize and Forward (DoQF) approach. In slow fading
    scenarios, two performance metrics are relevant and complementary, namely the
    outage probability gain and the Diversity-Multiplexing Tradeoff (DMT).

  7. Resource Allocation for Downlink Cellular OFDMA Systems: Part I - Optimal Allocation.

    Mon, 08/31/2009 - 17:16 — SomNambul
    Authors: Nassar Ksairi, Philippe Ciblat, Pascal Bianchi, Walid Hachem
    Subjects: Information Theory
    Abstract

    In this pair of papers (Part I and Part II in this issue), we investigate the
    issue of power control and subcarrier assignment in a sectorized two-cell
    downlink OFDMA system impaired by multicell interference. As recommended for
    WiMAX, we assume that the first part of the available bandwidth is likely to be
    reused by different base stations (and is thus subject to multicell
    interference) and that the second part of the bandwidth is shared in an
    orthogonal way between the different base stations (and is thus protected from
    multicell interference).

  8. Resource Allocation for Downlink Cellular OFDMA Systems: Part II - Practical Algorithms and Optimal Reuse Factor.

    Mon, 08/31/2009 - 17:16 — SomNambul
    Authors: Nassar Ksairi, Pascal Bianchi, Walid Hachem, Phiippe ciblat
    Subjects: Information Theory
    Abstract

    In a companion paper, we characterized the optimal resource allocation in
    terms of power control and subcarrier assignment, for a downlink sectorized
    OFDMA system. In our model, the network is assumed to be one dimensional for
    the sake of analysis. We also assume that a certain part of the available
    bandwidth is likely to be reused by different base stations while that the
    other part of the bandwidth is shared in an orthogonal way between these base
    stations.

Math-arch

Syndicate content