Quantum Hopfield neural network

Quantum computing allows for the potential of significant advancements in both the speed and the capacity of widely used machine learning techniques. Here we employ quantum algorithms for the Hopfield network, which can be used for pattern recognition, reconstruction, and optimization as a realization of a content-addressable memory system. We show that an exponentially large network can be stored in a polynomial number of quantum bits by encoding the network into the amplitudes of quantum states. By introducing a classical technique for operating the Hopfield network, we can leverage quantum algorithms to obtain a quantum computational complexity that is logarithmic in the dimension of the data. We also present an application of our method as a genetic sequence recognizer.Comment: 13 pages, 3 figures, final versio

Wireless Channel Equalization in Digital Communication Systems

Our modern society has transformed to an information-demanding system, seeking voice, video, and data in quantities that could not be imagined even a decade ago. The mobility of communicators has added more challenges. One of the new challenges is to conceive highly reliable and fast communication system unaffected by the problems caused in the multipath fading wireless channels. Our quest is to remove one of the obstacles in the way of achieving ultimately fast and reliable wireless digital communication, namely Inter-Symbol Interference (ISI), the intensity of which makes the channel noise inconsequential. The theoretical background for wireless channels modeling and adaptive signal processing are covered in first two chapters of dissertation. The approach of this thesis is not based on one methodology but several algorithms and configurations that are proposed and examined to fight the ISI problem. There are two main categories of channel equalization techniques, supervised (training) and blind unsupervised (blind) modes. We have studied the application of a new and specially modified neural network requiring very short training period for the proper channel equalization in supervised mode. The promising performance in the graphs for this network is presented in chapter 4. For blind modes two distinctive methodologies are presented and studied. Chapter 3 covers the concept of multiple cooperative algorithms for the cases of two and three cooperative algorithms. The select absolutely larger equalized signal and majority vote methods have been used in 2-and 3-algoirithm systems respectively. Many of the demonstrated results are encouraging for further research. Chapter 5 involves the application of general concept of simulated annealing in blind mode equalization. A limited strategy of constant annealing noise is experimented for testing the simple algorithms used in multiple systems. Convergence to local stationary points of the cost function in parameter space is clearly demonstrated and that justifies the use of additional noise. The capability of the adding the random noise to release the algorithm from the local traps is established in several cases

Real time evolutionary algorithms in robotic neural control systems.

This thesis describes the use of a Real-Time Evolutionary Algorithm (RTEA) to optimise an Artificial Neural Network (ANN) on-line (in this context on-line means while it is in use). Traditionally, Evolutionary Algorithms (Genetic Algorithms, Evolutionary Strategies and Evolutionary Programming) have been used to train networks before use - that is off-line, as have other learning systems like Back-Propagation and Simulated Annealing. However, this means that the network cannot react to new situations (which were not in its original training set). The system outlined here uses a Simulated Legged Robot as a test-bed and allows it to adapt to a changing Fitness function. An example of this in reality would be a robot walking from a solid surface onto an unknown surface (which might be, for example, rock or sand) while optimising its controlling network in real-time, to adjust its locomotive gait, accordingly. The project initially developed a Central Pattern Generator (CPG) for a Bipedal Robot and used this to explore the basic characteristics of RTEA. The system was then developed to operate on a Quadruped Robot and a test regime set up which provided thousands of real-environment like situations to test the RTEAs ability to control the robot. The programming for the system was done using Borland C++ Builder and no commercial simulation software was used. Through this means, the Evolutionary Operators of the RTEA were examined and their real-time performance evaluated. The results demonstrate that a RTEA can be used successfully to optimise an ANN in real-time. They also show the importance of Neural Functionality and Network Topology in such systems and new models of both neurons and networks were developed as part of the project. Finally, recommendations for a working system are given and other applications reviewed

A Continuous-Time Recurrent Neural Network for Joint Equalization and Decoding – Analog Hardware Implementation Aspects

Equalization and channel decoding are “traditionally” two cascade processes at the receiver side of a digital transmission. They aim to achieve a reliable and efficient transmission. For high data rates, the energy consumption of their corresponding algorithms is expected to become a limiting factor. For mobile devices with limited battery’s size, the energy consumption, mirrored in the lifetime of the battery, becomes even more crucial. Therefore, an energy-efficient implementation of equalization and decoding algorithms is desirable. The prevailing way is by increasing the energy efficiency of the underlying digital circuits. However, we address here promising alternatives offered by mixed (analog/digital) circuits. We are concerned with modeling joint equalization and decoding as a whole in a continuous-time framework. In doing so, continuous-time recurrent neural networks play an essential role because of their nonlinear characteristic and special suitability for analog very-large-scale integration (VLSI). Based on the proposed model, we show that the superiority of joint equalization and decoding (a well-known fact from the discrete-time case) preserves in analog. Additionally, analog circuit design related aspects such as adaptivity, connectivity and accuracy are discussed and linked to theoretical aspects of recurrent neural networks such as Lyapunov stability and simulated annealing