Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Most space-time coding schemes can be classified either as non-coherent or coherent. In this paper we prove that optimal non-coherent decoding can always be decomposed into a channel estimation step followed by coherent decoding step. Surprisingly the requ ...
Most space-time coding schemes can be classified either as non-coherent (decoding is performed without forming an explicit channel estimate) or coherent (decoding is performed conditioned upon a channel estimate as if it were the actual channel realisation ...
Most space-time coding schemes can be classified either as non-coherent (decoding is performed without forming an explicit channel estimate) or coherent (decoding is performed conditioned upon a channel estimate as if it were the actual channel realisation ...
We present a joint PHY/MAC architecture (DCC-MAC) for 802.15.4a-like networks based on PPM-UWB. Unlike traditional approaches it fully utilizes the specific nature of UWB to achieve high rates at low protocol complexity. It is the first MAC protocol that a ...
Communication over unknown discrete memoryless channels with instantaneous and perfect feedback is considered. For a given set of channels we define a notion of optimal coding schemes in terms of achievable rate and error exponent, and prove the existence ...
We propose a MAC protocol for very low radiated power (1 microwatt) ultra-wide band (UWB) mobile ad-hoc networks. Unlike traditional approaches, our protocol fully utilizes the specific nature of the physical layer of UWB. This makes it possible to reach a ...
Communication over unknown discrete memoryless channels with instantaneous and perfect feedback is considered. For a given set of channels we define a notion of optimal coding schemes in terms of achievable rate and error exponent, and prove the existence ...
We present sampling results for certain classes of two-dimensional signals that are not bandlimited, but have a parametric representation with a finite number of degrees of freedom. While there are many such parametric signals, it is often difficult to pro ...
We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correlations is formulated by a recursive expression, which makes it easier to calc ...
We study coding over a class of two-user broadcast channels with additive white Gaussian noise and fading known at the receivers only. Joint decoding of low-density parity-check codes is analyzed. The message update rule at the mapping node linking the use ...