309 research outputs found

    Outage rates and outage durations of opportunistic relaying systems

    Full text link
    Opportunistic relaying is a simple yet efficient cooperation scheme that achieves full diversity and preserves the spectral efficiency among the spatially distributed stations. However, the stations' mobility causes temporal correlation of the system's capacity outage events, which gives rise to its important second-order outage statistical parameters, such as the average outage rate (AOR) and the average outage duration (AOD). This letter presents exact analytical expressions for the AOR and the AOD of an opportunistic relaying system, which employs a mobile source and a mobile destination (without a direct path), and an arbitrary number of (fixed-gain amplify-and-forward or decode-and-forward) mobile relays in Rayleigh fading environment

    Adaptive OFDM Index Modulation for Two-Hop Relay-Assisted Networks

    Get PDF
    In this paper, we propose an adaptive orthogonal frequency-division multiplexing (OFDM) index modulation (IM) scheme for two-hop relay networks. In contrast to the traditional OFDM IM scheme with a deterministic and fixed mapping scheme, in this proposed adaptive OFDM IM scheme, the mapping schemes between a bit stream and indices of active subcarriers for the first and second hops are adaptively selected by a certain criterion. As a result, the active subcarriers for the same bit stream in the first and second hops can be varied in order to combat slow frequency-selective fading. In this way, the system reliability can be enhanced. Additionally, considering the fact that a relay device is normally a simple node, which may not always be able to perform mapping scheme selection due to limited processing capability, we also propose an alternative adaptive methodology in which the mapping scheme selection is only performed at the source and the relay will simply utilize the selected mapping scheme without changing it. The analyses of average outage probability, network capacity and symbol error rate (SER) are given in closed form for decode-and-forward (DF) relaying networks and are substantiated by numerical results generated by Monte Carlo simulations.Comment: 30 page

    Blind channel estimation and signal retrieving for MIMO relay systems

    Get PDF
    In this paper, we propose a blind channel estimation and signal retrieving algorithm for two-hop multiple-input multiple-output (MIMO) relay systems. This new algorithm integrates two blind source separation (BSS) methods to estimate the individual channel state information (CSI) of the source-relay and relay-destination links. In particular, a first-order Z-domain precoding technique is developed for the blind estimation of the relay-destination channel matrix, where the signals received at the relay node are pre-processed by a set of precoders before being transmitted to the destination node. With the estimated signals at the relay node, we propose an algorithm based on the constant modulus and signal mutual information properties to estimate the source-relay channel matrix. Compared with training-based MIMO relay channel estimation approaches, the proposed algorithm has a better bandwidth efficiency as no bandwidth is wasted for sending the training sequences. Numerical examples are shown to demonstrate the performance of the proposed algorithm

    Training based channel estimation algorithms for dual hop MIMO OFDM relay systems

    Get PDF
    In this paper we consider minimum mean square error (MMSE) training based channel estimation for two-hop multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) relaying systems. The channel estimation process is divided into two main phases. The relay-destination channel is estimated in the ïŹrst phase and can be obtained using well known point-to-point MIMO OFDM estimation methods. In the second phase, the source-relay channel is estimated at the destination with the use of a known training sequence that is transmitted from the source and forwarded to the destination by a non-regenerative relay. To obtain an estimate of the source-relay channel, the source training sequence, relay precoder, and destination processor, require to be optimised. To solve this problem we derive an iterative algorithm that involves sequentially solving a number of convex optimisation problems to update the source, relay, and destination design variables. Since the iterative algorithm may be too computationally expensive for practical implementation we then derive simpliïŹed solutions that have reduced computational complexity. Simulation results demonstrate the effectiveness of the proposed algorithms

    Advances in Multi-User Scheduling and Turbo Equalization for Wireless MIMO Systems

    Get PDF
    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-
    • 

    corecore