1,822 research outputs found
Advances in Multi-User Scheduling and Turbo Equalization for Wireless MIMO Systems
Nach einer Einleitung behandelt Teil 2 Mehrbenutzer-Scheduling für die
Abwärtsstrecke von drahtlosen MIMO Systemen mit einer Sendestation und
kanaladaptivem precoding: In jeder Zeit- oder Frequenzressource kann eine
andere Nutzergruppe gleichzeitig bedient werden, räumlich getrennt durch
unterschiedliche Antennengewichte. Nutzer mit korrelierten Kanälen sollten
nicht gleichzeitig bedient werden, da dies die räumliche Trennbarkeit
erschwert. Die Summenrate einer Nutzermenge hängt von den Antennengewichten
ab, die wiederum von der Nutzerauswahl abhängen. Zur Entkopplung des
Problems schlägt diese Arbeit Metriken vor basierend auf einer geschätzten
Rate mit ZF precoding. Diese lässt sich mit Hilfe von wiederholten
orthogonalen Projektionen abschätzen, wodurch die Berechnung von
Antennengewichten beim Scheduling entfällt. Die Ratenschätzung kann
basierend auf momentanen Kanalmessungen oder auf gemittelter Kanalkenntnis
berechnet werden und es können Datenraten- und Fairness-Kriterien
berücksichtig werden. Effiziente Suchalgorithmen werden vorgestellt, die
die gesamte Systembandbreite auf einmal bearbeiten können und zur
Komplexitätsreduktion die Lösung in Zeit- und Frequenz nachführen können.
Teil 3 zeigt wie mehrere Sendestationen koordiniertes Scheduling und
kooperative Signalverarbeitung einsetzen können. Mittels orthogonalen
Projektionen ist es möglich, Inter-Site Interferenz zu schätzen, ohne
Antennengewichte berechnen zu müssen. Durch ein Konzept virtueller Nutzer
kann der obige Scheduling-Ansatz auf mehrere Sendestationen und sogar
Relays mit SDMA erweitert werden. Auf den benötigten Signalisierungsaufwand
wird kurz eingegangen und eine Methode zur Schätzung der Summenrate eines
Systems ohne Koordination besprochen. Teil4 entwickelt Optimierungen für
Turbo Entzerrer. Diese Nutzen Signalkorrelation als Quelle von Redundanz.
Trotzdem kann eine Kombination mit MIMO precoding sinnvoll sein, da bei
Annahme realistischer Fehler in der Kanalkenntnis am Sender keine optimale
Interferenzunterdrückung möglich ist. Mit Hilfe von EXIT Charts wird eine
neuartige Methode zur adaptiven Nutzung von a-priori-Information zwischen
Iterationen entwickelt, die die Konvergenz verbessert. Dabei wird gezeigt,
wie man semi-blinde Kanalschätzung im EXIT chart berücksichtigen kann.
In Computersimulationen werden alle Verfahren basierend auf
4G-Systemparametern überprüft.After an introduction, part 2 of this thesis deals with downlink multi-user
scheduling for wireless MIMO systems with one transmitting station
performing channel adaptive precoding:Different user subsets can be served
in each time or frequency resource by separating them in space with
different antenna weight vectors. Users with correlated channel matrices
should not be served jointly since correlation impairs the spatial
separability.The resulting sum rate for each user subset depends on the
precoding weights, which in turn depend on the user subset. This thesis
manages to decouple this problem by proposing a scheduling metric based on
the rate with ZF precoding such as BD, written with the help of orthogonal
projection matrices. It allows estimating rates without computing any
antenna weights by using a repeated projection approximation.This rate
estimate allows considering user rate requirements and fairness criteria
and can work with either instantaneous or long term averaged channel
knowledge.Search algorithms are presented to efficiently solve user
grouping or selection problems jointly for the entire system bandwidth
while being able to track the solution in time and frequency for complexity
reduction.
Part 3 shows how multiple transmitting stations can benefit from
cooperative scheduling or joint signal processing. An orthogonal projection
based estimate of the inter-site interference power, again without
computing any antenna weights, and a virtual user concept extends the
scheduling approach to cooperative base stations and finally included SDMA
half-duplex relays in the scheduling.Signalling overhead is discussed and a
method to estimate the sum rate without coordination.
Part 4 presents optimizations for Turbo Equalizers. There, correlation
between user signals can be exploited as a source of redundancy.
Nevertheless a combination with transmit precoding which aims at reducing
correlation can be beneficial when the channel knowledge at the transmitter
contains a realistic error, leading to increased correlation. A novel
method for adaptive re-use of a-priori information between is developed to
increase convergence by tracking the iterations online with EXIT charts.A
method is proposed to model semi-blind channel estimation updates in an
EXIT chart.
Computer simulations with 4G system parameters illustrate the methods using realistic channel models.Im Buchhandel erhältlich:
Advances in Multi-User Scheduling and Turbo Equalization for Wireless MIMO Systems / Fuchs-Lautensack,Martin
Ilmenau: ISLE, 2009,116 S.
ISBN 978-3-938843-43-
Fronthaul-Constrained Cloud Radio Access Networks: Insights and Challenges
As a promising paradigm for fifth generation (5G) wireless communication
systems, cloud radio access networks (C-RANs) have been shown to reduce both
capital and operating expenditures, as well as to provide high spectral
efficiency (SE) and energy efficiency (EE). The fronthaul in such networks,
defined as the transmission link between a baseband unit (BBU) and a remote
radio head (RRH), requires high capacity, but is often constrained. This
article comprehensively surveys recent advances in fronthaul-constrained
C-RANs, including system architectures and key techniques. In particular, key
techniques for alleviating the impact of constrained fronthaul on SE/EE and
quality of service for users, including compression and quantization,
large-scale coordinated processing and clustering, and resource allocation
optimization, are discussed. Open issues in terms of software-defined
networking, network function virtualization, and partial centralization are
also identified.Comment: 5 Figures, accepted by IEEE Wireless Communications. arXiv admin
note: text overlap with arXiv:1407.3855 by other author
Optimality Properties, Distributed Strategies, and Measurement-Based Evaluation of Coordinated Multicell OFDMA Transmission
The throughput of multicell systems is inherently limited by interference and
the available communication resources. Coordinated resource allocation is the
key to efficient performance, but the demand on backhaul signaling and
computational resources grows rapidly with number of cells, terminals, and
subcarriers. To handle this, we propose a novel multicell framework with
dynamic cooperation clusters where each terminal is jointly served by a small
set of base stations. Each base station coordinates interference to neighboring
terminals only, thus limiting backhaul signalling and making the framework
scalable. This framework can describe anything from interference channels to
ideal joint multicell transmission.
The resource allocation (i.e., precoding and scheduling) is formulated as an
optimization problem (P1) with performance described by arbitrary monotonic
functions of the signal-to-interference-and-noise ratios (SINRs) and arbitrary
linear power constraints. Although (P1) is non-convex and difficult to solve
optimally, we are able to prove: 1) Optimality of single-stream beamforming; 2)
Conditions for full power usage; and 3) A precoding parametrization based on a
few parameters between zero and one. These optimality properties are used to
propose low-complexity strategies: both a centralized scheme and a distributed
version that only requires local channel knowledge and processing. We evaluate
the performance on measured multicell channels and observe that the proposed
strategies achieve close-to-optimal performance among centralized and
distributed solutions, respectively. In addition, we show that multicell
interference coordination can give substantial improvements in sum performance,
but that joint transmission is very sensitive to synchronization errors and
that some terminals can experience performance degradations.Comment: Published in IEEE Transactions on Signal Processing, 15 pages, 7
figures. This version corrects typos related to Eq. (4) and Eq. (28
Scaling up MIMO: Opportunities and Challenges with Very Large Arrays
This paper surveys recent advances in the area of very large MIMO systems.
With very large MIMO, we think of systems that use antenna arrays with an
order of magnitude more elements than in systems being built today, say a
hundred antennas or more. Very large MIMO entails an unprecedented number of
antennas simultaneously serving a much smaller number of terminals. The
disparity in number emerges as a desirable operating condition and a practical
one as well. The number of terminals that can be simultaneously served is
limited, not by the number of antennas, but rather by our inability to acquire
channel-state information for an unlimited number of terminals. Larger numbers
of terminals can always be accommodated by combining very large MIMO technology
with conventional time- and frequency-division multiplexing via OFDM. Very
large MIMO arrays is a new research field both in communication theory,
propagation, and electronics and represents a paradigm shift in the way of
thinking both with regards to theory, systems and implementation. The ultimate
vision of very large MIMO systems is that the antenna array would consist of
small active antenna units, plugged into an (optical) fieldbus.Comment: Accepted for publication in the IEEE Signal Processing Magazine,
October 201
A Tutorial on Clique Problems in Communications and Signal Processing
Since its first use by Euler on the problem of the seven bridges of
K\"onigsberg, graph theory has shown excellent abilities in solving and
unveiling the properties of multiple discrete optimization problems. The study
of the structure of some integer programs reveals equivalence with graph theory
problems making a large body of the literature readily available for solving
and characterizing the complexity of these problems. This tutorial presents a
framework for utilizing a particular graph theory problem, known as the clique
problem, for solving communications and signal processing problems. In
particular, the paper aims to illustrate the structural properties of integer
programs that can be formulated as clique problems through multiple examples in
communications and signal processing. To that end, the first part of the
tutorial provides various optimal and heuristic solutions for the maximum
clique, maximum weight clique, and -clique problems. The tutorial, further,
illustrates the use of the clique formulation through numerous contemporary
examples in communications and signal processing, mainly in maximum access for
non-orthogonal multiple access networks, throughput maximization using index
and instantly decodable network coding, collision-free radio frequency
identification networks, and resource allocation in cloud-radio access
networks. Finally, the tutorial sheds light on the recent advances of such
applications, and provides technical insights on ways of dealing with mixed
discrete-continuous optimization problems
- …