Results 251 to 260 of about 35,523 (280)
Some of the next articles are maybe not open access.
Memristive Circuits for LDPC Decoding
IEEE Journal on Emerging and Selected Topics in Circuits and Systems, 2014We present design principles for implementing decoders for low-density parity check codes in CMOL-type memristive circuits. The programmable nonvolatile connectivity enabled by the nanowire arrays in such circuits is used to map the parity check matrix of an LDPC code in the decoder, while decoding operations are realized by a cellular CMOS circuit ...
Poikonen, Jussi H. +4 more
openaire +5 more sources
The Ninth International Conference onCommunications Systems, 2004. ICCS 2004., 2004
Low-density parity-check (LDPC) codes are well known for their abilities to achieve near Shannon channel capacity limit and low decoding complexity compared with the turbo decoder. However, their encoding complexities grow with the square of the code length.
Zhang Qi, Ng Chun Sum
openaire +2 more sources
Low-density parity-check (LDPC) codes are well known for their abilities to achieve near Shannon channel capacity limit and low decoding complexity compared with the turbo decoder. However, their encoding complexities grow with the square of the code length.
Zhang Qi, Ng Chun Sum
openaire +2 more sources
2006 8th international Conference on Signal Processing, 2006
The presented LDPC-codec has no encrypting function since its rediscovering, and the presented encrypting for signal transmission needs additional algorithm and program, which leads the great time delay for the signal receiving. This paper reveals that LDPC-codec itself can have the desired encrypting faction if adopting our processing approach for the
Yang Xiao, Moon Ho Lee, Ying Zhao
openaire +2 more sources
The presented LDPC-codec has no encrypting function since its rediscovering, and the presented encrypting for signal transmission needs additional algorithm and program, which leads the great time delay for the signal receiving. This paper reveals that LDPC-codec itself can have the desired encrypting faction if adopting our processing approach for the
Yang Xiao, Moon Ho Lee, Ying Zhao
openaire +2 more sources
Integrated Design of JSCC Scheme Based on Double Protograph LDPC Codes System
IEEE Communications Letters, 2019In this letter, an integrated design of joint source-channel coding scheme based on the double protograph low-density parity-check (DP-LDPC) codes is proposed.
Qiwang Chen +3 more
semanticscholar +1 more source
Adapting Layer RBERs Variations of 3D Flash Memories via Multi-granularity Progressive LDPC Reading
Design Automation Conference, 2019Existing studies have uncovered that there exist significant Raw Bit Error Rates (RBERs) variations among different layers of 3D flash memories due to manufacture process variation.
Yajuan Du +4 more
semanticscholar +1 more source
BER comparison between Convolutional, Turbo, LDPC, and Polar codes
International Conference on Telecommunications, 2017Channel coding is a fundamental building block in any communications system. High performance codes, with low complexity encoding and decoding are a must-have for future wireless systems, with requirements ranging from the operation in highly reliable ...
Bashar Tahir, Stefan Schwarz, M. Rupp
semanticscholar +1 more source
Optimal Search for Girth-8 Quasi Cyclic and Spatially Coupled Multiple-Edge LDPC Codes
IEEE Communications Letters, 2019Two essential categories of LDPC codes that are more preferable to other types are quasi-cyclic LDPC (QC-LDPC) codes and spatially coupled LDPC convolutional codes (SC-LDPC-CCs) because of their excellent performance curves in waterfall and error floor ...
Mohammad-Reza Sadeghi
semanticscholar +1 more source
Rate-Adaptive Protograph LDPC Codes for Multi-Level-Cell NAND Flash Memory
IEEE Communications Letters, 2018The multi-level-cell (MLC) NAND flash memory exhibits a diversity of the raw bit error rate (BER) over different program/erase (P/E) cycles and different types of bits within a memory cell.
Pingping Chen, K. Cai, Shi Zheng
semanticscholar +1 more source
2014
The outstanding success of Low-Density Parity-Check codes in providing practical constructions that closely approach the theoretical Shannon limit is rooted in the way they are decoded. They feature iterative message-passing decoders able to convey information between coded bits, so as to progressively improve the estimation of the sent codeword.
openaire +2 more sources
The outstanding success of Low-Density Parity-Check codes in providing practical constructions that closely approach the theoretical Shannon limit is rooted in the way they are decoded. They feature iterative message-passing decoders able to convey information between coded bits, so as to progressively improve the estimation of the sent codeword.
openaire +2 more sources
2021
Low-density parity-check (LDPC) codes are a class of linear block codes that were first presented by Gallager in 1962. These codes have been the subject of much interest due to the fact that they can perform near Shannon limit. In this talk we study low-density parity-check (LDPC) codes having cubic semisymmetric graphs as their Tanner graphs.
Šimac, Marina +2 more
openaire +1 more source
Low-density parity-check (LDPC) codes are a class of linear block codes that were first presented by Gallager in 1962. These codes have been the subject of much interest due to the fact that they can perform near Shannon limit. In this talk we study low-density parity-check (LDPC) codes having cubic semisymmetric graphs as their Tanner graphs.
Šimac, Marina +2 more
openaire +1 more source