LDPC Code Density Evolution in the Error Floor Region

نویسندگان

  • Brian K. Butler
  • Paul H. Siegel
چکیده

This short paper explores density evolution (DE) for low-density parity-check (LDPC) codes at signal-to-noise-ratios (SNRs) that are significantly above the decoding threshold. The focus is on the additive white Gaussian noise channel and LDPC codes in which the variable nodes have regular degree. Prior work, using DE, produced results in the error floor region which were asymptotic in the belief-propagation decoder’s log-likelihood ratio (LLR) values. We develop expressions which closely approximate the LLR growth behavior at moderate LLR magnitudes. We then produce bounds on the mean extrinsic check-node LLR values required, as a function of SNR, such that the growth rate of the LLRs exceeds that of a particular trapping set’s internal LLRs such that its error floor contribution may be eliminated. We find that our predictions for the mean LLRs to be accurate in the error floor region, but the predictions for the LLR variance to be lacking beyond several initial iterations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of LDPC Decoders for Low Error Rate Performance

Many classes of high-performance low-density parity-check (LDPC) codes are based on parity check matrices composed of permutation submatrices. We describe the design of a parallel-serial decoder architecture that can be used to map any LDPC code with such structure to a hardware emulation platform. High-throughput emulation allows for the exploration of the low bit error rate (BER) region and p...

متن کامل

Error Floors of LDPC Codes

We introduce a computational technique that accurately predicts performance for a given LDPC code in the error floor region. We present some results obtained by applying the technique and describe certain aspects of it.

متن کامل

An Efficient Heuristic Approach for Irregular LDPC Code Construction with Low Error

Low-Density Parity-Check (LDPC) codes are increasingly being considered as good candidates for the nextgeneration FEC codes in high throughput wireless and recording applications. Trapping sets (TSs) are known to cause error floors in regular and irregular low-density parity-check (LDPC) codes. In existing algorithm, namely the Progressive-Edge-Growth Approximate-minimum-Cycle-Set-Extrinsic-mes...

متن کامل

Investigation of Error Floors of Structured Low- Density Parity-Check Codes by Hardware Emulation

Several high performance LDPC codes have parity check matrices composed of permutation submatrices. We design a parallel-serial architecture to map the decoder of any structured LDPC code in this large family to a hardware emulation platform. A peak throughput of 240Mb/s is achieved in decoding the (2048,1723) Reed-Solomon based LDPC (RS-LDPC) code. Experiments in the low bit error rate (BER) r...

متن کامل

Lowering Error Floors by Concatenation of Low-Density Parity-Check and Array Code

Low-density parity-check (LDPC) codes have been shown to deliver capacity approaching performance; however, problematic graphical structures (e.g. trapping sets) in the Tanner graph of some LDPC codes can cause high error floors in bit-errorratio (BER) performance under conventional sum-product algorithm (SPA). This paper presents a serial concatenation scheme to avoid the trapping sets and to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1409.5783  شماره 

صفحات  -

تاریخ انتشار 2014