16,266 research outputs found
Asymptotically Optimal Multiple-access Communication via Distributed Rate Splitting
We consider the multiple-access communication problem in a distributed
setting for both the additive white Gaussian noise channel and the discrete
memoryless channel. We propose a scheme called Distributed Rate Splitting to
achieve the optimal rates allowed by information theory in a distributed
manner. In this scheme, each real user creates a number of virtual users via a
power/rate splitting mechanism in the M-user Gaussian channel or via a random
switching mechanism in the M-user discrete memoryless channel. At the receiver,
all virtual users are successively decoded. Compared with other multiple-access
techniques, Distributed Rate Splitting can be implemented with lower complexity
and less coordination. Furthermore, in a symmetric setting, we show that the
rate tuple achieved by this scheme converges to the maximum equal rate point
allowed by the information-theoretic bound as the number of virtual users per
real user tends to infinity. When the capacity regions are asymmetric, we show
that a point on the dominant face can be achieved asymptotically. Finally, when
there is an unequal number of virtual users per real user, we show that
differential user rate requirements can be accommodated in a distributed
fashion.Comment: Submitted to the IEEE Transactions on Information Theory. 15 Page
Link-State Based Decode-Forward Schemes for Two-way Relaying
In this paper, we analyze a composite decode-and-forward scheme for the
two-way relay channel with a direct link. During transmission, our scheme
combines both block Markov coding and an independent coding scheme similar to
network coding at the relay. The main contribution of this work is to examine
how link state impacts the allocation of power between these two distinct
techniques, which in turn governs the necessity of each technique in achieving
the largest transmission rate region. We analytically determine the link-state
regimes and associated relaying techniques. Our results illustrate an
interesting trend: when the user-to-relay link is marginally stronger than the
direct link, it is optimal to use only independent coding. In this case, the
relay need not use full power. However, for larger user-to-relay link gains,
the relay must supplement independent coding with block Markov coding to
achieve the largest rate region. These link-state regimes are important for the
application of two-way relaying in 5G networks, such as in D2D mode or
relay-aided transmission.Comment: To be presented at Globecom 2014, Emerging Technologies for 5G
Wireless Cellular Networks (Wi5G
A Systematic Approach to Incremental Redundancy over Erasure Channels
As sensing and instrumentation play an increasingly important role in systems
controlled over wired and wireless networks, the need to better understand
delay-sensitive communication becomes a prime issue. Along these lines, this
article studies the operation of data links that employ incremental redundancy
as a practical means to protect information from the effects of unreliable
channels. Specifically, this work extends a powerful methodology termed
sequential differential optimization to choose near-optimal block sizes for
hybrid ARQ over erasure channels. In doing so, an interesting connection
between random coding and well-known constants in number theory is established.
Furthermore, results show that the impact of the coding strategy adopted and
the propensity of the channel to erase symbols naturally decouple when
analyzing throughput. Overall, block size selection is motivated by normal
approximations on the probability of decoding success at every stage of the
incremental transmission process. This novel perspective, which rigorously
bridges hybrid ARQ and coding, offers a pragmatic means to select code rates
and blocklengths for incremental redundancy.Comment: 7 pages, 2 figures; A shorter version of this article will appear in
the proceedings of ISIT 201
- …