Recently, there has been a growing interest in improving the performance of the wireless relay networks through the use of Physical Layer Network Coding (PLNC) techniques. The physical layer network coding technique allows two terminals to transmit simultaneously to a relay node and decode the modulo-2 sum of the transmitted bits at the relay. This technique considerably improves performance over Digital Network Coding technique. In this thesis, we will present an algorithm for joint decoding of the modulo-2 sum of bits transmitted from two unsynchronized transmitters at the relay. We shall also address the problems that arise when boundaries of the signals do not align with each other and when the channel parameters are slowly varying and are unknown to the receiver at the relay node. Our approach will first jointly estimate the timing o sets and fading gains of both signals using a known pilot sequence sent by both transmitters in the beginning of the packet and then perform Maximum Likelihood detection of data using a state-based Viterbi decoding scheme that takes into account the timing o sets between the interfering signals. We shall present an algorithm for simultaneously tracking the amplitude and phase of slowly varying wireless channel that will work in conjunction our Maximum Likelihood detection algorithm. Finally, we shall provide extension of our receiver to support antenna diversity. Our results show that the proposed detection algorithm works reasonably well, even with the assumption of timing misalignment. We also demonstrate that the performance of the algorithm is not degraded by amplitude and/or phase mismatch between the users. We further show that the performance of the channel tracking algorithm is close to the ideal case i.e. when the channel estimates are perfectly known. Finally, we demonstrate the performance boost provided by the receiver antenna diversity.

Wireless communication is facing one of the fastest developments of the last years in the fields of technology and computer science in the world. There are several standards that deal with it. In this work, the IEEE standard 802.11a, which deals with wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, is going to be discussed in detail. Taking this into consideration, PHY specifications and its environment are going to be studied. The work that the ISY department at the Institute of Technology of the Linköping University has proposed is to design a PHY layer implementation for WLANs, in a CPU, using MATLAB/Simulink and in a DSP processor, using Embedded Target for C6000 DSP and Code Composer Studio and, once implemented both, to perform and analyse the performance of the system under those implementations.

For wireless communication systems, due to broadcasting nature of wireless medium, how to keep eavesdroppers from wiretapping messages is worth investigated. In addition to encryption techniques applied in application layer, physical layer secrecy techniques have been studied in literature. Under the premise that eavesdropper cannot steal any information, physical layer secrecy focus on maximizing the capacity of legal transmission, and make it more reliable by using physical properties of wireless channel. This thesis considers an amplify-and-forward (AF) multiple-input multiple-output (MIMO) cooperative communication network with an untrusted relay (UR), and linear precoders are employed at source, relay, and destination. The relay here serves as a bridge of transmission 1 between the source and the destination. However, assume that the untrusted relay may wiretap information from the source without authorization. In order to prevent relay from wiretapping information, the destination generates artificial noise (AN) to interfere the relay, when the relay is receiving information from the source. Since AN is generated by the destination, the destination can eliminate AN by itself after receiving signal from the relay without corrupting signals of legal transmission. We propose precoder design for source, relay and destination to maximize secrecy capacity under the power constraint of three nodes. By utilizing singular value decomposition (SVD) of all channel matrices and Hadamard inequality, we simplify the optimization problem of precoding matrices to scalar optimization problem, and optimization can be accomplished recursively.

In the high-speed indoor wireless applications, IEEE 802.11 series is the most dominating LAN standard in the current markets. In this thesis, the design issues of the IEEE 802.11a physical layer baseband system are addressed. Various key modules including Viterbi codec, FFT/IFFT module, OFDM synchronous circuit have been integrated with several other modules to constitute the entire baseband system. This system has been implemented by Verilog HDL and verified against with the C-based behavior model. In addition, it will also be prototyped and optimized on the Altera DSP FPGA Development Board. The transmission of the I, Q channel for the time domain singal is emulated by using the 10-bits AD/DA modules on the FPGA board. The experimental results shows that the gate counts of the transmitter and the receiver are 81,190 and 413,461 respectively.

In recent years, there has been a growing interest in wireless ad hoc network. One of the major issues in wireless network is developing efficient routing protocol. Based on the concept of designing protocol model such as OSI model, the designers distilled the process of transmitting data to its most fundamental elements and identified which networking functions had related uses and collected those functions into discrete groups that became the layers. It is not suitable to design wireless ad hoc routing protocol based on OSI model conception because the OSI model is developed from the view point of wired network and there are many different characteristics between wired and wireless environment. The main different characteristics between wired and wireless are the mobility of mobile host and the transmission medium. Such differences have great effect on network performance. Due to the differences between wired and wireless characteristics, we present a comprehensive conception of designing wireless ad hoc routing protocol. In this context, we provide a wireless ad hoc routing protocol based on physical layer characteristics, ex: bit error rate, robust link. Our routing protocol will find out a route in good transmission environment and it is efficient to improve network throughput. Furthermore, our routing protocol will decrease the number of route request packets, the amount of retransmissions, link breakage rate, and increase throughput.

Connected Me is a Human Body Communication (HBC) system, which is used fortransferring data through human body. The working principle is based on theorycalled Body Coupled Communication (BCC), which uses electrostatic couplingfor transferring data between device and human body. Capacitance between bodyand electrode acts as an electrical interface between devices. BCC has become aprominent research area in the field of Personal Area Network (PAN), introducedby Zimmerman in 1995. Until now there have been significant amount of paperspublished on human body models and Analog Front End (AFE), but only fewreports are available in digital baseband processing. The proposed Human Body Communication (HBC) system consists ofdigital baseband and AFE. Digital baseband is used for transferring data packets.AFE is designed for reconstructing signal shape after signal degradation causedby the human body. This thesis implements high speed serial digital communicationsystem for a human body channel. Available modulation schemes andcharacteristics of the Physical layer (PHY) with respect to human body channelare analyzed before implementing the system. The outcome of this thesis is aFPGA demonstrator that shows the possibility of communication through thehuman body. / Connected Me

We consider a two-way relay channel in which two transmitters want to exchange information through a central relay. The relay observes a superposition of the trans- mitted signals from which a function of the transmitted messages is computed for broadcast. We consider the design of codebooks which permit the recovery of a function at the relay and derive information-theoretic bounds on the rates for reliable decoding at the relay. In the spirit of compute-and-forward, we present a multilevel coding scheme that permits reliable computation (or, decoding) of a class of functions at the relay. The function to be decoded is chosen at the relay depending on the channel realization. We define such a class of reliably computable functions for the proposed coding scheme and derive rates that are universally achievable over a set of channel gains when this class of functions is used at the relay. We develop our framework with general modulation formats in mind, but numerical results are presented for the case where each node transmits using 4-ary and 8-ary modulation schemes. Numerical results demonstrate that the flexibility afforded by our proposed scheme permits substantially higher rates than those achievable by always using a fixed function or considering only linear functions over higher order fields. Our numerical results indicate that it is favorable to allow the relay to attempt both compute-and-forward and decode-and-forward decoding. Indeed, either method considered separately is suboptimal for computation over general channels. However, we obtain a converse result when the transmitters are restricted to using identical binary linear codebooks generated uniformly at random. We show that it is impossible for this code ensemble to achieve any rate higher than the maximum of the rates achieved using compute-and-forward and decode-and-forward decoding. Finally, we turn our attention to the design of low density parity check (LDPC) ensembles which can practically achieve these information rates with joint-compute- and-forward message passing decoding. To this end, we construct a class of two-way erasure multiple access channels for which we can exactly characterize the performance of joint-compute-and-forward message passing decoding. We derive the processing rules and a density evolution like analysis for several classes of LDPC ensembles. Utilizing the universally optimal performance of spatially coupled LDPC ensembles with message passing decoding, we show that a single encoder and de- coder with puncturing can achieve the optimal rate region for a range of channel parameters.

Communication networks are an integral part of the Internet of Things (IoT) era. They enable endless opportunities for connectivity in a wide range of applications, leading to advances in efficiency of day-to-day life. While creating opportunities, they also incur several new challenges. In general, we wish to design a system that performs optimally well in all aspects. However, there usually exist competing objectives which lead to tradeoffs. In this thesis, driven by several applications, new features and objectives are included into the system model, making it closer to reality and needs. The results presented in this thesis aim at providing insight into the fundamental tradeoff of the system performance which can serve as a guideline for the optimal design of real-world communication systems. The thesis is divided into two parts. The first part considers the aspect of signal reconstruction requirement as a new objective in the source and channel coding problems. In this part, we consider the framework where the quality and/or availability of the side information can be influenced by a cost-constrained action sequence. In the source coding problem, we impose a constraint on the reconstruction sequence at the receiver that it should be reproduced at the sender, and characterize the fundamental tradeoff in the form of the rate-distortion-cost region, revealing the optimal relation between compression rate, distortion, and action cost. The channel coding counterpart is then studied where a reconstruction constraint is imposed on the channel input sequence such that it should be reconstructed at the receiver. An extension to the multi-stage channel coding problem is also considered where inner and outer bounds to the capacity region are given. The result on the channel capacity reveals interesting consequence of imposing an additional reconstruction requirement on the system model which has a causal processing structure. In the second part, we consider the aspect of information security and privacy in lossy source coding problems. The sender wishes to compress the source sequence in order to satisfy a distortion criterion at the receiver, while revealing only limited knowledge about the source to an unintended user. We consider three different aspects of information privacy. First, we consider privacy of the source sequence against the eavesdropper in the problem of source coding with action-dependent side information. Next, we study privacy of the source sequence due to the presence of a public helper in distributed lossy source coding problems. The public helper is assumed to be either a user who provides side information over a public link which can be eavesdropped, or a legitimate user in the network who helps to relay information to the receiver, but may not ignore the information that is not intended for it. Lastly, we take on a new perspective of information privacy in the source coding problem. That is, instead of protecting the source sequence, we are interested in the privacy of the reconstruction sequence with respect to a user in the system. For above settings, we provide the complete characterization of the rate-distortion(-cost)-leakage/equivocation region or corresponding inner and outer bounds for discrete memoryless systems. / <p>QC 20140514</p>

Recently, massive multiple-input multiple-output (MIMO) systems have gained significant attention as a new network architecture to not only achieving unprecedented spectral and energy efficiencies, but also to alleviating propagation losses and inter-user/inter-cell interference. Therefore, massive MIMO has been identified as one of the key candidate technologies for the 5th generation wireless standard. This dissertation thus focuses on (1) developing a performance analysis framework for cognitive massive MIMO systems by investigating the uplink transmissions of multi-cell multi-user massive MIMO secondary systems, which are underlaid in multi-cell multi-user primary massive MIMO systems, with taking into consideration the detrimental effects of practical transmission impairments, (2) proposing a new wireless-powered underlay cognitive massive MIMO system model, as the secondary user nodes is empowered by the ability to efficiently harvest energy from the primary user transmissions, and then access and utilize the primary network spectrum for information transmission, and (3) developing a secure communication strategy for cognitive multi-user massive MIMO systems, where physical layer secure transmissions are provisioned for both primary and secondary systems by exploiting linear precoders and artificial noise (AN) generation in order to degrade the signal decodability at eavesdropper. The key design feature of the proposed cognitive systems is to leverage the spatial multiplexing strategies to serve a large number of spatially distributed user nodes by using very large numbers of antennas at the base-stations. Moreover, the fundamental performance metrics, the secondary transmit power constraints, which constitute the underlay secondary transmissions subject to a predefined primary interference temperature, and the achievable sum rates of the primary and secondary systems, are characterized under different antenna array configurations. Additionally, the detrimental impact of practical wireless transmission impairments on the performance of the aforementioned systems are quantified. The important insights obtained throughout these analyses can be used as benchmarks for designing practical cognitive spectrum sharing networks.

The broadcast nature of wireless medium has made information security as one of the most important and critical issues in wireless systems. Physical layer security, which is based on information-theoretic secrecy concepts, can be used to secure the wireless channels by exploiting the noisiness and imperfections of the channels. Massive multiple-input multiple-output (MIMO) systems, which are equipped with very large antenna arrays at the base stations, have a great potential to boost the physical layer security by generating the artificial noise (AN) with the exploitation of excess degrees-of-freedom available at the base stations. In this thesis, we investigate physical layer security provisions in the presence of passive/active eavesdroppers for single-hop massive MIMO, dual-hop relay-assisted massive MIMO and underlay spectrum-sharing massive MIMO systems. The performance of the proposed security provisions is investigated by deriving the achievable rates at the user nodes, the information rate leaked into the eavesdroppers, and the achievable secrecy rates. Moreover, the effects of active pilot contamination attacks, imperfect channel state information (CSI) acquisition at the base-stations, and the availability of statistical CSI at the user nodes are quantified. The secrecy rate/performance gap between two AN precoders, namely the random AN precoder and the null-space based AN precoder, is investigated. The performance of hybrid analog/digital precoding is compared with the full-dimensional digital precoding. Furthermore, the physical layer security breaches in underlay spectrum-sharing massive MIMO systems are investigated, and thereby, security provisions are designed/analyzed against active pilot contamination attacks during the channel estimation phase. A power-ratio based active pilot attack detection scheme is investigated, and thereby, the probability of detection is derived. Thereby, the vulnerability of uplink channel estimation based on the pilots transmitted by the user nodes in time division duplexing based massive MIMO systems is revealed, and the fundamental trade-offs among physical layer security provisions, implementation complexity and performance gains are discussed.