29,489 research outputs found
Covert Bits Through Queues
We consider covert communication using a queuing timing channel in the
presence of a warden. The covert message is encoded using the inter-arrival
times of the packets, and the legitimate receiver and the warden observe the
inter-departure times of the packets from their respective queues. The
transmitter and the legitimate receiver also share a secret key to facilitate
covert communication. We propose achievable schemes that obtain non-zero covert
rate for both exponential and general queues when a sufficiently high rate
secret key is available. This is in contrast to other channel models such as
the Gaussian channel or the discrete memoryless channel where only
covert bits can be sent over channel uses, yielding
a zero covert rate.Comment: To appear at IEEE CNS, October 201
Write Channel Model for Bit-Patterned Media Recording
We propose a new write channel model for bit-patterned media recording that
reflects the data dependence of write synchronization errors. It is shown that
this model accommodates both substitution-like errors and insertion-deletion
errors whose statistics are determined by an underlying channel state process.
We study information theoretic properties of the write channel model, including
the capacity, symmetric information rate, Markov-1 rate and the zero-error
capacity.Comment: 11 pages, 12 figures, journa
Compressive Sensing for Feedback Reduction in MIMO Broadcast Channels
We propose a generalized feedback model and compressive sensing based
opportunistic feedback schemes for feedback resource reduction in MIMO
Broadcast Channels under the assumption that both uplink and downlink channels
undergo block Rayleigh fading. Feedback resources are shared and are
opportunistically accessed by users who are strong, i.e. users whose channel
quality information is above a certain fixed threshold. Strong users send same
feedback information on all shared channels. They are identified by the base
station via compressive sensing. Both analog and digital feedbacks are
considered. The proposed analog & digital opportunistic feedback schemes are
shown to achieve the same sum-rate throughput as that achieved by dedicated
feedback schemes, but with feedback channels growing only logarithmically with
number of users. Moreover, there is also a reduction in the feedback load. In
the analog feedback case, we show that the propose scheme reduces the feedback
noise which eventually results in better throughput, whereas in the digital
feedback case the proposed scheme in a noisy scenario achieves almost the
throughput obtained in a noiseless dedicated feedback scenario. We also show
that for a fixed given budget of feedback bits, there exist a trade-off between
the number of shared channels and thresholds accuracy of the feedback SINR.Comment: Submitted to IEEE Transactions on Wireless Communications, April 200
The Wiretap Channel with Feedback: Encryption over the Channel
In this work, the critical role of noisy feedback in enhancing the secrecy
capacity of the wiretap channel is established. Unlike previous works, where a
noiseless public discussion channel is used for feedback, the feed-forward and
feedback signals share the same noisy channel in the present model. Quite
interestingly, this noisy feedback model is shown to be more advantageous in
the current setting. More specifically, the discrete memoryless modulo-additive
channel with a full-duplex destination node is considered first, and it is
shown that the judicious use of feedback increases the perfect secrecy capacity
to the capacity of the source-destination channel in the absence of the
wiretapper. In the achievability scheme, the feedback signal corresponds to a
private key, known only to the destination. In the half-duplex scheme, a novel
feedback technique that always achieves a positive perfect secrecy rate (even
when the source-wiretapper channel is less noisy than the source-destination
channel) is proposed. These results hinge on the modulo-additive property of
the channel, which is exploited by the destination to perform encryption over
the channel without revealing its key to the source. Finally, this scheme is
extended to the continuous real valued modulo- channel where it is
shown that the perfect secrecy capacity with feedback is also equal to the
capacity in the absence of the wiretapper.Comment: Submitted to IEEE Transactions on Information Theor
- …