Abstract
Existence type lower bounds on the free distance of periodically time-varying LDPC convolutional codes and on the minimum distance of tail-biting LDPC convolutional codes are derived. It is demonstrated that the bound on free distance of periodically time-varying LDPC convolutional codes approaches the bound on free distance of general (nonperiodic) time-varying LDPC convolutional codes as the period increases. The proof of the bound is based on lower bounding the minimum distance of corresponding tail-biting LDPC convolutional codes, which is of interest in its own right.
Highlights
low-density parity-check (LDPC) block codes were invented by Gallager [2] in the 1960s
The proof of the bound is based on lower bounding the minimum distance of corresponding tail-biting LDPC convolutional codes, which is of interest in its own right
As the period increases, the new bound approaches the bound on free distance of non-periodic LDPC convolutional codes (LDPCCCs) derived in [1]
Summary
LDPC block codes were invented by Gallager [2] in the 1960s. The construction of the corresponding convolutional counterparts, LDPC convolutional codes (LDPCCCs), was first. D. Truhachev is with the Electrical and Computer Engineering Research Faculty (ECERF), University of Alberta, Edmonton, Alberta, Canada T6G 2V4. K. Sh. Zigangirov is with the Institute for Problems of Information Transmission, Moscow, Russia, and the Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
