The scope of this work is to map both conventional and less conventional methods of signal detection in the radio channel, computer simulation of selected methods and subsequent implementation selected method (algorithm) to FPGA chip.

Efficient utilization of frequency bands has attracted more and more attention. Most of the licensed spectrum nowadays is under-utilized and some unlicensed services are allowed to use the available spectrum without causing harmful interference to the primary users. Therefore, unlicensed users should be able to detect spectrum holes reliably. Spectrum sensing and estimation is an important factor to achieve this. In this thesis, several spectrum sensing and estimation methods are compared based on receiver operating characteristics. Simulation results show that there is a trade-off among different methods.

Cognitive radio networks (CRNs) have emerged as a solution for the looming spectrum crunch caused by the rapid adoption of wireless devices over the previous decade. This technology enables efficient spectrum utility by dynamically reusing existing spectral bands. A CRN achieves this by requiring its users – called secondary users (SUs) – to measure and opportunistically utilise the band of a legacy broadcaster – called a primary user (PU) – in a process called spectrum sensing. Sensing requires the distribution and fusion of measurements from all SUs, which is facilitated by a variety of architectures and topologies. CRNs possessing a central computation node are called centralised networks, while CRNs composed of multiple computation nodes are called decentralised networks. While simpler to implement, centralised networks are reliant on the central node – the entire network fails if this node is compromised. In contrast, decentralised networks require more sophisticated protocols to implement, while offering greater robustness to node failure. Relay-based networks, a subset of decentralised networks, distribute the computation over a number of specialised relay nodes – little research exists on spectrum sensing using these networks. CRNs are vulnerable to unique physical layer attacks targeted at their spectrum sensing functionality. One such attack is the Byzantine attack; these attacks occur when malicious SUs (MUs) alter their sensing reports to achieve some goal (e.g. exploitation of the CRN’s resources, reduction of the CRN’s sensing performance, etc.). Mitigation strategies for Byzantine attacks vary based on the CRN’s network architecture, requiring defence algorithms to be explored for all architectures. Because of the sparse literature regarding relay-based networks, a novel algorithm – suitable for relay-based networks – is proposed in this work. The proposed algorithm performs joint MU detection and secure sensing by large-scale probabilistic inference of a statistical model. The proposed algorithm’s development is separated into the following two parts. • The first part involves the construction of a probabilistic graphical model representing the likelihood of all possible outcomes in the sensing process of a relay-based network. This is done by discovering the conditional dependencies present between the variables of the model. Various candidate graphical models are explored, and the mathematical description of the chosen graphical model is determined. • The second part involves the extraction of information from the graphical model to provide utility for sensing. Marginal inference is used to enable this information extraction. Belief propagation is used to infer the developed graphical model efficiently. Sensing is performed by exchanging the intermediate belief propagation computations between the relays of the CRN. Through a performance evaluation, the proposed algorithm was found to be resistant to probabilistic MU attacks of all frequencies and proportions. The sensing performance was highly sensitive to the placement of the relays and honest SUs, with the performance improving when the number of relays was increased. The transient behaviour of the proposed algorithm was evaluated in terms of its dynamics and computational complexity, with the algorithm’s results deemed satisfactory in this regard. Finally, an analysis of the effectiveness of the graphical model’s components was conducted, with a few model components accounting for most of the performance, implying that further simplifications to the proposed algorithm are possible. / Dissertation (MEng)--University of Pretoria, 2020. / Electrical, Electronic and Computer Engineering / MEng / Unrestricted

Cognitive radios is one of the hot topics for emerging and future wireless commu- nication. It has been proposed as a suitable solution for the spectrum scarcity caused by the increase in frequency demand. The concept is based on allowing unlicensed users, called cognitive or secondary users, to share the unoccupied frequency bands with their owners, called the primary users, under constraints on the interference they cause to them. The objective of our work is to propose some enhancements to cognitive radio systems while taking into account practical constraints. Cogni- tive radios requires a capability to detect spectrum holes (spectrum sensing) and a scheduling flexibility to avoid the occupied spectrum and selectively use the empty spectrum (dynamic resource allocation). Thus, the work is composed of two main parts. The first part focuses on cooperative spectrum sensing. We compute in this part the analytical performance of cooperative spectrum sensing under non identical and imperfect channels. Different schemes are considered for the cooperation between users such as hard binary, censored information, quantized, and soft information. The second part focuses on the dynamic resource allocation. We first propose low-cost re- source allocation algorithms that use location information to estimate the interference to primary users to replace absence of instantaneous channel state information. We extend these algorithms to handle practical implementation constraints such as dis- 5 crete bit-loading and collocated subcarriers allocations. We then propose a reduced dimension approach based on the grouping of subcarriers into clusters and performing the resource allocation over clusters of subcarriers instead of single subcarriers. This approach is shown to reduce the computational complexity of the algorithm with lim- ited performance loss. In addition, it is valid for a generic set of resource allocation problems in presence of co-channel interference between users.

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.

No / Opportunistic secondary usage of underutilised radio spectrum is currently of great interest and the use of TV White Spaces (TVWS) has been considered for Long Term Evolution (LTE) broadband services. However, wireless microphones operating in TV bands pose a challenge to TVWS opportunistic access. Efficient and proactive spectrum sensing could prevent harmful interference between collocated devices, but existing spectrum sensing schemes such as energy detection and schemes based on Random Matrix Theory (RMT) have performance limitations. We propose a new blind spectrum sensing scheme with higher performance based on RMT supported by a new formula for the estimation of noise variance. The performance of the proposed scheme has been evaluated through extensive simulations on wireless microphone signals. The proposed scheme has also been compared to energy detection schemes, and shows higher performance in terms of the probability of false alarm (Pfa) and probability of detection (Pd).

The spectacular growth in wireless services imposes scarcity in term of the available radio spectrum. A solution to overcome this scarcity is to adopt what so called cognitive radio based on dynamic spectrum access. With dynamic spectrum access, secondary (unlicensed) users can access  spectrum owned by primary (licensed) users when it is temporally and/or geographically unused. This unused spectrum is termed as spectrum opportunity. Finding these spectrum opportunities related aspects are studied in this thesis where two approaches of finding spectrum opportunities, namely spectrum sensing and geo-locations databases are considered. In spectrum sensing arena, two topics are covered, blind spectrum sensing and sensing time and periodic sensing interval optimization. For blind spectrum sensing, a spectrum scanner based on maximum minimum eigenvalues detector and frequency domain rectangular filtering is developed. The measurements show that the proposed scanner outperforms the energy detector scanner in terms of the probability of detection. Continuing in blind spectrum sensing, a novel blind spectrum sensing technique based on discriminant analysis called spectrum discriminator has been developed in this thesis. Spectrum discriminator has been further developed to peel off multiple primary users with different transmission power from a wideband sensed spectrum. The spectrum discriminator performance is measured and compared with the maximum minimum eigenvalues detector in terms of the probability of false alarm, the probability of detection and the sensing time. For sensing time and periodic sensing interval optimization, a new approach that aims at maximizing the probability of right detection, the transmission efficiency and the captured opportunities is proposed and simulated. The proposed approach optimizes the sensing time and the periodic sensing interval iteratively. Additionally, the periodic sensing intervals for multiple channels are optimized to achieve as low sensing overhead and unexplored opportunities as possible for a multi channels system. The thesis considers radar bands and TV broadcasting bands to adopt geo-locations databases for spectrum opportunities. For radar bands, the possibility of spectrum sharing with secondary users in L, S and C bands is investigated. The simulation results show that band sharing is possible with more spectrum opportunities offered by C band than S and L band which comes as the least one. For the TV broadcasting bands, the thesis treats the power assignment for secondary users operate in Gävle area, Sweden. Furthermore, the interference that the TV transmitter would cause to the secondary users is measured in different locations in the same area. / <p>QC 20130114</p> / QUASAR

No description available.

No description available.

Recurrent neural networks (RNNs) have been widely used for supervised pattern recognition and exploring the underlying spatio-temporal correlation. However, due to the vanishing/exploding gradient problem, training a fully connected RNN in many cases is very difficult or even impossible. The difficulties of training traditional RNNs, led us to reservoir computing (RC) which recently attracted a lot of attention due to its simple training methods and fixed weights at its recurrent layer. There are three different categories of RC systems, namely, echo state networks (ESNs), liquid state machines (LSMs), and delayed feedback reservoirs (DFRs). In this dissertation a novel structure of RNNs which is inspired by dynamic delayed feedback loops is introduced. In the reservoir (recurrent) layer of DFR, only one neuron is required which makes DFRs extremely suitable for hardware implementations. The main motivation of this dissertation is to introduce an energy efficient, and easy to train RNN while this model achieves high performances in different tasks compared to the state-of-the-art. To improve the energy efficiency of our model, we propose to adopt spiking neurons as the information processing unit of DFR. Spiking neural networks (SNNs) are the most biologically plausible and energy efficient class of artificial neural networks (ANNs). The traditional analog ANNs have marginal similarity with the brain-like information processing. It is clear that the biological neurons communicate together through spikes. Therefore, artificial SNNs have been introduced to mimic the biological neurons. On the other hand, the hardware implementation of SNNs have shown to be extremely energy efficient. Towards achieving this overarching goal, this dissertation presents a spiking DFR (SDFR) with novel encoding schemes, and defense mechanisms against adversarial attacks. To verify the effectiveness and performance of the SDFR, it is adopted in three different applications where there exists a significant Spatio-temporal correlations. These three applications are attack detection in smart grids, spectrum sensing of multi-input-multi-output(MIMO)-orthogonal frequency division multiplexing (OFDM) Dynamic Spectrum Sharing (DSS) systems, and video-based face recognition. In this dissertation, the performance of SDFR is first verified in cyber attack detection in Smart grids. Smart grids are a new generation of power grids which guarantee a more reliable and efficient transmission and delivery of power to the costumers. A more reliable and efficient power generation and distribution can be realized through the integration of internet, telecommunication, and energy technologies. The convergence of different technologies, brings up opportunities, but the challenges are also inevitable. One of the major challenges that pose threat to the smart grids is cyber-attacks. A novel method is developed to detect false data injection (FDI) attacks in smart grids. The second novel application of SDFR is the spectrum sensing of MIMO-OFDM DSS systems. DSS is being implemented in the fifth generation of wireless communication systems (5G) to improve the spectrum efficiency. In a MIMO-OFDM system, not all the subcarriers are utilized simultaneously by the primary user (PU). Therefore, it is essential to sense the idle frequency bands and assign them to the secondary user (SU). The effectiveness of SDFR in capturing the spatio-temporal correlation of MIMO-OFDM time-series and predicting the availability of frequency bands in the future time slots is studied as well. In the third application, the SDFR is modified to be adopted in video-based face recognition. In this task, the SDFR is leveraged to recognize the identities of different subjects while they rotate their heads in different angles. Another contribution of this dissertation is to propose a novel encoding scheme of spiking neurons which is inspired by the cognitive studies of rats. For the first time, the multiplexing of multiple neural codes is introduced and it is shown that the robustness and resilience of the spiking neurons is increased against noisy data, and adversarial attacks, respectively. Adversarial attacks are small and imperceptible perturbations of the input data, which have shown to be able to fool deep learning (DL) models. So far, many adversarial attack and defense mechanisms have been introduced for DL models. Compromising the security and reliability of artificial intelligence (AI) systems is a major concern of government, industry and cyber-security researchers, in that insufficient protections can compromise the security and privacy of everyone in society. Finally, a defense mechanism to protect spiking neurons against adversarial attacks is introduced for the first time. In a nutshell, this dissertation presents a novel energy efficient deep spiking recurrent neural network which is inspired by delayed dynamic loops. The effectiveness of the introduced model is verified in several different applications. At the end, novel encoding and defense mechanisms are introduced which improve the robustness of the model against noise and adversarial attacks. / Doctor of Philosophy / The ultimate goal of artificial intelligence (AI) is to mimic the human brain. Artificial neural networks (ANN) are an attempt to realize that goal. However, traditional ANNs are very far from mimicking biological neurons. It is well-known that biological neurons communicate with one another through signals in the format of spikes. Therefore, artificial spiking neural networks (SNNs) have been introduced which behave more similarly to biological neurons. Moreover, SNNs are very energy efficient which makes them a suitable choice for hardware implementation of ANNs (neuromporphic computing). Despite the many benefits that are brought about by SNNs, they are still behind traditional ANNs in terms of performance. Therefore, in this dissertation, a new structure of SNNs is introduced which outperforms the traditional ANNs in three different applications. This new structure is inspired by delayed dynamic loops which exist in biological brains. The main objective of this novel structure is to capture the spatio-temporal correlation which exists in time-series while the training overhead and power consumption is reduced. Another contribution of this dissertation is to introduce novel encoding schemes for spiking neurons. It is clear that biological neurons leverage spikes, but the language that they use to communicate is not clear. Hence, the spikes require to be encoded in a certain language which is called neural spike encoding scheme. Inspired by the cognitive studies of rats, a novel encoding scheme is presented. Lastly, it is shown that the introduced encoding scheme increases the robustness of SNNs against noisy data and adversarial attacks. AI models including SNNs have shown to be vulnerable to adversarial attacks. Adversarial attacks are minor perturbations of the input data that can cause the AI model to misscalassify the data. For the first time, a defense mechanism is introduced which can protect SNNs against such attacks.