Concept

Channel access method

Publications associées (300)

Polar codes for the m-user multiple access channel and matroids

In this paper, a polar code for the m-user multiple access channel (MAC) with binary inputs is constructed. In particular, Arıkan’s polarization technique applied individually to each user will polarize any m-user binary input MAC into a finite collection ...

2010

Polar coding: a brief tour

Emre Telatar

Arikan's 'polar coding' is a technique to achieve the symmetric capacity of binary input memoryless channels. In this talk I will attempt to describe this technique, and briefly discuss its extensions to q-ary input channels, multiple access channels and r ...

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

Throughput-Delay Tradeoff for Hierarchical Cooperation in Ad Hoc Wireless Networks

Olivier Lévêque, Ayfer Özgür Aydin

Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme turns out to be s ...

Institute of Electrical and Electronics Engineers2010

Distance Bounding with IEEE 802.15.4a: Attacks and Countermeasures

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski, Manuel Flury

Impulse Radio Ultra-Wideband, in particular the recent standard IEEE 802.15.4a, is a primarycandidate for implementing distance bounding protocols, thanks to its ability to perform accurate indoor ranging. Distance bounding protocols allow two wireless dev ...

2010

Multiuser Two-Way Amplify-and-Forward Relay Processing and Power Control Methods for Beamforming Systems

Ali H. Sayed

In this paper, multiple-input multiple-output (MIMO) relay transceiver processing is proposed for multiuser two-way relay communications. The relay processing is optimized based on both zero-forcing (ZF) and minimum mean-square-error (MMSE) criteria under ...

IEEE2010

Double Sparsity: Towards Blind Estimation of Multiple Channels

Rémi Gribonval

We propose a framework for blind multiple filter estimation from convolutive mixtures, exploiting the time-domain sparsity of the mixing filters and the disjointness of the sources in the time-frequency domain. The proposed framework includes two steps: (a ...

Springer-Verlag's2010

Very High Density Microelectrode Array with Monolithically Integrated Readout Circuits

Alexandre Schmid, Yusuf Leblebici, Neil Joye, Sedigheh Hashemi

This paper presents the hardware realization and modeling of high-density microelectrode arrays including both microelectronic readout amplifiers as well as three-dimensional microelectrodes forming a fully integrated CMOS compatible system enabling resear ...

2010

Design of half- and full-duplex relay systems based on the MMSE formulation

Ali H. Sayed

In this paper, half- and full-duplex relay processing matrices and source-destination beamforming vectors are jointly optimized based on a minimum mean-square-error (MMSE) formulation under inequality constraints on the transmit power of the source and the ...

IEEE2009

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

The Interference-Multiple-Access Channel

Emre Telatar, Suhas Diggavi, Etienne Perron

We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the o ...

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

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