Embedded Rank Distance Codes for ISI channels

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.

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

The exponential growth in computing power and multimedia services has caused a tremendous increase in data traffic in recent years. This increase in data traffic brings a strong demand for data bandwidth of electrical input/output (I/O) links and pushes th ...

We start this short note by introducing two remarkable mathematical objects: the E8E8 root lattice Lambda8Lambda8 in 8-dimensional Euclidean space and the Leech lattice Lambda24Lambda24 in 24-dimensional space. These two lattices stand out among their lat ...

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

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

In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, ...

Sparse superposition codes, or sparse regression codes, constitute a new class of codes, which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are capacity-achieving over the A ...

In this work, we study the computational complexity of the Minimum Distance Code Detection problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which t ...

This paper presents a comparative study, analyzing the potentials of pulse amplitude modulation (PAM) for implementing next generation high-speed copper wireline links. This comparative study analyzes the sensitivities of PAM2, PAM4 and PAM8 to inter-symbo ...

Millimeter wave (mmWave) communication is a promising solution for coping with the ever-increasing mobile data traffic because of its large bandwidth. To enable a sufficient link margin, a large antenna array employing directional beamforming, which is ena ...

In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...

We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding tech ...

We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...

The exponential growth of Internet traffic and related demands for higher communication speed pushes processor-to-processor and processor-to-memory interconnects to provide further higher data-rate. Often time, processor-to-memory interconnectsâ speed is ...

Consider a binary linear code of length N, minimum distance d(min), transmission over the binary erasure channel with parameter 0 < epsilon < 1 or the binary symmetric channel with parameter 0 < epsilon < 1/2, and block-MAP decoding. It was shown by Tillic ...

This paper presents a parallel implementation technique of digital equalizer for high-speed wireline serial link receiver (RX). In wireline RX, inter-symbol interference (ISI) is mitigated by continuous-time linear equalizer, and the remaining ISI is cance ...

The performance of unipolar unicolor coded Brillouin optical time-domain analysis (BOTDA) is evaluated based on both Simplex and Golay codes. Four major detrimental factors that limit the system performance, including decoded-gain trace distortion, coding ...

Aside from intentional interference, multipath is the most significant error source for Global Navigation Satellite Systems (GNSS) receivers in many operational scenarios. In this thesis, we study the multipath estimation from two different perspectives: t ...

A time-division multiplexing (TDM) digital channel coding scheme with inter-symbol interference (ICI) reduction property for multi-drop memory interfaces has been proposed. Shaping the TX spectrum to avoid channel frequency notches, the proposed digital TD ...

Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they have an explici ...

Embedded Rank Distance Codes for ISI channels

Chattez avec Graph Search

Symmetry in design and decoding of polar-like codes

Energy-Efficient Design Techniques for High-Speed Wireline Serial Links

Almost impossible E_8 and Leech lattices

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Network coded multipath and related techniques

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Universal Sparse Superposition Codes With Spatial Coupling and GAMP Decoding

On the Computational Complexity of Blind Detection of Binary Linear Codes

ISI Sensitivity of PAM Signaling for Very High-Speed Short-Reach Copper Links

Feedback-Aware Precoding for Millimeter Wave Massive MIMO Systems

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

A New Coding Paradigm for the Primitive Relay Channel

Compute–Forward Multiple Access (CFMA): Practical Implementations

Multi-Tone Signaling and ADC-Based Digital Receiver for High-Speed Wireline Serial Links

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Parallel Implementation Technique of Digital Equalizer for Ultra-High-Speed Wireline Receiver

Design rules for optimizing unipolar coded Brillouin optical time-domain analyzers

Parameter Estimation with GNSS-Reflectometry and GNSS Synthetic Aperture Techniques

A Time-Division Multiplexing Signaling Scheme for Inter-Symbol/Channel Interference Reduction in Low-Power Multi-Drop Memory Links

PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes