DocumentCode :
2900249
Title :
Upper Bounding the Deletion Channel Capacity by Auxiliary Memoryless Channels
Author :
Fertonani, Dario ; Duman, Tolga M.
Author_Institution :
Dept. of Electr. Eng., Arizona State Univ., Tempe, AZ, USA
fYear :
2009
fDate :
14-18 June 2009
Firstpage :
1
Lastpage :
5
Abstract :
We present two upper bounds on the capacity of the binary deletion channel. Both bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined random processes. Since the closed-form expressions of the proposed bounds involve infinite series, we also introduce provable inequalities that lead to more manageable results. For most values of the deletion probability, these bounds improve the existing ones and significantly narrow the gap with the available lower bounds.
Keywords :
channel capacity; random processes; auxiliary memoryless channels; binary deletion channel; closed-form expressions; deletion channel capacity; deletion probability; genie-aided information; suitably-defined random processes; Auxiliary transmitters; Capacity planning; Channel capacity; Communications Society; Error correction; Error probability; Memoryless systems; Random processes; Random variables; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2009. ICC '09. IEEE International Conference on
Conference_Location :
Dresden
ISSN :
1938-1883
Print_ISBN :
978-1-4244-3435-0
Electronic_ISBN :
1938-1883
Type :
conf
DOI :
10.1109/ICC.2009.5199553
Filename :
5199553
Link To Document :
بازگشت