Deriving Good LDPC Convolutional Codes from LDPC Block Codes

2010/04/28 by Alí Emre Pusane, Roxana Smarandache, Pusane, Ali E. +5 · 2 citations
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1004.5157

openalex publication_date 2010/04/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper we discuss several graph-cover-based methods for deriving families of time-invariant and time-varying LDPC convolutional codes from LDPC block codes and show how earlier proposed LDPC convolutional code constructions can be presented within this framework. Some of the constructed convolutional codes significantly outperform the underlying LDPC block codes. We investigate some possible reasons for this "convolutional gain," and we also discuss the --- mostly moderate --- decoder cost increase that is incurred by going from LDPC block to LDPC convolutional codes.

Cited by

• Construction of LDPC convolutional codes with large girth from Latin squares
• On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization

Related

• Construction of LDPC convolutional codes with large girth from Latin squares
• Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency\n Communications
• Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes
• Construction of Rate (n-1)/n Non-Binary LDPC Convolutional Codes via\n Difference Triangle Sets
• Construction of LDPC convolutional codes via difference triangle sets