Low-density parity-check space-time codes: performance analysis and code construction

In this paper, we show that the direct transmission scheme of low-density parity-check (LDPC) codes can achieve the upper bound of rate-diversity tradeoff with probability one for multiple-input multiple-output (MIMO) systems with BPSK modulation. We then present an algorithm to construct the LDPC space-time codes through a 2-dimensional array whose doubly-periodic correlation is bounded by 1.

[1]  Zhen Zhang,et al.  New constructions of optimal cyclically permutable constant weight codes , 1995, IEEE Trans. Inf. Theory.

[2]  Zhen Zhang,et al.  On the trade-off between performance and rate for finite alphabet mimo systems , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[3]  Neil J. Calkin Dependent Sets of Constant Weight Binary Vectors , 1997, Comb. Probab. Comput..