Results 31 to 40 of about 92,025 (163)

Construction of Quasi-Cyclic Low Density Parity Check Codes for Magnetic Induction Communication

open access: yesIEEE Access, 2019
The magnetic induction (MI) communication has been proved to be an effective method in the wireless underground sensor networks (WUSN). MI communication system based on quasi-cyclic low density parity check (QC-LDPC) codes is expected to improve the ...
Hua Xu, Yanjing Sun, Wenjuan Shi
doaj   +1 more source

VLSI implementation of a multi-mode turbo/LDPC decoder architecture [PDF]

open access: yes, 2013
Flexible and reconfigurable architectures have gained wide popularity in the communications field. In particular, reconfigurable architectures for the physical layer are an attractive solution not only to switch among different coding modes but also to ...
Maurizio Martina   +3 more
core   +1 more source

Novel construction of quasi-cyclic low-density parity-check codes with variable code rates for cloud data storage systems

open access: yesETRI Journal, 2023
This paper proposed a novel method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes of medium to high code rates that can be applied in cloud data storage systems, requiring better error correction capabilities.
Vairaperumal Bhuvaneshwari   +1 more
doaj   +1 more source

Multilevel structured low-density parity-check codes [PDF]

open access: yes, 2008
Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to store their code description, which can be represented either by the connections ...
S. Chen   +5 more
core   +1 more source

On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes

open access: yesIEEE Access, 2019
Girth is an important structural property of low-density parity-check (LDPC) codes. Motivated by the works on the girth of Tanner (3, 5), (3, 7), (3, 11), and (5, 7) quasi-cyclic (QC) LDPC codes, we, in this paper, study the girth of Tanner (3, 13) QC ...
Hengzhou Xu   +4 more
doaj   +1 more source

An Efficient Construction Method for Quasi-Cyclic Low Density Parity Check Codes

open access: yesIEEE Access, 2017
In this paper, we propose an optimized belief propagation (OBP) based progressive edge-growth (PEG) method for constructing quasi-cyclic low density parity check (QC-LDPC) codes. In this proposed method, Tanner graphs are built by progressively appending
Yiming Lei, Mingke Dong
doaj   +1 more source

Tanner $(J,L)$ Quasi-Cyclic LDPC Codes: Girth Analysis and Derived Codes

open access: yesIEEE Access, 2019
Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper ...
Hengzhou Xu   +4 more
doaj   +1 more source

On the Construction of Multitype Quasi-Cyclic Low-Density Parity-Check Codes With Different Girth and Length

open access: yesIEEE Access, 2021
Multitype quasi-cyclic (QC) low-density parity-check (LDPC) codes are a class of protograph LDPC codes lifted cyclically from protographs with multiple edges, represented by two weight and slope matrices.
Farzaneh Abedi, Mohammad Gholami
doaj   +1 more source

Ldpc Code Construction using Randomly Permutated Copies of Parity Check Matrix [PDF]

open access: yesمجلة جامعة النجاح للأبحاث العلوم الطبيعية, 2018
A construction technique is proposed for low-density parity check (LDPC) codes. It uses a base parity check matrix designed from a ran-dom or constructed construction method as Gallager or Quasi-Cyclic LDPC (QC-LDPC) codes in sequence to get codes with ...
Amr lulu, Ammar Abu-Hudrouss
doaj   +1 more source

From Product Codes to Structured Generalized LDPC Codes [PDF]

open access: yes, 2010
Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors.
Paolini, Enrico   +10 more
core   +1 more source

Home - About - Disclaimer - Privacy