Abstract of signal processing: peak detection, Chenjiang Zhao

This thesis aims to count the translocations of the nanoparticles through the nanopipette. We design the MATLAB scripts to count, using the data from excel files which are provided by the biology group. We implement some signal processing theorems to analyze the data, and use MATLAB to verify the theories.

Abstract

Peak Detection to Count Gold Nanoparticles Translocations in Nanopipette

by

Jie Cheng

This research paper presents a detailed documentation of a method designed to

count the number of nanoparticle translocations. The report discusses fundamental

theory of signal processing techniques and explanation of practical implementation

in MATLAB. Experimental data was analyzed and the results are presented

and discussed thoroughly.

Network Coding provides some benefits in terms of performance efficiency and throughput in dynamic environments such as Mobile Ad Hoc networks. However Network Coding also adds considerable overhead and computational complexity at the transmitter and receiver. Hence the need to come up with an algorithm to provide the optimum performance with minimum overhead and computational complexity arises. We propose an adaptive network coding technique that enables the source node to switch between storing and forwarding the original packets into the network and performing Random linear network coding (RLNC) of the packets of a file and send the coded packets into the network. We evaluate the performance of this adaptive technique by comparing it with MANETs with and without network coding. According to the adaptive Network Coding strategy, the source nodes, make the decision of switching network coding ON and OFF based on the size of the file, the estimated link expiration time between the nodes and the data rate of the network. We propose to switch off Network Coding in the nodes transmit the packets of the file directly when the File size is lesser than the maximum data that can be transmitted with the given data rate of the link and the estimated link expiration time. Otherwise the nodes switch On Network Coding and send coded packets into the networks.

Space-time convolutional code (STCC) is a technique that combines transmit diversity and coding to improve reliability in wireless fading channels. In this proposal, we demonstrate a sys- tematic design of multi-level quadrature amplitude modulation (M-QAM) STCCs utilizing quadra- ture phase shift keying (QPSK) STCC as component codes for any number of transmit antennas. Morever, a low complexity decoding algorithm is introduced, where the decoding complexity in- creases linearly by the number of transmit antennas. The approach is based on utilizing a group interference cancellation technique also known as combined array processing (CAP) technique.

Finally, our research topic will explore:

* with the current approach, a scalable STTC with better performance as compared to space- time block code (STBC) combined with multiple trellis coded modulation (MTCM) also known as STBC-MTCM;

* the design of low complexity decoder for STTC;

* the combination of our approach with multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM).

Extensive growth of Internet applications like communication, education, and leisure, along with the privacy concerns and significant amount of personalized contents, have clearly affected the connectivity of the networks and the users' behavior. The social nature of today's networks' users (the term 'social' is used as a general technical term for network users with specific mutual relationships, and can address a large domain of users, including but not limited to social media users) has in turn a major influence on the networks' shapes and characteristics. On the other hand, with the emergence of advanced hardware and software technologies which enable significant processing power and storage space in mobile devices, and with their ever increasing widespread use, today's Internet is moving from an infrastructure-based network towards a wireless ad-hoc network. Besides, caching data within the network is going to be inevitable to improve latency and reduce bandwidth consumption, and storage is being considered as one of the network primitives.

This research, thus, investigates the impact of the above aspects of today's networks on the performance. It first discusses and evaluates the effect of users' social behavior on the maximum achievable data rate in the wireless ad-hoc networks, and proves that social connection among nodes may actually help in scaling wireless networks. It also reveals that due to their different social status, various users have different effects on the performance, and therefore, traditional transport capacity concept for wireless networks is not appropriate for these types of networks.

Second part of this work investigates the improvements in the fundamental limits of the performance metrics in networks of caches, and evaluates the effect of different caching policies and content searching algorithms on the obtained improvements. Then a framework is presented to quantify the overhead traffic of locating contents, and is later used to define some optimal policies with respect to the contents that should be cached for an operator-driven content distribution system. This framework can generally be used in many other distributed systems contexts where a control plane has to stay aware of the state of the forwarding plane.

Coded caching in wireless networks and storage systems is studied. Caching based on two types of codes, index codes and fountain codes, is investigated in terms of network throughput and security. It is shown that index coding can significantly increase the multicast transmission rate in Information Centric Networks (ICN). Also, it is proved that index codes can be efficiently used to increase the multicasting transmission rate in cellular networks. It is proved that a simple graph coloring-based algorithm for index coding achieves order optimal capacity gains both for cellular and ICN networks. A new decentralized caching scheme based on Random Linear Fountain (RLF) codes is then introduced and it is shown that RLF-based coded caching performs close to optimal in terms of reducing the average number of transmission hops in wireless ad hoc and cellular networks. Therefore, considerable capacity gains can be achieved using RLF-based coded caching in wireless networks. It is shown that the RLF codes can significantly reduce the overcaching in wireless networks. Further, it is shown that using coded caching based on RLF codes we can achieve asymptotic perfect secrecy. In the limiting case of large number of coded files, the conditions of Shannon secrecy theorem are met and the problem can be modelled by a Shannon cipher system which is perfectly secure. Finally, a new storage policy based on RLF codes for storage systems along with a Private Information Retrieval (PIR) scheme for these systems is proposed and it is proved that perfect privacy and secrecy is achievable in these systems.