Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Low Density Parity Check Convolutional Codes Derived from Quasi-Cyclic Block Codes

Daniel J. Costello, Arvind Sridharan, Deepak Sridhara, R. Michael Tanner

Published Jan 1, 2003• 0 citations
Publisher
DOI
10.1007/978-1-4757-3789-9_4

Related papers

Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth

Pinyi Ren, Qiang Yuan, Rui Wang +1 more

Science China Information Sciences•Feb 1, 2011•3 citations

Cycle analysis of time-variant LDPC convolutional codes

Hua Ren Zhou, Norbert Goertz

Time-variant Low-Density Parity-Check convolutional codes (LDPCccs) can be derived from unwrapping Quasi-Cyclic (QC) LDPC block codes. Rather than analyzing cycles in a large-scale time-domain parity check matrix, we propose a new way to describe cycle properties in compact form by a “polynomial syndrome former”, i.e., a syndrome former in an equivalent polynomial representation. According to the relationship of cycle structures between time- and polynomial-domain syndrome formers, we present a cycle counter algorithm to analyze cycle properties in time-variant LDPCccs as well as in time-invariant LDPCccs.

International Symposium on Turbo Codes and Iterative Information Processing•Sep 1, 2010•8 citations

Low density parity check codes based on sparse matrices with no small cycles

J.W. Bond, Siqi Hui, H. Schmidt

Lecture notes in computer science•Jan 1, 1997•4 citations

Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications

Massimo Battaglioni, Alireza Tasdighi, Marco Baldi +2 more

Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special quasi-cyclic low-density parity-check block codes and spatially coupled low-density parity-check convolutional codes that we denote as compact. They are defined by parity-check matrices designed according to a recent approach based on sequentially multiplied columns. This method allows obtaining codes with girth up to 12. Many numerical examples of practical codes are provided.

arXiv:1809.04662•IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2018•17 citations

PERFORMANCE OF PSEUDO-RANDOM AND QUASI-CYCLIC LOW DENSITY PARITY CHECK CODES

Onur Hüsnü Kazanci

•Jan 1, 2007•1 citation

System of Noise Resistant Coding Based on Quasi-Cyclic Low-Density Parity-Check Codes

JSC «STC ELINS», Moscow, Russia, В.Н. Тикменов, В.И. Ухандеев +3 more

Proceedings of Universities ELECTRONICS•Aug 1, 2018•0 citations
Time-variant Low-Density Parity-Check convolutional codes (LDPCccs) can be derived from unwrapping Quasi-Cyclic (QC) LDPC block codes. Rather than analyzing cycles in a large-scale time-domain parity check matrix, we propose a new way to describe cycle properties in compact form by a “polynomial syndrome former”, i.e., a syndrome former in an equivalent polynomial representation. According to the relationship of cycle structures between time- and polynomial-domain syndrome formers, we present a cycle counter algorithm to analyze cycle properties in time-variant LDPCccs as well as in time-invariant LDPCccs.
Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special quasi-cyclic low-density parity-check block codes and spatially coupled low-density parity-check convolutional codes that we denote as compact. They are defined by parity-check matrices designed according to a recent approach based on sequentially multiplied columns. This method allows obtaining codes with girth up to 12. Many numerical examples of practical codes are provided.