Low-density parity-check code: Difference between revisions

Revision as of 14:36, 10 March 2006

Revision as of 20:14, 17 April 2006

Line 9:

See [[sparse graph code]].

Below is a graph fragment of an example LDPC code using [[Forney's

factor graph notation]]. A message is encoded by placing bits on the

'''T's''' at the top such that the graphical constraints are

satisfied. Specifically, all lines connecting to an <math>=</math>

box have the same value, and all values connecting to a

<math>+</math> box must sum to zero [[modular arithmetic|modulo]] two (i.e. must sum to an even number).

[[Image:ldpc_code_fragment_factor_graph.png|none]]

If we ignore