Results 301 to 310 of about 196,265 (325)

Low Density Parity Check Codes

2015
Low density parity check (LDPC) codes are forward error-correction codes, invented by Robert Gallager in his MIT Ph.D. dissertation, 1960. The LDPC codes are ignored for long time due to their high computational complexity and domination of highly structured algebraic block and convolutional codes for forward error correction.
openaire   +2 more sources

A 0.18-$muhbox m$CMOS Analog Min-Sum Iterative Decoder for a (32,8) Low-Density Parity-Check (LDPC) Code

IEEE Journal of Solid-State Circuits, 2006
Current-mode circuits are presented for implementing analog min-sum (MS) iterative decoders. These decoders are used to efficiently decode the best known error correcting codes such as low-density parity-check (LDPC) codes and turbo codes.
S. Hemati, A. Banihashemi, C. Plett
semanticscholar   +1 more source

The renaissance of gallager's low-density parity-check codes

IEEE Communications Magazine, 2003
LDPC codes were invented in 1960 by R. Gallager. They were largely ignored until the discovery of turbo codes in 1993. Since then, LDPC codes have experienced a renaissance and are now one of the most intensely studied areas in coding. In this article we review the basic structure of LDPC codes and the iterative algorithms that are used to decode them.
Richardson, T., Urbanke, R.
openaire   +3 more sources

Multilevel coding for low‐density parity‐check codes

Electronics and Communications in Japan (Part I: Communications), 2007
AbstractIn recent years attention has turned to LDPC codes, which show performance approaching communication path capacity. In the past, application of LDPC codes has mainly been BPSK‐based proposals. In this paper, we propose a new design method for multilevel coding that uses LDPC codes as element codes.
Hideki Imai, Wataru Matsumoto, Weigang Xu   +2 more
openaire   +2 more sources

Low-Density Parity-Check Codes

2000
Gallager first proposed low-density parity-check (LDPC) codes and their iterative detection algorithm in 1962 [Gallager, 1962]. They have been almost forgotten for thirty years. Recently, with the extensive research on “turbo-like” codes and on iterative detection, LDPC codes re-emerge as another category of random codes approaching the Shannon ...
openaire   +2 more sources

A Stopping Criterion for Low-Density Parity-Check Codes

2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring, 2007
Low-density parity-check (LDPC) codes have an inherent stopping criterion, parity-check constraints (equations). By testing the parity-check constraints, an LDPC decoder can detect successful decoding and stop their decoding, which is, however, not possible with turbo codes.
Shin, D, Ha, J Ha, Jeongseok, Heo, K, Lee, H Lee, HyuckJae   +3 more
openaire   +4 more sources

Low-density parity-check accumulate codes

2010 International Symposium On Information Theory & Its Applications, 2010
This paper presents a class of high-rate codes called low-density parity-check accumulate (LDPCA) codes. The code design is the serial concatenation of an LDPC outer code and an accumulator with an interleaver. The iterative decoding for the LDPCA code design has complexity linear to the code length.
Shu Lin, Chung-Li Wang
openaire   +2 more sources

Design and Test of a 175-Mb/s, Rate-1/2 (128,3,6) Low-Density Parity-Check Convolutional Code Encoder and Decoder

IEEE Journal of Solid-State Circuits, 2007
Low-density parity-check block codes (LDPC-BCs) are quickly becoming the forward error correcting code of choice for emerging communication standards. However, low-density parity-check convolutional codes (LDPC-CCs), the convolutional counterpart of LDPC-
R. Swamy, S. Bates, T. Brandon, B. Cockburn, D. Elliott, J. C. Koob, Zhengang Chen   +6 more
semanticscholar   +1 more source

Low-Density Parity-Check Codes

2013
Low-density parity-check (LDPC) codes were introduced in 1960 by R. Gallager [1] in his Phd thesis. He already introduced the iterative method for decoding LDPC codes. However, also due to their computational and implementation complexity the iterative decoding was largely ignored.
openaire   +2 more sources

Quasicyclic low density parity check codes

IEEE International Symposium on Information Theory, 2003. Proceedings., 2003
In this work, the construction of low density parity check codes (LDPCs) from circulant permutation matrices is investigated. It is shown that such codes can not have a Tanner graph representation with girth larger than 12, and a relatively loose necessary and sufficient condition for the code to have a girth of 6, 8, 10 or 12 is derived. These results
openaire   +2 more sources