TY - GEN
T1 - Tight BER bounds of binned orthogonal and quasi-orthogonal dirty-paper codes
AU - Xu, Xiaotian
AU - Guan, Yong Liang
PY - 2008
Y1 - 2008
N2 - Existing dirty-paper coding (DPC) schemes based on binned FEC codes lack of tractable BER analysis, hence it is difficult to predict the performance behavior of DPC. In this paper, we derive closed-form BER upper bounds of binned Walsh-Hadamard codes and binned Gold codes as DPC. Their BER upper bounds are verified to be very tight under the condition that the channel contains side information only, or side information plus noise.
AB - Existing dirty-paper coding (DPC) schemes based on binned FEC codes lack of tractable BER analysis, hence it is difficult to predict the performance behavior of DPC. In this paper, we derive closed-form BER upper bounds of binned Walsh-Hadamard codes and binned Gold codes as DPC. Their BER upper bounds are verified to be very tight under the condition that the channel contains side information only, or side information plus noise.
UR - http://www.scopus.com/inward/record.url?scp=77951101998&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951101998&partnerID=8YFLogxK
U2 - 10.1109/ISITA.2008.4895490
DO - 10.1109/ISITA.2008.4895490
M3 - Conference contribution
AN - SCOPUS:77951101998
SN - 9781424420698
T3 - 2008 International Symposium on Information Theory and its Applications, ISITA2008
BT - 2008 International Symposium on Information Theory and its Applications, ISITA2008
T2 - 2008 International Symposium on Information Theory and its Applications, ISITA2008
Y2 - 7 December 2008 through 10 December 2008
ER -