activity
20102026
most citedDeep Learning Methods for Improved Decoding of Linear Codes

571 citations · 2.8k across the 60 of their papers we have counts for

collaborators
Showing 2016Show all

6 papers · 1 filter

cs.IT2016★ 14 cited

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…

cs.NE2016★ 18 cited

Neural Networks Designing Neural Networks: Multi-Objective Hyper-Parameter Optimization

Sean C. Smithson, Guang Yang, Warren J. Gross +1

Artificial neural networks have gone through a recent rise in popularity, achieving state-of-the-art results in various fields, including image classification, speech recognition,…

cs.NE2016★ 34 cited

Sparsely-Connected Neural Networks: Towards Efficient VLSI Implementation of Deep Neural Networks

Arash Ardakani, Carlo Condo, Warren J. Gross

Recently deep neural networks have received considerable attention due to their ability to extract and represent high-level abstractions in data sets. Deep neural networks such as…

cs.AR2016★ 8 cited

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…

cs.IT2016★ 29 cited

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,…

cs.IT2016★ 51 cited

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…