We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up to 0.26 dB are achieved
We consider probabilistic amplitude shaping (PAS) as a means of flexibly varying the spectral effici...
We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder u...
We propose a novel soft-aided low-complexity decoder for product codes based on dynamic reliability ...
We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on t...
We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed alg...
We propose a novel binary message passing decoding algorithm for product-like codes based on bounded...
We propose a binary message passing decoding algorithm for product codes based on generalized minimu...
Product codes (PCs) protect a 2-D array of bits using short component codes. Assuming transmission o...
We introduce a novel soft-aided hard-decision decoder for product codes adopting bit marking via upd...
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance ...
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance ...
Products codes (PCs) are conventionally decoded with efficient iterative bounded-distance decoding (...
Product coding produces powerful long codes from short constituent codes. The conventional row-colum...
Iterative decoding of block codes is a rather old subjectthat regained much interest recently. The m...
We consider probabilistic amplitude shaping (PAS) as a means of flexibly varying the spectral effici...
We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder u...
We propose a novel soft-aided low-complexity decoder for product codes based on dynamic reliability ...
We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on t...
We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed alg...
We propose a novel binary message passing decoding algorithm for product-like codes based on bounded...
We propose a binary message passing decoding algorithm for product codes based on generalized minimu...
Product codes (PCs) protect a 2-D array of bits using short component codes. Assuming transmission o...
We introduce a novel soft-aided hard-decision decoder for product codes adopting bit marking via upd...
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance ...
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance ...
Products codes (PCs) are conventionally decoded with efficient iterative bounded-distance decoding (...
Product coding produces powerful long codes from short constituent codes. The conventional row-colum...
Iterative decoding of block codes is a rather old subjectthat regained much interest recently. The m...
We consider probabilistic amplitude shaping (PAS) as a means of flexibly varying the spectral effici...
We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder u...
We propose a novel soft-aided low-complexity decoder for product codes based on dynamic reliability ...