2,978 research outputs found
An Achievable Rate Region for Three-Pair Interference Channels with Noise
An achievable rate region for certain noisy three-user-pair interference
channels is proposed. The channel class under consideration generalizes the
three-pair deterministic interference channel (3-DIC) in the same way as the
Telatar-Tse noisy two-pair interference channel generalizes the El Gamal-Costa
injective channel. Specifically, arbitrary noise is introduced that acts on the
combined interference signal before it affects the desired signal. This class
of channels includes the Gaussian case.
The rate region includes the best-known inner bound on the 3-DIC capacity
region, dominates treating interference as noise, and subsumes the
Han-Kobayashi region for the two-pair case.Comment: 9 pages, 3 figures; abbreviated version to be presented at IEEE
International Symposium on Information Theory (ISIT 2012
Secure Multiplex Coding Over Interference Channel with Confidential Messages
In this paper, inner and outer bounds on the capacity region of two-user
interference channels with two confidential messages have been proposed. By
adding secure multiplex coding to the error correction method in [15] which
achieves the best achievable capacity region for interference channel up to
now, we have shown that the improved secure capacity region compared with [2]
now is the whole Han-Kobayashi region. In addition, this construction not only
removes the rate loss incurred by adding dummy messages to achieve security,
but also change the original weak security condition in [2] to strong security.
Then the equivocation rate for a collection of secret messages has also been
evaluated, when the length of the message is finite or the information rate is
high, our result provides a good approximation for bounding the worst case
equivocation rate. Our results can be readily extended to the Gaussian
interference channel with little efforts.Comment: 10 pages, 6 figure
On Code Design for Interference Channels
abstract: There has been a lot of work on the characterization of capacity and achievable rate regions, and rate region outer-bounds for various multi-user channels of interest. Parallel to the developed information theoretic results, practical codes have also been designed for some multi-user channels such as multiple access channels, broadcast channels and relay channels; however, interference channels have not received much attention and only a limited amount of work has been conducted on them. With this motivation, in this dissertation, design of practical and implementable channel codes is studied focusing on multi-user channels with special emphasis on interference channels; in particular, irregular low-density-parity-check codes are exploited for a variety of cases and trellis based codes for short block length designs are performed.
Novel code design approaches are first studied for the two-user Gaussian multiple access channel. Exploiting Gaussian mixture approximation, new methods are proposed wherein the optimized codes are shown to improve upon the available designs and off-the-shelf point-to-point codes applied to the multiple access channel scenario. The code design is then examined for the two-user Gaussian interference channel implementing the Han-Kobayashi encoding and decoding strategy. Compared with the point-to-point codes, the newly designed codes consistently offer better performance. Parallel to this work, code design is explored for the discrete memoryless interference channels wherein the channel inputs and outputs are taken from a finite alphabet and it is demonstrated that the designed codes are superior to the single user codes used with time sharing. Finally, the code design principles are also investigated for the two-user Gaussian interference channel employing trellis-based codes with short block lengths for the case of strong and mixed interference levels.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201
The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
Recently, Etkin, Tse, and Wang found the capacity region of the two-user
Gaussian interference channel to within one bit/s/Hz. A natural goal is to
apply this approach to the Gaussian interference channel with an arbitrary
number of users. We make progress towards this goal by finding the capacity
region of the many-to-one and one-to-many Gaussian interference channels to
within a constant number of bits. The result makes use of a deterministic model
to provide insight into the Gaussian channel. The deterministic model makes
explicit the dimension of signal scale. A central theme emerges: the use of
lattice codes for alignment of interfering signals on the signal scale.Comment: 45 pages, 16 figures. Submitted to IEEE Transactions on Information
Theor
Incremental Relaying for the Gaussian Interference Channel with a Degraded Broadcasting Relay
This paper studies incremental relay strategies for a two-user Gaussian
relay-interference channel with an in-band-reception and
out-of-band-transmission relay, where the link between the relay and the two
receivers is modelled as a degraded broadcast channel. It is shown that
generalized hash-and-forward (GHF) can achieve the capacity region of this
channel to within a constant number of bits in a certain weak relay regime,
where the transmitter-to-relay link gains are not unboundedly stronger than the
interference links between the transmitters and the receivers. The GHF relaying
strategy is ideally suited for the broadcasting relay because it can be
implemented in an incremental fashion, i.e., the relay message to one receiver
is a degraded version of the message to the other receiver. A
generalized-degree-of-freedom (GDoF) analysis in the high signal-to-noise ratio
(SNR) regime reveals that in the symmetric channel setting, each common relay
bit can improve the sum rate roughly by either one bit or two bits
asymptotically depending on the operating regime, and the rate gain can be
interpreted as coming solely from the improvement of the common message rates,
or alternatively in the very weak interference regime as solely coming from the
rate improvement of the private messages. Further, this paper studies an
asymmetric case in which the relay has only a single single link to one of the
destinations. It is shown that with only one relay-destination link, the
approximate capacity region can be established for a larger regime of channel
parameters. Further, from a GDoF point of view, the sum-capacity gain due to
the relay can now be thought as coming from either signal relaying only, or
interference forwarding only.Comment: To appear in IEEE Trans. on Inf. Theor
- …