In this work, the design and application of Polynomial-Based Filters (PBF) for continuously variable Sample Rate Conversion (SRC) is studied. The major contributions of this work are summarized as follows. First, an explicit formula for the Fourier Transform of both a symmetrical and nonsymmetrical PBF impulse response with variable basis function coefficients is derived. In the literature only one explicit formula is given, and that for a symmetrical even length filter with fixed basis function coefficients. The frequency domain optimization of PBFs via linear programming has been proposed in the literature, however, the algorithm was not detailed nor were explicit formulas derived. In this contribution, a minimax optimization procedure is derived for the frequency domain optimization of a PBF with time-domain constraints. Explicit formulas are given for direct input to a linear programming routine. Additionally, accompanying Matlab code implementing this optimization in terms of the derived formulas is given in the appendix. In the literature, it has been pointed out that the frequency response of the Continuous-Time (CT) filter decays as frequency goes to infinity. It has also been observed that when implemented in SRC, the CT filter is sampled resulting in CT frequency response aliasing. Thus, for example, the stopband sidelobes of the Discrete-Time (DT) implementation rise above the CT designed level. Building on these observations, it is shown how the rolloff rate of the frequency response of a PBF can be adjusted by adding continuous derivatives to the impulse response. This is of great advantage, especially when the PBF is used for decimation as the aliasing band attenuation can be made to increase with frequency. It is shown how this technique can be used to dramatically reduce the effect of alias build up in the passband. In addition, it is shown that as the number of continuous derivatives of the PBF increases the resulting DT implementation more closely matches the Continuous-Time (CT) design. When implemented for SRC, samples from a PBF impulse response are computed by evaluating the polynomials using a so-called fractional interval, µ. In the literature, the effect of quantizing µ on the frequency response of the PBF has been studied. Formulas have been derived to determine the number of bits required to keep frequency response distortion below prescribed bounds. Elsewhere, a formula has been given to compute the number of bits required to represent µ to obtain a given SRC accuracy for rational factor SRC. In this contribution, it is shown how these two apparently competing requirements are quite independent. In fact, it is shown that the wordlength required for SRC accuracy need only be kept in the µ generator which is a single accumulator. The output of the µ generator may then be truncated prior to polynomial evaluation. This results in significant computational savings, as polynomial evaluation can require several multiplications and additions. Under the heading of applications, a new Wideband Digital Downconverter (WDDC) for Synthetic Instruments (SI) is introduced. DDCs first tune to a signal's center frequency using a numerically controlled oscillator and mixer, and then zoom-in to the bandwidth of interest using SRC. The SRC is required to produce continuously variable output sample rates from a fixed input sample rate over a large range. Current implementations accomplish this using a pre-filter, an arbitrary factor resampler, and integer decimation filters. In this contribution, the SRC of the WDDC is simplified reducing the computational requirements to a factor of three or more. In addition to this, it is shown how this system can be used to develop a novel computationally efficient FFT-based spectrum analyzer with continuously variable frequency spans. Finally, after giving the theoretical foundation, a real Field Programmable Gate Array (FPGA) implementation of a novel Arbitrary Waveform Generator (AWG) is presented. The new approach uses a fixed Digital-to-Analog Converter (DAC) sample clock in combination with an arbitrary factor interpolator. Waveforms created at any sample rate are interpolated to the fixed DAC sample rate in real-time. As a result, the additional lower performance analog hardware required in current approaches, namely, multiple reconstruction filters and/or additional sample clocks, is avoided. Measured results are given confirming the performance of the system predicted by the theoretical design and simulation.

As wireless protocols become easier to implement, more products come with wireless connectivity. This latest push for wireless connectivity has left a gap in the development of the security and the reliability of some protocols. These wireless protocols can be used in the growing field of IoT where wireless sensors are used to share information throughout a network. IoT is being implemented in homes, agriculture, manufactory, and in the medical field. Disrupting a wireless device from proper communication could potentially result in production loss, security issues, and bodily harm. The 802.15.4/ZigBee protocol is used in low power, low data rate, and low cost wireless applications such as medical devices and home automation devices. This protocol uses CSMA-CA (Carrier Sense Multiple Access w/ Collision Avoidance) which allows for multiple ZigBee devices to transmit simultaneousness and allows for wireless coexistence with the existing protocols at the same frequency band. The CSMA-CA MAC layer seems to introduce an unintentional gap in the reliability of the protocol. By creating a 16-tone signal with center frequencies located in the center of the multiple access channels, all channels will appear to be in use and the ZigBee device will be unable to transmit data. The jamming device will be created using the following hardware implementation. An FPGA connected to a high-speed Digital to Analog Converter will be used to create a digital signal synthesizer device that will create the 16-tone signal. The 16-tone signal will then be mixed up to the 2.4 GHz band, amplified, and radiated using a 2.4 GHz up-converter device. The transmitted jamming signal will cause the ZigBee MAC layer to wait indefinitely for the channel to clear. Since the channel will not clear, the MAC layer will not allow any transmission and the ZigBee devices will not communicate.

With the reality that diverse air interfaces and dissimilar access networks coexist, accompanied by the trend that dynamic spectrum access (DSA) is allowed and will be gradually employed, cognition and cooperation form a promising framework to achieve the ideality of seamless ubiquitous connectivity in future communication networks. In this dissertation, the cognitive gateway (CG), conceived as a special cognitive radio (CR) node, is proposed and designed to facilitate universal interoperability among incompatible waveforms. A proof-of-concept prototype is built and tested. Located in places where various communication nodes and diverse access networks coexist, the CG can be easily set up and works like a network server with differentiated service (Diffserv) architecture to provide automatic traffic relaying and link establishment. The author extracts a scalable '“source-CG-destination“ snapshot from the entire network and investigates the key enabling technologies for such a snapshot. The CG features provide universal interoperability, which is enabled by a generic waveform representation format and the reconfigurable software defined radio platform. According to the trend of an all IP-based solution for future communication systems, the term “waveform“ in this dissertation has been defined as a protocol stack specification suite. The author gives a generic waveform representation format based on the five-layer TCP/IP protocol stack architecture. This format can represent the waveforms used by Ethernet, WiFi, cellular system, P25, cognitive radios etc. A significant advantage of CG over other interoperability solutions lies in its autonomy, which is supported by appropriate signaling processes and automatic waveform identification. The service process in a CG is usually initiated by the users who send requests via their own waveforms. These requests are transmitted during the signaling procedures. The complete operating procedure of a CG is depicted as a waveform-oriented cognition loop, which is primarily executed by the waveform identifier, scenario analyzer, central controller, and waveform converter together. The author details the service process initialized by a primary user (e.g. legacy public safety radio) and that initialized by a secondary user (e.g. CR), and describes the signaling procedures between CG and clients for the accomplishment of CG discovery, user registration and un-registration, link establishment, communication resumption, service termination, route discovery, etc. From the waveforms conveyed during the signaling procedures, the waveform identifier extracts the parameters that can be used for a CG to identify the source waveform and the destination waveform. These parameters are called “waveform indicators.“ The author analyzes the four types of waveforms of interest and outlines the waveform indicators for different types of communication initiators. In particular, a multi-layer waveform identifier is designed for a CG to extract the waveform indicators from the signaling messages. For the physical layer signal recognition, a Universal Classification Synchronization (UCS) system has been invented. UCS is conceived as a self-contained system which can detect, classify, synchronize with a received signal and provide all parameters needed for physical layer demodulation without prior information from the transmitter. Currently, it can accommodate the modulations including AM, FM, FSK, MPSK, QAM and OFDM. The design and implementation details of a UCS have been presented. The designed system has been verified by over-the-air (OTA) experiments and its performance has been evaluated by theoretical analysis and software simulation. UCS can be ported to different platforms and can be applied for various scenarios. An underlying assumption for UCS is that the target signal is transmitted continually. However, it is not the case for a CG since the detection objects of a CG are signaling messages. In order to ensure higher recognition accuracy, signaling efficiency, and lower signaling overhead, the author addresses the key issues for signaling scheme design and their dependence on waveform identification strategy. In a CG, waveform transformation (WT) is the last step of the link establishment process. The resources required for transformation of waveform pairs, together with the application priority, constitute the major factors that determine the link control and scheduling scheme in a CG. The author sorts different WT into five categories and describes the details of implementing the four typical types of WT (including physical layer analog – analog gateway, up to link layer digital – digital gateway, up-to-network-layer digital gateway, and Voice over IP (VoIP) – an up to transport layer gateway) in a practical CG prototype. The issues that include resource management and link scheduling have also been addressed. This dissertation presents a CG prototype implemented on the basis of GNU Radio plus multiple USRPs. In particular, the service process of a CG is modeled as a two-stage tandem queue, where the waveform identifier queues at the first stage can be described as M/D/1/1 models and the waveform converter queue at the second stage can be described as G/M/K/K model. Based on these models, the author derives the theoretical block probability and throughput of a CG. Although the “source-CG-destination” snapshot considers only neighboring nodes which are one-hop away from the CG, it is scalable to form larger networks. CG can work in either ad-hoc or infrastructure mode. Utilizing its capabilities, CG nodes can be placed in different network architectures/topologies to provide auxiliary connectivity. Multi-hop cooperative relaying via CGs will be an interesting research topic deserving further investigation. / Ph. D.

This dissertation provides the theory, design, and implementation of a cognitive engine, the enabling technology of cognitive radio. A cognitive radio is a wireless communications device capable of sensing the environment and making decisions on how to use the available radio resources to enable communications with a certain quality of service. The cognitive engine, the intelligent system behind the cognitive radio, combines sensing, learning, and optimization algorithms to control and adapt the radio system from the physical layer and up the communication stack. The cognitive engine presented here provides a general framework to build and test cognitive engine algorithms and components such as sensing technology, optimization routines, and learning algorithms. The cognitive engine platform allows easy development of new components and algorithms to enhance the cognitive radio capabilities. It is shown in this dissertation that the platform can easily be used on a simulation system and then moved to a real radio system. The dissertation includes discussions of both theory and implementation of the cognitive engine. The need for and implementation of all of the cognitive components is strongly featured as well as the specific issues related to the development of algorithms for cognitive radio behavior. The discussion of the theory focuses largely on developing the optimization space to intelligently and successfully design waveforms for particular quality of service needs under given environmental conditions. The analysis develops the problem into a multi-objective optimization process to optimize and trade-of of services between objectives that measure performance, such as bit error rate, data rate, and power consumption. The discussion of the multi-objective optimization provides the foundation for the analysis of radio systems in this respect, and through this, methods and considerations for future developments. The theoretical work also investigates the use of learning to enhance the cognitive engine's capabilities through feed-back, learning, and knowledge representation. The results of this work include the analysis of cognitive radio design and implementation and the functional cognitive engine that is shown to work in both simulation and on-line experiments. Throughout, examples and explanations of building and interfacing cognitive components to the cognitive engine enable the use and extension of the cognitive engine for future work. / Ph. D.

Software Defined Networking (SDN) has gained popularity and attractiveness in the past years’ thanks to its dynamic and programmable nature. The possibility to decouple the data plane and control plane allows for the implementation of Internet networks in an innovative way. Thanks to its ease in changing flow rules in network switches, SDN allows network resources optimization. In the case of critical applications, an essential aspect is to ensure connectivity on the network even in case of link failures. Even when a failure causes an interruption of connectivity, the challenge also stays in recovering as fast as possible. Nonetheless, the SDN controller should have the policy to decide which pairs of end-hosts to disable connectivity when there is a shortage of resources to keep the most important connections active. In this thesis, we developed a proactive-reactive SDN controller coded in Python that copes with restoring end-hosts connectivity as fast as possible. The controller prioritizes the couples of end-hosts that need connectivity based on their importance. During a shortage of network resources, the connectivity of pairs of end-hosts with low importance is disabled, and the connectivity between the most important couples can be ensured. We tested our solution with a reactive-only SDN controller and a proactive-reactive SDN controller that does not consider any prioritization order between end-hosts connectivity. Both the benchmark SDN controllers were developed in the thesis. Experiments were run on the same network topology, with the same couple of endhosts involved. The comparison between the proactive-reactive and reactive-only controllers showed the first one to be faster in restoring the connectivity after a failure. It saves time restoring the connectivity and has fewer packets lost under certain conditions in the relationship between the switch-to-switch and the switchto-controller transmission delay. The comparison between the proactive-reactive iii controller and the controller with no prioritization confirms that without an ordered queue of priorities, it may be the most important couple of end-hosts to lose connectivity in case of shortages of network resources. To simulate a realistic scenario, the project considers the case study of electric power transmission networks using SDN. In particular, the focus is on reconnecting Phasor Measurement Unit (PMU)s to the power grid to ensure system observability. During our experiments, we adopted the typical measurement transmission frequency used by PMUs (50Hz). The SDN switches are deployed with P4, and the SDN controller is coded in Python. Furthermore, it exploits P4Runtime to communicate with the switches in run-time. / Software Defined Networking (SDN) har vunnit popularitet och attraktionskraft under de senaste åren tack vare sin dynamiska och programmerbara natur. Möjligheten att frikoppla dataplanet från kontrollplanet gör det möjligt att genomföra Internetnät på ett innovativt sätt. Tack vare att det är lätt att ändra flödesreglerna i nätverksväxlar gör SDN det möjligt att optimera nätverksresurserna. När det gäller kritiska tillämpningar är en viktig aspekt att säkerställa konnektiviteten i nätet även vid länkfel. Även när ett fel orsakar ett avbrott i konnektiviteten är utmaningen också att återhämta sig så snabbt som möjligt. Trots detta bör SDNstyrenheten ha en policy för att avgöra vilka par av slutvärdar som ska inaktivera anslutningen när det råder brist på resurser för att hålla de viktigaste anslutningarna aktiva. I den här avhandlingen har vi utvecklat en proaktiv-reaktiv SDN-styrenhet kodad i Python som klarar av att återställa slutvärdarnas anslutning så snabbt som möjligt. Styrenheten prioriterar paren av slutvärdar som behöver anslutning utifrån deras betydelse. Vid brist på nätverksresurser inaktiveras anslutningen för par av slutvärdar med låg betydelse, och anslutningen mellan de viktigaste paren kan säkerställas. Vi testade vår lösning med en enbart reaktiv SDN-styrenhet och en proaktiv-reaktiv SDN-styrenhet som inte tar hänsyn till någon prioriteringsordning mellan slutvärdarnas konnektivitet. Båda riktmärkeskontrollerna SDN utvecklades i avhandlingen. Experimenten genomfördes på samma nätverkstopologi med samma antal slutvärdar. Jämförelsen mellan den proaktivt-reaktiva och den enbart reaktiva kontrollören visade att den förstnämnda kontrollören var snabbare när det gäller att återställa anslutningen efter ett fel. Den sparar tid för att återställa anslutningen och har färre förlorade paket under vissa förhållanden i förhållandet mellan överföringsfördröjningen från switch till switch och från switch till styrenhet. Jämförelsen mellan den proaktiva-reaktiva styrenheten och v styrenheten utan prioritering bekräftar att utan en ordnad kö av prioriteringar kan det vara det viktigaste paret av slutvärdar som förlorar konnektiviteten vid brist på nätverksresurser. För att simulera ett realistiskt scenario används SDN i projektet som fallstudie för elöverföringsnät. Fokus ligger särskilt på att återansluta Phasor Measurement Unit (PMU)s till elnätet för att säkerställa systemets observerbarhet. Under våra experiment antog vi den typiska överföringsfrekvensen för mätningar som används av PMUs (50Hz). SDN-växlarna installeras med P4, och SDN-styrenheten är kodad i Python. Dessutom utnyttjas P4Runtime för att kommunicera med växlarna i körtid.

Due to advances in digital computing much of the baseband signal processing of a communication system has moved into the digital domain from the analog domain. Within the domain of digital communication systems, Software Defined Radios (SDRs) allow for majority of the signal processing tasks to be implemented in reconfigurable digital hardware. However this comes at a cost of higher power and resource requirements. Therefore, highly efficient custom hardware implementations for SDRs are needed to make SDRs feasible for practical use. Efficient custom hardware motivates the use of fixed point arithmetic in the implementation of Digital Signal Processing (DSP) algorithms. This conversion to finite precision arithmetic introduces quantization noise in the system, which significantly affects the performance metrics of the system. As a result, characterizing quantization noise and its effects within a DSP system is an important challenge that needs to be addressed. Current models to do so significantly over-estimate the quantization effects, resulting in an over-allocation of hardware resources to implement a system. Polynomial Chaos Expansion (PCE) is a method that is currently gaining attention in modelling uncertainty in engineering systems. Although it has been used to analyze quantization effects in DSP systems, previous investigations have been limited to simple examples. The purpose of this thesis is to therefore introduce new techniques that allow the application of PCE to be scaled up to larger DSP blocks with many noise sources. Additionally, the thesis introduces design space exploration algorithms that leverage the accuracy of PCE simulations to estimate bitwidths for fixed point implementations of DSP systems. The advantages of using PCE over current modelling techniques will be presented though its application to case studies relevant to practice. These case studies include Sine Generators, Infinite Impulse Response (IIR) filters, Finite Impulse Response (FIR) filters, FM demodulators and Phase Locked Loops (PLLs). / Thesis / Master of Applied Science (MASc)

Digital Selective Calling (DSC) is a vital maritime communications and safety system, enabling ships in distress to alert nearby vessels and coast guard stations of their emergency. While DSC is suitable for calling, its technical format is substandard from a cybersecurity perspective. Specifically, this work aims to demonstrate that Very High Frequency (VHF) DSC distress calls can be spoofed using Software Defined Radio (SDR). A VHF DSC distress call encoder and VHF DSC SDR signal constructor were developed. The forged distress call was transmitted using various techniques to two different DSC decoder programs, as well as to the maritime VHF transceiver ICOM IC-M510. It was shown that all of the targeted DSC decoders were susceptible to spoofing. This thesis concludes that VHF DSC distress calls can be spoofed using SDR, and infers that the DSC system as a whole has inherent security vulnerabilities that need to be addressed to assure the safety of future seafaring.

The onset of quantum computing threatens commonly used schemes for information secrecy across wireless communication channels, particularly key-based data-level encryption. This calls for secrecy schemes that can provide everlasting secrecy resistant to increased computational power of an adversary. One novel physical layer scheme proposes that an intended receiver capable of performing analog cancellation of a known key-based interference would hold a significant advantage in recovering small underlying messages versus an eavesdropper performing cancellation after analog-to-digital conversion. This advantage holds even in the event that an eavesdropper can recover and use the original key in their digital cancellation. Inspired by this scheme, a flexible software-defined radio receiver design capable of maintaining analog cancellation ratios consistently over 40 dB, reaching up to and over 50 dB, is implemented in this thesis. Maintaining this analog cancellation requires very precise time-frequency synchronization along with accurate modeling and simulation of the channel effects on the interference. The key sources of synchronization error preventing this test bed from achieving and maintaining perfect interference cancellation, sub-sample period timing errors and limited radio frequency stability, are explored for possible improvements. To further prove robustness of the implemented secrecy scheme, the testbed is shown to operate with both phase-shift keying and frequency-modulated waveforms. Differences in the synchronization algorithm used for the two waveforms are highlighted. Interference cancellation performance is measured for increasing interference bandwidth and shown to decrease with such. The implications this testbed has on security approaches based on intentional interference employed to confuse eavesdroppers is approached from the framework proposed in the motivating everlasting secrecy scheme. Using analog cancellation levels from the hardware testbed, it is calculated that secrecy rates up to 2.3 bits/symbol are gained by receivers (intended or not) performing interference cancellation in analog rather than on a digital signal processor. Inspired by the positive gains in secrecy over systems not performing analog cancellation prior to signal reception, a novel secrecy scheme that focuses on the advantage an analog canceller holds in receiver amplifier compression is proposed here. The adversary amplifier is assumed to perform linear cancellation after the interference has passed through their nonlinear amplifier. This is accomplished by deriving the distribution of the interference residual after undergoing an inverse tangent transfer function and perfect linear cancellation. Parameters of this scheme are fit for the radios and cancellation ratios observed in the testbed, resulting in a secrecy gain of 0.95 bits/symbol. The model shows that larger message powers can still be kept secure for the achieved levels of cancellation, thus providing an even greater secrecy gain with increased message transmission power.

No description available.

No description available.