An improvement of the deletion channel capacity upper bound
Author
Rahmati, M.
Duman, Tolga M.
Date
2013-10Source Title
51st Annual Allerton Conference on Communication, Control, and Computing, Allerton, 2013
Publisher
IEEE
Pages
1221 - 1225
Language
English
Type
Conference PaperItem Usage Stats
143
views
views
102
downloads
downloads
Abstract
In this paper, we offer an alternative look at channels with deletion errors by considering equivalent models for deletion channels by 'fragmenting' the input sequence where different subsequences travel through different channels. The resulting output symbols are combined appropriately to come up with an equivalent input-output representation of the original channel which allows for derivation of new upper bounds on the channel capacity. Considering a random fragmentation processes applied to binary deletion channels, we prove an inequality relation among the capacities of the original binary deletion channel and the introduced binary deletion subchannels. This inequality enables us to provide an improved upper bound on the capacity of the i.i.d. deletion channels, i.e., C(d) ≤ 0.4143(1 - d) for d ≥ 0.65. We also consider a deterministic fragmentation process suitable for the study of non-binary deletion channels which results in improved capacity upper bounds. © 2013 IEEE.
Keywords
CommunicationDeletion channels
Deletion errors
Equivalent model
Fragmentation process
Input sequence
Input-output
Original channels
Subchannels
Channel capacity