Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Aravind R. Iyengar"'
Publikováno v:
IEEE Transactions on Information Theory. 62:793-810
We consider a new formulation of a class of synchronization error channels and derive analytical bounds and numerical estimates for the capacity of these channels. For the binary channel with only deletions, we obtain an expression for the symmetric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33954fdbcc6a9fc30423109686a4d21c
https://doi.org/10.1109/tit.2015.2504358
https://doi.org/10.1109/tit.2015.2504358
Publikováno v:
IEEE Journal on Selected Areas in Communications. 32:933-945
We consider t-write codes for write-once memories with n cells that can store multiple levels. Assuming an underlying lattice-based construction and using the continuous approximation, we derive upper bounds on the worst-case sum-rate optimal and fix
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab7e66104a4f87cfc1034bc1bf1269b3
https://doi.org/10.1109/jsac.2014.140513
https://doi.org/10.1109/jsac.2014.140513
Publikováno v:
ISIT
Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach capacity, as well as for f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75fb196cf42dac80be6efb3643544d05
https://doi.org/10.1109/tit.2012.2231465
https://doi.org/10.1109/tit.2012.2231465
Autor:
Giovanni Emanuele Corazza, Paul H. Siegel, Aravind R. Iyengar, Marco Papaleo, Alessandro Vanelli-Coralli, Jack K. Wolf
Publikováno v:
IEEE Transactions on Information Theory. 58:2303-2320
We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code ensembles th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::150eef7af09ba87f301e43d8b0ffdaa1
https://doi.org/10.1109/tit.2011.2177439
https://doi.org/10.1109/tit.2011.2177439
Publikováno v:
IEEE Transactions on Magnetics. 47:35-45
We propose a new write channel model for bit-patterned media recording that reflects the data dependence of write synchronization errors. It is shown that this model accommodates both substitution-like errors and insertion-deletion errors whose stati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4588f421a5a4074a48c5df3846ea353b
https://doi.org/10.1109/tmag.2010.2080667
https://doi.org/10.1109/tmag.2010.2080667
We consider the effect of log-likelihood ratio saturation on belief propagation decoder low-density parity-check codes. Saturation is commonly done in practice and is known to have a significant effect on error floor performance. Our focus is on thre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::677dcba2184a32a15bfd12d8edce6fe5
http://arxiv.org/abs/1412.8090
http://arxiv.org/abs/1412.8090
Publikováno v:
ISIT
We consider the effect of LLR saturation on belief propagation decoding of low-density parity-check codes. Saturation occurs universally in practice and is known to have a significant effect on error floor performance. Our focus is on threshold analy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d6636719a2bb3b070686a6792c02c7c
Publikováno v:
ITW
We consider t-write codes for write-once memories with cells that can store multiple levels. Using worst-case sum-rate optimal 2-cell t-write code constructions for the asymptotic case of continuous levels, we derive 2-cell t-write code constructions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43cc28ab7b437644ee55f10ed5a73479
https://doi.org/10.1109/itw.2012.6404668
https://doi.org/10.1109/itw.2012.6404668
Publikováno v:
ISIT
We propose a new channel model for channels with synchronization errors. Using this model, we give simple, non-trivial and, in some cases, tight lower bounds on the capacity for certain synchronization error channels.
Comment: 5 pages, 1 figure,
Comment: 5 pages, 1 figure,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33c891e37e708c407878b7933af82189
We investigate the reasons behind the superior performance of belief propagation decoding of non-binary LDPC codes over their binary images when the transmission occurs over the binary erasure channel. We show that although decoding over the binary i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95a5ea2e6f62ac6e9f25509f5264b355