DocumentCode :
1968204
Title :
Upper bounds on the capacity of binary intermittent communication
Author :
Khoshnevisan, M. ; Laneman, J.N.
Author_Institution :
Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA
fYear :
2013
fDate :
10-15 Feb. 2013
Firstpage :
1
Lastpage :
6
Abstract :
This paper focuses on obtaining upper bounds on the capacity of a special case of intermittent communication, introduced in [1], in which the channel is binary-input binary-output noiseless with i.i.d. number of zeros inserted in between the binary codeword symbols. Upper bounds are obtained by providing the encoder and the decoder with various amounts of side-information, and calculating or upper bounding the capacity of this genie-aided system. The results suggest that the linear scaling of the receive window with respect to the codeword length considered in the system model is relevant since the upper bounds imply a tradeoff between the capacity of the channel and the intermittency rate.
Keywords :
codes; wireless channels; binary codeword symbols; binary intermittent communication capacity; binary-input binary-output noiseless; genie-aided system; intermittency rate; receive window; side-information; Channel capacity; Channel models; Decoding; Receivers; Uncertainty; Upper bound; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and Applications Workshop (ITA), 2013
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4673-4648-1
Type :
conf
DOI :
10.1109/ITA.2013.6502946
Filename :
6502946
Link To Document :
بازگشت