Filters








1,905 Hits in 3.2 sec

Turbo Decoding of Product Codes based on the Modified Adaptive Belief Propagation Algorithm

Christophe Jego, Warren J. Gross
2007 2007 IEEE International Symposium on Information Theory  
The Adaptive Belief Propagation algorithm of Jiang and Narayanan is simplified by moving the matrix adaptation step outside of the iteration loop, significantly reducing the complexity.  ...  This paper introduces the Modified Adaptive Belief Propagation (m-ABP) algorithm, an innovative method for the turbo decoding of product codes based on BCH component codes.  ...  Le Bidan for precious suggestions and interesting comments. They are grateful to P.  ... 
doi:10.1109/isit.2007.4557297 dblp:conf/isit/JegoG07 fatcat:dppq6vu7jna7xjyci6nnnucmma

Turbo decoding of product codes using adaptive belief propagation

Christophe Jego, Warren Gross
2009 IEEE Transactions on Communications  
The complexity of the Turbo-oriented Adaptive Belief propagation (TAB) algorithm is significantly reduced by moving the matrix adaptation step outside of the belief propagation iteration loop.  ...  The Adaptive Belief Propagation (ABP) algorithm was recently proposed by Jiang and Narayanan for the soft decoding of Reed-Solomon (RS) codes.  ...  INTRODUCTION Belief Propagation (BP) decoding [1] is a SISO decoding algorithm for linear block codes that is based on the propagation of soft information along the edges of a graph defined by the parity  ... 
doi:10.1109/tcomm.2009.10.070277 fatcat:dmvjr4hukbbevhuarz7z7j7e4e

Iterative Decoding and Cross-Layering Techniques for Multimedia Broadcasting and Communications

Fred Daneshgaran, Massimiliano Laddomada, Marina Mondin
2008 International Journal of Digital Multimedia Broadcasting  
The second paper "A simple scheme for belief propagation decoding of BCH and RS codes in multimedia transmissions" by Marco Baldi and Franco Chiaraluce proposes a new technique for decoding classic binary  ...  as well as nonbinary codes through the use of the belief propagation algorithm, which has proven to be effective in the decoding of low-density parity-check codes.  ...  ACKNOWLEDGMENTS The authors are grateful to the reviewers for their invaluable work and to the authors of the papers collected in this special issue.  ... 
doi:10.1155/2008/262148 fatcat:xln3lriilnh2dlqzbmhhi4lev4

Turbo decoding as an instance of Pearl's "belief propagation" algorithm

R.J. McEliece, D.J.C. MacKay, Jung-Fu Cheng
1998 IEEE Journal on Selected Areas in Communications  
Unfortunately, however, this belief diagram has loops, and Pearl only proved that his algorithm works when there are no loops, so an explanation of the excellent experimental performance of turbo decoding  ...  community for a decade, but which is relatively unknown to information theorists: Pearl's belief propagation algorithm.  ...  Smyth for apprising them about the "post-Pearl" developments in the belief propagation algorithm, and one of the referees for supplying them with much of the history of the forward-backward algorithm that  ... 
doi:10.1109/49.661103 fatcat:erdsngkghjhq5buism3wgxn3mm

On the Performance of Short Forward Error-Correcting Codes

Sheng Tong, Dengsheng Lin, Aleksandar Kavcic, Li Ping, Baoming Bai
2007 IEEE Communications Letters  
paritycheck (LDPC) codes are almost as good as random binary linear codes; 3) Low complexity belief propagation decoders incur considerable performance loss at short coding lengths.  ...  Our main results (demonstrated by simulations and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short low-density  ...  ACKNOWLEDGMENT The first author is grateful for the great help from Keying Wu and Jing Jiang. We would also like to thank the anonymous reviewers for their valuable comments.  ... 
doi:10.1109/lcomm.2007.070746 fatcat:rcxhigccqre7pp66b6qefyclri

Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation

Charly Poulliat, David Declercq, Thierry Lestable
2008 EURASIP Journal on Wireless Communications and Networking  
Recommended by Branka Vucetic This paper presents a new approach to decode turbo codes using a nonbinary belief propagation decoder. The proposed approach can be decomposed into two main steps.  ...  Then, a group belief propagation decoder runs several iterations on the obtained nonbinary Tanner graph.  ...  CONCLUSION In this paper, we have proposed a new approach to efficiently decode turbo codes using a nonbinary belief propagation decoder.  ... 
doi:10.1155/2008/473613 fatcat:fnq3qpuplzfdrenmqhoj5xdczy

Concatenated tree codes: a low-complexity, high-performance approach

Li Ping, K.Y. Wu
2001 IEEE Transactions on Information Theory  
They can also be regarded as special turbo codes with hybrid recursive/nonrecursive parts and multiple constituent codes. CT codes are decodable by the belief-propagation algorithm.  ...  They combine many advantages of LDPC and turbo codes, such as low decoding cost, fast convergence speed, and good performance.  ...  ACKNOWLEDGMENT The authors wish to thank the anonymous reviewers for the detailed comments and corrections from . They would also like to acknowledge help from W. K. Leung and J. K. S. Ho.  ... 
doi:10.1109/18.910589 fatcat:44w726sivvcbtnzops3mzkjp3e

Code Design for Short Blocks: A Survey [article]

Gianluigi Liva and Lorenzo Gaudio and Tudor Ninacs and Thomas Jerkovits
2016 arXiv   pre-print
In this work, we review some of the most recent code constructions targeting the short block regime, and we compare then with both finite-length performance bounds and classical error correction coding  ...  However, the decoding complexity of OSD scales less favorably with the block length than that of (non-binary) belief propagation (which is linear in the block length for a fixed iteration count and ensemble  ...  The belief propagation algorithm for the non-binary LDPC and turbo codes presented in this manuscript is performed in the probability domain to allow for FFT-based decoding at the check nodes Remark 2  ... 
arXiv:1610.00873v1 fatcat:k5regehlmjamzewz2laztoeoey

A Max-Product EM Algorithm for Reconstructing Markov-Tree Sparse Signals From Compressive Samples

Zhao Song, Aleksandar Dogandzic
2013 IEEE Transactions on Signal Processing  
We propose a Bayesian expectation-maximization (EM) algorithm for reconstructing Markov-tree sparse signals via belief propagation.  ...  The measurements follow an underdetermined linear model where the regression-coefficient vector is the sum of an unknown approximately sparse signal and a zero-mean white Gaussian noise with an unknown  ...  Following the AMP framework, Schniter [11] proposed a turbo-AMP structured sparse signal recovery method based on loopy belief propagation and turbo equalization and applied it to reconstruct one-dimensional  ... 
doi:10.1109/tsp.2013.2277833 fatcat:xor7e5pc6naa5oxc3bvkpzxsye

Bethe Free Energy Approach to LDPC Decoding on Memory Channels [article]

Jaime A. Anguita, Michael Chertkov, Mark A. Neifeld, Bane Vasic
2009 arXiv   pre-print
We present for the first time the derivation of the belief propagation (BP) equations that allow the simultaneous detection and decoding of a LDPC codeword in a PR channel.  ...  A simple algorithmic solution to the set of BP equations is proposed and evaluated using numerical simulations, yielding bit-error rate performances that surpass those of turbo equalization.  ...  BETHE FREE ENERGY AND BELIEF PROPAGATION EQUATIONS We begin this Section by briefly introducing the concept of beliefs and the Bethe free energy.  ... 
arXiv:0904.0747v1 fatcat:fi7i2mkeazgqhiyo35sr673hie

On Short Forward Error-Correcting Codes for Wireless Communication Systems

Sheng Tong, Dengsheng Lin, Aleksandar Kavcic, Baoming Bai, Li Ping
2007 2007 16th International Conference on Computer Communications and Networks  
parity-check (LDPC) codes are almost as good as random binary linear codes when high decoding complexity can be tolerated; 3) Low complexity belief propagation decoders incur considerable performance  ...  Our main results (demonstrated by both simulation and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short lowdensity  ...  ACKNOWLEDGMENT The first author is grateful for the valuable help received from Keying Wu and Jing Jiang.  ... 
doi:10.1109/icccn.2007.4317850 dblp:conf/icccn/TongLKBP07 fatcat:qa4r74qqg5ftrljzoddg7wxgue

Compressive imaging using approximate message passing and a Markov-tree prior

Subhojit Som, Lee C. Potter, Philip Schniter
2010 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers  
Like other recent works, we model wavelet structure using a hidden Markov tree (HMT) but, unlike other works, ours is based on loopy belief propagation (LBP).  ...  For LBP, we adopt a recently proposed "turbo" message passing schedule that alternates between exploitation of HMT structure and exploitation of compressive-measurement structure.  ...  We then alternate between belief propagation on each of these two subgraphs, treating the likelihoods on generated from belief propagation on one subgraph as priors for subsequent belief propagation on  ... 
doi:10.1109/acssc.2010.5757509 fatcat:5qelibogszcjnic6gg4qfmnmfu

Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior

Subhojit Som, Philip Schniter
2012 IEEE Transactions on Signal Processing  
Like other recent works, we model wavelet structure using a hidden Markov tree (HMT) but, unlike other works, ours is based on loopy belief propagation (LBP).  ...  For LBP, we adopt a recently proposed "turbo" message passing schedule that alternates between exploitation of HMT structure and exploitation of compressive-measurement structure.  ...  We then alternate between belief propagation on each of these two subgraphs, treating the likelihoods on generated from belief propagation on one subgraph as priors for subsequent belief propagation on  ... 
doi:10.1109/tsp.2012.2191780 fatcat:anzbl343hfgfxejxdg7qqigckm

Belief propagation based decoding of large non-orthogonal STBCs

Madhekar Suneel, Pritam Som, A. Chockalingam, B. Sundar Rajan
2009 2009 IEEE International Symposium on Information Theory  
In addition, it also achieves near-capacity turbo coded BER performance; for e.g., with BP decoding of 24 × 24 STBC from CDA using BPSK (i.e., 576 real dimensions) and rate-1/2 turbo code (i.e., 12 bps  ...  In this paper, we present a belief propagation (BP) based algorithm for decoding non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having large dimensions.  ...  Belief propagation [8] is known to be well suited in several communication problems [9] ; e.g., decoding of turbo codes and LDPC codes [10] , [11] , multiuser detection [12] , [13] , signal detection  ... 
doi:10.1109/isit.2009.5205658 dblp:conf/isit/SuneelSCR09 fatcat:tqgwx7ryrfejrpfnep7fmmn5ha

Stochastic Decoding of Linear Block Codes With High-Density Parity-Check Matrices

S. Sharifi Tehrani, C. Jego, Bo Zhu, W.J. Gross
2008 IEEE Transactions on Signal Processing  
RS) codes and, block turbo codes based on BCH component codes.  ...  Simulation results for a (128, 120) BCH code, a (31, 25) and a (63, 55) RS code and, a (256, 121) and a (1024, 676) BCH block turbo code demonstrate decoding performance close to the iterative SISO decoding  ...  Adaptive Belief Propagation BCH and RS codes are important classes of linear cyclic error-correcting codes with multiple error detection and correction capability.  ... 
doi:10.1109/tsp.2008.929337 fatcat:i66ngf3obvdwbmu26vhxqspthy
« Previous Showing results 1 — 15 out of 1,905 results