263 research outputs found
On the Performance Analysis of Cooperative Vehicular Communication
Vehicular networking is envisioned to be a key technology area for significant growth in the coming years. Although the expectations for this emerging technology are set very high, many practical aspects remain still unsolved for a vast deployment of vehicular networks. This dissertation addresses the enabling physical layer techniques to meet the challenges in vehicular networks operating in mobile wireless environments. Considering the infrastructure-less nature of vehicular networks, we envision cooperative diversity well positioned to meet the demanding requirements of vehicular networks with their underlying
distributed structure.
Cooperative diversity has been proposed as a powerful means to enhance the performance of high-rate communications over wireless fading channels. It realizes spatial diversity advantages in a distributed manner where a node uses others antennas to relay its message creating a virtual antenna array. Although cooperative diversity has garnered much attention recently, it has not yet been fully explored in the context of vehicular networks considering the unique characteristics of vehicular networks, this dissertation provides an error performance analysis study of cooperative transmission schemes for various deployment and traffic scenarios.
In the first part of this dissertation, we investigate the performance of a cooperative vehicle-to-vehicle (V2V) system with amplify-and-forward relaying for typical traffic scenarios under city/urban settings and a highway area. We derive pairwise error probability (PEP) expressions and demonstrate the achievable diversity gains. The effect of imperfect channel state information (CSI) is also studied through an asymptotical PEP analysis. We present Monte-Carlo simulations to confirm the analytical derivations and present the error rate performance of the vehicular scheme with perfect and imperfect-CSI.
In the second part, we consider road-to-vehicle (R2V) communications in which roadside access points use cooperating vehicles as relaying terminals. Under the assumption of decode-and-forward relaying, we derive PEP expressions for single-relay and multi-relay scenarios.
In the third part, we consider a cooperative multi-hop V2V system in which direct transmission is not possible and investigate its performance through the PEP derivation
and diversity gain analysis. Monte-Carlo simulations are further provided to con firm the analytical derivations and provide insight into the error rate performance improvement
Channel estimation and parameters acquisition systems employing cooperative diversity
Doutoramento em Engenharia Eletrotécnica e TelecomunicaçõesThis work investigates new channel estimation schemes for the forthcoming and future generation of cellular systems for which cooperative techniques are regarded.
The studied cooperative systems are designed to re-transmit the received information to the user terminal via the relay nodes, in order to make use of benefits such as high throughput, fairness in access and extra coverage.
The cooperative scenarios rely on OFDM-based systems employing classical and pilot-based channel estimators, which were originally designed to pointto-point links.
The analytical studies consider two relaying protocols, namely, the Amplifyand-Forward and the Equalise-and-Forward, both for the downlink case.
The relaying channels statistics show that such channels entail specific characteristics that comply to a proper filter and equalisation designs.
Therefore, adjustments in the estimation process are needed in order to obtain the relay channel estimates, refine these initial estimates via iterative processing and obtain others system parameters that are required in the
equalisation.
The system performance is evaluated considering standardised specifications and the International Telecommunication Union multipath channel models.Este trabalho tem por objetivo o estudo de novos esquemas de estimação de canal para sistemas de comunicação móvel das próximas gerações, para os quais técnicas cooperativa são consideradas.
Os sistemas cooperativos investigados neste trabalho estão projetados para fazerem uso de terminais adicionais a fim de retransmitir a informação recebida para o utilizador final. Desta forma, pode-se usurfruir de benefícios relacionados às comunicações cooperativas tais como o aumento do rendimento do sistema, fiabilidade e extra cobertura. Os cenários são basedos em sistemas OFDM que empregam estimadores de canal que fazem
uso de sinais piloto e que originalmente foram projetados para ligações ponto a ponto.
Os estudos analíticos consideram dois protocolos de encaminhamento, nomeadamente, Amplify-and-Forward e Equalise-and-Forward, ambos para o caso downlink. As estatísticas dos canais em estudo mostram que tais canais
ocasionam características específicas para as quais o filtro do estimador e a equalisação devem ser apropridamente projetados. Estas características requerem ajustes que são necessários no processo de estimação a fim
de estimar os canais, refinar as estimativas iniciais através de processos iterativos e ainda obter outros parâmetros do sistema que são necessários na equalização.
O desempenho dos esquemas propostos são avaliados tendo em consideração especificações padronizadas e modelos de canal descritos na International Telecommunication Union
Advanced Algebraic Concepts for Efficient Multi-Channel Signal Processing
Unsere moderne Gesellschaft ist Zeuge eines fundamentalen Wandels in der Art und Weise
wie wir mit Technologie interagieren. Geräte werden zunehmend intelligenter - sie verfügen
über mehr und mehr Rechenleistung und häufiger über eigene Kommunikationsschnittstellen.
Das beginnt bei einfachen Haushaltsgeräten und reicht über Transportmittel bis zu großen
überregionalen Systemen wie etwa dem Stromnetz. Die Erfassung, die Verarbeitung und der
Austausch digitaler Informationen gewinnt daher immer mehr an Bedeutung. Die Tatsache,
dass ein wachsender Anteil der Geräte heutzutage mobil und deshalb batteriebetrieben ist,
begründet den Anspruch, digitale Signalverarbeitungsalgorithmen besonders effizient zu gestalten.
Dies kommt auch dem Wunsch nach einer Echtzeitverarbeitung der großen anfallenden
Datenmengen zugute.
Die vorliegende Arbeit demonstriert Methoden zum Finden effizienter algebraischer Lösungen
für eine Vielzahl von Anwendungen mehrkanaliger digitaler Signalverarbeitung. Solche Ansätze
liefern nicht immer unbedingt die bestmögliche Lösung, kommen dieser jedoch häufig recht
nahe und sind gleichzeitig bedeutend einfacher zu beschreiben und umzusetzen. Die einfache
Beschreibungsform ermöglicht eine tiefgehende Analyse ihrer Leistungsfähigkeit, was für den
Entwurf eines robusten und zuverlässigen Systems unabdingbar ist. Die Tatsache, dass sie nur
gebräuchliche algebraische Hilfsmittel benötigen, erlaubt ihre direkte und zügige Umsetzung
und den Test unter realen Bedingungen.
Diese Grundidee wird anhand von drei verschiedenen Anwendungsgebieten demonstriert.
Zunächst wird ein semi-algebraisches Framework zur Berechnung der kanonisch polyadischen
(CP) Zerlegung mehrdimensionaler Signale vorgestellt. Dabei handelt es sich um ein sehr
grundlegendes Werkzeug der multilinearen Algebra mit einem breiten Anwendungsspektrum
von Mobilkommunikation über Chemie bis zur Bildverarbeitung. Verglichen mit existierenden
iterativen Lösungsverfahren bietet das neue Framework die Möglichkeit, den Rechenaufwand
und damit die Güte der erzielten Lösung zu steuern. Es ist außerdem weniger anfällig gegen eine
schlechte Konditionierung der Ausgangsdaten. Das zweite Gebiet, das in der Arbeit besprochen
wird, ist die unterraumbasierte hochauflösende Parameterschätzung für mehrdimensionale Signale,
mit Anwendungsgebieten im RADAR, der Modellierung von Wellenausbreitung, oder
bildgebenden Verfahren in der Medizin. Es wird gezeigt, dass sich derartige mehrdimensionale
Signale mit Tensoren darstellen lassen. Dies erlaubt eine natürlichere Beschreibung und eine
bessere Ausnutzung ihrer Struktur als das mit Matrizen möglich ist. Basierend auf dieser Idee
entwickeln wir eine tensor-basierte Schätzung des Signalraums, welche genutzt werden kann
um beliebige existierende Matrix-basierte Verfahren zu verbessern. Dies wird im Anschluss
exemplarisch am Beispiel der ESPRIT-artigen Verfahren gezeigt, für die verbesserte Versionen
vorgeschlagen werden, die die mehrdimensionale Struktur der Daten (Tensor-ESPRIT),
nichzirkuläre Quellsymbole (NC ESPRIT), sowie beides gleichzeitig (NC Tensor-ESPRIT) ausnutzen.
Um die endgültige Schätzgenauigkeit objektiv einschätzen zu können wird dann ein
Framework für die analytische Beschreibung der Leistungsfähigkeit beliebiger ESPRIT-artiger
Algorithmen diskutiert. Verglichen mit existierenden analytischen Ausdrücken ist unser Ansatz
allgemeiner, da keine Annahmen über die statistische Verteilung von Nutzsignal und
Rauschen benötigt werden und die Anzahl der zur Verfügung stehenden Schnappschüsse beliebig
klein sein kann. Dies führt auf vereinfachte Ausdrücke für den mittleren quadratischen
Schätzfehler, die Schlussfolgerungen über die Effizienz der Verfahren unter verschiedenen Bedingungen
zulassen. Das dritte Anwendungsgebiet ist der bidirektionale Datenaustausch mit
Hilfe von Relay-Stationen. Insbesondere liegt hier der Fokus auf Zwei-Wege-Relaying mit Hilfe
von Amplify-and-Forward-Relays mit mehreren Antennen, da dieser Ansatz ein besonders gutes
Kosten-Nutzen-Verhältnis verspricht. Es wird gezeigt, dass sich die nötige Kanalkenntnis
mit einem einfachen algebraischen Tensor-basierten Schätzverfahren gewinnen lässt. Außerdem
werden Verfahren zum Finden einer günstigen Relay-Verstärkungs-Strategie diskutiert. Bestehende
Ansätze basieren entweder auf komplexen numerischen Optimierungsverfahren oder auf
Ad-Hoc-Ansätzen die keine zufriedenstellende Bitfehlerrate oder Summenrate liefern. Deshalb
schlagen wir algebraische Ansätze zum Finden der Relayverstärkungsmatrix vor, die von relevanten
Systemmetriken inspiriert sind und doch einfach zu berechnen sind. Wir zeigen das
algebraische ANOMAX-Verfahren zum Erreichen einer niedrigen Bitfehlerrate und seine Modifikation
RR-ANOMAX zum Erreichen einer hohen Summenrate. Für den Spezialfall, in dem
die Endgeräte nur eine Antenne verwenden, leiten wir eine semi-algebraische Lösung zum
Finden der Summenraten-optimalen Strategie (RAGES) her. Anhand von numerischen Simulationen
wird die Leistungsfähigkeit dieser Verfahren bezüglich Bitfehlerrate und erreichbarer
Datenrate bewertet und ihre Effektivität gezeigt.Modern society is undergoing a fundamental change in the way we interact with technology.
More and more devices are becoming "smart" by gaining advanced computation capabilities
and communication interfaces, from household appliances over transportation systems to large-scale
networks like the power grid. Recording, processing, and exchanging digital information
is thus becoming increasingly important. As a growing share of devices is nowadays mobile
and hence battery-powered, a particular interest in efficient digital signal processing techniques
emerges.
This thesis contributes to this goal by demonstrating methods for finding efficient algebraic
solutions to various applications of multi-channel digital signal processing. These may not
always result in the best possible system performance. However, they often come close while
being significantly simpler to describe and to implement. The simpler description facilitates a
thorough analysis of their performance which is crucial to design robust and reliable systems.
The fact that they rely on standard algebraic methods only allows their rapid implementation
and test under real-world conditions.
We demonstrate this concept in three different application areas. First, we present a semi-algebraic
framework to compute the Canonical Polyadic (CP) decompositions of multidimensional
signals, a very fundamental tool in multilinear algebra with applications ranging from
chemistry over communications to image compression. Compared to state-of-the art iterative
solutions, our framework offers a flexible control of the complexity-accuracy trade-off and
is less sensitive to badly conditioned data. The second application area is multidimensional
subspace-based high-resolution parameter estimation with applications in RADAR, wave propagation
modeling, or biomedical imaging. We demonstrate that multidimensional signals can
be represented by tensors, providing a convenient description and allowing to exploit the
multidimensional structure in a better way than using matrices only. Based on this idea,
we introduce the tensor-based subspace estimate which can be applied to enhance existing
matrix-based parameter estimation schemes significantly. We demonstrate the enhancements
by choosing the family of ESPRIT-type algorithms as an example and introducing enhanced
versions that exploit the multidimensional structure (Tensor-ESPRIT), non-circular source
amplitudes (NC ESPRIT), and both jointly (NC Tensor-ESPRIT). To objectively judge the
resulting estimation accuracy, we derive a framework for the analytical performance assessment
of arbitrary ESPRIT-type algorithms by virtue of an asymptotical first order perturbation
expansion. Our results are more general than existing analytical results since we do not need
any assumptions about the distribution of the desired signal and the noise and we do not
require the number of samples to be large. At the end, we obtain simplified expressions for the
mean square estimation error that provide insights into efficiency of the methods under various
conditions. The third application area is bidirectional relay-assisted communications. Due to
its particularly low complexity and its efficient use of the radio resources we choose two-way
relaying with a MIMO amplify and forward relay. We demonstrate that the required channel
knowledge can be obtained by a simple algebraic tensor-based channel estimation scheme. We
also discuss the design of the relay amplification matrix in such a setting. Existing approaches
are either based on complicated numerical optimization procedures or on ad-hoc solutions
that to not perform well in terms of the bit error rate or the sum-rate. Therefore, we propose
algebraic solutions that are inspired by these performance metrics and therefore perform well
while being easy to compute. For the MIMO case, we introduce the algebraic norm maximizing
(ANOMAX) scheme, which achieves a very low bit error rate, and its extension Rank-Restored
ANOMAX (RR-ANOMAX) that achieves a sum-rate close to an upper bound. Moreover, for
the special case of single antenna terminals we derive the semi-algebraic RAGES scheme which
finds the sum-rate optimal relay amplification matrix based on generalized eigenvectors. Numerical
simulations evaluate the resulting system performance in terms of bit error rate and
system sum rate which demonstrates the effectiveness of the proposed algebraic solutions
Estimation de canal à évanouissements plats dans les transmissions sans fils à relais multibonds
This thesis deals with the estimation of the multihop Amplify-and-Forward relay communications. The various objects (transmitter, relays, receivers) can be fixed or mobile. Each link is modeled by a flat fading Rayleigh channel, with a Doppler spectrum resulting from twodimensional (2D, leading to the U-shape Dopller spectrum) or three-dimensional (3D, leading to a flat Doppler spectrum) scattering environments. The cascade of channel hops is approximated by a first-order autoregressive (AR(1)) model and is tracked by a standard estimation algorithm, the Kalman Filter (KF). The common method used in the literature to tune the parameter of the AR(1) model is based on a Correlation Matching (CM) criterion. However, for slow fading variations, another criterion based on the off-line Minimization of the Asymptotic Variance (MAV) of the KF is shown to be more appropriate. For both the CM and MAV criteria, this thesis gives analytic justification by providing approximated closed-form expressions of the estimation variance in output of the Kalman filter, and of the optimal AR(1) parameter. The analytical results are calculated for given Doppler frequencies and Signal-to-Noise Ratio for both scattering environments, whatever the number and type of transmission hops (Fixed-to-Mobile or Mobile-to-Mobile). The simulation results show a considerable gain in terms of the Mean Square Error (MSE) of the well tuned Kalman-based channel estimator, especially for the most common scenario of slow-fading channel.Cette thèse traite de l’estimation d’un canal de communication radio-mobile multibond. La communication entre l’émetteur et le récepteur est ainsi faite par l’intermédiaire de relais (de type « Amplify and-Forward ») en série. Les différents éléments (émetteurs, relais, récepteurs) peuvent être fixes ou mobiles. Chaque lien de communication (chaque bond) est modélisé par un canal de Rayleigh à évanouissements plats, avec un spectre Doppler issu de deuxenvironnements possibles de diffusion : en deux dimensions (2D, amenant le spectre en U de Jakes), ou en trois dimensions (3D, amenant un spectre Doppler plat). L’objectif majeur de la thèse est l’estimation dynamique du canal global issue de la cascade des différents liens. A cette fin, la cascade de canaux est approchée par une modèle auto-régressif du premier ordre (AR(1)), et l’estimation est réalisée à l’aide d’un algorithme standard, le filtre de Kalman. La méthode couramment utilisée dans la littérature pour fixer le paramètre du modèle AR(1) est basée sur un critère de « corrélation matching » (CM). Cependant, nous montrons que pour des canaux à variations lentes, un autre critère basé sur la minimisation de la variance asymptotique (MAV) de la sortie du filtre de Kalman est plus approprié. Pour les deux critères, CM et MAV, cette thèse donne une justification analytique en fournissant des formules approchées de la variance d’estimation par le filtre de Kalman, ainsi que du réglage optimal du paramètre du modèle AR(1). Ces formules analytiques sont données en fonctions des fréquences Doppler et du rapport signal sur bruit, pour les environnements de diffusion 2D et 3D, quel que soit le nombre et le type de bonds (fixe-mobile ou mobile-mobile). Les résultats de simulations montrent un gain considérable en termes de l’erreur quadratique moyenne (MSE) de l’estimateur de canal bien réglé, en particulier pour le scénario le plus courant de canal à évanouissements lents
マクロセルにオーバーレイするスモールセルのための層間干渉低減に関する研究
The huge number of mobile terminals in use and the radio frequency scarceness are the relevant issues for future wireless communications. Frequency sharing has been considered to solve the problem. Addressing the issues has led to a wide adoption of small cell networks particularly femtocells overlaid onto macrocell or small cells implemented with the support of distributed antenna systems (DASs). Small cell networks improve link quality and frequency reuse. Spectrum sharing improves the usage efficiency of the licensed spectrum. A macrocell underlaid with femtocells constitutes a typical two-tier network for improving spectral efficiency and indoor coverage in a spectrum sharing environment. Considering the end-user access control over the small cell base station (SBS), with shared usage of the macrocell’s spectrum, this dissertation contribution is an investigation of mitigation techniques of crosstier interference. Such cross-tier interference mitigation leads to possible implementation of multi-tier and heterogeneous networks. The above arguments underpin our work which is presented in the hereby dissertation. The contributions in this thesis are three-fold. Our first contribution is an interference cancellation scheme based on the transmitter symbols fed back to the femtocell base station (FBS) undergoing harmful cross-tier interference. We propose a cross-tier interference management between the FBS and the macrocell base station (MBS) in uplink communications. Our proposal uses the network infrastructure for interference cancellation at the FBS. Besides, we profit from terminal discovery to derive the interference level from the femtocell to the macrocell. Thus, additionally, we propose an interference avoidance method based on power control without cooperation from the MBS. In our second contribution, we dismiss the use of the MBS for symbol feedback due to delay issues. In a multi-tier cellular communication system, the interference from one tier to another, denoted as cross-tier interference, is a limiting factor for the system performance. In spectrum-sharing usage, we consider the uplink cross-tier interference management of heterogeneous networks using femtocells overlaid onto the macrocell. We propose a variation of the cellular architecture and introduce a novel femtocell clustering based on interference cancellation to enhance the sum rate capacity. Our proposal is to use a DAS as an interface to mitigate the cross-tier interference between the macrocell and femtocell tiers. In addition, the DAS can forward the recovered data to the macrocell base station (MBS); thus, the macrocell user can reduce its transmit power to reach a remote antenna unit (RAU) located closer than the MBS. By distributing the RAUs within the macrocell coverage, the proposed scheme can mitigate the cross-tier interference at different locations for several femtocell clusters. Finally, we address the issue of cross-tier interference mitigation in heterogeneous cognitive small cell networks comparing equal and unequal signal-to-noise ratio (SNR) branches in multi-input multi-output (MIMO) Alamouti scheme. Small cell networks enhance spectrum efficiency by handling the indoor traffic of mobile networks on a frequency-reuse operation. Because most of the current mobile traffic happens indoor, we introduce a prioritization shift by imposing a threshold on the outage generated by the outdoor mobile system to the indoor small cells. New closed-form expressions are derived to validate the proposed bit error rate (BER) function used in our optimization algorithm. We propose a joint transmit antenna selection and power allocation which minimizes the proposed BER function of the outdoor mobile terminal. The optimization is constrained by the outage at the small cell located near the cooperating transmit relays. Such constraint improves the initialization of the iterative algorithm compared to randomly choosing initial points. The proposed optimization yields a dynamic selection of the relays with power control pertaining to the outdoor mobile terminal performance.電気通信大学201
Recommended from our members
Adaptive Coded Modulation Classification and Spectrum Sensing for Cognitive Radio Systems. Adaptive Coded Modulation Techniques for Cognitive Radio Using Kalman Filter and Interacting Multiple Model Methods
The current and future trends of modern wireless communication systems place heavy demands on fast data transmissions in order to satisfy end users’ requirements anytime, anywhere. Such demands are obvious in recent applications such as smart phones, long term evolution (LTE), 4 & 5 Generations (4G & 5G), and worldwide interoperability for microwave access (WiMAX) platforms, where robust coding and modulations are essential especially in streaming on-line video material, social media and gaming. This eventually resulted in extreme exhaustion imposed on the frequency spectrum as a rare natural resource due to stagnation in current spectrum management policies. Since its advent in the late 1990s, cognitive radio (CR) has been conceived as an enabling technology aiming at the efficient utilisation of frequency spectrum that can lead to potential direct spectrum access (DSA) management. This is mainly attributed to its internal capabilities inherited from the concept of software defined radio (SDR) to sniff its surroundings, learn and adapt its operational parameters accordingly. CR systems (CRs) may commonly comprise one or all of the following core engines that characterise their architectures; namely, adaptive coded modulation (ACM), automatic modulation classification (AMC) and spectrum sensing (SS).
Motivated by the above challenges, this programme of research is primarily aimed at the design and development of new paradigms to help improve the adaptability of CRs and thereby achieve the desirable signal processing tasks at the physical layer of the above core engines. Approximate modelling of Rayleigh and finite state Markov channels (FSMC) with a new concept borrowed from econometric studies have been approached. Then insightful channel estimation by using Kalman filter (KF) augmented with interacting multiple model (IMM) has been examined for the purpose of robust adaptability, which is applied for the first time in wireless communication systems. Such new IMM-KF combination has been facilitated in the feedback channel between wireless transmitter and receiver to adjust the transmitted power, by using a water-filling (WF) technique, and constellation pattern and rate in the ACM algorithm. The AMC has also benefited from such IMM-KF integration to boost the performance against conventional parametric estimation methods such as maximum likelihood estimate (MLE) for channel interrogation and the estimated parameters of both inserted into the ML classification algorithm. Expectation-maximisation (EM) has been applied to examine unknown transmitted modulation sequences and channel parameters in tandem. Finally, the non-parametric multitaper method (MTM) has been thoroughly examined for spectrum estimation (SE) and SS, by relying on Neyman-Pearson (NP) detection principle for hypothesis test, to allow licensed primary users (PUs) to coexist with opportunistic unlicensed secondary users (SUs) in the same frequency bands of interest without harmful effects. The performance of the above newly suggested paradigms have been simulated and assessed under various transmission settings and revealed substantial improvements
Recent Advances in Steganography
Steganography is the art and science of communicating which hides the existence of the communication. Steganographic technologies are an important part of the future of Internet security and privacy on open systems such as the Internet. This book's focus is on a relatively new field of study in Steganography and it takes a look at this technology by introducing the readers various concepts of Steganography and Steganalysis. The book has a brief history of steganography and it surveys steganalysis methods considering their modeling techniques. Some new steganography techniques for hiding secret data in images are presented. Furthermore, steganography in speeches is reviewed, and a new approach for hiding data in speeches is introduced
- …