English
Related papers

Related papers: Linear Programming based Detectors for Two-Dimensi…

200 papers

We study iterative blind symbol detection for block-fading linear inter-symbol interference channels. Based on the factor graph framework, we design a joint channel estimation and detection scheme that combines the expectation maximization…

Information Theory · Computer Science 2024-08-06 Luca Schmid , Tomer Raviv , Nir Shlezinger , Laurent Schmalen

Iterative message passing detection based on expectation propagation(EP) has demonstrated near-optimum performance in many signal processing and communication scenarios. The method remains feasible even for channel impulse responses (CIRs),…

Information Theory · Computer Science 2025-09-23 Jannis Clausius , Luca Schmid , Laurent Schmalen , Stephan ten Brink

In this paper, we develop a new decoding algorithm of a binary linear codes for symbol-pair read channels. Symbol-pair read channel has recently been introduced by Cassuto and Blaum to model channels with high write resolution but low read…

Information Theory · Computer Science 2016-12-21 Shunsuke Horii , Toshiyasu Matsushima , Shigeichi Hirasawa

Banded linear systems arise in many communication scenarios, e.g., those involving inter-carrier interference and inter-symbol interference. Motivated by recent advances in deep learning, we propose to design a high-accuracy low-complexity…

Information Theory · Computer Science 2018-09-12 Congmin Fan , Xiaojun Yuan , Ying-Jun Angela Zhang

We propose an approximation of maximum-likelihood detection in ISI channels based on linear programming or message passing. We convert the detection problem into a binary decoding problem, which can be easily combined with LDPC decoding. We…

Information Theory · Computer Science 2016-11-18 Mohammad H. Taghavi , Paul H. Siegel

In this paper, the linear programming (LP) decoder for binary linear codes, introduced by Feldman, et al. is extended to joint-decoding of binary-input finite-state channels. In particular, we provide a rigorous definition of LP…

Information Theory · Computer Science 2010-06-09 Byung-Hak Kim , Henry D. Pfister

Molecular communication requires low-complexity symbol detection algorithms to deal with the many sources of uncertainty that are inherent in these channels. This paper proposes two variants of a high-performance asynchronous peak detection…

Information Theory · Computer Science 2017-02-27 Adam Noel , Andrew W. Eckford

We consider channels affected by intersymbol interference with reduced-complexity, mutual information optimized, channel-shortening detection. For such settings, we optimize the transmit filter, taking into consideration the reduced…

Information Theory · Computer Science 2013-10-24 Andrea Modenini , Fredrik Rusek , Giulio Colavolpe

Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we…

Information Theory · Computer Science 2007-07-13 Mohammad H. Taghavi , Paul H. Siegel

We consider transmission over a binary-input additive white Gaussian noise channel using low-density parity-check codes. One of the most popular techniques for decoding low-density parity-check codes is the linear programming decoder. In…

Information Theory · Computer Science 2015-03-19 Shrinivas Kudekar , Jason K. Johnson , Misha Chertkov

Discrete barycenters are the optimal solutions to mass transport problems for a set of discrete measures. Such transport problems arise in many applications of operations research and statistics. The best known algorithms for exact…

Optimization and Control · Mathematics 2019-04-24 Steffen Borgwardt , Stephan Patterson

We show that spatially coupled low-density parity-check (LDPC) codes yield robust performance over changing intersymbol interfere (ISI) channels with optimal and suboptimal detectors. We compare the performance with classical LDPC code…

Information Theory · Computer Science 2024-04-19 Mgeni Makambi Mashauri , Alexandre Graell i Amat , Michael Lentmaier

Detectability of failures of linear programming (LP) decoding and its potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the LP problem. In this paper, we make a…

Information Theory · Computer Science 2007-07-13 Mohammad H. Taghavi N. , Paul H. Siegel

The detection problem in the Gaussian interference channel is addressed, when transmitters employ non-Gaussian schemes designed for the single-user Gaussian channel. A structure consisting of a separate symbol-by-symbol detector and a hard…

Information Theory · Computer Science 2009-07-09 Jungwon Lee , Dimitris Toumpakaris , Hui-Ling Lou

Interleaving is a mechanism universally used in wireless access technologies to alleviate the effect of channel correlation. In spite of its wide adoption, to the best of our knowledge, there are no analytical models proposed so far. In…

Information Theory · Computer Science 2018-01-31 Dmitri Moltchanov , Pavel Kustarev , Yevgeni Kucharyavy

This paper presents a performance analysis framework for linear detection in fast-fading channels with possibly correlated channel and noise. The framework is both accurate and adaptable, making it well-suited for analyzing a wide range of…

Signal Processing · Electrical Eng. & Systems 2025-07-09 Almutasem Bellah Enad , Jihad Fahs , Hadi Sarieddeen , Hakim Jemaa , Tareq Y. Al-Naffouri

In this paper, we propose the joint interference cancellation, fast fading channel estimation, and data symbol detection for a general interference setting where the interfering source and the interfered receiver are unsynchronized and…

Signal Processing · Electrical Eng. & Systems 2020-05-12 Minh Tri Nguyen , Long Bao Le

A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates linear-programming based reception for coded modulation systems which use direct modulation mapping of coded…

Information Theory · Computer Science 2016-11-15 Mark F. Flanagan , Vitaly Skachek , Eimear Byrne , Marcus Greferath

In this work, a new two-stage identification method based on dynamic programming and sparsity inducing is proposed for switched linear systems. Our method achieves sparsity inducing in the identification of switched linear systems by the…

Systems and Control · Electrical Eng. & Systems 2024-07-15 Zheng Wenju , Ye Hao

In this paper we analyze the performance of several bit-interleaving strategies applied to Non-Binary Low-Density Parity-Check (LDPC) codes over the Rayleigh fading channel. The technique of bit-interleaving used over fading channel…

Information Theory · Computer Science 2013-01-21 Valentin Savin , David Declercq
‹ Prev 1 2 3 10 Next ›