Large Scale LP Decoding with Low Complexity

doi:10.1109/LCOMM.2013.101413.130826

2013-11-01

PRE

Guoqiang Zhang *

Richard Heusdens

W. Bastiaan Kleijn

DOI：10.1109/LCOMM.2013.101413.130826

原文链接

原文求助

摘要

En 中文

Linear program (LP) decoding has become increasingly popular for error-correcting codes due to its simplicity and promising performance. Low-complexity and efficient iterative algorithms for LP decoding are of great importance for practical applications. In this paper we focus on solving the binary LP decoding problem by using the alternating direction method of multipliers (ADMM). Our main contribution is that we propose a linear-complexity algorithm for the projection onto a parity polytope (having a computational complexity of O(d), where d is the check-node degree), as compared to recent work [1], which has a computational complexity of O(d log d). In particular, we show that the projection onto the parity polytope can be transformed to a projection onto a simplex.

Keyword:

Distributed optimization

LP decoding

alternating direction method of multipliers

AI总结

对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Communications Letters

IF:

4.4

论文数:

1.3W

被引数:

2.2W

机构

Delft University of Technology

学者数:

2.6W

论文数: 2.5W

被引数: 3.8W

引用论文

Relationship Between the Boson Heat Capacity Peak and the Excess Enthalpy of a Metallic Glass

physica status solidi (RRL) – Rapid Research Letters

IF0

2019-03-12

PREAI

Yurii P. Mitrofanov; Andrei S. Makarov; Gennadii V. Afonin; Konstantin V. Zakharov; Alexander N. Vasiliev; Nikolai P. Kobelev; Gerhard Wilde; Vitaly A. Khonik

On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit

IEEE COMMUNICATIONS LETTERS

IF4.4

2001-01-01

1.3K

PREAI

Chung, SY; Forney, GD; Richardson, TJ; Urbanke, R

Techno-Economic Analysis of Natural Gas Fuel Cell Plant Configurations

IF0

2022-04-30

PREAI

Arun Iyengar; Alex Noring; Jocelyn MacKay; Dale Keairns; Gregory Hackett