510 research outputs found
A Tight Bound for Probability of Error for Quantum Counting Based Multiuser Detection
Future wired and wireless communication systems will employ pure or combined
Code Division Multiple Access (CDMA) technique, such as in the European 3G
mobile UMTS or Power Line Telecommunication system, but also several 4G
proposal includes e.g. multi carrier (MC) CDMA. Former examinations carried out
the drawbacks of single user detectors (SUD), which are widely employed in
narrowband IS-95 CDMA systems, and forced to develop suitable multiuser
detection schemes to increase the efficiency against interference. However, at
this moment there are only suboptimal solutions available because of the rather
high complexity of optimal detectors. One of the possible receiver technologies
can be the quantum assisted computing devices which allows high level
parallelism in computation. The first commercial devices are estimated for the
next years, which meets the advert of 3G and 4G systems. In this paper we
analyze the error probability and give tight bounds in a static and dynamically
changing environment for a novel quantum computation based Quantum Multiuser
detection (QMUD) algorithm, employing quantum counting algorithm, which
provides optimal solution.Comment: presented at IEEE ISIT 2002, 7 pages, 2 figure
Multiuser MIMO-OFDM for Next-Generation Wireless Systems
This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems
Multiuser Detection with Decision-Feedback Detectors and PIC in MC-CDMA System
In this paper we propose an iterative parallel decision feedback (P-DF) receivers associated with parallel interference cancellation (PIC) for multicarrier code division multiple access (MC-CDMA) systems in a Rayleigh fading channel (cost 207). First the most widely detection techniques, minimum mean-squared error MMSE, Maximum Likelihood ML and PIC were investigated in order to compare their performances in terms of Bit Error Rate (BER) with parallel feedback detection P-DFD. A MMSE DF detector that employs parallel decision-feedback (MMSE-P-DFD) is considered and shows almost the same BER performance with MMSE and ML, which present a better result than the other techniques. In a second time, an iterative proposed method based on the multi-stage techniques P-DFD (parallel DFD with two stages) and PIC was exploited to improve the performance of the system
Signal Processing and Learning for Next Generation Multiple Access in 6G
Wireless communication systems to date primarily rely on the orthogonality of
resources to facilitate the design and implementation, from user access to data
transmission. Emerging applications and scenarios in the sixth generation (6G)
wireless systems will require massive connectivity and transmission of a deluge
of data, which calls for more flexibility in the design concept that goes
beyond orthogonality. Furthermore, recent advances in signal processing and
learning have attracted considerable attention, as they provide promising
approaches to various complex and previously intractable problems of signal
processing in many fields. This article provides an overview of research
efforts to date in the field of signal processing and learning for
next-generation multiple access, with an emphasis on massive random access and
non-orthogonal multiple access. The promising interplay with new technologies
and the challenges in learning-based NGMA are discussed
Turbo receivers for interleave-division multiple-access systems
In this paper several turbo receivers for Interleave-Division Multiple-Access (IDMA) systems will be discussed. The multiple access system model is presented first. The optimal, Maximum A Posteriori (MAP) algorithm, is then presented. It will be shown that the use of a precoding technique at the emitter side is applicable to IDMA systems. Several low complexity Multi-User Detector (MUD), based on the Gaussian approximation, will be next discussed. It will be shown that the MUD with Probabilistic Data Association (PDA) algorithm provides faster convergence of the turbo receiver. The discussed turbo receivers will be evaluated by means of Bit Error Rate (BER) simulations and EXtrinsic Information Transfer (EXIT) charts
Subspace Tracking and Least Squares Approaches to Channel Estimation in Millimeter Wave Multiuser MIMO
The problem of MIMO channel estimation at millimeter wave frequencies, both
in a single-user and in a multi-user setting, is tackled in this paper. Using a
subspace approach, we develop a protocol enabling the estimation of the right
(resp. left) singular vectors at the transmitter (resp. receiver) side; then,
we adapt the projection approximation subspace tracking with deflation and the
orthogonal Oja algorithms to our framework and obtain two channel estimation
algorithms. We also present an alternative algorithm based on the least squares
approach. The hybrid analog/digital nature of the beamformer is also explicitly
taken into account at the algorithm design stage. In order to limit the system
complexity, a fixed analog beamformer is used at both sides of the
communication links. The obtained numerical results, showing the accuracy in
the estimation of the channel matrix dominant singular vectors, the system
achievable spectral efficiency, and the system bit-error-rate, prove that the
proposed algorithms are effective, and that they compare favorably, in terms of
the performance-complexity trade-off, with respect to several competing
alternatives.Comment: To appear on the IEEE Transactions on Communication
Gaussian Message Passing for Overloaded Massive MIMO-NOMA
This paper considers a low-complexity Gaussian Message Passing (GMP) scheme
for a coded massive Multiple-Input Multiple-Output (MIMO) systems with
Non-Orthogonal Multiple Access (massive MIMO-NOMA), in which a base station
with antennas serves sources simultaneously in the same frequency.
Both and are large numbers, and we consider the overloaded cases
with . The GMP for MIMO-NOMA is a message passing algorithm operating
on a fully-connected loopy factor graph, which is well understood to fail to
converge due to the correlation problem. In this paper, we utilize the
large-scale property of the system to simplify the convergence analysis of the
GMP under the overloaded condition. First, we prove that the \emph{variances}
of the GMP definitely converge to the mean square error (MSE) of Linear Minimum
Mean Square Error (LMMSE) multi-user detection. Secondly, the \emph{means} of
the traditional GMP will fail to converge when . Therefore, we propose and derive a new
convergent GMP called scale-and-add GMP (SA-GMP), which always converges to the
LMMSE multi-user detection performance for any , and show that it
has a faster convergence speed than the traditional GMP with the same
complexity. Finally, numerical results are provided to verify the validity and
accuracy of the theoretical results presented.Comment: Accepted by IEEE TWC, 16 pages, 11 figure
- …