English
Related papers

Related papers: Efficient QP-ADMM Decoder for Binary LDPC Codes an…

200 papers

In this paper, we develop an efficient decoder via the proximal alternating direction method of multipliers (proximal-ADMM) technique for nonbinary linear block codes in the Galois field. Its main contents are as follows: first, exploiting…

Information Theory · Computer Science 2020-10-20 Yongchao Wang , Jing Bai

In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition.…

Information Theory · Computer Science 2019-01-24 Jing Bai , Yongchao Wang , Francis C. M. Lau

In this paper, we develop efficient decoders for non-binary low-density parity-check (LDPC) codes using the alternating direction method of multipliers (ADMM). We apply ADMM to two decoding problems. The first problem is linear programming…

Information Theory · Computer Science 2015-07-29 Xishuo Liu , Stark C. Draper

In this paper, we devote to devise a non-binary low-density parity-check (LDPC) decoder in Galois fields of characteristic two ($\mathbb{F}_{2^q}$) via the alternating direction method of multipliers (ADMM) technique. Through the proposed…

Information Theory · Computer Science 2022-02-08 Xiaomeng Guo , Yongchao Wang

The Alternating Direction Method of Multipliers (ADMM) decoding of Low Density Parity Check (LDPC) codes has received many attentions due to its excellent performance at the error floor region. In this paper, we develop a parameter-free…

Information Theory · Computer Science 2018-04-25 Qiong Wu , Fan Zhang , Hao Wang , Jun Lin , Yang Liu

Linear programming (LP) decoding for low-density parity-check (LDPC) codes proposed by Feldman et al. is shown to have theoretical guarantees in several regimes and empirically is not observed to suffer from an error floor. However at low…

Information Theory · Computer Science 2016-11-18 Xishuo Liu , Stark C. Draper

Non-convex quadratically constrained quadratic programming (QCQP) problems have numerous applications in signal processing, machine learning, and wireless communications, albeit the general QCQP is NP-hard, and several interesting special…

Optimization and Control · Mathematics 2016-09-21 Kejun Huang , Nicholas D. Sidiropoulos

When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding problem can be stated as a linear program (LP). This LP decoder can be used to decode error-correcting codes at…

Information Theory · Computer Science 2013-09-24 Siddharth Barman , Xishuo Liu , Stark C. Draper , Benjamin Recht

Convex quadratic programs (QPs) constitute a fundamental computational primitive across diverse domains including financial optimization, control systems, and machine learning. The alternating direction method of multipliers (ADMM) has…

Optimization and Control · Mathematics 2025-05-15 Xi Gao , Jinxin Xiong , Linxin Yang , Akang Wang , Weiwei Xu , Jiang Xue

In this paper, we focus on decoding nonbinary low-density parity-check (LDPC) codes in Galois fields of characteristic two via the proximal alternating direction method of multipliers (proximal-ADMM). By exploiting…

Information Theory · Computer Science 2022-01-04 Yongchao Wang , Jing Bai

In this paper, we analyze the convergence of Alternating Direction Method of Multipliers (ADMM) on convex quadratic programs (QPs) with linear equality and bound constraints. The ADMM formulation alternates between an equality constrained…

Optimization and Control · Mathematics 2015-10-06 Arvind U. Raghunathan , Stefano Di Cairano

Semidefinite programming (SDP) is a fundamental convex optimization problem with wide-ranging applications. However, solving large-scale instances remains computationally challenging due to the high cost of solving linear systems and…

Optimization and Control · Mathematics 2025-12-22 Hantao Nie , Dong An , Zaiwen Wen

In this paper, we consider a prototypical convex optimization problem with multi-block variables and separable structures. By adding the Logarithmic Quadratic Proximal (LQP) regularizer with suitable proximal parameter to each of the first…

Numerical Analysis · Mathematics 2021-04-01 Jianchao Bai , Yuxue Ma , Hao Sun , Miao Zhang

In this paper we develop an accelerated Alternating Direction Method of Multipliers (ADMM) algorithm for solving quadratic programs called superADMM. Unlike standard ADMM QP solvers, superADMM uses a novel dynamic weighting method that…

Optimization and Control · Mathematics 2025-06-16 P. C. N. Verheijen , D. Goswami , M. Lazar

This paper studies coding schemes for the $q$-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size $q=2^m$, $m\in\mathbb{N}$, thus complementing some recently proposed packet-based…

Information Theory · Computer Science 2015-03-13 Claudio Weidmann , Gottfried Lechner

Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers. One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder. In this…

Quantum Physics · Physics 2025-02-18 Sisi Miao , Alexander Schnerring , Haizheng Li , Laurent Schmalen

The Alternating Direction Method of Multipliers has recently been adapted for Linear Programming Decoding of Low-Density Parity-Check codes. The computation of the projection onto the parity polytope is the core of this algorithm and…

Information Theory · Computer Science 2019-01-11 Florian Gensheimer , Tobias Dietz , Kira Kraft , Stefan Ruzika , Norbert Wehn

In this paper, we design an efficient quadrature amplitude modulation (QAM) signal detector for massive multiple-input multiple-output (MIMO) communication systems via the penalty-sharing alternating direction method of multipliers…

Signal Processing · Electrical Eng. & Systems 2021-12-14 Quan Zhang , Jiangtao Wang , Yongchao Wang

The objective of this paper is to design an efficient and convergent alternating direction method of multipliers (ADMM) for finding a solution of medium accuracy to conic programming problems whose constraints consist of linear equalities,…

Optimization and Control · Mathematics 2014-12-02 Defeng Sun , Kim-Chuan Toh , Liuqin Yang

In this paper, we consider how to partition the parity-check matrices (PCMs) to reduce the hardware complexity and computation delay for the row layered decoding of quasi-cyclic low-density parity-check (QC-LDPC) codes. First, we formulate…

Information Theory · Computer Science 2022-08-30 Teng Lu , Xuan He , Peng Kang , Jiongyue Xing , Xiaohu Tang
‹ Prev 1 2 3 10 Next ›