Toward Terabits-per-second Communications: Low-Complexity Parallel Decoding of G_N-Coset Codes

04/21/2020
by   Xianbin Wang, et al.
0

Recently, a parallel decoding framework of G_N-coset codes was proposed. High throughput is achieved by decoding the independent component polar codes in parallel. Various algorithms can be employed to decode these component codes, enabling a flexible throughput-performance tradeoff. In this work, we adopt SC as the component decoders to achieve the highest-throughput end of the tradeoff. The benefits over soft-output component decoders are reduced complexity and simpler (binary) interconnections among component decoders. To reduce performance degradation, we integrate an error detector and a log-likelihood ratio (LLR) generator into each component decoder. The LLR generator, specifically the damping factors therein, is designed by a genetic algorithm. This low-complexity design can achieve an area efficiency of 533Gbps/mm^2 under 7nm technology.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

research
06/28/2018

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems

We study low-complexity iterative decoding algorithms for product codes....
research
07/19/2021

Fast polar codes for terabits-per-second throughput communications

Targeting high-throughput and low-power communications, we implement two...
research
08/27/2021

Terabit-per-Second Multicore Polar Code Successive Cancellation Decoders

This work presents a high throughput and energy efficient multicore (MC)...
research
01/21/2019

Construction and Decoding of Product Codes with Non-Systematic Polar Codes

Product codes are widespread in optical communications, thanks to their ...
research
04/21/2020

Toward Terabits-per-second Communications: A High-Throughput Hardware Implementation of G_N-Coset Codes

Recently, a parallel decoding algorithm of G_N-coset codes was proposed....
research
03/16/2016

Fast Low-Complexity Decoders for Low-Rate Polar Codes

Polar codes are capacity-achieving error-correcting codes with an explic...
research
01/20/2021

Recursive Trellis Processing of Large Polarization Kernels

A reduced complexity algorithm is presented for computing the log-likeli...

Please sign up or login with your details

Forgot password? Click here to reset