Space-time low-density parity-check codes

In this work we use a graph based representation to develop space-time low density parity check (LDPC) codes. Shortly after the advent of turbo codes in 1993, several researchers noticed that existing graphical representations such as Bayesian Networks and later-developed representations like factor graphs are excellent unifying frameworks for developing iterative algorithms such as (joint) decoding and equalization. This work is one such example where we use the framework of Bayesian networks to develop LDPC codes for a multiple transmit / multiple receive antenna scenario. The performance of these codes and corresponding iterative decoding algorithm is explored.