OpenCores

Project maintainers

Details

Name: cf_ldpc
Created: May 13, 2003
Updated: Dec 20, 2009
SVN Updated: Mar 10, 2009
SVN: Browse
Latest version: download (might take a bit to start...)
Statistics: View
Bugs: 0 reported / 0 solved
Star3you like it: star it!

Other project properties

Category:ECC core
Language:
Development status:Stable
Additional info:
WishBone compliant: No
WishBone version: n/a
License:

Description

Cores are generated from Confluence; a modern logic design language. Confluence is a simple, yet highly expressive language that compiles into Verilog, VHDL, and C. See Confluent.org for more info. The core is provided in Verilog, Vhdl, C, and Python. Low-density parity-check (LDPC) codes are forward error correction codes invented by Robert Gallager in the early 60's. LDPC codes have record breaking error correction performance and approach Shannon's limit for channel capacity.

Features

This LDPC error corrector implements Gallager's "A" algorithm: an iterative, hard-decision decoder that opts for simplicity over performance. The architecture elaborates all logic required to implement the message-passing algorithm from message nodes, to check nodes, then back to message nodes -- one iteration occurs every clock cycle.

The core is primarily meant as an LDPC evaluation platform, as the fully parallel architecture may be inappropriate for synthesis of large block length LDPC decoders.

The Confluence source code generates an LDPC error corrector given an arbitrary parity-check matrix. This core implements Gallager's (20, 3, 4) parity-check matrix:

1 1 1 1 . . . . . . . . . . . . . . . .
. . . . 1 1 1 1 . . . . . . . . . . . .
. . . . . . . . 1 1 1 1 . . . . . . . .
. . . . . . . . . . . . 1 1 1 1 . . . .
. . . . . . . . . . . . . . . . 1 1 1 1
1 . . . 1 . . . 1 . . . 1 . . . . . . .
. 1 . . . 1 . . . 1 . . . . . . 1 . . .
. . 1 . . . 1 . . . . . . 1 . . . 1 . .
. . . 1 . . . . . . 1 . . . 1 . . . 1 .
. . . . . . . 1 . . . 1 . . . 1 . . . 1
1 . . . . 1 . . . . . 1 . . . . . 1 . .
. 1 . . . . 1 . . . 1 . . . . 1 . . . .
. . 1 . . . . 1 . . . . 1 . . . . . 1 .
. . . 1 . . . . 1 . . . . 1 . . 1 . . .
. . . . 1 . . . . 1 . . . . 1 . . . . 1