Filters








173 Hits in 3.9 sec

Modified augmented belief propagation for general memoryless channels

Benjamin Gadat, Charly Poulliat
2016 2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)  
CONCLUSION In this paper, we have proposed an efficient implementation of the augmented belief propagation algorithm for LDPC codes over general memoryless channels.  ...  This enables us to consider indifferently general memoryless channels, such as the BSC or the AWGN channel, while still taking into account the influence of irregularity in the graph connectivity.  ... 
doi:10.1109/istc.2016.7593103 dblp:conf/istc/GadatP16 fatcat:mpbgxp4z5vfkrkf2bqtzfnoc4m

Capacity-Approaching Joint Source-Channel Coding for Asymmetric Channels with Low-Density Parity-Check Codes

Cen Feng
2014 Sensors & Transducers  
To demonstrate the effectiveness of the proposed scheme, a code ensemble for joint source-channel coding over asymmetric communication channel is designed for binary memoryless sources with a range of  ...  By using the source- channel adaptors both the asymmetric communication channel and the asymmetric correlation channel can be converted to symmetric channel and the conventional design method for channel  ...  Belief propagation with maximum 200 iterations for each codeword is employed for decoding. More than 400 codewords were transmitted for each simulation.  ... 
doaj:d1a9b0168d304378bec69e93f432683b fatcat:rucjomzosngp7azdrd4uwzm6pa

Universal Algorithms for Channel Decoding of Uncompressed Sources

Erik Ordentlich, Gadiel Seroussi, Sergio Verdu, Krishnamurthy Viswanathan
2008 IEEE Transactions on Information Theory  
In many applications, an uncompressed source stream is systematically encoded by a channel code (which ignores the source redundancy) for transmission over a discrete memoryless channel.  ...  The decoder knows the channel and the code but does not know the source statistics.  ...  ACKNOWLEDGMENT The authors would like to thank Marcelo Weinberger and Tsachy Weissman for discussions that led to this work.  ... 
doi:10.1109/tit.2008.920187 fatcat:rbhi7exrtfbmtdgjrxyfjqn7em

Iterative algebraic soft-decision list decoding of Reed-Solomon codes

M. El-Khamy, R.J. McEliece
2006 IEEE Journal on Selected Areas in Communications  
Building on the Jiang-Narayanan algorithm, we present a belief-propagation based algorithm with a significant reduction in computational complexity.  ...  We introduce the concept of using a belief-propagation based decoder to enhance the soft-input information prior to decoding with an algebraic soft-decision decoder.  ...  Narayanan for providing an extended version of their paper [13] . M. El-Khamy is grateful to M. Kan for confirming many of the simulation results in this paper.  ... 
doi:10.1109/jsac.2005.862399 fatcat:fhqb5rozt5hsjpstltgx7k72ne

Fountain Capacity

Shlomo Shamai, Emre Telatar, Sergio Verdu
2006 2006 IEEE International Symposium on Information Theory  
This paper introduces the notion of fountain capacity for arbitrary channels, and shows that it is equal to the conventional Shannon capacity for stationary memoryless channels.  ...  Fountain codes have been successfully employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates.  ...  The infinite sequence is transmitted through an erasure channel. The decoder runs a belief propagation algorithm observing only as many channel outputs as necessary to recover the k transmitted bits.  ... 
doi:10.1109/isit.2006.261807 dblp:conf/isit/ShamaiTV06 fatcat:yspunmayxbb2fchpvgr3dww5sa

Fountain Capacity

S. Shamai, I.E. Telatar, S. Verdu
2007 IEEE Transactions on Information Theory  
We show that fountain capacity and Shannon capacity are equal for stationary memoryless channels.  ...  This correspondence introduces the notion of fountain capacity for arbitrary channels.  ...  The decoder runs a belief propagation algorithm observing only as many channel outputs as necessary to recover the k transmitted bits. 18]) CR = max P min I(P; W ) = min max P I(P; W )  ... 
doi:10.1109/tit.2007.907495 fatcat:de3woei5uneazg74hp4d5tz44i

CRC error correction for energy-constrained transmission

Evgeny Tsimbalo, Xenofon Fafoutis, Robert J Piechocki
2015 2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)  
Using the CRC-24 code adopted by the Bluetooth Low Energy standard as an example, we show how two iterative techniques traditionally used for decoding of low-density parity check codes -Belief Propagation  ...  demonstrated that a gain of up to 1.7 dB in terms of the SNR per bit and a total reduction of the packet error rate by more than 70% can be achieved compared with the non-correction scenario, at no extra cost for  ...  Belief Propagation Decoding BP decoding in the form of the sum-product algorithm is a standard approach to decode LDPC codes.  ... 
doi:10.1109/pimrc.2015.7343337 dblp:conf/pimrc/TsimbaloFP15 fatcat:6w5zdx4lazcfhnu3fb4pvyzemq

Decoding Reed-Muller Codes Using Minimum-Weight Parity Checks [article]

Elia Santi, Christian Häger, Henry D. Pfister
2018 arXiv   pre-print
As examples, we consider the peeling decoder for the binary erasure channel, linear-programming and belief propagation (BP) decoding for the binary-input additive white Gaussian noise channel, and bit-flipping  ...  and BP decoding for the binary symmetric channel.  ...  Belief Propagation BP decoding is an iterative method for decoding binary linear codes transmitted over memoryless channels [15] . It works by passing messages along the edges of the Tanner graph.  ... 
arXiv:1804.10319v1 fatcat:dx6o3qq4kbbubiyqibnfxlunp4

Decoding Reed-Muller Codes Using Minimum- Weight Parity Checks

Elia Santi, Christian Hager, Henry D. Pfister
2018 2018 IEEE International Symposium on Information Theory (ISIT)  
As examples, we consider the peeling decoder for the binary erasure channel, linear-programming and belief propagation (BP) decoding for the binary-input additive white Gaussian noise channel, and bit-flipping  ...  and BP decoding for the binary symmetric channel.  ...  Belief Propagation BP decoding is an iterative method for decoding binary linear codes transmitted over memoryless channels [14] . It works by passing messages along the edges of the Tanner graph.  ... 
doi:10.1109/isit.2018.8437637 dblp:conf/isit/SantiHP18 fatcat:4kvseoxu6jhfxls7ud53vq5hzm

Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems [article]

Siva Gorantla, Todd Coleman
2011 arXiv   pre-print
Motivated by a desire to foster links between control and information theory, we augment the standard formulation by considering general alphabets and a cost function operating on current and previous  ...  We emphasize an example where the decoder alphabet lies in a space of beliefs on the source alphabet, and the additive cost function is a log likelihood ratio pertaining to sequential information gain.  ...  A timeinvariant 'posterior matching' encoding scheme in Figure 2 's framework achieves capacity on general memoryless channels [15] .  ... 
arXiv:1102.0250v1 fatcat:kjwuxv2t7rgdpcm3jfbmfteuxa

Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels

Aravind R. Iyengar, Marco Papaleo, Paul H. Siegel, Jack Keil Wolf, Alessandro Vanelli-Coralli, Giovanni E. Corazza
2012 IEEE Transactions on Information Theory  
We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm.  ...  We show that the structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed  ...  ACKNOWLEDGMENT The authors are very grateful to the anonymous reviewers for their comments and suggestions for improving the presentation of the paper.  ... 
doi:10.1109/tit.2011.2177439 fatcat:tr4ooffz2ng2bdicahz3334jua

Factor graphs and the sum-product algorithm

F.R. Kschischang, B.J. Frey, H.-A. Loeliger
2001 IEEE Transactions on Information Theory  
propagation algorithm for Bayesian networks, the Kalman filter, and certain fast Fourier transform (FFT) algorithms.  ...  In this tutorial paper, we present a generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph.  ...  Fig. 25 . 25 Messages sent in belief propagation.  ... 
doi:10.1109/18.910572 fatcat:7ogeo7loqvhvxcduit2z6o5poa

Distributed In-Network Channel Decoding

Hao Zhu, G.B. Giannakis, A. Cano
2009 IEEE Transactions on Signal Processing  
Average log-likelihood ratios (LLRs) constitute sufficient statistics for centralized maximum-likelihood block decoding as well as for a posteriori probability evaluation which enables bit-wise (possibly  ...  Interestingly, simulated tests corroborating the analytical findings demonstrate that only a few consensus iterations suffice for the novel distributed decoders to approach the performance of their centralized  ...  To obtain this average, belief consensus and belief propagation approaches were developed in [10] and [17] in the context of distributed detection.  ... 
doi:10.1109/tsp.2009.2023936 fatcat:2vfpo2yl4bfn5mq3s2dvygkady

Belief propagation as a dynamical system: the linear case and open problems

B.S. Rüffer, S.R. Weller, P.M. Dower, C.M. Kellett
2010 IET Control Theory & Applications  
We present an equivalent discrete-time dynamical system interpretation of an algorithm commonly used in information theory called Belief Propagation.  ...  Belief Propagation (BP) is one instance of the so-called Sum-Product Algorithm and arises, e.g., in the context of iterative decoding of Low-Density Parity-Check codes.  ...  In particular, under the moniker of belief propagation (BP) it has revolutionized error correction coding.  ... 
doi:10.1049/iet-cta.2009.0233 fatcat:5yqidqxik5bn7ozov3d5fatrae

Automorphism Ensemble Decoding of Reed-Muller Codes [article]

Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink
2021 arXiv   pre-print
The decoding algorithm can be seen as a generalization of multiple-bases belief propagation (MBBP) and may use any polar or RM decoder as constituent decoders.  ...  We provide extensive error-rate performance simulations for successive cancellation (SC)-, SC-list (SCL)- and belief propagation (BP)-based constituent decoders.  ...  Additionally, an attenuation factor for all checkto-variable node messages is applied to mitigate short cycle effects. 6) Neural Belief Propagation Decoding: Neural belief propagation (NBP) decoding as  ... 
arXiv:2012.07635v2 fatcat:3iesonywdzcthhbc66otw7dzte
« Previous Showing results 1 — 15 out of 173 results