38 research outputs found
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
Uplink Non-Orthogonal Multiple Access with Finite-Alphabet Inputs
This paper focuses on the non-orthogonal multiple access (NOMA) design for a
classical two-user multiple access channel (MAC) with finite-alphabet inputs.
We consider practical quadrature amplitude modulation (QAM) constellations at
both transmitters, the sizes of which are assumed to be not necessarily
identical. We propose to maximize the minimum Euclidean distance of the
received sum-constellation with a maximum likelihood (ML) detector by adjusting
the scaling factors (i.e., instantaneous transmitted powers and phases) of both
users. The formulated problem is a mixed continuous-discrete optimization
problem, which is nontrivial to resolve in general. By carefully observing the
structure of the objective function, we discover that Farey sequence can be
applied to tackle the formulated problem. However, the existing Farey sequence
is not applicable when the constellation sizes of the two users are not the
same. Motivated by this, we define a new type of Farey sequence, termed punched
Farey sequence. Based on this, we manage to achieve a closed-form optimal
solution to the original problem by first dividing the entire feasible region
into a finite number of Farey intervals and then taking the maximum over all
the possible intervals. The resulting sum-constellation is proved to be a
regular QAM constellation of a larger size. Moreover, the superiority of NOMA
over time-division multiple access (TDMA) in terms of minimum Euclidean
distance is rigorously proved. Furthermore, the optimal rate allocation among
the two users is obtained in closed-form to further maximize the obtained
minimum Euclidean distance of the received signal subject to a total rate
constraint. Finally, simulation results are provided to verify our theoretical
analysis and demonstrate the merits of the proposed NOMA over existing
orthogonal and non-orthogonal designs.Comment: Submitted for possible journal publicatio
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
Linear MIMO Precoding in Jointly-Correlated Fading Multiple Access Channels with Finite Alphabet Signaling
In this paper, we investigate the design of linear precoders for
multiple-input multiple-output (MIMO) multiple access channels (MAC). We assume
that statistical channel state information (CSI) is available at the
transmitters and consider the problem under the practical finite alphabet input
assumption. First, we derive an asymptotic (in the large-system limit) weighted
sum rate (WSR) expression for the MIMO MAC with finite alphabet inputs and
general jointly-correlated fading. Subsequently, we obtain necessary conditions
for linear precoders maximizing the asymptotic WSR and propose an iterative
algorithm for determining the precoders of all users. In the proposed
algorithm, the search space of each user for designing the precoding matrices
is its own modulation set. This significantly reduces the dimension of the
search space for finding the precoding matrices of all users compared to the
conventional precoding design for the MIMO MAC with finite alphabet inputs,
where the search space is the combination of the modulation sets of all users.
As a result, the proposed algorithm decreases the computational complexity for
MIMO MAC precoding design with finite alphabet inputs by several orders of
magnitude. Simulation results for finite alphabet signalling indicate that the
proposed iterative algorithm achieves significant performance gains over
existing precoder designs, including the precoder design based on the Gaussian
input assumption, in terms of both the sum rate and the coded bit error rate.Comment: 7 pages, 2 figures, accepted for ICC1
Physical-layer Network Coding for Cooperative Wireless Networks
As a newly-emerged paradigm in the networking techniques, physical-layer network coding (PNC) [1, 5] takes advantage of the superimposition of the electromagnetic waves, and embraces the interference which was typically deemed as harmful, by performing exclusive-or mapping. Therefore, the spectral efficiency is utilized, which in turn boosts the network throughput. In the classical 2-way relay channel (2-WRC), PNC only spends two channel uses for the bi-directional data exchange. However, one challenge for such a paradigm is that the singular fading states in the uplink of 2-WRC, might result in ambiguity for decoding the network coded symbol. One major focus of this thesis is to address the fading issue for PNC in the 2-WRC. Another fundamental challenge for PNC is to extend the PNC from the 2-WRC to a multi-user network such as the multi-way relay channel (M-WRC) or the hierarchical wireless network (HWN). To tackle these two fundamental challenges of PNC, several solutions are proposed in this thesis, which are summarized as follows: First, we introduce two efficient fading correction strategies, i.e., the rotationally-invariant coded modulation and the soft-bit correction. Second, a novel multilevel coded linear PNC scheme with extended mapping for the Rayleigh fading 2-WRC is proposed. Third, we design a new type of linear PNC for the Rayleigh fading 2-WRC, based on rings. We refer to such design as linear PNC over the hybrid finite ring. Fourth, we redesign PNC for the HWN, which facilitates the multi-user data exchange. To combat the co-channel interference introduced by multi-user data exchange, two efficient interference exploitation strategies based on network coding are proposed: 1) PNC with joint decoding; and 2) analogue network coding with interference-aware maximum likelihood detection. Finally, we propose a multilevel coded LPNC for the data exchange in the M-WRC