220 research outputs found
Writing on Fading Paper and Causal Transmitter CSI
A wideband fading channel is considered with causal channel state information
(CSI) at the transmitter and no receiver CSI. A simple orthogonal code with
energy detection rule at the receiver (similar to [6]) is shown to achieve the
capacity of this channel in the limit of large bandwidth. This code transmits
energy only when the channel gain is large enough. In this limit, this capacity
without any receiver CSI is the same as the capacity with full receiver CSI--a
phenomenon also true for dirty paper coding. For Rayleigh fading, this capacity
(per unit time) is proportional to the logarithm of the bandwidth. Our coding
scheme is motivated from the Gel'fand-Pinsker [2,3] coding and dirty paper
coding [4]. Nonetheless, for our case, only causal CSI is required at the
transmitter in contrast with dirty-paper coding and Gel'fand-Pinsker coding,
where non-causal CSI is required.
Then we consider a general discrete channel with i.i.d. states. Each input
has an associated cost and a zero cost input "0" exists. The channel state is
assumed be to be known at the transmitter in a causal manner. Capacity per unit
cost is found for this channel and a simple orthogonal code is shown to achieve
this capacity. Later, a novel orthogonal coding scheme is proposed for the case
of causal transmitter CSI and a condition for equivalence of capacity per unit
cost for causal and non-causal transmitter CSI is derived. Finally, some
connections are made to the case of non-causal transmitter CSI in [8]
Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels
This paper studies a variant of the classical problem of ``writing on dirty
paper'' in which the sum of the input and the interference, or dirt, is
multiplied by a random variable that models resizing, known to the decoder but
not to the encoder. The achievable rate of Costa's dirty paper coding (DPC)
scheme is calculated and compared to the case of the decoder's also knowing the
dirt. In the ergodic case, the corresponding rate loss vanishes asymptotically
in the limits of both high and low signal-to-noise ratio (SNR), and is small at
all finite SNR for typical distributions like Rayleigh, Rician, and Nakagami.
In the quasi-static case, the DPC scheme is lossless at all SNR in terms of
outage probability. Quasi-static fading broadcast channels (BC) without
transmit channel state information (CSI) are investigated as an application of
the robustness properties. It is shown that the DPC scheme leads to an outage
achievable rate region that strictly dominates that of time division.Comment: To appear in IEEE International Symposium on Information Theory 200
Secret-key Agreement with Channel State Information at the Transmitter
We study the capacity of secret-key agreement over a wiretap channel with
state parameters. The transmitter communicates to the legitimate receiver and
the eavesdropper over a discrete memoryless wiretap channel with a memoryless
state sequence. The transmitter and the legitimate receiver generate a shared
secret key, that remains secret from the eavesdropper. No public discussion
channel is available. The state sequence is known noncausally to the
transmitter. We derive lower and upper bounds on the secret-key capacity. The
lower bound involves constructing a common state reconstruction sequence at the
legitimate terminals and binning the set of reconstruction sequences to obtain
the secret-key. For the special case of Gaussian channels with additive
interference (secret-keys from dirty paper channel) our bounds differ by 0.5
bit/symbol and coincide in the high signal-to-noise-ratio and high
interference-to-noise-ratio regimes. For the case when the legitimate receiver
is also revealed the state sequence, we establish that our lower bound achieves
the the secret-key capacity. In addition, for this special case, we also
propose another scheme that attains the capacity and requires only causal side
information at the transmitter and the receiver.Comment: 10 Pages, Submitted to IEEE Transactions on Information Forensics and
Security, Special Issue on Using the Physical Layer for Securing the Next
Generation of Communication System
Capacity Theorems for the Fading Interference Channel with a Relay and Feedback Links
Handling interference is one of the main challenges in the design of wireless
networks. One of the key approaches to interference management is node
cooperation, which can be classified into two main types: relaying and
feedback. In this work we consider simultaneous application of both cooperation
types in the presence of interference. We obtain exact characterization of the
capacity regions for Rayleigh fading and phase fading interference channels
with a relay and with feedback links, in the strong and very strong
interference regimes. Four feedback configurations are considered: (1) feedback
from both receivers to the relay, (2) feedback from each receiver to the relay
and to one of the transmitters (either corresponding or opposite), (3) feedback
from one of the receivers to the relay, (4) feedback from one of the receivers
to the relay and to one of the transmitters. Our results show that there is a
strong motivation for incorporating relaying and feedback into wireless
networks.Comment: Accepted to the IEEE Transactions on Information Theor
Optimal Transmit Covariance for Ergodic MIMO Channels
In this paper we consider the computation of channel capacity for ergodic
multiple-input multiple-output channels with additive white Gaussian noise. Two
scenarios are considered. Firstly, a time-varying channel is considered in
which both the transmitter and the receiver have knowledge of the channel
realization. The optimal transmission strategy is water-filling over space and
time. It is shown that this may be achieved in a causal, indeed instantaneous
fashion. In the second scenario, only the receiver has perfect knowledge of the
channel realization, while the transmitter has knowledge of the channel gain
probability law. In this case we determine an optimality condition on the input
covariance for ergodic Gaussian vector channels with arbitrary channel
distribution under the condition that the channel gains are independent of the
transmit signal. Using this optimality condition, we find an iterative
algorithm for numerical computation of optimal input covariance matrices.
Applications to correlated Rayleigh and Ricean channels are given.Comment: 22 pages, 14 figures, Submitted to IEEE Transactions on Information
Theor
- …