442 citations · 994 across the 13 of their papers we have counts for
13 papers
Stall Pattern Avoidance in Polynomial Product Codes
Carlo Condo, Francois Leduc-Primeau, Gabi Sarkis +2
Product codes are a concatenated error-correction scheme that has been often considered for applications requiring very low bit-error rates, which demand that the error floor be de…
A 9.52 dB NCG FEC scheme and 164 bits/cycle low-complexity product decoder architecture
Carlo Condo, Pascal Giard, François Leduc-Primeau +2
Powerful Forward Error Correction (FEC) schemes are used in optical communications to achieve bit-error rates below . These FECs follow one of two approaches: concatenati…
Hardware Decoders for Polar Codes: An Overview
Pascal Giard, Gabi Sarkis, Alexios Balatsoukas-Stimming +5
Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented,…
Fast Low-Complexity Decoders for Low-Rate Polar Codes
Pascal Giard, Alexios Balatsoukas-Stimming, Gabi Sarkis +2
Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-t…
Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes
Gabi Sarkis, Ido Tal, Pascal Giard +3
In this work, we present hardware and software implementations of flexible polar systematic encoders and decoders. The proposed implementations operate on polar codes of any length…
Fast List Decoders for Polar Codes
Gabi Sarkis, Pascal Giard, Alexander Vardy +2
Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and m…
Multi-mode Unrolled Architectures for Polar Decoders
Pascal Giard, Gabi Sarkis, Claude Thibeault +1
In this work, we present a family of architectures for polar decoders using a reduced-complexity successive-cancellation decoding algorithm that employs unrolling to achieve extrem…
Low-Latency Software Polar Decoders
Pascal Giard, Gabi Sarkis, Camille Leroux +2
Polar codes are a new class of capacity-achieving error-correcting codes with low encoding and decoding complexity. Their low-complexity decoding algorithms rendering them attracti…
A 237 Gbps Unrolled Hardware Polar Decoder
Pascal Giard, Gabi Sarkis, Claude Thibeault +1
In this letter we present a new architecture for a polar decoder using a reduced complexity successive cancellation decoding algorithm. This novel fully-unrolled, deeply-pipelined…
Increasing the Speed of Polar List Decoders
Gabi Sarkis, Pascal Giard, Alexander Vardy +2
In this work, we present a simplified successive cancellation list decoder that uses a Chase-like decoding process to achieve a six time improvement in speed compared to successive…
Fast Polar Decoders: Algorithm and Implementation
Gabi Sarkis, Pascal Giard, Alexander Vardy +2
Polar codes provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. This work aims to increase the throughput of polar decoder hardwa…
Fast Software Polar Decoders
Pascal Giard, Gabi Sarkis, Claude Thibeault +1
Among error-correcting codes, polar codes are the first to provably achieve channel capacity with an explicit construction. In this work, we present software implementations of a p…
Hardware Implementation of Successive Cancellation Decoders for Polar Codes
Camille Leroux, Alexandre J. Raymond, Gabi Sarkis +3
The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless channels using the low…