66 research outputs found
Performance of direct-oversampling correlator-type receivers in chaos-based DS-CDMA systems over frequency non-selective fading channels
In this paper, we present a study on the performance of direct-oversampling correlator-type receivers in chaos-based direct-sequence code division multiple access systems over frequency non-selective fading channels. At the input, the received signal is sampled at a sampling rate higher than the chip rate. This oversampling step is used to precisely determine the delayed-signal components from multipath fading channels, which can be combined together by a correlator for the sake of increasing the SNR at its output. The main advantage of using direct-oversampling correlator-type receivers is not only their low energy consumption due to their simple structure, but also their ability to exploit the non-selective fading characteristic of multipath channels to improve the overall system performance in scenarios with limited data speeds and low energy requirements, such as low-rate wireless personal area networks. Mathematical models in discrete-time domain for the conventional transmitting side with multiple access operation, the generalized non-selective Rayleigh fading channel, and the proposed receiver are provided and described. A rough theoretical bit-error-rate (BER) expression is first derived by means of Gaussian approximation. We then define the main component in the expression and build its probability mass function through numerical computation. The final BER estimation is carried out by integrating the rough expression over possible discrete values of the PFM. In order to validate our findings, PC simulation is performed and simulated performance is compared with the corresponding estimated one. Obtained results show that the system performance get better with the increment of the number of paths in the channel.Peer ReviewedPostprint (author's final draft
Multi-stage Wireless Signal Identification for Blind Interception Receiver Design
Protection of critical wireless infrastructure from malicious attacks has become increasingly important in recent years, with the widespread deployment of various wireless technologies and dramatic growth in user populations. This brings substantial technical challenges to the interception receiver design to sense and identify various wireless signals using different transmission technologies. The key requirements for the receiver design include estimation of the signal parameters/features and classification of the modulation scheme. With the proper identification results, corresponding signal interception techniques can be developed, which can be further employed to enhance the network behaviour analysis and intrusion detection.
In detail, the initial stage of the blind interception receiver design is to identify the signal parameters. In the thesis, two low-complexity approaches are provided to realize the parameter estimation, which are based on iterative cyclostationary analysis and envelope spectrum estimation, respectively. With the estimated signal parameters, automatic modulation classification (AMC) is performed to automatically identify the modulation schemes of the transmitted signals. A novel approach is presented based on Gaussian Mixture Models (GMM) in Chapter 4. The approach is capable of mitigating the negative effect from multipath fading channel. To validate the proposed design, the performance is evaluated under an experimental propagation environment. The results show that the proposed design is capable of adapting blind parameter estimation, realize timing and frequency synchronization and classifying the modulation schemes with improved performances
Real-time Digital Signal Processing for Software-defined Optical Transmitters and Receivers
A software-defined optical Tx is designed and demonstrated generating signals with various formats and pulse-shapes in real-time. Special pulse-shapes such as OFDM or Nyquist signaling were utilized resulting in a highly efficient usage of the available fiber channel bandwidth. This was achieved by parallel data processing with high-end FPGAs. Furthermore, highly efficient Rx algorithms for carrier and timing recovery as well as for polarization demultiplexing were developed and investigated
Compensation of fibre impairments in coherent optical systems
Tese de mestrado integrado. Engenharia Electrotécnica e de Computadores. Faculdade de Engenharia. Universidade do Porto. 201
An Oversampling-based Correlator-type Receiver for DCSK Communication Systems Over Generalized Flat Rayleigh Fading Channels
This paper proposes an oversampling-based correlator-type receiver for Differential Chaos-shift Keying (DCSK) communication systems, which can exploit the flat-fading characteristic of multipath channels in order to improve the system performance. At the receiver, the incoming signal is sampled with a sampling rate higher than chip rate before feeding to a correlator. This oversampling step aims to specifically determine delayed-signal components from fading multipath channels, which can be combined together by the correlator in order to increase the ratio of signal-to-noise at its output. In particular, the performance of the proposed receiver is investigated by means of a generalized flat Rayleigh fading channel which has one primary path (i.e., the path having the shortest transmission period) and multiple secondary paths (i.e., the other remaining paths with delays). Mathematical models in discrete-time domain for the conventional transmitter, generalized channel, and proposed receiver are proposed and analyzed. The theoretical bit-error-rate (BER) expression is first derived and then distribution histogram for the ratio of variable bit energy to noise power spectral density is computed. The BER performance is finally estimated by integrating the BER expression over all possible values of the histogram. Numerical simulations with specific parameters are carried out and then simulated performances are shown in comparison to estimated ones. Obtained results point out that the system performance is significantly improved when the number of secondary paths increases
BASEBAND RADIO MODEM DESIGN USING GRAPHICS PROCESSING UNITS
A modern radio or wireless communications transceiver is programmed via
software and firmware to change its functionalities at the baseband. However, the
actual implementation of the radio circuits relies on dedicated hardware, and the
design and implementation of such devices are time consuming and challenging. Due
to the need for real-time operation, dedicated hardware is preferred in order to meet
stringent requirements on throughput and latency. With increasing need for higher
throughput and shorter latency, while supporting increasing bandwidth across a
fragmented spectrum, dedicated subsystems are developed in order to service individual
frequency bands and specifications. Such a dedicated-hardware-intensive
approach leads to high resource costs, including costs due to multiple instantiations
of mixers, filters, and samplers. Such increases in hardware requirements in turn
increases device size, power consumption, weight, and financial cost.
If it can meet the required real-time constraints, a more flexible and reconfigurable
design approach, such as a software-based solution, is often more desirable
over a dedicated hardware solution. However, significant challenges must be
overcome in order to meet constraints on throughput and latency while servicing
different frequency bands and bandwidths. Graphics processing unit (GPU) technology
provides a promising class of platforms for addressing these challenges. GPUs,
which were originally designed for rendering images and video sequences, have been
adapted as general purpose high-throughput computation engines for a wide variety
of application areas beyond their original target domains. Linear algebra and signal
processing acceleration are examples of such application areas.
In this thesis, we apply GPUs as software-based, baseband radios and demonstrate
novel, software-based implementations of key subsystems in modern wireless
transceivers. In our work, we develop novel implementation techniques that allow
communication system designers to use GPUs as accelerators for baseband processing
functions, including real-time filtering and signal transformations. More
specifically, we apply GPUs to accelerate several computationally-intensive, frontend
radio subsystems, including filtering, signal mixing, sample rate conversion,
and synchronization. These are critical subsystems that must operate in real-time
to reliably receive waveforms.
The contributions of this thesis can be broadly organized into 3 major areas:
(1) channelization, (2) arbitrary resampling, and (3) synchronization.
1. Channelization: a wideband signal is shared between different users and
channels, and a channelizer is used to separate the components of the shared signal
in the different channels. A channelizer is often used as a pre-processing step in
selecting a specific channel-of-interest. A typical channelization process involves signal
conversion, resampling, and filtering to reject adjacent channels. We investigate
GPU acceleration for a particularly efficient form of channelizer called a polyphase
filterbank channelizer, and demonstrate a real-time implementation of our novel
channelizer design.
2. Arbitrary resampling: following a channelization process, a signal is often
resampled to at least twice the data rate in order to further condition the signal.
Since different communication standards require different resampling ratios, it is
desirable for a resampling subsystem to support a variety of different ratios. We
investigate optimized, GPU-based methods for resampling using polyphase filter
structures that are mapped efficiently into GPU hardware. We investigate these
GPU implementation techniques in the context of interpolation (integer-factor increases
in sampling rate), decimation (integer-factor decreases in sampling rate),
and rational resampling. Finally, we demonstrate an efficient implementation of arbitrary
resampling using GPUs. This implementation exploits specialized hardware
units within the GPU to enable efficient and accurate resampling processes involving
arbitrary changes in sample rate.
3. Synchronization: incoming signals in a wireless communications transceiver
must be synchronized in order to recover the transmitted data properly from complex
channel effects such as thermal noise, fading, and multipath propagation. We investigate
timing recovery in GPUs to accelerate the most computationally intensive
part of the synchronization process, and correctly align the incoming data symbols
in the receiver. Furthermore, we implement fully-parallel timing error detection to
accelerate maximum likelihood estimation
Performance analysis of OFDM technology on radio-over-fiber systems
Dissertação de mest., Engenharia Eletrónica e Telecomunicações, Faculdade de Ciências e Tecnologia, Univ. do Algarve, 2011Nowadays, the demand for high speed, high quality and diversity in distributed services presents a challenge for telecommunication technology. Wireless systems provide the accessibility to end-user, but are not the solution for long distance links. Currently, the ideal technology for long-range transmissions at high data rates is optical fiber. Hence, a new concept for high capacity networks emerges, with centralized services into Base Stations (BS) engineered to provide flexibility and control over the system, and to perform operations such as electrical to optical domain conversion and modulation. Such Radio-over-Fiber (RoF) networks also appear as an attractive technology because they are efficient and cost effective.
Orthogonal Frequency Division Multiplexing (OFDM) technology is widely used in a number of standards. For instance, it is actually the Multi-Carrier Modulation (MCM) technique applied in 802.11a/g/n wireless standards and in Digital Video Broadcasting-Terrestrial (DVB-T), among other prevailing systems, which makes this subject one particularly pertinent to study. OFDM systems are an appealing choice for waveform modulation, as they are very bandwidth efficient comparing to others MCM, and provide flexibility in data transmission rates. Additionally, an important advantage dwells in its natural robustness against severely interfering environments.
In this thesis, fundamentals on OFDM technology are extensively described, and its application to wireless and optical fiber networks is introduced. The combined channel effects of these technologies on OFDM signals are investigated. In terms of performance analysis, this exposition focuses on understanding the importance of OFDM modulation parameters, and explores some OFDM signal properties. To achieve this, a simulator was implemented with Matlab to create arbitrary OFDM waveforms and emulate channel effects. This study also investigates the efficiency of OFDM technology over a real Radio Frequency (RF) system with an ideal communication channel. Finally, an experimental RoF configuration is implemented and its performance is assessed
Applications of Lattice Codes in Communication Systems
In the last decade, there has been an explosive growth in different applications of wireless technology, due to users' increasing expectations for multi-media services. With the current trend, the present systems will not be able to handle the required data traffic. Lattice codes have attracted considerable attention in recent years, because they provide high data rate constellations. In this thesis, the applications of implementing lattice codes in different communication systems are investigated. The thesis is divided into two major parts. Focus of the first part is on constellation shaping and the problem of lattice labeling. The second part is devoted to the lattice decoding problem.
In constellation shaping technique, conventional constellations are replaced by lattice codes that satisfy some geometrical properties. However, a simple algorithm, called lattice labeling, is required to map the input data to the lattice code points. In the first part of this thesis, the application of lattice codes for constellation shaping in Orthogonal Frequency Division Multiplexing (OFDM) and Multi-Input Multi-Output (MIMO) broadcast systems are considered. In an OFDM system a lattice code with low Peak to Average Power Ratio (PAPR) is desired. Here, a new lattice code with considerable PAPR reduction for OFDM systems is proposed. Due to the recursive structure of this lattice code, a simple lattice labeling method based on Smith normal decomposition of an integer matrix is obtained. A selective mapping method in conjunction with the proposed lattice code is also presented to further reduce the PAPR. MIMO broadcast systems are also considered in the thesis. In a multiple antenna broadcast system, the lattice labeling algorithm should be such that different users can decode their data independently. Moreover, the implemented lattice code should result in a low average transmit energy. Here, a selective mapping technique provides such a lattice code.
Lattice decoding is the focus of the second part of the thesis, which concerns the operation of finding the closest point of the lattice code to any point in N-dimensional real space. In digital communication applications, this problem is known as the integer least-square problem, which can be seen in many areas, e.g. the detection of symbols transmitted over the multiple antenna wireless channel, the multiuser detection problem in Code Division Multiple Access (CDMA) systems, and the simultaneous detection of multiple users in a Digital Subscriber Line (DSL) system affected by crosstalk. Here, an efficient lattice decoding algorithm based on using Semi-Definite Programming (SDP) is introduced. The proposed algorithm is capable of handling any form of lattice constellation for an arbitrary labeling of points. In the proposed methods, the distance minimization problem is expressed in terms of a binary quadratic minimization problem, which is solved by introducing several matrix and vector lifting SDP relaxation models. The new SDP models provide a wealth of trade-off between the complexity and the performance of the decoding problem
Linear Transmit-Receive Strategies for Multi-user MIMO Wireless Communications
Die Notwendigkeit zur Unterdrueckung von Interferenzen auf der einen Seite
und zur Ausnutzung der durch Mehrfachzugriffsverfahren erzielbaren Gewinne
auf der anderen Seite rueckte die raeumlichen Mehrfachzugriffsverfahren
(Space Division Multiple Access, SDMA) in den Fokus der Forschung. Ein
Vertreter der raeumlichen Mehrfachzugriffsverfahren, die lineare
Vorkodierung, fand aufgrund steigender Anzahl an Nutzern und Antennen in
heutigen und zukuenftigen Mobilkommunikationssystemen besondere Beachtung,
da diese Verfahren das Design von Algorithmen zur Vorcodierung
vereinfachen. Aus diesem Grund leistet diese Dissertation einen Beitrag zur
Entwicklung linearer Sende- und Empfangstechniken fuer MIMO-Technologie mit
mehreren Nutzern. Zunaechst stellen wir ein Framework zur Approximation des
Datendurchsatzes in Broadcast-MIMO-Kanaelen mit mehreren Nutzern vor. In
diesem Framework nehmen wir das lineare Vorkodierverfahren regularisierte
Blockdiagonalisierung (RBD) an. Durch den Vergleich von Dirty Paper Coding
(DPC) und linearen Vorkodieralgorithmen (z.B. Zero Forcing (ZF) und
Blockdiagonalisierung (BD)) ist es uns moeglich, untere und obere Schranken
fuer den Unterschied bezueglich Datenraten und bezueglich Leistung zwischen
beiden anzugeben. Im Weiteren entwickeln wir einen Algorithmus fuer
koordiniertes Beamforming (Coordinated Beamforming, CBF), dessen Loesung
sich in geschlossener Form angeben laesst. Dieser CBF-Algorithmus basiert
auf der SeDJoCo-Transformation und loest bisher vorhandene Probleme im
Bereich CBF. Im Anschluss schlagen wir einen iterativen CBF-Algorithmus
namens FlexCoBF (flexible coordinated beamforming) fuer
MIMO-Broadcast-Kanaele mit mehreren Nutzern vor. Im Vergleich mit bis dato
existierenden iterativen CBF-Algorithmen kann als vielversprechendster
Vorteil die freie Wahl der linearen Sende- und Empfangsstrategie
herausgestellt werden. Das heisst, jede existierende Methode der linearen
Vorkodierung kann als Sendestrategie genutzt werden, waehrend die Strategie
zum Empfangsbeamforming frei aus MRC oder MMSE gewaehlt werden darf. Im
Hinblick auf Szenarien, in denen Mobilfunkzellen in Clustern
zusammengefasst sind, erweitern wir FlexCoBF noch weiter. Hier wurde das
Konzept der koordinierten Mehrpunktverbindung (Coordinated Multipoint
(CoMP) transmission) integriert. Zuletzt stellen wir drei Moeglichkeiten
vor, Kanalzustandsinformationen (Channel State Information, CSI) unter
verschiedenen Kanalumstaenden zu erlangen. Die Qualitaet der
Kanalzustandsinformationen hat einen starken Einfluss auf die Guete des
Uebertragungssystems. Die durch unsere neuen Algorithmen erzielten
Verbesserungen haben wir mittels numerischer Simulationen von Summenraten
und Bitfehlerraten belegt.In order to combat interference and exploit large multiplexing gains of the
multi-antenna systems, a particular interest in spatial division multiple
access (SDMA) techniques has emerged. Linear precoding techniques, as one
of the SDMA strategies, have obtained more attention due to the fact that
an increasing number of users and antennas involved into the existing and
future mobile communication systems requires a simplification of the
precoding design. Therefore, this thesis contributes to the design of
linear transmit and receive strategies for multi-user MIMO broadcast
channels in a single cell and clustered multiple cells. First, we present a
throughput approximation framework for multi-user MIMO broadcast channels
employing regularized block diagonalization (RBD) linear precoding.
Comparing dirty paper coding (DPC) and linear precoding algorithms (e.g.,
zero forcing (ZF) and block diagonalization (BD)), we further quantify
lower and upper bounds of the rate and power offset between them as a
function of the system parameters such as the number of users and antennas.
Next, we develop a novel closed-form coordinated beamforming (CBF)
algorithm (i.e., SeDJoCo based closed-form CBF) to solve the existing open
problem of CBF. Our new algorithm can support a MIMO system with an
arbitrary number of users and transmit antennas. Moreover, the application
of our new algorithm is not only for CBF, but also for blind source
separation (BSS), since the same mathematical model has been used in BSS
application.Then, we further propose a new iterative CBF algorithm (i.e.,
flexible coordinated beamforming (FlexCoBF)) for multi-user MIMO broadcast
channels. Compared to the existing iterative CBF algorithms, the most
promising advantage of our new algorithm is that it provides freedom in the
choice of the linear transmit and receive beamforming strategies, i.e., any
existing linear precoding method can be chosen as the transmit strategy and
the receive beamforming strategy can be flexibly chosen from MRC or MMSE
receivers. Considering clustered multiple cell scenarios, we extend the
FlexCoBF algorithm further and introduce the concept of the coordinated
multipoint (CoMP) transmission. Finally, we present three strategies for
channel state information (CSI) acquisition regarding various channel
conditions and channel estimation strategies. The CSI knowledge is required
at the base station in order to implement SDMA techniques. The quality of
the obtained CSI heavily affects the system performance. The performance
enhancement achieved by our new strategies has been demonstrated by
numerical simulation results in terms of the system sum rate and the bit
error rate
- …