FPGA Implementations of LDPC over GF(2m) Decoders
نویسندگان
چکیده
Low Density Parity Check (LDPC) codes over GF(2) are an extension of binary LDPC codes that have not been studied extensively. Performances of GF(2) LDPC codes have been shown to be higher than binary LDPC codes, but the complexity of the encoders/decoders increases. Hence there is a substantial lack of hardware implementations for LDPC over GF(2) codes. This paper presents a FPGA serial implementation of two decoding algorithms for LDPC over GF(2). The results prove that the implementation of LDPC over GF(2) decoding is feasible and the extra complexity of the decoder is balanced by the superior performance of GF(2) LDPC codes.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملHigh-throughput architecture and implementation of regular (2, dc) nonbinary LDPC decoders
Nonbinary LDPC codes have shown superior performance, but decoding nonbinary codes is complex, incurring a long latency and a much degraded throughput. We propose a low-latency variable processing node by a skimming algorithm, together with a low-latency extended min-sum check processing node by prefetching and relaxing redundancy control. The processing nodes are jointly designed for an optima...
متن کاملAn Alternative FPGA Implementation of Decoders for Quasi-Cyclic LDPC Codes
Due to their Shannon-limit-approaching performance and low-complexity decoding, low-density parity-check (LDPC) codes have been used for forward error correction in a broad-range of communication and storage systems. In addition to its low-complexity, the iterative decoding algorithm used for decoding LDPC codes is inherently parallel. To exploit the parallelism at a larger extent, a significan...
متن کاملEfficient VLSI Architectures for Error-Correcting Coding A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY
This thesis is devoted to several efficient VLSI architecture design issues in errorcorrecting coding, including finite field arithmetic, (Generalized) Low-Density ParityCheck (LDPC) codes, and Reed-Solomon codes. A systematic low-complexity bit-parallel finite field multiplier design approach is proposed. This design approach is applicable to GF (2m) constructed by arbitrary irreducible polyno...
متن کاملTradeoff Analysis and Architecture Design of High Throughput Irregular LDPC Decoders
Low density parity check (LDPC) codes have attracted significant research interest thanks to their excellent error-correcting abilities and high level of processing parallelism. Recent architecture designs of LDPC decoders are mostly based on the block-structured parity check matrices (PCMs) composed of horizontal layers or component codes. Irregular block-structured LDPC codes have very good e...
متن کامل