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

نویسندگان

  • Daniel J. Costello
  • Arvind Sridharan
  • Deepak Sridhara
  • Michael Tanner
چکیده

Abstract Using algebraic techniques, one of the co-authors has designed a [155,64,20] low density parity check code based on permutation matrices. This code is quasi-cyclic by construction and hence admits a convolutional representation. A set of low density parity check convolutional codes is derived from this quasi-cyclic code and its generalizations. We investigate the performance of these convolutional codes when decoded using belief propagation on their corresponding graph representations. ∗This work was supported in part by NSF Grant CCR00-75514 and NASA Grant NAG5-10503.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Construction for Low Density Parity Check Convolutional Codes Based on Quasi-Cyclic Block Codes

A set of convolutional codes with low density parity check matrices is derived from a class of quasi-cyclic low density parity check block codes. Their performance when decoded using the belief propagation algorithm is investigated.

متن کامل

Convolutional Cylinder-type Block-circulant Cycle Codes

In this paper, we consider a class of column-weight two quasi-cyclic low-density parity check codes in which the girth can be large enough, as an arbitrary multiple of 8. Then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. Finally, we show that the free distance of the convolutio...

متن کامل

Unavoidable Cycles in Polynomial-Based Time-Invariant LDPC Convolutional Codes

Low-Density Parity-Check convolutional codes (LDPCccs) are very interesting for practical error-correction coding in wireless transmission as they have excellent performance and at the same time they allow for variable block size with low complexity encoding and decoding. As for all LDPC codes that are decoded by the sub-optimal (but highly efficient) Sum Product Algorithm, the cycles in the co...

متن کامل

Type-III LDPC Convolutional Codes

A class of geometrically structured quasi-cyclic low-density paritycheck codes with a cylinder structure graph and girth 12 is considered. The parity-check matrix of such a code consists of blocks of zeros and circulant permutation matrices. A class of convolutional codes is assigned to these codes. The convolutional form generator matrix of these codes is obtained by elementary row and column ...

متن کامل

An Efficient Encoding-Decoding of Large Girth LDPC Codes Based on Quasi-Cyclic

In this paper, we propose a novel method for constructing quasi-cyclic low-density parity check (QC-LDPC) codes based row division method which can guarantee a concentrated node degree distribution with large girth. The main advantage is that large girth QC-LDPC codes can be easily constructed with a variety of block lengths and rates. Simulation results show that the proposed codes perform sig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002