Results 261 to 270 of about 2,457,220 (279)

Construction of Quasi-Cyclic LDPC Codes via Masking With Successive Cycle Elimination

IEEE Communications Letters, 2016
In this letter, we study the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes by array dispersion and masking. We first propose a class of arrays of circulant permutation matrices (CPMs) of arbitrary size obtained by dispersion ...
Hengzhou Xu, Dan Feng, Rui Luo, B. Bai
semanticscholar   +1 more source

Array Codes as LDPC Codes

2001
An area of great interest for LDPC codes is the use of structured constructions rather than random constructions. These include graph theoretic approaches, such as the constructions by Margulis [Mar82] and Tanner [Tan00]. Ramanujan graphs are considered by Rosenthal and Vontobel [RV00] and finite geometries are used by Kou, Lin and Fos-sorier [KLF00 ...
openaire   +2 more sources

Non-Binary LDPC Codes for Magnetic Recording Channels: Error Floor Analysis and Optimized Code Design

IEEE Transactions on Communications, 2016
In this paper, we provide a comprehensive analysis of the error floor along with code optimization guidelines for structured and regular non-binary low-density parity-check (NB-LDPC) codes in magnetic recording (MR) applications.
Ahmed Hareedy, B. Amiri, R. Galbraith, L. Dolecek   +3 more
semanticscholar   +1 more source

On irregular LDPC codes with quantized message passing decoding

International Workshop on Signal Processing Advances in Wireless Communications, 2017
Irregular low-density parity-check (LDPC) codes are among the best codes currently known. Unfortunately, the performance of existing codes may deteriorate substantially with practical finite-precision decoder implementations.
Michael Meidlinger, G. Matz
semanticscholar   +1 more source

On the Waterfall Performance of Finite-Length SC-LDPC Codes Constructed From Protographs

IEEE Journal on Selected Areas in Communications, 2016
An analysis of spatially coupled low-density parity-check (SC-LDPC) codes constructed from protographs is proposed. Given the protograph used to generate the SC-LDPC code ensemble, a set of scaling parameters to characterize the average finite-length ...
M. Stinner, P. Olmos
semanticscholar   +1 more source

A 3.0 Gb/s Throughput Hardware-Efficient Decoder for Cyclically-Coupled QC-LDPC Codes

IEEE Transactions on Circuits and Systems Part 1: Regular Papers, 2016
In this paper, we propose a new class of quasi-cyclic low-density parity-check (QC-LDPC) codes, namely cyclically-coupled QC-LDPC (CC-QC-LDPC) codes, and their RAM-based decoder architecture.
Qing Lu, Jianfeng Fan, Chiu-Wing Sham, W. Tam, F. Lau   +4 more
semanticscholar   +1 more source

Stochastic Decoders for LDPC Codes

2014
Binary and non-binary low density parity check (LDPC) codes are capacity-approaching codes that can be decoded with message-passing algorithms. These algorithms are inherently parallel, making LDPC codes attractive for simultaneously achieving a large coding gain and a high data throughput.
Vincent Gaudet, Francois Leduc-Primeau, Warren J. Gross   +2 more
openaire   +2 more sources

A comparative study of BMST-LDPC codes and staircase-LDPC codes

Physical Communication, 2023
Yinchu Wang, Xiao Ma
openaire   +1 more source

Coded cooperation using LDPC codes

2009 Global Mobile Congress, 2009
In this paper, a novel scheme of coded cooperation using LDPC codes is presented. Two decoding methods are proposed. A simple upper bound of this scheme is introduced based on the union bound. The performance of these two methods is evaluated and compared by simulation.
Daoben Li, Dongfeng Zhao
openaire   +2 more sources

Superposition Construction of $Q$ -Ary LDPC Codes by Jointly Optimizing Girth and Number of Shortest Cycles

IEEE Communications Letters, 2016
In this letter, we consider the construction of q-ary low-density parity-check (LDPC) codes by jointly optimizing the girth and number of shortest cycles in the frame of superposition.
Hengzhou Xu, B. Bai
semanticscholar   +1 more source