19 research outputs found
Asynchronous Orthogonal Differential Decoding for Multiple Access Channels
We propose several differential decoding schemes for asynchronous multi-user
MIMO systems based on orthogonal space-time block codes (OSTBCs) where neither
the transmitters nor the receiver has knowledge of the channel. First, we
derive novel low complexity differential decoders by performing interference
cancelation in time and employing different decoding methods. The decoding
complexity of these schemes grows linearly with the number of users. We then
present additional differential decoding schemes that perform significantly
better than our low complexity decoders and outperform the existing synchronous
differential schemes but require higher decoding complexity compared to our low
complexity decoders. The proposed schemes work for any square OSTBC, any
constant amplitude constellation, any number of users, and any number of
receive antennas. Furthermore, we analyze the diversity of the proposed schemes
and derive conditions under which our schemes provide full diversity. For the
cases of two and four transmit antennas, we provide examples of PSK
constellations to achieve full diversity. Simulation results show that our
differential schemes provide good performance. To the best of our knowledge,
the proposed differential detection schemes are the first differential schemes
for asynchronous multi-user systems.Comment: To appear in IEEE Transactions on Wireless Communication
Sequential Decoding for Multiple Access Channels
The use of sequential decoding in multiple access channels is considered. The Fano metric, which achieves all achievable rates in the one-user case, fails to do so in the multiuser case. A new metric is introduced and an inner bound is given to its achievable rate region. This inner bound region is large enough to encourage the use of sequential decoding in practice. The new metric is optimal, in the sense of achieving all achievable rates, in the case of one-user and pairwise-reversible channels. Whether the metric is optimal for all multiple access channels remains an open problem. It is worth noting that even in the one-user case, the new metric differs from the Fano metric in a nontrivial way, showing that the Fano metric is not uniquely optimal for such channels. A new and stricter criterion of achievability in sequential decoding is also introduced and examined. © 1988 IEE
Asynchronous Channel Training in Multi-Cell Massive MIMO
Pilot contamination has been regarded as the main bottleneck in time division
duplexing (TDD) multi-cell massive multiple-input multiple-output (MIMO)
systems. The pilot contamination problem cannot be addressed with large-scale
antenna arrays. We provide a novel asynchronous channel training scheme to
obtain precise channel matrices without the cooperation of base stations. The
scheme takes advantage of sampling diversity by inducing intentional timing
mismatch. Then, the linear minimum mean square error (LMMSE) estimator and the
zero-forcing (ZF) estimator are designed. Moreover, we derive the minimum
square error (MSE) upper bound of the ZF estimator. In addition, we propose the
equally-divided delay scheme which under certain conditions is the optimal
solution to minimize the MSE of the ZF estimator employing the identity matrix
as pilot matrix. We calculate the uplink achievable rate using maximum ratio
combining (MRC) to compare asynchronous and synchronous channel training
schemes. Finally, simulation results demonstrate that the asynchronous channel
estimation scheme can greatly reduce the harmful effect of pilot contamination
On the Performance of MRC Receiver with Unknown Timing Mismatch-A Large Scale Analysis
There has been extensive research on large scale multi-user multiple-input
multiple-output (MU-MIMO) systems recently. Researchers have shown that there
are great opportunities in this area, however, there are many obstacles in the
way to achieve full potential of using large number of receive antennas. One of
the main issues, which will be investigated thoroughly in this paper, is timing
asynchrony among signals of different users. Most of the works in the
literature, assume that received signals are perfectly aligned which is not
practical. We show that, neglecting the asynchrony can significantly degrade
the performance of existing designs, particularly maximum ratio combining
(MRC). We quantify the uplink achievable rates obtained by MRC receiver with
perfect channel state information (CSI) and imperfect CSI while the system is
impaired by unknown time delays among received signals. We then use these
results to design new algorithms in order to alleviate the effects of timing
mismatch. We also analyze the performance of introduced receiver design, which
is called MRC-ZF, with perfect and imperfect CSI. For performing MRC-ZF, the
only required information is the distribution of timing mismatch which
circumvents the necessity of time delay acquisition or synchronization. To
verify our analytical results, we present extensive simulation results which
thoroughly investigate the performance of the traditional MRC receiver and the
introduced MRC-ZF receiver
Applications of position-based coding to classical communication over quantum channels
Recently, a coding technique called position-based coding has been used to
establish achievability statements for various kinds of classical communication
protocols that use quantum channels. In the present paper, we apply this
technique in the entanglement-assisted setting in order to establish lower
bounds for error exponents, lower bounds on the second-order coding rate, and
one-shot lower bounds. We also demonstrate that position-based coding can be a
powerful tool for analyzing other communication settings. In particular, we
reduce the quantum simultaneous decoding conjecture for entanglement-assisted
or unassisted communication over a quantum multiple access channel to open
questions in multiple quantum hypothesis testing. We then determine achievable
rate regions for entanglement-assisted or unassisted classical communication
over a quantum multiple-access channel, when using a particular quantum
simultaneous decoder. The achievable rate regions given in this latter case are
generally suboptimal, involving differences of Renyi-2 entropies and
conditional quantum entropies.Comment: v4: 44 pages, v4 includes a simpler proof for an upper bound on
one-shot entanglement-assisted capacity, also found recently and
independently in arXiv:1804.0964
On the Achievable Rate Region of Sequential Decoding for a Class of Multiaccess Channels
The achievable-rate region of sequential decoding for the class of pairwise reversible multiaccess channels is determined. This result is obtained by finding tight lower bounds to the average list size for the same class of channels. The average list size is defined as the expected number of incorrect messages that appear, to a maximum-likelihood decoder, to be at least as likely as the correct message. The average list size bounds developed here may be of independent interest, with possible applications to list-decoding schemes. © 1990 IEE
An Analysis of Two-User Uplink Asynchronous Non-Orthogonal Multiple Access Systems
Recent studies have numerically demonstrated the possible advantages of the
asynchronous non-orthogonal multiple access (ANOMA) over the conventional
synchronous non-orthogonal multiple access (NOMA). The ANOMA makes use of the
oversampling technique by intentionally introducing a timing mismatch between
symbols of different users. Focusing on a two-user uplink system, for the first
time, we analytically prove that the ANOMA with a sufficiently large frame
length can always outperform the NOMA in terms of the sum throughput. To this
end, we derive the expression for the sum throughput of the ANOMA as a function
of signal-to-noise ratio (SNR), frame length, and normalized timing mismatch.
Based on the derived expression, we find that users should transmit at full
powers to maximize the sum throughput. In addition, we obtain the optimal
timing mismatch as the frame length goes to infinity. Moreover, we
comprehensively study the impact of timing error on the ANOMA throughput
performance. Two types of timing error, i.e., the synchronization timing error
and the coordination timing error, are considered. We derive the throughput
loss incurred by both types of timing error and find that the synchronization
timing error has a greater impact on the throughput performance compared to the
coordination timing error
Novel Time Asynchronous NOMA schemes for Downlink Transmissions
In this work, we investigate the effect of time asynchrony in non-orthogonal
multiple access (NOMA) schemes for downlink transmissions. First, we analyze
the benefit of adding intentional timing offsets to the conventional power
domain-NOMA (P-NOMA). This method which is called Asynchronous-Power
Domain-NOMA (AP-NOMA) introduces artificial symbol-offsets between packets
destined for different users. It reduces the mutual interference which results
in enlarging the achievable rate-region of the conventional P-NOMA. Then, we
propose a precoding scheme which fully exploits the degrees of freedom provided
by the time asynchrony. We call this multiple access scheme T-NOMA which
provides higher degrees of freedom for users compared to the conventional
P-NOMA or even the modified AP-NOMA. T-NOMA adopts a precoding at the base
station and a linear preprocessing scheme at the receiving user which
decomposes the broadcast channel into parallel channels circumventing the need
for Successive Interference Cancellation (SIC). The numerical results show that
T-NOMA outperforms AP-NOMA and both outperform the conventional P-NOMA. We also
compare the maximum sum-rate and fairness provided by these methods. Moreover,
the impact of pulse shape and symbol offset on the performance of AP-NOMA and
T-NOMA schemes are investigated
Cooperative Asynchronous Non-Orthogonal Multiple Access with Power Minimization Under QoS Constraints
Recent studies have demonstrated the superiority of non-orthogonal multiple
access (NOMA) over orthogonal multiple access (OMA) in cooperative
communication networks. In this paper, we propose a novel half-duplex
cooperative asynchronous NOMA (C-ANOMA) framework with user relaying, where a
timing mismatch is intentionally added in the broadcast signal. We derive the
expressions for the individual throughputs of the strong user (acts as relay)
which employs the block-wise successive interference cancellation (SIC) and the
weak user which combines the symbol-asynchronous signal with the
interference-free signal. We analytically prove that in the C-ANOMA systems
with a sufficiently large frame length, the strong user attains the same
throughput to decode its own message while both users can achieve a higher
throughput to decode the weak user's message compared with those in the
cooperative NOMA (C-NOMA) systems. Besides, we obtain the optimal timing
mismatch when the frame length goes to infinity. Furthermore, to exploit the
trade-off between the power consumption of base station and that of the relay
user, we solve a weighted sum power minimization problem under quality of
services (QoS) constraints. Numerical results show that the C-ANOMA system can
consume less power compared with the C-NOMA system to satisfy the same QoS
requirements
On the Origin of Polar Coding
Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a vector channel (either given or artificially built), split it into multiple correlated subchannels, and employ a separate sequential decoder on each subchannel. Polar coding was originally designed to be a low-complexity recursive channel combining and splitting operation of this type, to be used as the inner code in a concatenated scheme with outer convolutional coding and sequential decoding. However, the polar inner code turned out to be so effective that no outer code was actually needed to achieve the original aim of boosting the cutoff rate to channel capacity. This paper explains the cutoff rate considerations that motivated the development of polar coding. © 2015 IEEE