4.7 Article

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

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Engineering, Electrical & Electronic

Construction of Polar Codes With Reinforcement Learning

Yun Liao et al.

Summary: This paper presents a method that formulates the polar-code construction problem as a maze-traversing game and solves it using reinforcement-learning techniques. Unlike traditional algorithms, this method improves the efficiency of polar-code construction by deciding whether input bits should be frozen in a purely sequential manner. Simulation results show that this method outperforms traditional methods in terms of performance for the SCL decoder.

IEEE TRANSACTIONS ON COMMUNICATIONS (2022)

Article Engineering, Electrical & Electronic

On Decoding of Reed-Muller Codes Using a Local Graph Search

Mikhail Kamenev

Summary: In this paper, a novel iterative decoding algorithm for Reed-Muller (RM) codes is presented, which utilizes a graph representation of the code. The algorithm uses a greedy local search to find a node optimizing a metric and incorporates a cyclic redundancy check to improve the computational complexity. Simulation results show that the presented decoder achieves performance close to maximum likelihood decoding for RM codes and outperforms state-of-the-art decoding algorithms for a wide range of block lengths and rates.

IEEE TRANSACTIONS ON COMMUNICATIONS (2022)

Article Engineering, Electrical & Electronic

Automorphism Ensemble Decoding of Reed-Muller Codes

Marvin Geiselhart et al.

Summary: RM codes are known for their good maximum likelihood performance in the short block-length regime, but finding a low complexity soft-input decoding scheme remains an open problem. We have presented a versatile decoding architecture for RM codes based on their rich automorphism group, which can be seen as a generalization of multiple-bases belief propagation.

IEEE TRANSACTIONS ON COMMUNICATIONS (2021)

Proceedings Paper Computer Science, Information Systems

Complexity-Adaptive Maximum-Likelihood Decoding of Modified GN-Coset Codes

Peihong Yuan et al.

Summary: The proposed complexity-adaptive tree search algorithm is suitable for G(N)-coset codes, achieving near-ML decoding without the need for an outer code to terminate decoding. It can be applied to various code constructions and does not require optimization of a separate parameter like sequential decoders do.

2021 IEEE INFORMATION THEORY WORKSHOP (ITW) (2021)

Proceedings Paper Acoustics

HARDWARE IMPLEMENTATION OF ITERATIVE PROJECTION-AGGREGATION DECODING OF REED-MULLER CODES

Marzieh Hashemipour-Nazari et al.

Summary: This work presents a simplification and corresponding hardware architecture for hard-decision recursive projection-aggregation decoding of Reed-Muller codes, achieving minimal error-correction degradation while reducing average computations. The proposed fully parallel hardware architecture for simplified RPA decoding shows promising FPGA implementation results for RM codes on Xilinx Virtex-7 FPGA, achieving high throughput at a frequency of 80 MHz.

2021 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP 2021) (2021)

Proceedings Paper Computer Science, Theory & Methods

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

Dorsa Fathollahi et al.

Summary: The paper presents a new algorithm that reduces the computational budget of Reed-Muller codes' decoder by using sparse projection aggregation, while maintaining performance close to that of the RPA decoder. The method reduces the RPA decoder's computations by up to 80% with negligible performance loss.

2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2021)

Article Computer Science, Information Systems

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Min Ye et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2020)

Proceedings Paper Computer Science, Theory & Methods

CRC-Aided Belief Propagation List Decoding of Polar Codes

Marvin Geiselhart et al.

2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2020)

Proceedings Paper Computer Science, Artificial Intelligence

Decoding Polar Codes with Reinforcement Learning

Nghia Doan et al.

2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) (2020)

Proceedings Paper Computer Science, Artificial Intelligence

Simplified Decoding of Polar Codes by Identifying Reed-Muller Constituent Codes

Nadim Ghaddar et al.

2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) (2020)

Article Engineering, Electrical & Electronic

Fast Block Sequential Decoding of Polar Codes

Grigorii Trofimiuk et al.

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY (2020)

Article Engineering, Electrical & Electronic

Fast Successive-Cancellation-Based Decoders of Polar Codes

Maryam Haghighi Ardakani et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2019)

Proceedings Paper Computer Science, Information Systems

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Kirill Ivanov et al.

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2019)

Proceedings Paper Computer Science, Information Systems

A New Permutation Decoding Method for Reed-Muller Codes

Mikhail Kamenev et al.

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2019)

Article Telecommunications

Belief Propagation List Decoding of Polar Codes

Ahmed Elkelesh et al.

IEEE COMMUNICATIONS LETTERS (2018)

Article Engineering, Electrical & Electronic

Fast and Flexible Successive-Cancellation List Decoders for Polar Codes

Seyyed Ali Hashemi et al.

IEEE TRANSACTIONS ON SIGNAL PROCESSING (2017)

Article Computer Science, Information Systems

List Decoding of Polar Codes

Ido Tal et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2015)

Article Engineering, Electrical & Electronic

LLR-Based Successive Cancellation List Decoding of Polar Codes

Alexios Balatsoukas-Stimming et al.

IEEE TRANSACTIONS ON SIGNAL PROCESSING (2015)

Article Engineering, Electrical & Electronic

Fast Polar Decoders: Algorithm and Implementation

Gabi Sarkis et al.

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (2014)

Article Computer Science, Information Systems

How to Construct Polar Codes

Ido Tal et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2013)

Article Engineering, Electrical & Electronic

Efficient Design and Decoding of Polar Codes

Peter Trifonov

IEEE TRANSACTIONS ON COMMUNICATIONS (2012)

Article Computer Science, Information Systems

Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels

Erdal Arikan

IEEE TRANSACTIONS ON INFORMATION THEORY (2009)

Article Telecommunications

A performance comparison of polar codes and reed-muller codes

Erdal Arikan

IEEE COMMUNICATIONS LETTERS (2008)

Article Computer Science, Information Systems

Soft-decision decoding of Reed-Muller codes: Recursive lists

I Dumer et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2006)

Article Computer Science, Information Systems

Recursive decoding and its performance for low-rate Reed-Muller codes

I Dumer

IEEE TRANSACTIONS ON INFORMATION THEORY (2004)