Concept

High Speed Packet Access

Publications associées (80)

Efficient polymer passivation of ligand-stripped nanocrystal surfaces

Water-dispersible, polymer-wrapped nanocrystals are highly sought after for use in biol. and chem., from nanomedicine to catalysis. The hydrophobicity of their native ligand shell, however, is a significant barrier to their aq. transfer as single particles ...

2012

Sampling of Sparse Channels with Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

The present paper proposes and studies an algorithm to estimate chan- nels with a sparse common support (SCS). It is a generalization of the classical sampling of signals with Finite Rate of Innovation (FRI) and thus called SCS-FRI. It is applicable to OFD ...

2011

Energy Saving and Capacity Gain of Micro Sites in Regular LTE Networks: Downlink Traffic Layer Analysis

Jean-Yves Le Boudec, Ramin Khalili, Teklemariam Tsegay Tesfay

We study the effect of deployment of low cost, low power micro base stations along with macro base stations on energy consumption and capacity of downlink LTE. [1] studied this problem, using spectral area efficiency as the performance metric. We show that ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Estimating Sparse MIMO Channels Having Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

We propose an algorithm (SCS-FRI) to estimate multipath channels with Sparse Common Support (SCS) based on Finite Rate of Inno- vation (FRI) sampling. In this setup, theoretical lower-bounds are derived, and simulation in a Rayleigh fading environment show ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Prioritized Distributed Video Delivery with Randomized Network Coding

Pascal Frossard, Nikolaos Thomos, Jakov Cakareski

We address the problem of prioritized video streaming over lossy overlay networks. We propose to exploit network path diversity via a novel Randomized Network Coding (RNC) approach that provides unequal error protection (UEP) to the packets conveying the v ...

2011

Exploiting the Path Propagation Time Differences in Multipath Transmission with FEC

Maciej Kurant

We consider a transmission of a delay-sensitive data stream (e. g., a video call) from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet ...

2011

Cognitive Radio Through Primary Control Feedback

Michael Christoph Gastpar

A fundamental problem in dynamic frequency reuse is that the cognitive radio is ignorant of the amount of interference it inflicts on the primary license holder. Policies that attempt to limit interference without the active participation of the primary ar ...

2011

Practical code design for compute-and-forward

Michael Christoph Gastpar

The Compute-and-Forward approach has been proven to be very beneficial for communication over Gaussian networks. While the theoretical results are promising, it is still not completely understood how to best apply this scheme in practice. The objective of ...

IEEE2011

Cross-Layer Based Analysis of Multi-Hop Wireless Networks

Tarik Tabet

In this work, we revisit classical packet radio networks with a modern treatment of physical-layer (PHY) procedures, medium-access (MAC) and geographic channel-driven routing protocols. Our network model assumes that nodes are randomly distributed on the p ...

2010

Neighbor discovery with reception status feedback to transmitters

Ramin Khalili

Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search