4 citations · 5 across the 6 of their papers we have counts for
18 papers
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…
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…
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…
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…
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…
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…