simulate fast Tanner LDPC codec with quasi-circular generator matrices

The program can simulate fast Tanner LDPC codec with quasi-circular generator matrices.

Description

The program can simulate fast Tanner LDPC codec with quasi-circular generator matrices, and 1/2 code rate.
 Copyright (C2010-2015) Yang XIAO, Beijing Jiaotong University, Nov.3, 2010, E-Mail: [e-mail].
 Current Version Published: 2010-11-5
In my following books, I derived the algorithm of constructing quasi-circular generator matrices from Tanner codes.
[1] Yang Xiao, Turbo and LDPC Codecs and their Applications, Press of Posts and Telecommunications, Beijing, 2010.
[2] Yang Xiao, MIMO Multiple Antenna Wireless Communication Systems, Press of Posts and Telecommunications, Beijing, 2009.
You can obtain different size of Tanner codes by adjusting parameter b, which should be a prime number [1,2].
Existing Tanner codes can not derive quasi-circular generator matrices, we revise the Tanner codes' parity check matrices [1,2]

• MATLAB release: MATLAB 7.1.0 (R14SP3)