000198248 001__ 198248
000198248 005__ 20190316235907.0
000198248 0247_ $$2doi$$a10.1109/Lcomm.2014.030714.132830
000198248 022__ $$a1089-7798
000198248 02470 $$2ISI$$a000338114700033
000198248 037__ $$aARTICLE
000198248 245__ $$aDensity Evolution for Min-Sum Decoding of LDPC Codes Under Unreliable Message Storage
000198248 260__ $$bInstitute of Electrical and Electronics Engineers$$c2014
000198248 269__ $$a2014
000198248 336__ $$aJournal Articles
000198248 520__ $$aWe analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this model. Subsequently, we formulate the corresponding density evolution equations to predict the average bit error probability in the limit of infinite blocklength. We present numerical threshold results and we show that using more quantization bits is not always beneficial in the context of faulty decoders.
000198248 6531_ $$aLDPC codes
000198248 6531_ $$amin-sum decoding
000198248 6531_ $$afaulty decoding
000198248 700__ $$aBalatsoukas-Stimming, Alexios
000198248 700__ $$g194090$$aBurg, Andreas Peter$$0245488
000198248 773__ $$j18$$tIEEE Communications Letters$$k5$$q849-852
000198248 8564_ $$uhttps://infoscience.epfl.ch/record/198248/files/bare_jrnl_2.pdf$$zPreprint$$s329727$$yPreprint
000198248 909C0 $$xU12395$$0252398$$pTCL
000198248 909CO $$qGLOBAL_SET$$pSTI$$ooai:infoscience.tind.io:198248$$particle
000198248 917Z8 $$x218000
000198248 917Z8 $$x148230
000198248 937__ $$aEPFL-ARTICLE-198248
000198248 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000198248 980__ $$aARTICLE