☆ 3.8 Proceedings Paper

Randomized Scheduling of ADMM-LP Decoding Based on Geometric Priors

2022 IEEE INFORMATION THEORY WORKSHOP (ITW) (2022)

Related references

Note: Only part of the references are listed.

Article Telecommunications

Node-Wise Scheduling Algorithm of ADMM Decoding Based on Line Segment Projection

Qiaoqiao Xia et al.

Summary: This paper presents a method to simplify the node-wise scheduling algorithm by using an approximate line segment projection algorithm. The results show that this method leads to poor performance in terms of frame error rate. To address this issue, a dynamic scheduling strategy is proposed to select the appropriate message-passing schedule. The simulation results demonstrate that the modified node-wise scheduling algorithm based on line segment projection outperforms existing algorithms in terms of performance and speed.

IEEE COMMUNICATIONS LETTERS (2022)

Add to Collection

Proceedings Paper Computer Science, Information Systems

SAPA: Sparse Affine Projection Algorithm in ADMM-LP Decoding of LDPC Codes

Amirreza Asadzadeh et al.

Summary: We propose a simplified alternating direction method of multipliers with linear programming (ADMM-LP) decoder for LDPC codes, which uses an approximate projection algorithm onto the parity polytope. The algorithm achieves a lower per-iteration complexity compared to exact projection and shows comparable performance. It is suitable for high-throughput applications.

2022 17TH CANADIAN WORKSHOP ON INFORMATION THEORY (CWIT) (2022)

Add to Collection

Article Telecommunications

A Hybrid Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes

Qiaoqiao Xia et al.

Summary: The study introduces a novel hybrid projection algorithm (HPA) that alternately uses approximate even-vertex projection algorithm (EVA) and other accurate projection algorithms to increase the percentage of unuseful projections, achieving better decoding performance while reducing projection time. Compared to the cut search algorithm (CSA), the proposed algorithm significantly saves average projection and decoding time.

IEEE COMMUNICATIONS LETTERS (2021)

Add to Collection

Article Computer Science, Hardware & Architecture

An Enhanced HDPC-EVA Decoder Based on ADMM

Yujin Zheng et al.

Summary: For high-density parity-check (HDPC) codes, the traditional ADMM-LP decoder faces challenges, thus the HDPC-EVA algorithm is proposed to reduce complexity and improve performance. By introducing the even vertex algorithm (EVA) and the automorphism groups of codes, it is possible to achieve near maximum likelihood performance while enhancing decoding speed.

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES (2021)

Add to Collection

Article Computer Science, Information Systems

A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding

Florian Gensheimer et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2020)

Add to Collection

Article Telecommunications

A Fast Approximate Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes

Qiaoqiao Xia et al.

IEEE COMMUNICATIONS LETTERS (2019)

Add to Collection

Article Engineering, Electrical & Electronic

Hardware-Based Linear Program Decoding With the Alternating Direction Method of Multipliers

Mitchell Wasson et al.

IEEE TRANSACTIONS ON SIGNAL PROCESSING (2019)

Add to Collection

Article Computer Science, Hardware & Architecture

A Fast Iterative Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes by Bisection Method

Yan Lin et al.

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES (2019)

Add to Collection

Article Telecommunications

An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes

Haoyuan Wei et al.

IEEE COMMUNICATIONS LETTERS (2018)

Add to Collection

Article Engineering, Electrical & Electronic

Efficient ADMM Decoding of LDPC Codes Using Lookup Tables

Xiaopeng Jiao et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2017)

Add to Collection

Article Telecommunications

Fast Converging ADMM-Penalized Algorithm for LDPC Decoding

Imen Debbabi et al.

IEEE COMMUNICATIONS LETTERS (2016)

Add to Collection

Article Computer Science, Information Systems

The ADMM Penalized Decoder for LDPC Codes

Xishuo Liu et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2016)

Add to Collection

Article Telecommunications

Reduced-Complexity Linear Programming Decoding Based on ADMM for LDPC Codes

Haoyuan Wei et al.

IEEE COMMUNICATIONS LETTERS (2015)

Add to Collection

Article Computer Science, Information Systems

Decomposition Methods for Large Scale LP Decoding

Siddharth Barman et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2013)

Add to Collection

Article Computer Science, Information Systems

Using linear programming to decode binary linear codes

J Feldman et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2005)

Add to Collection

Article Computer Science, Information Systems

Factor graphs and the sum-product algorithm

FR Kschischang et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2001)

Add to Collection

© Peeref 2019-2024. All rights reserved.