DocumentCode :
3279758
Title :
Tight BER bound of binned orthogonal and quasi-orthogonal dirty-paper codes
Author :
Xu, Xiaotian ; Guan, Yong Liang
Author_Institution :
Nanyang Technol. Univ., Singapore
fYear :
2008
fDate :
7-10 Dec. 2008
Firstpage :
1
Lastpage :
5
Abstract :
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.
Keywords :
error statistics; orthogonal codes; BER; FEC codes; binned Walsh-Hadamard codes; binned orthogonal codes; bit error rate; quasi-orthogonal dirty-paper codes; Bit error rate;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location :
Auckland
Print_ISBN :
978-1-4244-2068-1
Electronic_ISBN :
978-1-4244-2069-8
Type :
conf
DOI :
10.1109/ISITA.2008.4895490
Filename :
4895490
Link To Document :
بازگشت