We propose a novel soft-aided low-complexity decoder for product codes based on dynamic reliability scores and error-and-erasure decoding. We observe coding gains of up to 1.2 dB compared to conventional hard-decision decoders.Comment: Optical Fiber Communication (OFC) Conference 202
We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm i...
Error correction techniques traditionally focus on the co-design of restricted code-structures in ta...
The so-called improved soft-aided bit-marking algorithm was recently proposed for staircase codes (S...
Products codes (PCs) are conventionally decoded with efficient iterative bounded-distance decoding (...
Full soft decoding of product codes is optimal, but it is impractical. Although, the performance of ...
Product coding produces powerful long codes from short constituent codes. The conventional row-colum...
We introduce a novel soft-aided hard-decision decoder for product codes adopting bit marking via upd...
We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder u...
The decoding performance of product codes and staircase codes based on iterative bounded-distance de...
We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed alg...
Product codes have large minimum Hamming distance and their complexity might be compared with Tu...
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance ...
Absract- A new iterative decoding algorithm for product codes (block) based on soft decoding and sof...
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance ...
We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on t...
We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm i...
Error correction techniques traditionally focus on the co-design of restricted code-structures in ta...
The so-called improved soft-aided bit-marking algorithm was recently proposed for staircase codes (S...
Products codes (PCs) are conventionally decoded with efficient iterative bounded-distance decoding (...
Full soft decoding of product codes is optimal, but it is impractical. Although, the performance of ...
Product coding produces powerful long codes from short constituent codes. The conventional row-colum...
We introduce a novel soft-aided hard-decision decoder for product codes adopting bit marking via upd...
We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder u...
The decoding performance of product codes and staircase codes based on iterative bounded-distance de...
We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed alg...
Product codes have large minimum Hamming distance and their complexity might be compared with Tu...
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance ...
Absract- A new iterative decoding algorithm for product codes (block) based on soft decoding and sof...
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance ...
We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on t...
We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm i...
Error correction techniques traditionally focus on the co-design of restricted code-structures in ta...
The so-called improved soft-aided bit-marking algorithm was recently proposed for staircase codes (S...
DOI
Add to ORKG