English
Related papers

Related papers: Verification-Based Interval-Passing Algorithm for …

200 papers

An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric channels. We show gains of 0.9 dB for additive white Gaussian…

Information Theory · Computer Science 2023-05-24 Thomas Wiegart , Linfang Wang , Diego Lentner , Richard D. Wesel

In a digital communication system, information is sent from one place to another over a noisy communication channel. It may be possible to detect and correct errors that occur during the transmission if one encodes the original information…

Information Theory · Computer Science 2017-08-21 Banu Kabakulak , Z. Caner Taşkın , Ali Emre Pusane

Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems. This technique relies on properties of the sensing matrix such as the restricted isometry property. Sensing matrices that satisfy the…

Computational Complexity · Computer Science 2011-10-18 Pascal Koiran , Anastasios Zouzias

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

Compressive sensing (CS) is a data acquisition technique that measures sparse or compressible signals at a sampling rate lower than their Nyquist rate. Results show that sparse signals can be reconstructed using greedy algorithms, often…

Information Theory · Computer Science 2016-02-23 Jinye Zhang , Laming Chen , Petros T. Boufounos , Yuantao Gu

Linear nested codes, where two or more sub-codes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled low-density…

Information Theory · Computer Science 2021-02-23 Salman Habib , David G. M. Mitchell , Joerg Kliewer

In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes, a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes…

Information Theory · Computer Science 2021-01-06 Peng W. Zhang , Francis C. M. Lau , Chiu-W. Sham

For identifying the non-Gaussian impulsive noise systems, normalized LMP (NLMP) has been proposed to combat impulsive-inducing instability. However, the standard algorithm is without considering the inherent sparse structure distribution of…

Information Theory · Computer Science 2015-03-04 Wentao Ma , Hua Qu , Jihong Zhao , Badong Chen , Guan Gui

Conventional compressed sensing theory assumes signals have sparse representations in a known, finite dictionary. Nevertheless, in many practical applications such as direction-of-arrival (DOA) estimation and line spectral estimation, the…

Information Theory · Computer Science 2014-12-19 Jun Fang , Huiping Duan , Jing Li , Hongbin Li , Rick S. Blum

A ternary message passing (TMP) decoding algorithm for low-density parity-check codes is developed. All messages exchanged between variable and check nodes have a ternary alphabet, and the variable nodes exploit soft information from the…

Information Theory · Computer Science 2018-10-12 Emna Ben Yacoub , Fabian Steiner , Balazs Matuz , Gianluigi Liva

We propose an iterative channel estimation algorithm based on the Least Square Estimation (LSE) and Sparse Message Passing (SMP) algorithm for the Millimeter Wave (mmWave) MIMO systems. The channel coefficients of the mmWave MIMO are…

Information Theory · Computer Science 2022-06-23 Chongwen Huang , Lei Liu , Chau Yuen , Sumei Sun

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

Methodology · Statistics 2007-11-13 Emmanuel J. Candes , Michael B. Wakin , Stephen P. Boyd

The classical sparse parameter identification methods are usually based on the iterative basis selection such as greedy algorithms, or the numerical optimization of regularized cost functions such as LASSO and Bayesian posterior probability…

Systems and Control · Electrical Eng. & Systems 2026-05-05 Yanxin Fu , Wenxiao Zhao

To strike a balance between energy efficiency and data quality control, this paper proposes a sensor censoring scheme for distributed sparse signal recovery via compressive-sensing based wireless sensor networks. In the proposed approach,…

Information Theory · Computer Science 2018-01-16 Jwo-Yuh Wu , Ming-Hsun Yang , Tsang-Yi Wang

We propose an efficient encoding algorithm for the binary and non-binary low-density parity-check codes. This algorithm transforms the parity part of the parity-check matrix into a block triangular matrix with low weight diagonal…

Information Theory · Computer Science 2021-03-03 Yuta Iketo , Takayuki Nozaki

Compressed sensing aims to undersample certain high-dimensional signals, yet accurately reconstruct them by exploiting signal characteristics. Accurate reconstruction is possible when the object to be recovered is sufficiently sparse in a…

Information Theory · Computer Science 2015-05-13 David L. Donoho , Arian Maleki , Andrea Montanari

We propose an Iterative Detection and Decoding (IDD) scheme with Low Density Parity Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems for block-fading $F = 2$ and fast fading Rayleigh channels. An IDD receiver with soft…

Information Theory · Computer Science 2014-04-09 A. G. D. Uchoa , C. T. Healy , R. C. de Lamare , P. Li

Quantum error correction (QEC) is a cornerstone of quantum computing, enabling reliable information processing in the presence of noise. Sparse stabilizer codes -- referred to generally as quantum low-density parity-check (QLDPC) codes --…

Quantum Physics · Physics 2025-10-20 Bane Vasic , Valentin Savin , Michele Pacenti , Shantom Borah , Nithin Raveendran

Departing from traditional communication theory where decoding algorithms are assumed to perform without error, a system where noise perturbs both computational devices and communication channels is considered here. This paper studies…

Information Theory · Computer Science 2010-05-31 Lav R. Varshney

We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing…

Information Theory · Computer Science 2016-11-18 Jaehong Kim , Aditya Ramamoorthy , Steven W. McLaughlin
‹ Prev 1 3 4 5 6 7 10 Next ›