676 research outputs found
Code designs for MIMO broadcast channels
Recent information-theoretic results show the optimality of dirty-paper coding (DPC) in achieving the full capacity region of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). This paper presents a DPC based code design for BCs. We consider the case in which there is an individual rate/signal-to-interference-plus-noise ratio (SINR) constraint for each user. For a fixed transmitter power, we choose the linear transmit precoding matrix such that the SINRs at users are uniformly maximized, thus ensuring the best bit-error rate performance. We start with Cover's simplest two-user Gaussian BC and present a coding scheme that operates 1.44 dB from the boundary of the capacity region at the rate of one bit per real sample (b/s) for each user. We then extend the coding strategy to a two-user MIMO Gaussian BC with two transmit antennas at the base-station and develop the first limit-approaching code design using nested turbo codes for DPC. At the rate of 1 b/s for each user, our design operates 1.48 dB from the capacity region boundary. We also consider the performance of our scheme over a slow fading BC. For two transmit antennas, simulation results indicate a performance loss of only 1.4 dB, 1.64 dB and 1.99 dB from the theoretical limit in terms of the total transmission power for the two, three and four user case, respectively
A Novel Power Allocation Scheme for Two-User GMAC with Finite Input Constellations
Constellation Constrained (CC) capacity regions of two-user Gaussian Multiple
Access Channels (GMAC) have been recently reported, wherein an appropriate
angle of rotation between the constellations of the two users is shown to
enlarge the CC capacity region. We refer to such a scheme as the Constellation
Rotation (CR) scheme. In this paper, we propose a novel scheme called the
Constellation Power Allocation (CPA) scheme, wherein the instantaneous transmit
power of the two users are varied by maintaining their average power
constraints. We show that the CPA scheme offers CC sum capacities equal (at low
SNR values) or close (at high SNR values) to those offered by the CR scheme
with reduced decoding complexity for QAM constellations. We study the
robustness of the CPA scheme for random phase offsets in the channel and
unequal average power constraints for the two users. With random phase offsets
in the channel, we show that the CC sum capacity offered by the CPA scheme is
more than the CR scheme at high SNR values. With unequal average power
constraints, we show that the CPA scheme provides maximum gain when the power
levels are close, and the advantage diminishes with the increase in the power
difference.Comment: To appear in IEEE Transactions on Wireless Communications, 10 pages
and 7 figure
A Game-Theoretic Approach to Energy-Efficient Modulation in CDMA Networks with Delay QoS Constraints
A game-theoretic framework is used to study the effect of constellation size
on the energy efficiency of wireless networks for M-QAM modulation. A
non-cooperative game is proposed in which each user seeks to choose its
transmit power (and possibly transmit symbol rate) as well as the constellation
size in order to maximize its own utility while satisfying its delay
quality-of-service (QoS) constraint. The utility function used here measures
the number of reliable bits transmitted per joule of energy consumed, and is
particularly suitable for energy-constrained networks. The best-response
strategies and Nash equilibrium solution for the proposed game are derived. It
is shown that in order to maximize its utility (in bits per joule), a user must
choose the lowest constellation size that can accommodate the user's delay
constraint. This strategy is different from one that would maximize spectral
efficiency. Using this framework, the tradeoffs among energy efficiency, delay,
throughput and constellation size are also studied and quantified. In addition,
the effect of trellis-coded modulation on energy efficiency is discussed.Comment: To appear in the IEEE Journal on Selected Areas in Communications
(JSAC): Special Issue on Non-Cooperative Behavior in Networking, August 200
Enhanced Trellis Coded Multiple Access (ETCMA)
We propose an enhanced version of trellis coded multiple access (TCMA), an
overloaded multiple access scheme that outperforms the original TCMA in terms
of achieved spectral efficiency. Enhanced TCMA (ETCMA) performs simultaneous
transmission of multiple data streams intended for users experiencing similar
signal-to-noise ratios and can be employed both in the uplink and in the
downlink of wireless systems, thus overcoming one of the main limitations of
TCMA. Thanks to a new receiver algorithm, ETCMA is capable of delivering a
significantly higher spectral efficiency. We show that ETCMA approaches the
capacity of the Additive White Gaussian Noise channel for a wide range of
signal-to-noise ratios.Comment: 5 pages, 5 figure
Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping
In this paper, we provide for the first time a systematic comparison of
distribution matching (DM) and sphere shaping (SpSh) algorithms for short
blocklength probabilistic amplitude shaping. For asymptotically large
blocklengths, constant composition distribution matching (CCDM) is known to
generate the target capacity-achieving distribution. As the blocklength
decreases, however, the resulting rate loss diminishes the efficiency of CCDM.
We claim that for such short blocklengths and over the additive white Gaussian
channel (AWGN), the objective of shaping should be reformulated as obtaining
the most energy-efficient signal space for a given rate (rather than matching
distributions). In light of this interpretation, multiset-partition DM (MPDM),
enumerative sphere shaping (ESS) and shell mapping (SM), are reviewed as
energy-efficient shaping techniques. Numerical results show that MPDM and SpSh
have smaller rate losses than CCDM. SpSh--whose sole objective is to maximize
the energy efficiency--is shown to have the minimum rate loss amongst all. We
provide simulation results of the end-to-end decoding performance showing that
up to 1 dB improvement in power efficiency over uniform signaling can be
obtained with MPDM and SpSh at blocklengths around 200. Finally, we present a
discussion on the complexity of these algorithms from the perspective of
latency, storage and computations.Comment: 18 pages, 10 figure
Self-concatenated code design and its application in power-efficient cooperative communications
In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions
- …