Coherent versus non-coherent decode-and-forward relaying aided cooperative space-time shift keying

Motivated by the recent concept of Space-Time Shift Keying (STSK), we propose a novel cooperative STSK family, which is capable of achieving a flexible rate-diversity tradeoff, in the context of cooperative space-time transmissions. More specifically, we first propose a Coherent cooperative STSK (CSTSK) scheme, where each Relay Node (RN) activates Decode-and-Forward (DF) transmissions, depending on the success or failure of Cyclic Redundancy Checking (CRC). We invoke a bitto- STSK mapping rule, where according to the input bits, one of the Q pre-assigned dispersion vectors is activated to implicitly convey log2(Q) bits, which are transmitted in combination with the classic log2(L)-bit modulated symbol. Additionally, we introduce a beneficial dispersion vector design, which enables us to dispense with symbol-level Inter-Relay Synchronization (IRS). Furthermore, the Destination Node (DN) is capable of jointly detecting the signals received from the source-destination and relay-destination links, using a low-complexity single-stream-based Maximum Likelihood (ML) detector, which is an explicit benefit of our Inter-Element Interference (IEI)-free system model. More importantly, as a benefit of its design flexibility, our cooperative CSTSK arrangement enables us to adapt the number of the RNs, the transmission rate as well as the achievable diversity order. Moreover, we also propose a Differentially-encoded cooperative STSK (DSTSK) arrangement, which dispenses with CSI estimation at any of the nodes, while retaining the fundamental benefits of the cooperative CSTSK scheme

Achievable Rate and Modulation for Bandlimited Channels with Oversampling and 1-Bit Quantization at the Receiver

Sustainably realizing applications of the future with high performance demands requires that energy efficiency becomes a central design criterion for the entire system. For example, the power consumption of the analog-to-digital converter (ADC) can become a major factor when transmitting at large bandwidths and carrier frequencies, e.g., for ultra-short range high data rate communication. The consumed energy per conversion step increases with the sampling rate such that high resolution ADCs become unfeasible in the sub-THz regime at the very high sampling rates required. This makes signaling schemes adapted to 1-bit quantizers a promising alternative. We therefore quantify the performance of bandlimited 1-bit quantized wireless communication channels using techniques like oversampling and faster-than-Nyquist (FTN) signaling to compensate for the loss of achievable rate. As a limiting case, we provide bounds on the mutual information rate of the hard bandlimited 1-bit quantized continuous-time – i.e., infinitely oversampled – additive white Gaussian noise channel in the mid-to-high signal-to-noise ratio (SNR) regime. We derive analytic expressions using runlength encoded input signals. For real signals the maximum value of the lower bound on the spectral efficiency in the high-SNR limit was found to be approximately 1.63 bit/s/Hz. Since in practical scenarios the oversampling ratio remains finite, we derive bounds on the achievable rate of the bandlimited oversampled discrete-time channel. These bounds match the results of the continuous-time channel remarkably well. We observe spectral efficiencies up to 1.53 bit/s/Hz in the high-SNR limit given hard bandlimitation. When excess bandwidth is tolerable, spectral efficiencies above 2 bit/s/Hz per domain are achievable w.r.t. the 95 %-power containment bandwidth. Applying the obtained bounds to a bandlimited oversampled 1-bit quantized multiple-input multiple-output channel, we show the benefits when using appropriate power allocation schemes. As a constant envelope modulation scheme, continuous phase modulation is considered in order to relieve linearity requirements on the power amplifier. Noise-free performance limits are investigated for phase shift keying (PSK) and continuous phase frequency shift keying (CPFSK) using higher-order modulation alphabets and intermediate frequencies. Adapted waveforms are designed that can be described as FTN-CPFSK. With the same spectral efficiency in the high-SNR limit as PSK and CPFSK, these waveforms provide a significantly improved bit error rate (BER) performance. The gain in SNR required for achieving a certain BER can be up to 20 dB.Die nachhaltige Realisierung von zukünftigen Übertragungssystemen mit hohen Leistungsanforderungen erfordert, dass die Energieeffizienz zu einem zentralen Designkriterium für das gesamte System wird. Zum Beispiel kann die Leistungsaufnahme des Analog-Digital-Wandlers (ADC) zu einem wichtigen Faktor bei der Übertragung mit großen Bandbreiten und Trägerfrequenzen werden, z. B. für die Kommunikation mit hohen Datenraten über sehr kurze Entfernungen. Die verbrauchte Energie des ADCs steigt mit der Abtastrate, so dass hochauflösende ADCs im Sub-THz-Bereich bei den erforderlichen sehr hohen Abtastraten schwer einsetzbar sind. Dies macht Signalisierungsschemata, die an 1-Bit-Quantisierer angepasst sind, zu einer vielversprechenden Alternative. Wir quantifizieren daher die Leistungsfähigkeit von bandbegrenzten 1-Bit-quantisierten drahtlosen Kommunikationssystemen, wobei Techniken wie Oversampling und Faster-than-Nyquist (FTN) Signalisierung eingesetzt werden, um den durch Quantisierung verursachten Verlust der erreichbaren Rate auszugleichen. Wir geben Grenzen für die Transinformationsrate des Extremfalls eines strikt bandbegrenzten 1-Bit quantisierten zeitkontinuierlichen – d.h. unendlich überabgetasteten – Kanals mit additivem weißen Gauß’schen Rauschen bei mittlerem bis hohem Signal-Rausch-Verhältnis (SNR) an. Wir leiten analytische Ausdrücke basierend auf lauflängencodierten Eingangssignalen ab. Für reelle Signale ist der maximale Wert der unteren Grenze der spektralen Effizienz im Hoch-SNR-Bereich etwa 1,63 Bit/s/Hz. Da die Überabtastrate in praktischen Szenarien endlich bleibt, geben wir Grenzen für die erreichbare Rate eines bandbegrenzten, überabgetasteten zeitdiskreten Kanals an. Diese Grenzen stimmen mit den Ergebnissen des zeitkontinuierlichen Kanals bemerkenswert gut überein. Im Hoch-SNR-Bereich sind spektrale Effizienzen bis zu 1,53 Bit/s/Hz bei strikter Bandbegrenzung möglich. Wenn Energieanteile außerhalb des Frequenzbandes tolerierbar sind, können spektrale Effizienzen über 2 Bit/s/Hz pro Domäne – bezogen auf die Bandbreite, die 95 % der Energie enthält – erreichbar sein. Durch die Anwendung der erhaltenen Grenzen auf einen bandbegrenzten überabgetasteten 1-Bit quantisierten Multiple-Input Multiple-Output-Kanal zeigen wir Vorteile durch die Verwendung geeigneter Leistungsverteilungsschemata. Als Modulationsverfahren mit konstanter Hüllkurve betrachten wir kontinuierliche Phasenmodulation, um die Anforderungen an die Linearität des Leistungsverstärkers zu verringern. Beschränkungen für die erreichbare Datenrate bei rauschfreier Übertragung auf Zwischenfrequenzen mit Modulationsalphabeten höherer Ordnung werden für Phase-shift keying (PSK) and Continuous-phase frequency-shift keying (CPFSK) untersucht. Weiterhin werden angepasste Signalformen entworfen, die als FTN-CPFSK beschrieben werden können. Mit der gleichen spektralen Effizienz im Hoch-SNR-Bereich wie PSK und CPFSK bieten diese Signalformen eine deutlich verbesserte Bitfehlerrate (BER). Die Verringerung des erforderlichen SNRs zur Erreichung einer bestimmten BER kann bis zu 20 dB betragen

Multiple timing offsets compensation in cooperative communication systems

Cooperative communication systems have attracted much attention recently due to their desirable performance gain while using single antenna terminals. However, most of the existin works on cooperative communications require perfect timing synchronization among users, which is usually not true in practical systems. In this paper, a general framework of the re-synchronization filter design is developed in order to com pensate the multiple timing offsets at the destination. The proposed method is applied to different scenarios with varying degrees of timing misalignment and is numerically shown to provide excellent performances that approach the perfectly synchronized case. © 2009 IEEE.published_or_final_versionThe 16th International Conference on Digital Signal Processing (DSP 2009), Santorini-Hellas, Greece, 5-7 July 2009. In Proceedings of 16th DSP, 2009, p. 1-

Timing estimation and resynchronization for amplify-and-forward communication systems

This paper proposes a general framework to effectively estimate the unknown timing and channel parameters, as well as design efficient timing resynchronization algorithms for asynchronous amplify-and-forward (AF) cooperative communication systems. In order to obtain reliable timing and channel parameters, a least squares (LS) estimator is proposed for initial estimation and an iterative maximum-likelihood (ML) estimator is derived to refine the LS estimates. Furthermore, a timing and channel uncertainty analysis based on the CramrRao bounds (CRB) is presented to provide insights into the system uncertainties resulted from estimation. Using the parameter estimates and uncertainty information in our analysis, timing resynchronization algorithms that are robust to estimation errors are designed jointly at the relays and the destination. The proposed framework is developed for different AF systems with varying degrees of timing misalignment and channel uncertainties and is numerically shown to provide excellent performances that approach the synchronized case with perfect channel information. © 2006 IEEE.published_or_final_versio

Timing synchronization in decode-and-forward cooperative communication systems

Cooperative communication systems have attracted much attention recently due to their desirable performance gain while using single antenna terminals. This paper addresses the joint timing and channel estimation problem, and furthermore the resynchronization of multiple timing offsets in a cooperative relay system. The estimations of timing and channel are conducted in two phases and the associated Cramér-Rao bounds (CRB) are derived for both phases. It is demonstrated that the conventional CRB is not valid for timing parameters under fading conditions, and a new bound called Weighted Bayesian CRB is proposed. With the timing and channel estimates, a general framework of the resynchronization filter design is developed in order to compensate the multiple timing offsets at the destination. The proposed methods are applied to different scenarios with varying degrees of timing misalignment and are numerically shown to provide excellent performances that approach the perfectly synchronized case. © 2009 IEEE.published_or_final_versio

Near-Instantaneously Adaptive HSDPA-Style OFDM Versus MC-CDMA Transceivers for WIFI, WIMAX, and Next-Generation Cellular Systems

Burts-by-burst (BbB) adaptive high-speed downlink packet access (HSDPA) style multicarrier systems are reviewed, identifying their most critical design aspects. These systems exhibit numerous attractive features, rendering them eminently eligible for employment in next-generation wireless systems. It is argued that BbB-adaptive or symbol-by-symbol adaptive orthogonal frequency division multiplex (OFDM) modems counteract the near instantaneous channel quality variations and hence attain an increased throughput or robustness in comparison to their fixed-mode counterparts. Although they act quite differently, various diversity techniques, such as Rake receivers and space-time block coding (STBC) are also capable of mitigating the channel quality variations in their effort to reduce the bit error ratio (BER), provided that the individual antenna elements experience independent fading. By contrast, in the presence of correlated fading imposed by shadowing or time-variant multiuser interference, the benefits of space-time coding erode and it is unrealistic to expect that a fixed-mode space-time coded system remains capable of maintaining a near-constant BER

Transmitter precoding for multi-antenna multi-user communications

Emerging wireless sensor networks and existing wireless cellular and ad hoc networks motivate the design of low-power receivers. Multi-user interference drastically reduces the energy efficiency of wireless multi-user communications by introducing errors in the bits being detected at the receiver. Interference rejection algorithms and multiple antenna techniques can significantly reduce the bit-error-rate at the receiver. Unfortunately, while interference rejection algorithms burden the receiver with heavy signal processing functionalities, thereby increasing the power consumption at the receiver, the small size of receivers, specifically in sensor networks and in downlink cellular communications, prohibits the use of multiple receive antennas. In a broadcast channel, where a central transmitter is transmitting independent streams to decentralized receivers, it is possible for the transmitter to have a priori knowledge of the interference. Multiple antennas can be used at the transmitter to enhance energy efficiency. In some systems, the transmitter has access to virtually an infinite source of power. A typical example would be the base station transmitter for the downlink of a cellular system. The power consumption at receivers can be reduced if some of the signal processing functionality of the receiver is moved to the transmitter.;In this thesis, we consider a wireless broadcast channel with a transmitter equipped with multiple antennas and having a priori knowledge of interference. Our objective is to minimize the receiver complexity by adding extra signal processing functions to the transmitter. We need to determine the optimal signal that should be transmitted so that interference is completely eliminated, and the benefits that can be obtained by using multiple transmit antennas can be maximized. We investigate the use of linear precoders, linear transformations made on the signal before transmission, for this purpose

Analysis and Ad-hoc Networking Solutions for Cooperative Relaying Systems

Users of mobile networks are increasingly demanding higher data rates from their service providers. To cater to this demand, various signal processing and networking algorithms have been proposed. Amongst them the multiple input multiple output (MIMO) scheme of wireless communications is one of the most promising options. However, due to certain physical restrictions, e.g., size, it is not possible for many devices to have multiple antennas on them. Also, most of the devices currently in use are single-antenna devices. Such devices can make use of the MIMO scheme by employing cooperative MIMO methods. This involves nearby nodes utilizing the antennas of each other to form virtual antenna arrays (VAAs). Nodes with limited communication ranges can further employ multi-hopping to be able to communicate with far away nodes. However, an ad-hoc communications scheme with cooperative MIMO multi-hopping can be challenging to implement because of its de-centralized nature and lack of a centralized controling entity such as a base-station. This thesis looks at methods to alleviate the problems faced by such networks.In the first part of this thesis, we look, analytically, at the relaying scheme under consideration and derive closed form expressions for certain performance measures (signal to noise ratio (SNR), symbol error rate (SER), bit error rate (BER), and capacity) for the co-located and cooperative multiple antenna schemes in different relaying configurations (amplify-and-forward and decode-and-forward) and different antenna configurations (single input single output (SISO), single input multiple output (SIMO) and MIMO). These expressions show the importance of reducing the number of hops in multi-hop communications to achieve a better performance. We can also see the impact of different antenna configurations and different transmit powers on the number of hops through these simplified expressions.We also look at the impact of synchronization errors on the cooperative MIMO communications scheme and derive a lower bound of the SINR and an expression for the BER in the high SNR regime. These expressions can help the network designers to ensure that the quality of service (QoS) is satisfied even in the worst-case scenarios. In the second part of the thesis we present some algorithms developed by us to help the set-up and functioning of cluster-based ad-hoc networks that employ cooperative relaying. We present a clustering algorithm that takes into account the battery status of nodes in order to ensure a longer network life-time. We also present a routing mechanism that is tailored for use in cooperative MIMO multi-hop relaying. The benefits of both schemes are shown through simulations.A method to handle data in ad-hoc networks using distributed hash tables (DHTs) is also presented. Moreover, we also present a physical layer security mechanism for multi-hop relaying. We also analyze the physical layer security mechanism for the cooperative MIMO scheme. This analysis shows that the cooperative MIMO scheme is more beneficial than co-located MIMO in terms of the information theoretic limits of the physical layer security.Nutzer mobiler Netzwerke fordern zunehmend höhere Datenraten von ihren Dienstleistern. Um diesem Bedarf gerecht zu werden, wurden verschiedene Signalverarbeitungsalgorithmen entwickelt. Dabei ist das "Multiple input multiple output" (MIMO)-Verfahren für die drahtlose Kommunikation eine der vielversprechendsten Techniken. Jedoch ist aufgrund bestimmter physikalischer Beschränkungen, wie zum Beispiel die Baugröße, die Verwendung von mehreren Antennen für viele Endgeräte nicht möglich. Dennoch können solche Ein-Antennen-Geräte durch den Einsatz kooperativer MIMO-Verfahren von den Vorteilen des MIMO-Prinzips profitieren. Dabei schließen sich naheliegende Knoten zusammen um ein sogenanntes virtuelles Antennen-Array zu bilden. Weiterhin können Knoten mit beschränktem Kommunikationsbereich durch mehrere Hops mit weiter entfernten Knoten kommunizieren. Allerdings stellt der Aufbau eines solchen Ad-hoc-Netzwerks mit kooperativen MIMO-Fähigkeiten aufgrund der dezentralen Natur und das Fehlen einer zentral-steuernden Einheit, wie einer Basisstation, eine große Herausforderung dar. Diese Arbeit befasst sich mit den Problemstellungen dieser Netzwerke und bietet verschiedene Lösungsansätze.Im ersten Teil dieser Arbeit werden analytisch in sich geschlossene Ausdrücke für ein kooperatives Relaying-System bezüglicher verschiedener Metriken, wie das Signal-Rausch-Verhältnis, die Symbolfehlerrate, die Bitfehlerrate und die Kapazität, hergeleitet. Dabei werden die "Amplify-and forward" und "Decode-and-forward" Relaying-Protokolle, sowie unterschiedliche Mehrantennen-Konfigurationen, wie "Single input single output" (SISO), "Single input multiple output" (SIMO) und MIMO betrachtet. Diese Ausdrücke zeigen die Bedeutung der Reduzierung der Hop-Anzahl in Mehr-Hop-Systemen, um eine höhere Leistung zu erzielen. Zudem werden die Auswirkungen verschiedener Antennen-Konfigurationen und Sendeleistungen auf die Anzahl der Hops analysiert.  Weiterhin wird der Einfluss von Synchronisationsfehlern auf das kooperative MIMO-Verfahren herausgestellt und daraus eine untere Grenze für das Signal-zu-Interferenz-und-Rausch-Verhältnis, sowie ein Ausdruck für die Bitfehlerrate bei hohem Signal-Rausch-Verhältnis entwickelt. Diese Zusammenhänge sollen Netzwerk-Designern helfen die Qualität des Services auch in den Worst-Case-Szenarien sicherzustellen. Im zweiten Teil der Arbeit werden einige innovative Algorithmen vorgestellt, die die Einrichtung und die Funktionsweise von Cluster-basierten Ad-hoc-Netzwerken, die kooperative Relays verwenden, erleichtern und verbessern. Darunter befinden sich ein Clustering-Algorithmus, der den Batteriestatus der Knoten berücksichtigt, um eine längere Lebensdauer des Netzwerks zu gewährleisten und ein Routing-Mechanismus, der auf den Einsatz in kooperativen MIMO Mehr-Hop-Systemen zugeschnitten ist. Die Vorteile beider Algorithmen werden durch Simulationen veranschaulicht. Eine Methode, die Daten in Ad-hoc-Netzwerken mit verteilten Hash-Tabellen behandelt wird ebenfalls vorgestellt. Darüber hinaus wird auch ein Sicherheitsmechanismus für die physikalische Schicht in Multi-Hop-Systemen und kooperativen MIMO-Systemen präsentiert. Eine Analyse zeigt, dass das kooperative MIMO-Verfahren deutliche Vorteile gegenüber dem konventionellen MIMO-Verfahren hinsichtlich der informationstheoretischen Grenzen der Sicherheit auf der physikalischen Schicht aufweist

Estimation and Calibration Algorithms for Distributed Sampling Systems

Thesis Supervisor: Gregory W. Wornell Title: Professor of Electrical Engineering and Computer ScienceTraditionally, the sampling of a signal is performed using a single component such as an analog-to-digital converter. However, many new technologies are motivating the use of multiple sampling components to capture a signal. In some cases such as sensor networks, multiple components are naturally found in the physical layout; while in other cases like time-interleaved analog-to-digital converters, additional components are added to increase the sampling rate. Although distributing the sampling load across multiple channels can provide large benefits in terms of speed, power, and resolution, a variety mismatch errors arise that require calibration in order to prevent a degradation in system performance. In this thesis, we develop low-complexity, blind algorithms for the calibration of distributed sampling systems. In particular, we focus on recovery from timing skews that cause deviations from uniform timing. Methods for bandlimited input reconstruction from nonuniform recurrent samples are presented for both the small-mismatch and the low-SNR domains. Alternate iterative reconstruction methods are developed to give insight into the geometry of the problem. From these reconstruction methods, we develop time-skew estimation algorithms that have high performance and low complexity even for large numbers of components. We also extend these algorithms to compensate for gain mismatch between sampling components. To understand the feasibility of implementation, analysis is also presented for a sequential implementation of the estimation algorithm. In distributed sampling systems, the minimum input reconstruction error is dependent upon the number of sampling components as well as the sample times of the components. We develop bounds on the expected reconstruction error when the time-skews are distributed uniformly. Performance is compared to systems where input measurements are made via projections onto random bases, an alternative to the sinc basis of time-domain sampling. From these results, we provide a framework on which to compare the effectiveness of any calibration algorithm. Finally, we address the topic of extreme oversampling, which pertains to systems with large amounts of oversampling due to redundant sampling components. Calibration algorithms are developed for ordering the components and for estimating the input from ordered components. The algorithms exploit the extra samples in the system to increase estimation performance and decrease computational complexity

MIMO-OFDM communication systems: channel estimation and wireless location

In this new information age, high data rate and strong reliability features our wireless communication systems and is becoming the dominant factor for a successful deployment of commercial networks. MIMO-OFDM (multiple input multiple output-orthogonal frequency division multiplexing), a new wireless broadband technology, has gained great popularity for its capability of high rate transmission and its robustness against multi-path fading and other channel impairments. A major challenge to MIMO-OFDM systems is how to obtain the channel state information accurately and promptly for coherent detection of information symbols and channel synchronization. In the first part, this dissertation formulates the channel estimation problem for MIMO-OFDM systems and proposes a pilot-tone based estimation algorithm. A complex equivalent base-band MIMO-OFDM signal model is presented by matrix representation. By choosing equally-spaced and equally-powered pilot tones from sub-carriers in one OFDM symbol, a down-sampled version of the original signal model is obtained. Furthermore, this signal model is transformed into a linear form solvable for the LS (least-square) estimation algorithm. Based on the resultant model, a simple pilot-tone design is proposed in the form of a unitary matrix, whose rows stand for different pilot-tone sets in the frequency domain and whose columns represent distinct transmit antennas in the spatial domain. From the analysis and synthesis of the pilot-tone design in this dissertation, our estimation algorithm can reduce the computational complexity inherited in MIMO systems by the fact that the pilot-tone matrix is essentially a unitary matrix, and is proven an optimal channel estimator in the sense of achieving the minimum MSE (mean squared error) of channel estimation for a fixed power of pilot tones. In the second part, this dissertation addresses the wireless location problem in WiMax (worldwide interoperability for microwave access) networks, which is mainly based on the MIMO-OFDM technology. From the measurement data of TDOA (time difference of arrival), AOA (angle of arrival) or a combination of those two, a quasi-linear form is formulated for an LS-type solution. It is assumed that the observation data is corrupted by a zero-mean AWGN (additive white Gaussian noise) with a very small variance. Under this assumption, the noise term in the quasi-liner form is proved to hold a normal distribution approximately. Hence the ML (maximum-likelihood) estimation and the LS-type solution are equivalent. But the ML estimation technique is not feasible here due to its computational complexity and the possible nonexistence of the optimal solution. Our proposed method is capable of estimating the MS location very accurately with a much less amount of computations. A final result of the MS (mobile station) location estimation, however, cannot be obtained directly from the LS-type solution without bringing in another independent constraint. To solve this problem, the Lagrange multiplier is explored to find the optimal solution to the constrained LS-type optimization problem