simulate fast Tanner LDPC codec with quasi-circular generator matrices
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 (2024). 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
Platform Compatibility
Windows macOS LinuxCategories
- RF and Mixed Signal > Antenna Toolbox > Analysis, Benchmarking, and Verification > Antenna and Array Analysis >
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Sim_Fast_Tanner/
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |