18 citations · 55 across the 19 of their papers we have counts for
13 papers · 1 filter
Robust Performance Over Changing Intersymbol Interference Channels by Spatial Coupling
Mgeni Makambi Mashauri, Alexandre Graell i Amat, Michael Lentmaier
We show that spatially coupled low-density parity-check (LDPC) codes yield robust performance over changing intersymbol interfere (ISI) channels with optimal and suboptimal detecto…
Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation
Hanwen Yao, Waleed Abu Laban, Christian Häger +2
Quantum low-density parity-check (QLDPC) codes have emerged as a promising technique for quantum error correction. A variety of decoders have been proposed for QLDPC codes and many…
Rateless Autoencoder Codes: Trading off Decoding Delay and Reliability
Vukan Ninkovic, Dejan Vukobratovic, Christian Häger +2
Most of today's communication systems are designed to target reliable message recovery after receiving the entire encoded message (codeword). However, in many practical scenarios,…
Generalized Spatially-Coupled Parallel Concatenated Codes With Partial Repetition
Min Qiu, Xiaowei Wu, Jinhong Yuan +1
A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed…
On Doped SC-LDPC Codes for Streaming
Roman Sokolovskii, Alexandre Graell i Amat, Fredrik Brännström
In streaming applications, doping improves the performance of spatially-coupled low-density parity-check (SC-LDPC) codes by creating reduced-degree check nodes in the coupled chain…
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding
Mustafa Cemil Coşkun, Gianluigi Liva, Alexandre Graell i Amat +2
A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to…
Refined Reliability Combining for Binary Message Passing Decoding of Product Codes
Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva +1
We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named iterative bounded distance decoding with combined reliability (iBD…
On Product Codes with Probabilistic Amplitude Shaping for High-Throughput Fiber-Optic Systems
Alireza Sheikh, Alexandre Graell i Amat, Alex Alvarado
Probabilistic amplitude shaping (PAS) can flexibly vary the spectral efficiency (SE) of fiber-optic systems. In this paper, we demonstrate the application of PAS to bit-wise hard d…
Improving the Decoding Threshold of Tailbiting Spatially Coupled LDPC Codes by Energy Shaping
Thomas Jerkovits, Gianluigi Liva, Alexandre Graell i Amat
We show how the iterative decoding threshold of tailbiting spatially coupled (SC) low-density parity-check (LDPC) code ensembles can be improved over the binary input additive whit…
MDS-Coded Distributed Caching for Low Delay Wireless Content Delivery
Amina Piemontese, Alexandre Graell i Amat
We investigate the use of maximum distance separable (MDS) codes to cache popular content to reduce the download delay of wireless content delivery. In particular, we consider a ce…
Optimizing MDS Coded Caching in Wireless Networks with Device-to-Device Communication
Jesper Pedersen, Alexandre Graell i Amat, Iryna Andriyanova +1
We consider the caching of content in the mobile devices in a dense wireless network using maximum distance separable (MDS) codes. We focus on an area, served by a base station (BS…
On Frame Asynchronous Coded Slotted ALOHA: Asymptotic, Finite Length, and Delay Analysis
Erik Sandgren, Alexandre Graell i Amat, Fredrik Brännström
We consider a frame asynchronous coded slotted ALOHA (FA-CSA) system for uncoordinated multiple access, where users join the system on a slot-by-slot basis according to a Poisson r…
Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates
Christian Häger, Henry D. Pfister, Alexandre Graell i Amat +1
Generalized product codes (GPCs) are extensions of product codes (PCs) where code symbols are protected by two component codes but not necessarily arranged in a rectangular array.…