Concept

Universal Mobile Telecommunications System

Publications associées (97)

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

Towards integrating Quantize-Map-Forward relaying into LTE

Christina Fragouli, Suhas Diggavi, Emre Atsan

We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme [1] into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and resul ...

Ieee2012

Coded SC-FDMA for broadband satellite return links

Stefano Rosati

In this paper we deal with Single Carrier Frequency Division Multiple Access (SC-FDMA) as uplink air interface of broadband satellite networks. Interestingly, SC-FDMA enables a significant increase of the spectral efficiency with respect to the state-of-th ...

Ieee Computer Soc2012

Correlation-aware Resource Allocation in Multi-Cell Networks

Pascal Frossard, Dorna Bandari

We propose a cross-layer strategy for resource allocation between spatially correlated sources in the uplink of multi-cell FDMA networks. Our objective is to find the optimum power and channel allocation to the different sources, in order to minimize the m ...

Institute of Electrical and Electronics Engineers2012

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

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

ACCOP: Adaptive Cost-Constrained and Delay-Optimized Data Allocation over Parallel Opportunistic Networks

Hamza Harkous

As wireless and mobile technologies are becoming increasingly pervasive, an uninterrupted connectivity in mobile devices is becoming a necessity rather than a luxury. When dealing with challenged networking environments, this necessity becomes harder to ac ...

2011

ACCOP: Adaptive Cost-Constrained and Delay- Optimized Data Allocation over Parallel Opportunistic Networks

Hamza Harkous

2011

Graph-based codes for quantize-map-and-forward relaying

Christina Fragouli, Suhas Diggavi, Ayfer Özgür Aydin, Siddhartha Brahma, Ayan Sengupta

We present a structured Quantize-Map-and- Forward (QMF) scheme for cooperative communication over wireless networks, that employs LDPC ensembles for the node operations and message-passing algorithms for decoding. We demonstrate through extensive simulatio ...

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

Channel State Feedback Over the MIMO-MAC

Krishna Kumar

In order to exploit the full multiplexing gain of multi-antenna multi-user downlink schemes, accurate channel state information at the transmitter (i.e., at the base station) is required. We consider the design of a closed-loop channel state information fe ...

2011

Line and Lattice Networks Under Deterministic Interference Models

Michael Christoph Gastpar, Jasper Goseling

Capacity bounds are compared for four different deterministic models of wireless networks, representing four different ways of handling broadcast and superposition in the physical layer. In particular, the transport capacity under a multiple unicast traffi ...

2011