Concept

Capacité d'un canal

Publications associées (454)

Bringing Stability to Wireless Mesh Networks

Wireless mesh networks were designed as a mean to rapidly deliver large-scale communication capabilities without the support of any prior infrastructure. Among the different properties of mesh networks, the self-organizing feature is particularly interesti ...

EPFL2011

Universal Rateless Codes From Coupled LT Codes

Rüdiger Urbanke, Vahid Aref

It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We study the performanc ...

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

Mitigating interference with integer-forcing architectures

Michael Christoph Gastpar

We show that the recently proposed integer-forcing linear receiver provides an attractive approach to the problem of mitigating external interference in MIMO channels. The integer-forcing receiver proceeds by first decoding a set of full rank integer linea ...

IEEE2011

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

Tools for brain-computer interaction: a general concept for a hybrid BCI

José del Rocio Millán Ruiz, Robert Leeb, Luca Tonin, Michele Tavella

The aim of this work is to present the development of a hybrid Brain-Computer Interface (hBCI) which combines existing input devices with a BCI. Thereby, the BCI should be available if the user wishes to extend the types of inputs available to an assistive ...

Frontiers Research Foundation2011

Coding in the Presence of Semantic Value of Information: Unequal Error Protection Using Poset Decoders

In this work we explore possibilities for coding when information worlds have different (semantic) values. We introduce a loss function that expresses the overall performance of a coding scheme for discrete channels and exchange the usual goal of minimizin ...

2011

Workshop: Next-Generation Fibers for High Capacity Transmission—Radical Solutions

Hans Georg Limberger

Driven by the exponentially growing demand for capacity, it is already apparent that the next generation of telecommunication networks will be radically different from previous implementations; coherent detection along with powerful digital signal processi ...

2011

Array-Code Ensembles -or- Two-Dimensional LDPC Codes

Mohammad Amin Shokrollahi, Yuval Cassuto

Probabilistic construction of codes on two-dimensional arrays is proposed and analyzed. Instead of a pure combinatorial erasure model used in traditional array codes, we propose a mixed combinatorial-probabilistic model of limiting the number of column fai ...

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

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

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