TY - GEN
T1 - Good LDPC codes over GF(Q) for bandwidth efficient transmission
AU - Li, Xiangming
AU - Soleymani, M. R.
AU - Lodge, J.
AU - Guinand, P. S.
N1 - Publisher Copyright:
© 2003 IEEE.
PY - 2004
Y1 - 2004
N2 - In this paper, we combine irregular LDPC codes over GF(q) and q-ary modulations for handwidth efficient transmission over AWGN channel and consider the optimization of the codes. To find a good LDPC code over GF(q), based on the previous work by Davey, one may choose a row profile and minimize a non-linear objective function subject to a series of linear constraints about the column profile of the parity check matrix. One major drawback of this method is that an important parameter, the average column (row) weight, doesn't participate in the optimization since the average column weight is determined as soon as a row profile is given. We relax Davey's constraints of fixed row profile, using instead all the constraints about the row profile, the column profile and the average column weight and introduce the complex method to solve this non-linear programming problem. This ensures that the average column weight of the parity-check matrix participates in the optimization.
AB - In this paper, we combine irregular LDPC codes over GF(q) and q-ary modulations for handwidth efficient transmission over AWGN channel and consider the optimization of the codes. To find a good LDPC code over GF(q), based on the previous work by Davey, one may choose a row profile and minimize a non-linear objective function subject to a series of linear constraints about the column profile of the parity check matrix. One major drawback of this method is that an important parameter, the average column (row) weight, doesn't participate in the optimization since the average column weight is determined as soon as a row profile is given. We relax Davey's constraints of fixed row profile, using instead all the constraints about the row profile, the column profile and the average column weight and introduce the complex method to solve this non-linear programming problem. This ensures that the average column weight of the parity-check matrix participates in the optimization.
UR - https://www.scopus.com/pages/publications/84944685275
U2 - 10.1109/SPAWC.2003.1318929
DO - 10.1109/SPAWC.2003.1318929
M3 - Conference contribution
AN - SCOPUS:84944685275
T3 - IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC
SP - 95
EP - 99
BT - 2003 4th IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2003
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 4th IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2003
Y2 - 15 June 2003 through 18 June 2003
ER -