647 citations · 1.4k across the 61 of their papers we have counts for
40 papers · 1 filter
High-throughput Low-latency Hardware Implementation of BCH Decoders
Jasper Lagendijk, Wenqing Song, Yunus Can Gültekin +3
Two well-known decoding algorithms for BCH codes are conventional decoding, based on the Berlekamp-Massey algorithm in combination with Chien search, and direct decoding, which use…
Syndrome Adaptive Gain Control for Min-Sum Decoding of Quantum LDPC Codes
Hernan Cordova, Alexios Balatsoukas-Stimming, Yunus Can Gültekin +2
Min-Sum (MS) decoding is a popular low-complexity alternative to belief propagation (BP), retaining only the minimum incoming message magnitude during check-node (CN) processing, a…
On LLR Mismatch in Belief Propagation Decoding of Overcomplete QLDPC Codes
Hernan Cordova, Alexios Balatsoukas-Stimming, Gabriele Liga +2
Belief propagation (BP) decoding of quantum low density parity check (QLDPC) codes is often implemented using overcomplete stabilizer (OS) representations, where redundant parity c…
Lowering Error Floors for Hard Decision Decoding of OFEC Code
Jasper Lagendijk, Yunus Can Gültekin, Alexios Balatsoukas-Stimming +2
Stall patterns are known to cause an error floor in hard decision decoding of the OFEC code. We propose a novel stall pattern removal algorithm that lowers the error floor of state…
Generalized Restart Mechanism for Successive-Cancellation Flip Decoding of Polar Codes
Ilshat Sagitov, Charles Pillet, Alexios Balatsoukas-Stimming +1
Polar codes are a class of linear error-correction codes that have received a lot of attention due to their ability to achieve channel capacity in an arbitrary binary discrete memo…
Edge-Spreading Raptor-Like LDPC Codes for 6G Wireless Systems
Yuqing Ren, Leyu Zhang, Yifei Shen +4
Next-generation channel coding has stringent demands on throughput, energy consumption, and error rate performance while maintaining key features of 5G New Radio (NR) standard code…
A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation
Yuqing Ren, Hassan Harb, Yifei Shen +2
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 implementati…
Unrolled and Pipelined Decoders based on Look-Up Tables for Polar Codes
Pascal Giard, Syed Aizaz Ali Shah, Alexios Balatsoukas-Stimming +2
Unrolling a decoding algorithm allows to achieve extremely high throughput at the cost of increased area. Look-up tables (LUTs) can be used to replace functions otherwise implement…
Successive-Cancellation Flip Decoding of Polar Codes with a Simplified Restart Mechanism
Ilshat Sagitov, Charles Pillet, Alexios Balatsoukas-Stimming +1
Polar codes are a class of error-correcting codes that provably achieve the capacity of practical channels. The successive-cancellation flip (SCF) decoder is a low-complexity decod…
Recursive/Iterative unique Projection-Aggregation of RM codes
Marzieh Hashemipour-Nazari, Renate Debets, Kees Goossens +1
We describe recursive unique projection-aggregation (RUPA) decoding and iterative unique projection-aggregation (IUPA) decoding of Reed-Muller (RM) codes, which remove non-unique p…
High-Throughput Flexible Belief Propagation List Decoder for Polar Codes
Yuqing Ren, Yifei Shen, Leyu Zhang +4
Owing to its high parallelism, belief propagation (BP) decoding is highly amenable to high-throughput implementations and thus represents a promising solution for meeting the ultra…
Pipelined Architecture for Soft-decision Iterative Projection Aggregation Decoding for RM Codes
Marzieh Hashemipour-Nazari, Yuqing Ren, Kees Goossens +1
The recently proposed recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller codes has received significant attention as it provides near-ML decoding performance…
Multi-Factor Pruning for Recursive Projection-Aggregation Decoding of RM Codes
Marzieh Hashemipour-Nazari, Kees Goossens, Alexios Balatsoukas-Stimming
The recently introduced recursive projection aggregation (RPA) decoding method for Reed-Muller (RM) codes can achieve near-maximum likelihood (ML) decoding performance. However, it…
Reducing the Error Floor of the Sign-Preserving Min-Sum LDPC Decoder via Message Weighting of Low-Degree Variable Nodes
Lotte Paulissen, Alex Alvarado, Kaiquan Wu +1
Some low-complexity LDPC decoders suffer from error floors. We apply iteration-dependent weights to the degree-3 variable nodes to solve this problem. When the 802.3ca EPON LDPC co…
A Sequence Repetition Node-Based Successive Cancellation List Decoder for 5G Polar Codes: Algorithm and Implementation
Yuqing Ren, Andreas Toftegaard Kristensen, Yifei Shen +3
Due to the low-latency and high-reliability requirements of 5G, low-complexity node-based successive cancellation list (SCL) decoding has received considerable attention for use in…
A Soft-Aided Staircase Decoder Using Three-Level Channel Reliabilities
Yi Lei, Bin Chen, Gabriele Liga +3
The soft-aided bit-marking (SABM) algorithm is based on the idea of marking bits as highly reliable bits (HRBs), highly unreliable bits (HUBs), and uncertain bits to improve the pe…
Hardware Implementation of Iterative Projection-Aggregation Decoding of Reed-Muller Codes
Marzieh Hashemipour-Nazari, Kees Goossens, Alexios Balatsoukas-Stimming
In this work, we present a simplification and a corresponding hardware architecture for hard-decision recursive projection-aggregation (RPA) decoding of Reed-Muller (RM) codes. In…
Implementation of a High-Throughput Fast-SSC Polar Decoder with Sequence Repetition Node
Haotian Zheng, Alexios Balatsoukas-Stimming, Zizheng Cao +1
Even though polar codes were adopted in the latest 5G cellular standard, they still have the fundamental problem of high decoding latency. Aiming at solving this problem, a fast si…
Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes
Haotian Zheng, Seyyed Ali Hashemi, Alexios Balatsoukas-Stimming +4
Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fa…
Improving HD-FEC decoding via bit marking
Alex Alvarado, Gabriele Liga, Yi Lei +2
We review the recently introduced soft-aided bit-marking (SABM) algorithm and its suitability for product codes. Some aspects of the implementation of the SABM algorithm are discus…
LDPC Coded Multiuser Shaping for the Gaussian Multiple Access Channel
Alexios Balatsoukas-Stimming, Stefano Rini, Joerg Kliewer
The joint design of input constellation and low-density parity-check (LDPC) codes to approach the symmetric capacity of the two-user Gaussian multiple access channel is studied. Mo…
Neural-Network Optimized 1-bit Precoding for Massive MU-MIMO
Alexios Balatsoukas-Stimming, Oscar Castañeda, Sven Jacobsson +2
Base station (BS) architectures for massive multi-user (MU) multiple-input multiple-output (MIMO) wireless systems are equipped with hundreds of antennas to serve tens of users on…
On the Computational Complexity of Blind Detection of Binary Linear Codes
Alexios Balatsoukas-Stimming, Aris Filos-Ratsikas
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 t…
Polar Coding for the Large Hadron Collider: Challenges in Code Concatenation
Alexios Balatsoukas-Stimming, Tomasz Podzorny, Jan Uythoven
In this work, we present a concatenated repetition-polar coding scheme that is aimed at applications requiring highly unbalanced unequal bit-error protection, such as the Beam Inte…