Concept

Evolution-Data Optimized

Publications associées (36)

Comparison of multi-cell multi-antenna CDMA and TDMA systems

We evaluate system capacities for multicellular systems with different multiple access strategies. The interference from another cell sharing the same frequency is calculated, and the total interference arising from the frequency reuse pattern is evaluated ...

2004

Exploiting spatio-temporal correlation for rate-efficient transmit beamforming

Ali H. Sayed

With multiple antennas at the transmitter, either space-time block coding or beamforming can be used as the transmission scheme depending on the availability of channel state information at the transmitter. Although beamforming can provide superior perform ...

IEEE2004

Power Control is Not Required for Wireless Networks in the Linear Regime

Jean-Yves Le Boudec

We consider the design of optimal strategies for joint power adaptation, rate adaptation and scheduling in a multi-hop wireless network. Most existing strategies control either power and scheduling, or rates and scheduling, but not the three together as we ...

2004

Scalable position-based multicast for mobile ad-hoc networks

Jörg Widmer

In this paper we present Scalable Position-Based Multicast (SPBM), a multicast routing protocol for ad-hoc networks. SPBM uses the geographic position of nodes to provide a highly scalable group membership scheme and to forward data packets with a very low ...

2004

Folded shift multiplexing

Demetri Psaltis, Wei Liu

Shift multiplexing is a holographic recording method that uses a spherical reference wave. We extend the principle to a thin slab of holographic material that acts as a waveguide. Total internal reflection folds the reference spherical beam in one dimensio ...

2003

Fresh Packet First Scheduling for Voice Traffic in Congested Networks

Jean-Pierre Hubaux

The following invention disclosure is generally concerned with transmission of data in congested networks and more specifically concerned with a fresh packet first technique of scheduling data packets for interactive applications ...

1998

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