Publication

User Selection Methods for Multiuser Two-Way Relay Communications Using Space Division Multiple Access

Publications associées (32)

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

Simple schedules for half-duplex networks

Christina Fragouli, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoid ...

Ieee2012

Bounds on the Sum Capacity of Synchronous Binary CDMA Channels

Pedram Pad, Vahid Aref

In this paper, we obtain a family of lower bounds for the sum capacity of code-division multiple-access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this ...

Institute of Electrical and Electronics Engineers2009

An Analytical Model for the Contention Access Period of the Slotted IEEE 802.15.4 with Service Differentiation

Giovanni De Micheli, Nadia Khaled, Eugène David Ngangue Ndih

The IEEE 802.15.4 standard is poised to become the global standard for low data rate, low energy consumption wireless sensor networks (WSN). By assigning the same sets of contention access parameters for all data frames and nodes, the contention access per ...

2009

Sufficient-Statistics Based Multiple Access over Wireless Fading Channels

Michael Christoph Gastpar

In this work, we study a communication scheme in which nodes transmit sufficient statistics of their observations over non-orthogonal medium access channels for distributed estimation. This scheme unifies and generalizes several multiple access schemes suc ...

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

Achievable Flows on Orthogonal Information Networks

Dinkar Vasudevan

We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access ...

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

Delay and coding in multiple-user communications

Stéphane Musy

In multiple-user communications, the bursty nature of the packet arrival times cannot be divorced from the analysis of the transmission process. However, in traditional information theory the random arrival times are smoothed out by appropriated source cod ...

EPFL2007

On the Capacity of a Code Division Multiple Access System

Nicolas Macris, Satish Babu Korada

We consider multiuser communication on a binary input additive white Gaussian noise channel using Randomly Spread-Code Division Multiple Access. We show concentration of various quantities of the system including the capacity and the free energy. We also o ...

2007

Closing the gap in the capacity of random wireless networks via percolation theory

Patrick Thiran, Olivier Dousse

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the ...

2007

On the concentration of the capacity for a code division multiple access system

Nicolas Macris, Satish Babu Korada

We prove the concentration of the capacity, in the large system limit, for a code division multiple access system over an additive white Gaussian noise channel, with Gaussian signature sequences and {\it binary input} symbols. The probabilistic tools that ...

2007

On cooperation via noisy feedback

Michael Christoph Gastpar

An upper bound is established on the usefulness of noisy feedback for the two-user multiple-access channel (MAC). The bound generalizes a dependence-balance argument developed by Hekstra and Willems for the common-output two-way channel and the MAC with no ...

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