Concept

Channel 4

Publications associées (18)

Automatic Call Sign Detection: Matching Air Surveillance Data with Air Traffic Spoken Communications

Voice communication is the main channel to exchange information between pilots and Air-Traffic Controllers (ATCos). Recently, several projects have explored the employment of speech recognition technology to automatically extract spoken key information suc ...

MDPI2021

Scanning Tunneling Spectroscopy with Superconducting Junctions

Jacob Senkpiel

This thesis contains two major topics, the restriction of tunneling to only a few channels in the scanning tunneling microscope (STM) and the interaction of local magnetic impurities with superconductivity. At a temperature of 15mK, the quantum back-action ...

EPFL2018

From Polar to Reed-Muller Codes

Marco Mondelli

The year 2016, in which I am writing these words, marks the centenary of Claude Shannon, the father of information theory. In his landmark 1948 paper "A Mathematical Theory of Communication", Shannon established the largest rate at which reliable communica ...

EPFL2016

3D T 2-weighted imaging at 7T using dynamic kT-points on single-transmit MRI systems

Rolf Gruetter, José Pedro Rebelo Ferreira Marques, Daniel Gallichan, Kieran O'Brien, Florent Eggenschwiler

OBJECTIVES: For turbo spin echo (TSE) sequences to be useful at ultra-high field, they should ideally employ an RF pulse train compensated for the B 1 + inhomogeneity. Previously, it was shown that a single kT-point pulse designed in the small tip-angle re ...

Springer Verlag2016

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

This paper presents polar coding schemes for the two-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is tight for all clas ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset uppe ...

Ieee2012

Broadcasting Nested Message Sets

Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

In this paper, we take a deterministic approach to the problem of broadcasting nested message sets. We mainly consider the scenario where a common message and a private message are to be encoded into a signal and transmitted over a broadcast channel toward ...

2012

Local volume depletion/accumulation in GAA Si nanowire junctionless nMOSFETs

Mihai Adrian Ionescu, Jean-Michel Sallese, Wladyslaw Grabinski, Mohammad Najmzadeh, Matthieu Berthomé

In this paper, we report, for the first time, corner effect analysis in the gate-all-around equilateral triangular silicon nanowire (NW) junctionless (JL) nMOSFETs, from subthreshold to strong accumulation regime. Corners were found to accumulate and deple ...

Institute of Electrical and Electronics Engineers2012

Feedback-based coding algorithms for broadcast erasure channels with degraded message sets

Christina Fragouli, Shirin Saeedi Bidokhti

We consider single-hop broadcast packet erasure channels (BPEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual-queue-based algorithms in [1], which were ...

2012

Feedback-based Coding Algorithms for Braodcast Erasure Channels with Degraded Message Sets

Christina Fragouli

2012

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