Publications related to Polar codes: Characterization of exponent, bounds, and constructions

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

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 ...

EPFL2024

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

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Yifei Shen, Yuqing Ren, Hassan Harb

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 ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

Andreas Peter Burg

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 ...

New York2023

Multiplicative chaos of the Brownian loop soup

Antoine Pierre François Jego, Titus Lupu

We construct a measure on the thick points of a Brownian loop soup in a bounded domain D

D

of the plane with given intensity theta>0

\theta >0

, which is formally obtained by exponentiating the square root of its occupation field. The measure is construct ...

WILEY2023

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

David Atienza Alonso, Giovanni Ansaloni, Grégoire Axel Eggermann, Marco Antonio Rios

State-of-the-art Artificial Intelligence (AI) algorithms, such as graph neural networks and recommendation systems, require floating-point computation of very large matrix multiplications over sparse data. Their execution in resource-constrained scenarios, ...

2023

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes; however, their imprecise statistical characterization can severely impair such ...

2023

Noncollinear DFT plus U and Hubbard parameters with fully relativistic ultrasoft pseudopotentials

Nicola Marzari, Luca Binci

The magnetic, noncollinear parametrization of Dudarev's DFT + U method is generalized to fully relativistic ultrasoft pseudopotentials. We present the definition of the DFT + U total energy functional and the calculation of forces and stresses in the case ...

College Pk2023

Symmetry in design and decoding of polar-like codes

Kirill Ivanov

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 ...

EPFL2022

On the Efficiency of Polar-Like Decoding for Symmetric Codes

Rüdiger Urbanke, Kirill Ivanov

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 ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

Compute–forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice ...

2022

Polar codes: Characterization of exponent, bounds, and constructions

Graph Chatbot

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

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

Multiplicative chaos of the Brownian loop soup

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Noncollinear DFT plus U and Hubbard parameters with fully relativistic ultrasoft pseudopotentials

Symmetry in design and decoding of polar-like codes

On the Efficiency of Polar-Like Decoding for Symmetric Codes

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

On the Efficiency of Polar-Like Decoding for Symmetric Codes

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

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

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

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Symmetry in design and decoding of polar-like codes

Multiplicative chaos of the Brownian loop soup

Noncollinear DFT plus U and Hubbard parameters with fully relativistic ultrasoft pseudopotentials