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.
Shannon's separation theorem gives a conceptually and practically appealing way to construct an optimal communication system in two independent steps, namely source compression and channel coding. However, sometimes it is worth considering {\em joint} sour ...
This chapter is a review of multiresolution source and channel coding techniques as applicable in wireless transmission. The focus is on image and video compression and transmission. Section 1 gives an introduction and a review of the separation principle ...
Wireless location finding is gaining considerable attention in the field of wireless communications. This is due to a recent USA government mandate for wireless service providers to locate users in emergency situations within a high precision. In this pape ...
The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete ...
Infrastructure-based mobile-positioning is receiving increasing attention in the field of wireless communications. This is is due to an order issued by the Federal Communications Commission (FCC) that mandates all wireless service providers to locate an em ...
This paper addresses the problem of channel tracking and equalization in frequency-selective fading channels. Low-order autoregressive models approximate the channel taps, where each tap is a circular complex Gaussian random process with the typical U-shap ...
In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that opt ...
A capacity-achieving sequence of degree distributions for the erasure channel is, roughly speaking, a sequence of degree distributions such that graphs sampled uniformly at random satisfying those degree constraints lead to codes that perform arbitrarily c ...
The theory and practice of digital communication during the past 50 years has been strongly influenced by Shannon's separation theorem. While it is conceptually and practically appealing to separate source from channel coding, either step requires infinite ...
We design sequences of low-density parity check codes that provably perform at rates extremely close to the Shannon capacity. These codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. We further show ...
