990 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
One-Bit Massive MIMO: Channel Estimation and High-Order Modulations
We investigate the information-theoretic throughout achievable on a fading
communication link when the receiver is equipped with one-bit analog-to-digital
converters (ADCs). The analysis is conducted for the setting where neither the
transmitter nor the receiver have a priori information on the realization of
the fading channels. This means that channel-state information needs to be
acquired at the receiver on the basis of the one-bit quantized channel outputs.
We show that least-squares (LS) channel estimation combined with joint pilot
and data processing is capacity achieving in the single-user,
single-receive-antenna case.
We also investigate the achievable uplink throughput in a massive
multiple-input multiple-output system where each element of the antenna array
at the receiver base-station feeds a one-bit ADC. We show that LS channel
estimation and maximum-ratio combining are sufficient to support both multiuser
operation and the use of high-order constellations. This holds in spite of the
severe nonlinearity introduced by the one-bit ADCs
An Overview of Physical Layer Security with Finite-Alphabet Signaling
Providing secure communications over the physical layer with the objective of
achieving perfect secrecy without requiring a secret key has been receiving
growing attention within the past decade. The vast majority of the existing
studies in the area of physical layer security focus exclusively on the
scenarios where the channel inputs are Gaussian distributed. However, in
practice, the signals employed for transmission are drawn from discrete signal
constellations such as phase shift keying and quadrature amplitude modulation.
Hence, understanding the impact of the finite-alphabet input constraints and
designing secure transmission schemes under this assumption is a mandatory step
towards a practical implementation of physical layer security. With this
motivation, this article reviews recent developments on physical layer security
with finite-alphabet inputs. We explore transmit signal design algorithms for
single-antenna as well as multi-antenna wiretap channels under different
assumptions on the channel state information at the transmitter. Moreover, we
present a review of the recent results on secure transmission with discrete
signaling for various scenarios including multi-carrier transmission systems,
broadcast channels with confidential messages, cognitive multiple access and
relay networks. Throughout the article, we stress the important behavioral
differences of discrete versus Gaussian inputs in the context of the physical
layer security. We also present an overview of practical code construction over
Gaussian and fading wiretap channels, and we discuss some open problems and
directions for future research.Comment: Submitted to IEEE Communications Surveys & Tutorials (1st Revision
Power allocation and linear precoding for wireless communications with finite-alphabet inputs
This dissertation proposes a new approach to maximizing data rate/throughput of practical communication system/networks through linear precoding and power allocation. First, the mutual information or capacity region is derived for finite-alphabet inputs such as phase-shift keying (PSK), pulse-amplitude modulation (PAM), and quadrature amplitude modulation (QAM) signals. This approach, without the commonly used Gaussian input assumptions, complicates the mutual information analysis and precoder design but improves performance when the designed precoders are applied to practical systems and networks. Second, several numerical optimization methods are developed for multiple-input multiple-output (MIMO) multiple access channels, dual-hop relay networks, and point-to-point MIMO systems. In MIMO multiple access channels, an iterative weighted sum rate maximization algorithm is proposed which utilizes an alternating optimization strategy and gradient descent update. In dual-hop relay networks, the structure of the optimal precoder is exploited to develop a two-step iterative algorithm based on convex optimization and optimization on the Stiefel manifold. The proposed algorithm is insensitive to initial point selection and able to achieve a near global optimal precoder solution. The gradient descent method is also used to obtain the optimal power allocation scheme which maximizes the mutual information between the source node and destination node in dual-hop relay networks. For point-to-point MIMO systems, a low complexity precoding design method is proposed, which maximizes the lower bound of the mutual information with discretized power allocation vector in a non-iterative fashion, thus reducing complexity. Finally, performances of the proposed power allocation and linear precoding schemes are evaluated in terms of both mutual information and bit error rate (BER). Numerical results show that at the same target mutual information or sum rate, the proposed approaches achieve 3-10dB gains compared to the existing methods in the medium signal-to-noise ratio region. Such significant gains are also indicated in the coded BER systems --Abstract, page iv-v
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
- …