activity
20162022
most citedFast and Flexible Successive-Cancellation List Decoders for Polar Codes

222 citations · 366 across the 18 of their papers we have counts for

collaborators
Showing cs.ITShow all

26 papers · 1 filter

cs.IT2022★ 1 cited

Scalable Polar Code Construction for Successive Cancellation List Decoding: A Graph Neural Network-Based Approach

Yun Liao, Seyyed Ali Hashemi, Hengjie Yang +1

While constructing polar codes for successive-cancellation decoding can be implemented efficiently by sorting the bit-channels, finding optimal polar codes for cyclic-redundancy-ch…

cs.IT2021

Successive Syndrome-Check Decoding of Polar Codes

Seyyed Ali Hashemi, Marco Mondelli, John Cioffi +1

A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome.…

cs.IT2021★ 8 cited

Fast Successive-Cancellation List Flip Decoding of Polar Codes

Nghia Doan, Seyyed Ali Hashemi, Warren J. Gross

This work presents a fast successive-cancellation list flip (Fast-SCLF) decoding algorithm for polar codes that addresses the high latency issue associated with the successive-canc…

cs.IT2021

Decoding Reed-Muller Codes with Successive Codeword Permutations

Nghia Doan, Seyyed Ali Hashemi, Marco Mondelli +1

A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permutations (SP) of the codeword is presented. A low-complexity SP scheme applied to…

cs.IT2021

Successive-Cancellation Decoding of Reed-Muller Codes with Fast Hadamard Transform

Nghia Doan, Seyyed Ali Hashemi, Warren J. Gross

A novel permuted fast successive-cancellation list decoding algorithm with fast Hadamard transform (FHT-FSCL) is presented. The proposed decoder initializes active de…

cs.IT2021

A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes

Seyyed Ali Hashemi, Nghia Doan, Warren J. Gross +2

A low-complexity tree search approach is presented that achieves the maximum-likelihood (ML) decoding performance of Reed-Muller (RM) codes. The proposed approach generates a bit-f…

cs.IT2020

Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes

Seyyed Ali Hashemi, Marco Mondelli, Arman Fazeli +3

This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the nu…

cs.IT2020

Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes

Dorsa Fathollahi, Nariman Farsad, Seyyed Ali Hashemi +1

Reed-Muller (RM) codes are one of the oldest families of codes. Recently, a recursive projection aggregation (RPA) decoder has been proposed, which achieves a performance that is c…

cs.IT2020★ 1 cited

Construction of Polar Codes with Reinforcement Learning

Yun Liao, Seyyed Ali Hashemi, John Cioffi +1

This paper formulates the polar-code construction problem for the successive-cancellation list (SCL) decoder as a maze-traversing game, which can be solved by reinforcement learnin…

cs.IT2020

Decoding Polar Codes with Reinforcement Learning

Nghia Doan, Seyyed Ali Hashemi, Warren Gross

In this paper we address the problem of selecting factor-graph permutations of polar codes under belief propagation (BP) decoding to significantly improve the error-correction perf…

cs.IT2020★ 6 cited

Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes

Haotian Zheng, Seyyed Ali Hashemi, Alexios Balatsoukas-Stimming +4

Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fa…

cs.IT2019

Deep-Learning-Aided Successive-Cancellation Decoding of Polar Codes

Seyyed Ali Hashemi, Nghia Doan, Thibaud Tonnellier +1

A deep-learning-aided successive-cancellation list (DL-SCL) decoding algorithm for polar codes is introduced with deep-learning-aided successive-cancellation (DL-SC) decoding being…

cs.IT2019

Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes

Marco Mondelli, Seyyed Ali Hashemi, John Cioffi +1

This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike c…

cs.IT2019

Efficient Flicker-Free FEC Codes using Knuth's Balancing Algorithm for VLC

Elie Ngomseu Mambou, Thibaud Tonnellier, Seyyed Ali Hashemi +1

Visible light communication (VLC) provides a short-range optical wireless communication through light-emitting diode (LED) lighting. Light beam flickering and dimming are among the…

cs.IT2019

Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes

Nghia Doan, Seyyed Ali Hashemi, Furkan Ercan +2

Dynamic successive cancellation flip (DSCF) decoding of polar codes is a powerful algorithm that can achieve the error correction performance of successive cancellation list (SCL)…

cs.IT2019★ 26 cited

Rate-Flexible Fast Polar Decoders

Seyyed Ali Hashemi, Carlo Condo, Marco Mondelli +1

Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Succes…

cs.IT2018

Neural Belief Propagation Decoding of CRC-Polar Concatenated Codes

Nghia Doan, Seyyed Ali Hashemi, Elie Ngomseu Mambou +2

Polar codes are the first class of error correcting codes that provably achieve the channel capacity at infinite code length. They were selected for use in the fifth generation of…

cs.IT2018

Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations

Seyyed Ali Hashemi, Nghia Doan, Marco Mondelli +1

Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short i…

cs.IT2018

On the Decoding of Polar Codes on Permuted Factor Graphs

Nghia Doan, Seyyed Ali Hashemi, Marco Mondelli +1

Polar codes are a channel coding scheme for the next generation of wireless communications standard (5G). The belief propagation (BP) decoder allows for parallel decoding of polar…

cs.IT2018

Design and Implementation of a Polar Codes Blind Detection Scheme

Carlo Condo, Seyyed Ali Hashemi, Arash Ardakani +2

In blind detection, a set of candidates has to be decoded within a strict time constraint, to identify which transmissions are directed at the user equipment. Blind detection is re…

cs.IT2017★ 49 cited

Partitioned Successive-Cancellation Flip Decoding of Polar Codes

Furkan Ercan, Carlo Condo, Seyyed Ali Hashemi +1

Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the…

cs.IT2017

On Error-Correction Performance and Implementation of Polar Code List Decoders for 5G

Furkan Ercan, Carlo Condo, Seyyed Ali Hashemi +1

Polar codes are a class of capacity achieving error correcting codes that has been recently selected for the next generation of wireless communication standards (5G). Polar code de…

cs.IT2017

Efficient Bit-Channel Reliability Computation for Multi-Mode Polar Code Encoders and Decoders

Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross

Polar codes are a family of capacity-achieving error-correcting codes, and they have been selected as part of the next generation wireless communication standard. Each polar code b…

cs.IT2017

Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance

Seyyed Ali Hashemi, Marco Mondelli, S. Hamed Hassani +2

Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As suc…