Learn more about us or of things related to us.
The LDPC codes for flash memories can be found in the .zip file that you can download below. The zip file includes three .txt LDPC parity check matrices. Each line represents an edge between a check node and variable node. The third number in each line is just an indicator with 0 indicating the end of the file.
The degree distribution of the codes is as follows:
λ(x) = 2.0054E-5x0 + 0.035776x1 + 0.39869x2 + 0.0084827x8 + 0.037701x9 + 0.51933x18
ρ(x) = 0.15662x54 + 0.84338x55
λ(x) = 1.7701E-5x0 + 0.031579x1 + 0.46923x3 + 0.0074877x8 + 0.033278x9 + 0.45841x18
ρ(x) = 0.0010975x61 + 0.73267x62 + 0.26623x63
λ(x) = 0.032172x1 + 0.002681x2 + 0.55764x3 + 0.40751x23
ρ(x) = 0.10366x57 + 0.89634x58
These are the specifications of the nonlinear trellis codes presented in “Non linear Trellis Codes for Binary-Input Binary-Output Multiple Access Channels With Single-User Decoding”, M. Griot, A.I. Vila Casado, W.-Y. Weng, H. Chan, J. Wang and R. Wesel. IEEE Transactions on Communications, vol. 60, No. 2, pp 364 - 374, February 2012.
All the codes are feed-forward encoders with the following trellis structure:
The row combining codes can be found in the .zip file below. The codes are in the sub-matrix format. That is, each entry corresponds to a (p x p) sub-matrix that can be either the all-zero matrix or an identity matrix shifted to the right. The cyclic shift identifies the non-zero matrices and the zero-matrices are identified by a -1.Download
A cross-layer optimization tool based on TCOM2011 can be found in the .zip file below. The .zip file includes a .m file and a .fig file. In order to run the code, ensure that the two files are in the same folder. Then use MATLAB to run the .m file by typing the name of the .m file in MATLAB command window.
Please cite as:
T. A. Courtade and R. D. Wesel, "Optimal Allocation of Redundancy Between Packet-Level Erasure Coding and Physical-Layer Channel Coding in Fading Channels," IEEE Transactions on Communications, Vol. 59, No. 8, pp 2101 - 2109, August 2011.