Filters








1,479 Hits in 4.1 sec

Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity

H.D. Pfister, I. Sason, R. Urbanke
2005 IEEE Transactions on Information Theory  
The bound holds for every memoryless binary-input output-symmetric channel and is refined for the BEC.  ...  We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (  ...  Acknowledgment The authors wish to thank the Associate Editor, Prof. Robert J. McEliece, for handling their paper.  ... 
doi:10.1109/tit.2005.850079 fatcat:vkjvt4yrjrbnnogb46ojvywjnu

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

H. Pfister, I. Sason, R. Urbanke
2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel  
The bound holds for every memoryless binary-input output-symmetric channel and is refined for the binary erasure channel.  ...  We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel with  ...  Acknowledgment The authors wish to thank the Associate Editor, Prof. Robert J. McEliece, for handling their paper.  ... 
doi:10.1109/eeei.2004.1361101 fatcat:dj4cvst6ejhqrincx5xka6a7f4

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

H. Pfister, I. Sason, R. Urbanke
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.  
The bound holds for every memoryless binary-input output-symmetric channel and is refined for the binary erasure channel.  ...  We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel with  ...  Acknowledgment The authors wish to thank the Associate Editor, Prof. Robert J. McEliece, for handling their paper.  ... 
doi:10.1109/isit.2004.1365246 dblp:conf/isit/PfisterSU04 fatcat:whr6z2z5t5hghk6fvyfurkznqe

Bounds on the decoding complexity of punctured codes on graphs [article]

H. Pfister, I. Sason, R. Urbanke
2004 arXiv   pre-print
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (  ...  The bound holds for every memoryless binary-input output-symmetric channel, and is refined for the BEC.  ...  Capacity-achieving ensembles of irregular repeat-accumulate (IRA) codes for the BEC were introduced and analyzed in [1, 10] , and also capacity-achieving ensembles for erasure channels with memory were  ... 
arXiv:cs/0409027v1 fatcat:br3jcuarrvdqphpdtlicrmdali

Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel

Igal Sason, Gil Wiechman
2008 2008 IEEE International Symposium on Information Theory  
We derive simple lower bounds on the number of iterations which are required to communicate over the binary erasure channel when graph-based code ensembles are used in conjunction with an iterative message-passing  ...  It is demonstrated that, under a mild condition, the number of iterations required for successful decoding scales at least like the inverse of the gap (in rate) to capacity.  ...  This included preliminary steps towards the derivation of a lower bound on the number of iterations for LDPC code ensembles. I. Sason also wishes to acknowledge H. D.  ... 
doi:10.1109/isit.2008.4595318 dblp:conf/isit/SasonW08 fatcat:a5bioqs7bndddo4f2s4guuo4ja

Bounds on the convergence speed of iterative message-passing decoders over the binary erasure channel

Igal Sason, Gil Wiechman
2008 2008 5th International Symposium on Turbo Codes and Related Topics  
Capacity-achieving ensembles of systematic accumulate-repeat-accumulate (ARA) codes with bounded complexity (Pfister & Sason, Trans.  ...  The sequence achieves 1 − ε of the channel capacity with vanishing bit erasure prob. under message-passing decoding. L 2 (ε) -fraction of variable nodes of degree 2.  ... 
doi:10.1109/turbocoding.2008.4658690 fatcat:mpzoxgkm4fgyvpn3dfphge7upy

Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel

Igal Sason, Gil Wiechman
2009 IEEE Transactions on Information Theory  
The transmission of the code ensembles is assumed to take place over a binary erasure channel, and the bounds refer to the asymptotic case where we let the block length tend to infinity.  ...  -2 variable nodes, the target bit erasure probability and the gap between the channel capacity and the design rate of the ensemble.  ...  A similar result of a bounded graphical complexity for capacity-achieving ensembles over the BEC was also obtained in [9] .  ... 
doi:10.1109/tit.2009.2018342 fatcat:vijilrzggzc4zenk73yjeffgim

Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe [article]

Igal Sason, Gil Wiechman
2007 arXiv   pre-print
The transmission of the code ensembles is assumed to take place over a binary erasure channel, and the bounds refer to the asymptotic case where we let the block length tend to infinity.  ...  -2 variable nodes, the target bit erasure probability and the gap between the channel capacity and the design rate of the ensemble.  ...  A similar result of a bounded graphical complexity for capacity-achieving ensembles over the BEC was also obtained in [9] .  ... 
arXiv:0711.1056v1 fatcat:y5ox5ylq4jhprfwdgf346kiooq

Information-theoretic lower bounds on the bit error probability of codes on graphs

I. Sason, R. Urbanke
2003 IEEE International Symposium on Information Theory, 2003. Proceedings.  
We present lower bounds on the bit error probability of binary linear block codes, and on the gap between the channel capacity and the rate of these codes for which reliable communication is achievable  ...  The tightness of the lower bounds is especially pronounced for the binary erasure channel (BEC); to this end, we analyze a sequence of ensembles of low-density parity-check (LDPC) codes which closely approach  ...  Figure 1 : 1 Lower bounds on the bit erasure probability for any binary linear code which is transmitted over a BEC.  ... 
doi:10.1109/isit.2003.1228283 fatcat:yay7cv3yljeadlovolrntmdwh4

Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel

I. Sason, R. Urbanke
2004 IEEE Transactions on Information Theory  
We derive upper and lower bounds on the encoding and decoding complexity of two capacity-achieving ensembles of irregular repeat-accumulate (IRA1 and IRA2) codes on the binary erasure channel (BEC).  ...  These bounds are expressed in terms of the gap between the channel capacity and the rate of a typical code from this ensemble for which reliable communications is achievable under message-passing iterative  ...  The authors thank the associate editor Simon Litsyn for handling their paper.  ... 
doi:10.1109/tit.2004.828101 fatcat:3hguwp5ugjhxhjw7vooxiw55ve

Capacity Achieving Codes From Randomness Condensers [article]

Mahdi Cheraghchi
2011 arXiv   pre-print
the binary erasure and symmetric channels.  ...  We establish a general framework for construction of small ensembles of capacity achieving linear codes for a wide range of (not necessarily memoryless) discrete symmetric channels, and in particular,  ...  CODES FOR THE BINARY SYMMETRIC CHANNEL The goal of this section is to design capacity achieving code ensembles for the binary symmetric channel BSC(p).  ... 
arXiv:0901.1866v2 fatcat:3qcsgrdvafcx7mb2i7isc5x3lm

Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels [article]

Manik Raina, Predrag Spasojevic
2010 arXiv   pre-print
It is shown that the LDGM-LDPC codes achieve rates arbitrarily close to the channel-capacity of the binary-input symmetric-output memoryless (BISOM) channel with bounded complexity.  ...  The stability condition for decoding the irregular LDGM-LDPC codes over the binary-erasure channel (BEC) under iterative-decoding with message-passing is described.  ...  The ensemble of irregular LDGM-LDPC codes have been shown to achieve the capacity of the BISOM channel with bounded complexity.  ... 
arXiv:1003.2454v3 fatcat:jufgucdz2nfwnf7cy356khcuq4

On Universal Properties of Capacity-Approaching LDPC Code Ensembles

Igal Sason
2009 IEEE Transactions on Information Theory  
A proper modification of these bounds makes them universal for the set of all MBIOS channels which exhibit a given capacity.  ...  The bounds are compared with capacity-approaching LDPC code ensembles under BP decoding, and they are shown to be informative and are easy to calculate.  ...  Considered here is a BEC whose capacity is 1 2 bit per channel use, and where 99.9% of capacity is achieved under iterative message-passing decoding with vanishing bit erasure probability.  ... 
doi:10.1109/tit.2009.2021305 fatcat:6hhng4qdvrb3hfopp3vuhsbh74

On the Parity-Check Density and Achievable Rates of LDPC Codes [article]

Gil Wiechman, Igal Sason
2005 arXiv   pre-print
The lower bounds on the parity-check density are expressed in terms of the gap between the channel capacity and the rate of the codes for which reliable communication is achievable, and are valid for every  ...  The new upper bounds on the achievable rates of binary linear block codes tighten previously reported bounds by Burshtein et al., and therefore enable to obtain tighter upper bounds on the thresholds of  ...  The authors acknowledge Andrea Montanari for his correspondence regarding [7] .  ... 
arXiv:cs/0505078v2 fatcat:4gusew5arfdqlfzunzo4jdeqmy

Performance of low-density parity-check codes with linear minimum distance

H. Pishro-Nik, F. Fekri
2006 IEEE Transactions on Information Theory  
We first obtain a lower bound on the achievable rates of these ensembles over memoryless binary-input output-symmetric channels. For the binary erasure channel a tighter bound is obtained.  ...  We also introduce a method to construct the codes meeting the lower bound for the binary erasure channel.  ...  For the binary erasure channel (BEC) with low enough channel erasure probability, using a simple union bound we can show that the BER of an expurgated ensemble with λ (0)ρ (1) < 1 decreases exponentially  ... 
doi:10.1109/tit.2005.860439 fatcat:fm6rzv257zgijeicjjtv4azewe
« Previous Showing results 1 — 15 out of 1,479 results