A New Construction for Low Density Parity Check Convolutional Codes
| Title: | A New Construction for Low Density Parity Check Convolutional Codes |
|---|---|
| Authors: | Arvind Sridharan; Daniel J. Costello; Jr.; I. Introduction |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://www.nd.edu/~eecoding/pap_itw_summ.pdf. |
| Publication Year: | 2002 |
| Collection: | CiteSeerX |
| Description: | this paper, convolutional codes with parity check matrices H(D) having randomly chosen polynomials as entries are constructed. In order to ensure sparse constraint graphs well suited for message passing decoders, only polynomials with sparse weights are chosen. In particular it can be shown that choosing polynomials of weight greater than two produces length six cycles in the constraint graphs and so we restrict the choice to monomials and binomials in D. We note that in this construction, unlike in [2], parity check matrices H(D) of arbitrary sizes can be obtained. Hence, a wider range of code rates is possible |
| Document Type: | text |
| File Description: | application/pdf |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.6474; http://www.nd.edu/~eecoding/pap_itw_summ.pdf |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.6474; http://www.nd.edu/~eecoding/pap_itw_summ.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.AF7EDC91 |
| Database: | BASE |