TY - GEN
T1 - Flooding-assisted informed dynamic scheduling for rateless codes
AU - Chen, Yen Ming
AU - Lee, Huang Chang
AU - Ueng, Yeong Luh
AU - Yeh, Chin Yun
PY - 2012
Y1 - 2012
N2 - As part of the tradeoff between error performance, decoding complexity and the overhead of rateless codes, the combination of incremental decoding (ID) and informed dynamic scheduling (IDS), known as IDIDS (incremental decoding with informed dynamic scheduling), is an attractive solution in binary symmetric channels (BSC). However, applying IDIDS in the AWGN (additive white Gaussian noise) channel may cause a degradation in BER performance, since the incrementally received symbols from the AWGN channel may not be immediately utilized in the decoding process directed by IDS. In addition, a stopping criterion combined with IDS may cause the current decoding attempt to terminate too early, and the channel information contained in the originally received codeword will not be used efficiently. In this paper, a dynamic decoding schedule strategy is proposed. In the proposed decoder, the new received symbols can be immediately utilized in the decoding process. For Luby transform (LT) codes and Raptor codes over the AWGN channel, the proposed algorithm provides a more balanced tradeoff. In the case of Raptor codes, the BER performance is obviously improved.
AB - As part of the tradeoff between error performance, decoding complexity and the overhead of rateless codes, the combination of incremental decoding (ID) and informed dynamic scheduling (IDS), known as IDIDS (incremental decoding with informed dynamic scheduling), is an attractive solution in binary symmetric channels (BSC). However, applying IDIDS in the AWGN (additive white Gaussian noise) channel may cause a degradation in BER performance, since the incrementally received symbols from the AWGN channel may not be immediately utilized in the decoding process directed by IDS. In addition, a stopping criterion combined with IDS may cause the current decoding attempt to terminate too early, and the channel information contained in the originally received codeword will not be used efficiently. In this paper, a dynamic decoding schedule strategy is proposed. In the proposed decoder, the new received symbols can be immediately utilized in the decoding process. For Luby transform (LT) codes and Raptor codes over the AWGN channel, the proposed algorithm provides a more balanced tradeoff. In the case of Raptor codes, the BER performance is obviously improved.
KW - Rateless codes
KW - incremental decoding
KW - message-passing decoding
KW - scheduling
UR - http://www.scopus.com/inward/record.url?scp=84864349171&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2012.6214065
DO - 10.1109/WCNC.2012.6214065
M3 - 会议稿件
AN - SCOPUS:84864349171
SN - 9781467304375
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 173
EP - 177
BT - 2012 IEEE Wireless Communications and Networking Conference, WCNC 2012
T2 - 2012 IEEE Wireless Communications and Networking Conference, WCNC 2012
Y2 - 1 April 2012 through 4 April 2012
ER -