Capacité d'un canal

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding

Andreas Peter Burg, Mohammad Rowshan

In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arikan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are called po ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Differential Entropy of the Conditional Expectation under Gaussian Noise

Michael Christoph Gastpar, Alper Köse, Ahmet Arda Atalik

This paper considers an additive Gaussian noise channel with arbitrarily distributed finite variance input signals. It studies the differential entropy of the minimum mean-square error (MMSE) estimator and provides a new lower bound which connects the diff ...

IEEE2021

Modified Joint Channel-and-Data Estimation for One-Bit Massive MIMO

Saeed Saadatnejad, Mohammadhossein Bahari, Mahdi Amiri

Centralized and cloud computing-based network architectures are the promising tracks of future communication systems where a large scale compute power can be virtualized for various algorithms. These architectures rely on high-performance communication lin ...

IEEE2021

TID Degradation Mechanisms in 16-nm Bulk FinFETs Irradiated to Ultrahigh Doses

Christian Enz

This article investigates the total ionizing dose (TID) degradation mechanisms of 16-nm bulk Si FinFETs at ultrahigh doses. n- and p-FinFETs with several channel lengths are irradiated up to 1 Grad(SiO2) and then annealed for 24 h at 100 degrees C. Irradia ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

On the Universality of Low-Density Parity-Check Block Codes

Rüdiger Urbanke, Wei Liu

An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this pape ...

IEEE2020

Sampling and Reconstruction of Bandlimited Signals with Multi-Channel Time Encoding

Martin Vetterli, Karen Adam, Adam James Scholefield

Sampling is classically performed by recording the amplitude of the input at given time instants; however, sampling and reconstructing a signal using multiple devices in parallel becomes a more difficult problem to solve when the devices have an unknown sh ...

2020

Supply-Power-Constrained Cable Capacity Maximization Using Multi-Layer Neural Networks

Erixhen Sula

We experimentally solve the problem of maximizing capacity under a total supply power constraint in a massively parallel submarine cable context, i.e., for a spatially uncoupled system in which fiber Kerr nonlinearity is not a dominant limitation. By using ...

IEEE Institute of Electrical and Electronics Engineers2020

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Emmanuel Abbé, Min Ye

We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Coded LoRa Frame Error Rate Analysis

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Orion Afisiadis

In this work, we study the coded frame error rate (FER) of LoRa under additive white Gaussian noise (AWGN) and under carrier frequency offset (CFO). To this end, we use existing approximations for the bit error rate (BER) of the LoRa modulation under AWGN ...

IEEE2020

Network coded multipath and related techniques

Emre Telatar, Arno Schneuwly, Derya Malak

Techniques are disclosed for adaptive coding and scheduling of packets in wireless networks. The adaptive coding and scheduling can be achieved by utilizing a discrete water filling (DWF) scheme. In an example, a computer-implemented method to adaptively c ...

2020

Page 2 sur 2