CFMA (Compute-Forward Multiple Access) and its Applications in Network Information Theory

Chat with Graph Search

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.

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range of all 5G NR bl ...

Implanted medical devices (IMDs) have been widely developed to support the monitoring and recording of biological data inside the body or brain. Wirelessly powered IMDs, a subset of implantable electronics, have been proposed to eliminate the limitations r ...

Low-Density Parity-Check (LDPC) decoder is among the power hungry building blocks of wireless communication systems. Voltage scaling down to Near-Threshold (NT) voltages substantially improves energy efficiency, in theory up 10x. However, tuning the voltag ...

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

Artificial Neural Networks (ANN) are habitually trained via the back-propagation (BP) algorithm. This approach has been extremely successful: Current models like GPT-3 have O(10 11 ) parameters, are trained on O(10 11 ) words and produce awe-inspiring resu ...

The landscape of computing is changing, thanks to the advent of modern networking equipment that allows machines to exchange information in as little as one microsecond. Such advancement has enabled microsecond-scale distributed computing, where entire dis ...

In-network devices around the world monitor and tamper with connections for many reasons, including intrusion prevention, combating spam or phishing, and country-level censorship. Connection tampering seeks to block access to specific domain names or keywo ...

In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from ...

Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, given a source that produces a letter every T-s seconds and an erasure channel t ...

The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short blocklength regime. Short blocklengths are commonly employed in massively connected IoT sensor networks in 5G and beyond wireless systems. P ...

Locally correctable codes (LCCs) are error correcting codes C : \Sigmak \rightarrow \Sigman which admit local algorithms that correct any individual symbol of a corrupted codeword via a minuscule number of queries. For systematic codes, this notion is stro ...

Online services have become ubiquitous in technological society, the global demand for which has driven enterprises to construct gigantic datacenters that run their software. Such facilities have also recently become a substrate for third-party organizatio ...

Signalized intersections are a fundamental part of urban networks. Their understanding is crucial to identify congestion patterns, queues, delays, and safety issues in local and network level. In this work, we analyze multimodal vehicle trajectories and pr ...

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacity-achieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plo ...

Human voluntary movement stems from the coordinated activations in space and time of many musculoskeletal segments. However, the current methodological approaches to study human movement are still limited to the evaluation of the synergies among a few body ...

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

Decentralized signal control of congested traffic networks based on the Max-Pressure (MP) controller is theoretically proven to maximize throughput, stabilize the system and balance queues for single intersections under specific conditions. However, its pe ...

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether ...

CFMA (Compute-Forward Multiple Access) and its Applications in Network Information Theory

Chat with Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

Integrated Wireless Power, Data Communication, and Thermal Sensing System for Autonomous Multisite Brain Implants

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Artificial Neural Network Training on an Optical Processor via Direct Feedback Alignment

Reliable Microsecond-Scale Distributed Computing

Global, Passive Detection of Connection Tampering

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Optima Age Over Erasure Channels

Symmetry in design and decoding of polar-like codes

Secret Key Generation Using Short Blocklength Polar Coding Over Wireless Channels

Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity

Hardware and Software Support for RPC-Centric Server Architecture

An automatized signal timing detection at signalized intersections with detailed vehicle trajectory data

On the Efficiency of Polar-Like Decoding for Symmetric Codes

The kinectome: A comprehensive kinematic map of human motion in health and disease

A Functional Perspective on Information Measures

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!