simulate fast Tanner LDPC codec with quasi-circular generator matrices

Version 1.0.0.0 (18.3 KB) by Yang Xiao
The program can simulate fast Tanner LDPC codec with quasi-circular generator matrices.
0.0
(0)
1.6K Downloads
Updated 4 Nov 2010

View License

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: yxiao@bjtu.edu.cn.
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]

Cite As

Yang Xiao (2026). simulate fast Tanner LDPC codec with quasi-circular generator matrices (https://www.mathworks.com/matlabcentral/fileexchange/29277-simulate-fast-tanner-ldpc-codec-with-quasi-circular-generator-matrices), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R14SP3
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags
Open in new tab
Version Published Release Notes
1.0.0.0