Molecular communications techniques for the internet of bio-nano things

The ”Internet of Bio-Nano Things” (IoBNT) is a new networking paradigm defined as the interconnection of nanoscale devices. IoBNT is a revolutionizing concept that will likely enable a wide range of applications, in particular, it is envisioned that healthcare systems will be transformed with the development and integration of body-centric networks into future generations of communication systems. Within this context, molecular communications (MC) emerge as the most promising way of transmitting information for in-body communications, due to being inherently biocompatible, energy-efficient, and robust in physiological conditions. One of the biggest challenges is how to minimize the effects of environmental noise and reduce intersymbol interference (ISI) which can be very high in an MC via diffusion scenario. Analogous to traditional communications, channel coding is one of the most promising types of techniques for addressing this problem. This work is based on the study and evaluation of novel energy efficient and low complexity coding, modulation and detection schemes for MC. With a special focus on the implementation of Tomlinson, Cercas, Hughes (TCH) codes as a new attractive approach for the MC environment, due to the particular codeword properties which enable simplified detection. Simulation results show that TCH codes are more effective for these scenarios when compared to other existing alternatives, without introducing too much complexity or processing power into the system. Furthermore, an experimental macroscale proof-of-concept is described, which uses pH as the information carrier and demonstrates that the proposed TCH codes can improve the reliability in this type of communication channel.A ”Internet das Coisas” Bio-Nano é um novo paradigma de rede definido como a interconexão de dispositivos nano escala. Este é um conceito revolucionário que espectavelmente permitirá uma vasta gama de aplicações. Em particular, prevê-se que os sistemas de saúde sejam transformados com a integração de redes centradas no corpo, em futuras gerações de sistemas de comunicação. Neste contexto, as comunicações moleculares (CM) emergem como a forma mais promissora de transmitir informação, devido ao facto de serem intrinsecamente biocompatíveis, eficientes em termos energéticos e robustos em condições fisiológicas. Um dos maiores desafios é como minimizar os efeitos do ruído ambiental e reduzir a interferência intersimbólica que pode ser muito elevada num cenário de CM por difusão. A codificação de canal é um dos tipos de técnicas mais promissoras para abordar este problema. Este trabalho baseia-se na avaliação da modulação, da deteção e de novos esquemas de codificação energeticamente eficientes e de baixa complexidade aplicados em CM. Com especial foco, na implementação de códigos Tomlinson, Cercas, Hughes (TCH) como uma nova abordagem para um ambiente de CM, devido às suas particulares propriedades das palavras de código, que permitem uma deteção simplificada. Os resultados das simulações mostram que os códigos TCH são mais eficazes para estes cenários quando comparados com outras alternativas existentes, sem introduzir demasiada complexidade ou poder de processamento no sistema. Adicionalmente, é descrita uma experiência macroscópica, que utiliza o pH como portador de informação, demonstrando que os códigos TCH propostos podem melhorar a fiabilidade para CM

Design of tch-type sequences for communications

This thesis deals with the design of a class of cyclic codes inspired by TCH codewords. Since TCH codes are linked to finite fields the fundamental concepts and facts about abstract algebra, namely group theory and number theory, constitute the first part of the thesis. By exploring group geometric properties and identifying an equivalence between some operations on codes and the symmetries of the dihedral group we were able to simplify the generation of codewords thus saving on the necessary number of computations. Moreover, we also presented an algebraic method to obtain binary generalized TCH codewords of length N = 2k, k = 1,2, . . . , 16. By exploring Zech logarithm’s properties as well as a group theoretic isomorphism we developed a method that is both faster and less complex than what was proposed before. In addition, it is valid for all relevant cases relating the codeword length N and not only those resulting from N = p

Power Flow Control In Hybrid Ac/Dc Microgrids

Microgrid structures allow for more efficient utilization of renewable resources as well as autonomous operation. Ideally, a centralized controller would be available to allow for an optimizer to take all components into account so that they may collaboratively work towards a shared goal. To this end, a centralized optimization method was developed called the squared slack interior point method. The novelty of this method is that it incorporates the fraction to bound rule to alleviate the known ill-conditioning introduced by utilizing squared slack variables to handle inequality constraints. In addition, this method also allows for inequality constraint violations to be quantified in the same manner that equality constraints are quantified. The proposed method is found to quickly and accurately calculate the optimal power flow and reject solutions that violate the inequality constraints beyond some specified tolerance. Where centralized information is not available, a decentralized method is required. In this method, constrained game theoretical optimization is utilized. However, due to unknown information about remote loads, inconsistent solution among players result in overloaded generators. To alleviate this issue, two perturbation methods are introduced. The first is overload feedback and the second is the perturb and observe squeeze method. In both methods, the goal is to adjust voltage angles and magnitudes to locally manage generator output. Both methods are found to rapidly drive overloaded sources back within their desired tolerances. Moreover, the game theoretical approach is found to have poor performance in the absence of shared load information among players. It is determined that the localized optimizers should be removed to reduce cost and that the operating condition should be perturb starting from the most recently available power flow calculation or starting from the nominal value. Also, to manage voltage stability in the absence of communication, a Hamiltonian approach is implemented for the voltage source rectifier. This approach resulted in a highly stable voltage and a fast response to large step changes. The method was able to maintain the reference dc output at unity power factor while not requiring any information about loading or interconnection

Conversor configurável analógico para informação.

Nos conversores Analógicos Digitais (ADC) com frequência de conversão baseada no Teorema de Nyquist, o parâmetro básico para orientar a aquisição é a largura de banda do sinal. O tratamento da informação e a remoção da redundância são realizados após a representação digital obtida do sinal. A Amostragem Compressiva foi proposta como uma técnica de digitalização que explora a esparsidade do sinal em um determinado domínio, para capturar apenas seu conteúdo de informação, com uma taxa que pode ser menor do que a preconizada pelo Teorema de Nyquist. As arquiteturas em hardware para implementar a Amostragem Compressiva são chamadas de Conversores Analógicos para Informação (AIC). Os AIC propostos na bibliografia exploram a esparsidade do sinal em um determinado domínio, e por isso cada arquitetura é especifica para uma classe de sinais. Nesta tese propõe-se um AIC configurável, baseado em arquiteturas conhecidas, capaz de adquirir sinais de várias classes, alterando seus parâmetros de configuração. No trabalho desenvolveu-se um modelo computacional, que permite analisar o comportamento dinâmico do AIC, e dos parâmetros de hardware propostos, bem como foi feita a implementação física da arquitetura proposta. Verificou-se a adaptabilidade dessa arquitetura a partir dos resultados obtidos, pois foi possível fazer a aquisição de mais de uma classe de sinais.In analog-to-digital converters (ADC) based on Nyquist Theorem, the basic parameter to guide acquisition is the bandwidth of the signal. The information processing and redundancy removal are performed after the digital representation obtained from the signal. Compressed Sensing was proposed as a digitalization technique that exploits the sparsity of the signal in a given domain to capture only its information content, at a rate that may be lower than that advocated by the Nyquist Theorem. The hardware architectures to implement Compressed Sensing are called Analog to Information Converters (AIC). The AICs proposed in the bibliography exploit the sparsity of the signal in a given domain, and therefore each architecture is specific for a class of signals. This thesis proposes a configurable AIC, based on known architectures, capable of acquiring signals from several classes, changing its configuration parameters. A computational model was developed to analyze the dynamic behavior of AIC and proposed hardware parameters, as well as the physical implementation of the proposed architecture. It was verified the adaptability of the proposed architecture from the obtained results, since it was possible to perform the acquisition of more than one class of signals.Cape

Multiphoton Quantum Optics and Quantum State Engineering

We present a review of theoretical and experimental aspects of multiphoton quantum optics. Multiphoton processes occur and are important for many aspects of matter-radiation interactions that include the efficient ionization of atoms and molecules, and, more generally, atomic transition mechanisms; system-environment couplings and dissipative quantum dynamics; laser physics, optical parametric processes, and interferometry. A single review cannot account for all aspects of such an enormously vast subject. Here we choose to concentrate our attention on parametric processes in nonlinear media, with special emphasis on the engineering of nonclassical states of photons and atoms. We present a detailed analysis of the methods and techniques for the production of genuinely quantum multiphoton processes in nonlinear media, and the corresponding models of multiphoton effective interactions. We review existing proposals for the classification, engineering, and manipulation of nonclassical states, including Fock states, macroscopic superposition states, and multiphoton generalized coherent states. We introduce and discuss the structure of canonical multiphoton quantum optics and the associated one- and two-mode canonical multiphoton squeezed states. This framework provides a consistent multiphoton generalization of two-photon quantum optics and a consistent Hamiltonian description of multiphoton processes associated to higher-order nonlinearities. Finally, we discuss very recent advances that by combining linear and nonlinear optical devices allow to realize multiphoton entangled states of the electromnagnetic field, that are relevant for applications to efficient quantum computation, quantum teleportation, and related problems in quantum communication and information.Comment: 198 pages, 36 eps figure

Pattern classification based multiuser detectors for CDMA communication systems

Master'sMASTER OF ENGINEERIN

Discrete Mathematics and Symmetry

Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group