Concept

Low (complexity)

Publications associées (109)

Compute-and-Forward: Finding the Best Equation

Michael Christoph Gastpar, Saeid Sahraei

Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optim ...

2014

Compressed Sensing of Memoryless Sources

Saeid Haghighatshoar

Compressed sensing is a new trend in signal processing for efficient sampling and signal acquisition. The idea is that most real-world signals have a sparse representation in an appropriate basis and this can be exploited to capture the sparse signal by ta ...

EPFL2014

Kinematic primitives for walking and trotting gaits of a quadruped robot with compliant legs

Auke Ijspeert, Alexander Spröwitz, Mostafa Ajallooeian, Alexandre Tuleu

In this work we research the role of body dynamics in the complexity of kinematic patterns in a quadruped robot with compliant legs. Two gait patterns, lateral sequence walk and trot, along with leg length control patterns of different complexity were impl ...

Frontiers Research Foundation2014

Audiovisual focus of attention and its application to Ultra High Definition video compression

Touradj Ebrahimi, Martin Rerabek, Jong Seok Lee, Hiromi Nemoto

Using Focus of Attention (FoA) as a perceptual process in image and video compression belongs to well-known approaches to increase coding efficiency. It has been shown that foveated coding, when compression quality varies across the image according to regi ...

SPIE2014

Ultra low power design of hardware efficient CS-Based compression scheme in WBSN

David Atienza Alonso, Pierre Vandergheynst, Hossein Mamaghanian

Ultra-low power optimization is a challenging research topic in the de- sign of the sensor front-ends, especially in the area of Wireless Body Sensor Nodes (WBSN), where a limited amount of power and hardware resources are available. In this talk, I analyz ...

2014

Universal Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani

Polar codes, invented by Arikan in 2009, are known to achieve the capacity of any binary-input memoryless outputsymmetric channel. Further, both the encoding and the decoding can be accomplished in O(N log(N)) real operations, where N is the blocklength. O ...

Ieee2014

Synthesizing robust systems

Barbara Jobstmann

Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if ass ...

Springer2014

Estimating reliability of blood glucose concentration predictions in patients with type 1 diabetes mellitus

Denis Gillet, Grégory François, Alain Bock

Blood glucose concentrations of patients with type 1 diabetes mellitus are subject to very high inter- and intra-patient variability. This variability may be detrimental to the reliability of the treatment, thus resulting in potentially frequent hypo- or h ...

Elsevier2014

On Self-interference Suppression Methods for Low-complexity Full-duplex MIMO

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Pavle Belanovic, Konstantinos Alexandris

Full-duplex wireless communication offers improved spectral efﬁciency, as well as more efﬁcient relaying and medium access, but requires suppression of self-interference. In this paper we analyze the existing methods for active RF suppression and use the ” ...

2013

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Christina Fragouli, Efe Onaran

We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of

N

users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent ...

2013

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

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Christina Fragouli, Efe Onaran

We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of

N

users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent ...

2013