Future wireless networks will be required to support multimedia traffic in addition to traditional best-effort network services. Supporting multimedia traffic on wired networks presents a large number of design problems, particularly for networks that run connectionless data transport protocols such as the TCP/IP protocol suite. These problems are magnified for wireless links, as the quality of such links varies widely and uncontrollably. This dissertation presents new tools developed for the design and realization of wireless networks including, for the first time, analytical channel models for predicting the efficacy of error control codes, interleaving schemes, and signalling protocols, and several novel algorithms for matching and adapting system parameters (such as error control and frame length) to time-varying channels and Quality of Service (QoS) requirements.

The objective of the proposed research is to design and evaluate end-to-end solutions to support the Quality of Experience (QoE) for the Internet Protocol Television (IPTV) service. IPTV is a system that integrates voice, video, and data delivery into a single Internet Protocol (IP) framework to enable interactive broadcasting services at the subscribers. It promises significant advantages for both service providers and subscribers. For instance, unlike conventional broadcasting systems, IPTV broadcasts will not be restricted by the limited number of channels in the broadcast/radio spectrum. Furthermore, IPTV will provide its subscribers with the opportunity to access and interact with a wide variety of high-quality on-demand video content over the Internet. However, these advantages come at the expense of stricter quality of service (QoS) requirements than traditional Internet applications. Since IPTV is considered as a real-time broadcast service over the Internet, the success of the IPTV service depends on the QoE perceived by the end-users. The characteristics of the video traffic as well as the high-quality requirements of the IPTV broadcast impose strict requirements on transmission delay. IPTV framework has to provide mechanisms to satisfy the stringent delay, jitter, and packet loss requirements of the IPTV service over lossy transmission channels with varying characteristics. The proposed research focuses on error recovery and channel change latency problems in IPTV networks. Our specific aim is to develop a content delivery framework that integrates content features, IPTV application requirements, and network characteristics in such a way that the network resource utilization can be optimized for the given constraints on the user perceived service quality. To achieve the desired QoE levels, the proposed research focuses on the design of resource optimal server-based and peer-assisted delivery techniques. First, by analyzing the tradeoffs on the use of proactive and reactive repair techniques, a solution that optimizes the error recovery overhead is proposed. Further analysis on the proposed solution is performed by also focusing on the use of multicast error recovery techniques. By investigating the tradeoffs on the use of network-assisted and client-based channel change solutions, distributed content delivery frameworks are proposed to optimize the error recovery performance. Next, bandwidth and latency tradeoffs associated with the use of concurrent delivery streams to support the IPTV channel change are analyzed, and the results are used to develop a resource-optimal channel change framework that greatly improves the latency performance in the network. For both problems studied in this research, scalability concerns for the IPTV service are addressed by properly integrating peer-based delivery techniques into server-based solutions.

The time-dependent Schrödinger equation (TDSE) models the quantum nature of molecular processes.  Numerical simulations based on the TDSE help in understanding and predicting the outcome of chemical reactions. This thesis is dedicated to the derivation and analysis of efficient and reliable simulation tools for the TDSE, with a particular focus on models for the interaction of molecules with time-dependent electromagnetic fields. Various time propagators are compared for this setting and an efficient fourth-order commutator-free Magnus-Lanczos propagator is derived. For the Lanczos method, several communication-reducing variants are studied for an implementation on clusters of multi-core processors. Global error estimation for the Magnus propagator is devised using a posteriori error estimation theory. In doing so, the self-adjointness of the linear Schrödinger equation is exploited to avoid solving an adjoint equation. Efficiency and effectiveness of the estimate are demonstrated for both bounded and unbounded states. The temporal approximation is combined with adaptive spectral elements in space. Lagrange elements based on Gauss-Lobatto nodes are employed to avoid nondiagonal mass matrices and ill-conditioning at high order. A matrix-free implementation for the evaluation of the spectral element operators is presented. The framework uses hybrid parallelism and enables significant computational speed-up as well as the solution of larger problems compared to traditional implementations relying on sparse matrices. As an alternative to grid-based methods, radial basis functions in a Galerkin setting are proposed and analyzed. It is found that considerably higher accuracy can be obtained with the same number of basis functions compared to the Fourier method. Another direction of research presented in this thesis is a new algorithm for quantum optimal control: The field is optimized in the frequency domain where the dimensionality of the optimization problem can drastically be reduced. In this way, it becomes feasible to use a quasi-Newton method to solve the problem. / eSSENCE

Recent designs for low-density parity-check (LDPC) codes have exhibited capacity approaching performance for large block length, overtaking the performance of turbo codes. While theoretically impressive, LDPC codes present some challenges for practical implementation. In general, LDPC codes have higher encoding complexity than turbo codes both in terms of computational latency and architecture size. Decoder circuits for LDPC codes have a high routing complexity and thus demand large amounts of circuit area. There has been recent interest in developing analog circuit architectures suitable for decoding. These circuits offer a fast, low-power alternative to the digital approach. Analog decoders also have the potential to be significantly smaller than digital decoders. In this thesis we present a novel and efficient approach to LDPC encoder / decoder (codec) design. We propose a new algorithm which allows the parallel decoder architecture to be reused for iterative encoding. We present a new class of LDPC codes which are iteratively encodable, exhibit good empirical performance, and provide a flexible choice of code length and rate. Combining the analog decoding approach with this new encoding technique, we design a novel time-multiplexed LDPC codec, which switches between analog decode and digital encode modes. In order to achieve this behaviour from a single circuit we have developed mode-switching gates. These logic gates are able to switch between analog (soft) and digital (hard) computation, and represent a fundamental circuit design contribution. Mode-switching gates may also be applied to built-in self-test circuits for analog decoders. Only a small overhead in circuit area is required to transform the analog decoder into a full codec. The encode operation can be performed two orders of magnitude faster than the decode operation, making the circuit suitable for full-duplex applications. Throughput of the codec scales linearly with block size, for both encode and decode operations. The low power and small area requirements of the circuit make it an attractive option for small portable devices.

Ces travaux se placent dans le contexte de l'étude des champs profonds hyperspectraux produits par l'instrument d'observation céleste MUSE. Ces données permettent de sonder l'Univers lointain et d'étudier les propriétés physiques et chimiques des premières structures galactiques et extra-galactiques. La première problématique abordée dans cette thèse est l'attribution d'une signature spectrale pour chaque source galactique. MUSE étant un instrument au sol, la turbulence atmosphérique dégrade fortement le pouvoir de résolution spatiale de l'instrument, ce qui génère des situations de mélange spectral pour un grand nombre de sources. Pour lever cette limitation, des approches de fusion de données, s'appuyant sur les données complémentaires du télescope spatial Hubble et d'un modèle de mélange linéaire, sont proposées, permettant la séparation spectrale des sources du champ. Le second objectif de cette thèse est la détection du Circum-Galactic Medium (CGM). Le CGM, milieu gazeux s'étendant autour de certaines galaxies, se caractérise par une signature spatialement diffuse et de faible intensité spectrale. Une méthode de détection de cette signature par test d'hypothèses est développée, basée sur une stratégie de max-test sur un dictionnaire et un apprentissage des statistiques de test sur les données. Cette méthode est ensuite étendue pour prendre en compte la structure spatiale des sources et ainsi améliorer la puissance de détection tout en conservant un contrôle global des erreurs. Les codes développés sont intégrés dans la bibliothèque logicielle du consortium MUSE afin d'être utilisables par l'ensemble de la communauté. De plus, si ces travaux sont particulièrement adaptés aux données MUSE, ils peuvent être étendus à d'autres applications dans les domaines de la séparation de sources et de la détection de sources faibles et étendues. / This work takes place in the context of the study of hyperspectral deep fields produced by the European 3D spectrograph MUSE. These fields allow to explore the young remote Universe and to study the physical and chemical properties of the first galactical and extra-galactical structures.The first part of the thesis deals with the estimation of a spectral signature for each galaxy. As MUSE is a terrestrial instrument, the atmospheric turbulences strongly degrades the spatial resolution power of the instrument thus generating spectral mixing of multiple sources. To remove this issue, data fusion approaches, based on a linear mixing model and complementary data from the Hubble Space Telescope are proposed, allowing the spectral separation of the sources.The second goal of this thesis is to detect the Circum-Galactic Medium (CGM). This CGM, which is formed of clouds of gas surrounding some galaxies, is characterized by a spatially extended faint spectral signature. To detect this kind of signal, an hypothesis testing approach is proposed, based on a max-test strategy on a dictionary. The test statistics is learned on the data. This method is then extended to better take into account the spatial structure of the targets, thus improving the detection power, while still ensuring global error control.All these developments are integrated in the software library of the MUSE consortium in order to be used by the astrophysical community.Moreover, these works can easily be extended beyond MUSE data to other application fields that need faint extended source detection and source separation methods.

Orientador: Yuzo Iano / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-11T08:32:05Z (GMT). No. of bitstreams: 1 Caetano_DiogoGara_M.pdf: 6545832 bytes, checksum: d1bdaa84e6d542ee7380aadc0423d44b (MD5) Previous issue date: 2007 / Resumo: O objetivo deste trabalbo foi estudar o desempenho de codificadores de canal com decodificação iterativa e diferentes esquemas de concatenação de codificadores para sistemas de TV digital móveis tais como: DVB-H e ISDB- T. Contribui-se com uma proposta de concatenação de codificadores para sistemas COFDM avaliada através de implementação computacional. Os resultados gerados nesta pesquisa demonstram ganhos de codificação em relação a sistemas padronizados de TV digital. Estes ganhos de codificação são referentes à utilização de codificadores BCH concatenados com codificadores Turbo e LDPC. As simulações ocorreram em canais com multipercurso, distribuição Rayleigh, ruído gaussiano branco e outros canais típicos de radiodifusão utilizados no Brasil para testes de TV digital / Abstract: The aim of this work is to study the performance of channel encoders with iterative decoder: and also different encoders concatenation schemes to mobile digital television standards ;; DVB-H and ISDB-T. The contribution of this work is a proposal of encoder concatenatic scheme for COFDM systems evaluated through software implementation. The final results I this work presents overall coding gain with respect to digital TV standards. The gain presenb in this work is regarded to the concatenation of BCH encoders with Turbo and LDPC encodel The simulations were performed over multipath, Rayleigh, A WGN and typical Brazili: broadcast channels used for digital TV trials / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Neste trabalho, uma combinação do Método dos Elementos de Contorno (MEC) com o Método dos Elementos Finitos (MEF) é apresentada para análise bidimensional de sólidos elastostáticos reforçados, sendo considerados modelos de aderência no acoplamento. O elemento de contorno é adotado para modelar o comportamento do domínio, enquanto que o modelo por elementos finitos é utilizado para modelar o enrijecedor. Devido às singularidades nas equações integrais do MEC, estudou-se o erro ocasionado pelos integrandos de ordem e e como conseqüência sugerem-se, neste trabalho, equações mais simples para representar o erro das integrações. Para a formulação do acoplamento, um polinômio do terceiro grau é adotado para aproximar tanto o campo de deslocamento quanto a rotação do enrijecedor, enquanto aproximações lineares são usadas para representar a força de contato entre o domínio e o enrijecedor. Modelos de escorregamento, apresentados, são lineares e governados em função do carregamento escrito em termos das forças de contato e o deslocamento relativo. A partir da combinação entre o MEC e o MEF obtém-se uma matriz retangular contendo duas equações para o MEC e uma para o MEF. O resultado das equações algébricas redundantes é eliminado pela aplicação do procedimento dos mínimos quadrados. Exemplos ilustram o bom ajuste e os melhores resultados proporcionados pelo controle do erro das equações integrais, mostrando ainda através de exemplos, a potencialidade e as limitações no acoplamento entre os dois materiais, considerando modelos de aderência ou não. / In this work it is presented a coupling between the Boundary Element Method and the Finite Element Method for two-dimensional elastostatic analysis of reinforced bodies considering adherence. The Boundary Element is used to model the matrix while the reinforcement is modeled by the Finite Element. Due to the inherent singularities present in Boundary Element formulations the quadrature rules, used to develop the necessary integrals may present undesired errors. In this sense the behavior of this integration error is studied and a simple way to control it is proposed along the work. Regarding the coupling formulation a third degree polynomial is adopted to describe the displacements and rotations of the reinforcement, while a linear polynomial is used to describe the contact forces among the continuum and the reinforcement. Adherence (or sliding) models are presented and implemented in the computer code. A linear relation between relative displacement and transmitted force is adopted. From difference of approximation regarding contact forces and displacements a rectangular matrix arrises from the BEM/FEM coupling. The additional equations are eliminated by the use of a least square method based on the multiplication of transpose matrices. Examples are shown to demonstrate the good behavior of error control applied on gaussian quadratures regarding Boundary Element simulations for coupled or not situations, considering or not adherence models.

Orientador: Celso de Almeida / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-19T04:18:46Z (GMT). No. of bitstreams: 1 AltamiranoCarrillo_CarlosDaniel_M.pdf: 813233 bytes, checksum: 862b6d12c2e773acbd4f388a59e9eadd (MD5) Previous issue date: 2011 / Resumo: Este trabalho avalia os efeitos da interferência de co-canal na taxa de erro de bits (BER) de sistemas de transmissão digitais sem fio. O ambiente do sistema considera canais com ruído gaussiano (AWGN) e canais com desvanecimento Rayleigh na presença de um interferente de co-canal dominante, onde os usuários empregam esquemas de modulação BPSK e M-QAM e também códigos corretores de erros. Os códigos corretores de erros utilizados em sistemas com expansão de banda são os códigos convolucional e turbo, e em sistemas sem expansão de banda são a modulação-codificada por treliça (TCM) e a modulação-codificada turbo (TTCM). Os efeitos da interferência de co-canal na taxa de erro de bit serão avaliados derivando-se expressões teóricas e mediante a simulação de Monte Carlo, variando o tipo de canal e os esquemas de modulação e codificação. Este trabalho mostra que a interferência de co-canal introduz patamares na taxa de erro de bit, que os sistemas sem expansão de banda são mais susceptíveis à interferência e que os códigos corretores de erro são uma boa ferramenta para mitigar os efeitos da interferência de co-canal / Abstract: This work evaluates the effects of co-channel interference on the bit error rate (BER) of digital transmission systems. The transmission system considers gaussian noise channels (AWGN) and Rayleigh fading channels in the presence of a dominant co-channel interferer, where all users employ BPSK and M-QAM modulations and error control coding. For systems that present bandwidth expansion the considered error control codes are convolutional and turbo codes, and for systems that do not present bandwidth expansion are considered trellis coded modulation (TCM) and turbo trellis coded modulation (TTCM). The effects of co-channel interference on the bit error rate are evaluated by deriving theoretical expressions and via Monte Carlo simulation, varying the channel type, the modulation and coding schemes. This work shows that co-channel interference introduces floors on the bit error rate, that systems without bandwidth expansion are more susceptible to interference, and that error control codes are a good tool to mitigate the co-channel interference effects / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Orientador: Reginaldo Palazzo Júnior / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-18T18:43:43Z (GMT). No. of bitstreams: 1 Faria_LuzineteCristinaBonanide_D.pdf: 17107444 bytes, checksum: 4faf2de7876247b3c74423dc7a3043d1 (MD5) Previous issue date: 2011 / Resumo: Um dos grandes desafios da comunidade científica em teorias da informação genética, comunicação genética e codificação genética é verificar a existência de uma estrutura matemática relacionada com a estrutura do DNA. Este trabalho propõe modelos para o sistema de comunicação de informação genética e genômica análogos ao modelo de um sistema de comunicação digital. Ambos os modelos são capazes de identificar, reproduzir e classificar matematicamente diferentes sequências de DNA. O primeiro identifica e reproduz a sequência de nucleotídeos de uma fita simples do DNA através da codificação genética e, o segundo identifica e reproduz a sequência das bases complementares da fita dupla do DNA através da codificação genômica. Os objetivos principais do presente trabalho são: a) caracterização matemática dos modelos de codificação genética e codificação genômica, b) proposta de um algoritmo para identificação de sequências de DNA; c) mostrar que sequências de DNA com características biológicas distintas, incluindo proteínas, gene e genoma em termos das fitas simples do DNA e da dupla hélice do DNA são identificadas como palavras-código dos códigos G-linearidade (BCH sobre corpos e BCH sobre anéis), reproduzidas e classificadas matematicamente, d) representação algébrica via polinômios primitivos/geradores e seus polinômios recíprocos das fitas simples do DNA (fita codante e fita não codante) e da dupla hélice do DNA, e) mostrar a existência de códigos concatenados (nested codes) entre algumas sequências de direcionamento e suas respectivas proteínas organelares, f) mostrar a arquitetura biológica (Biological frame) do genoma do plasmídeo Lactococcus lactis. Os resultados apresentados neste trabalho contribuem para o desenvolvimento de uma metodologia que poderá ser aplicada em análises mutacionais e de polimorfismos, produção de novos fármacos, melhoramento genético, entre outros, reduzindo tempo e custos laboratoriais / Abstract: One of the great challenges of the scientific community on theories of genetic information, genetic communication and genetic coding is to determine a mathematical structure related to the structure of DNA. This thesis proposes a model of a communication system for genetic and genomic information similar to the model of a digital communication system. Both models are able to identify, reproduce and classify mathematically different sequences of DNA. The first model identifies and reproduces the nucleotide sequence of a single DNA strand via the genetic encoding. The latter identifies and reproduces the sequence of the complementary bases of the double DNA strand through genomic encoding. The aims of this work are: a) a mathematical characterization of the models of genetic coding and genomic coding, b) the proposal of an algorithm for the identification of DNA sequences, c) to show that DNA sequences with distinct biological characteristics, including protein, gene and genome in terms of the single strands of DNA and of the double helix of DNA are identified as codewords of the G-linearity codes (BCH codes over fields and BCH codes over rings), mathematically reproduced and classified, d) algebraic representation via primitive/generator polynomials and their reciprocal polynomials of single DNA strands (coding strand and non-coding strand) and the double DNA strand, e) to show the existence of concatenated codes (nested codes) between some targeting sequences and their corresponding organelles proteins, f) to show the biological architecture (Biological frame) of the plasmid Lactococcus lactis genome. The results presented in this work contribute to the development of a methodology that can be applied to mutational analysis and polymorphisms, production of new drugs, genetic improvement, among others, reducing time and laboratory costs / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica

Aufgrund der fundamentalen Bedeutung partieller Differentialgleichungen zur Beschreibung von Phänomenen in angewandten Wissenschaften ist deren Analyse ein Kerngebiet der Mathematik. Durch Computer lassen sich die Lösungen für eine Vielzahl dieser Gleichungen näherungsweise bestimmen. Die dabei verwendeten numerischen Verfahren sollen auf möglichst exakte Approximationen führen und deren Genauigkeit verifizieren. Die Least-Squares Finite-Elemente-Methode (LSFEM) und die unstetige Petrov-Galerkin (DPG) Methode sind solche Verfahren. Sie werden in dieser Dissertation untersucht. Der erste Teil der Arbeit untersucht die Genauigkeit der mittels LSFEM berechneten Näherungen. Dazu werden Eigenschaften der zugrundeliegenden Differentialgleichungen mit den Eigenschaften der LSFEM kombiniert. Dies zeigt, dass die Abweichung der berechneten Näherung von der exakten Lösung einem berechenbaren Residuum asymptotisch entspricht. Ferner wird ein Verfahren zu Berechnung einer garantierten oberen Fehlerschranke eingeführt. Während etablierte Fehlerschätzer den Fehler signifikant überschätzt, zeigen numerische Experimente eine äußerst geringe Überschätzung des Fehlers mittels der neuen Fehlerschranke. Die Analyse der Fehlerschranken für das Stokes-Problem offenbart ein Beziehung der LSFEM und der LBB Konstanten. Diese Konstante ist entscheidend für die Existenz und Stabilität von Lösungen in der Strömungslehre. Der zweite Teil der Arbeit nutzt diese Beziehung und entwickelt ein auf der LSFEM basierendes Verfahren zur numerischen Berechnung der LBB Konstanten. Der dritte Teil der Arbeit untersucht die DPG Methode. Dabei werden existierende Anwendungen der DPG Methode zusammengefasst und analysiert. Diese Analyse zeigt, dass sich die DPG Methode als eine leicht gestörte LSFEM interpretieren lässt. Diese Interpretation erlaubt die Anwendung der Resultate aus dem ersten Teil der Arbeit und ermöglicht dadurch eine genauere Untersuchung existierender und die Entwicklung neuer DPG Methoden. / The analysis of partial differential equations is a core area in mathematics due to the fundamental role of partial differential equations in the description of phenomena in applied sciences. Computers can approximate the solutions to these equations for many problems. They use numerical schemes which should provide good approximations and verify the accuracy. The least-squares finite element method (LSFEM) and the discontinuous Petrov-Galerkin (DPG) method satisfy these requirements. This thesis investigates these two schemes. The first part of this thesis explores the accuracy of solutions to the LSFEM. It combines properties of the underlying partial differential equation with properties of the LSFEM and so proves the asymptotic equality of the error and a computable residual. Moreover, this thesis introduces an novel scheme for the computation of guaranteed upper error bounds. While the established error estimator leads to a significant overestimation of the error, numerical experiments indicate a tiny overestimation with the novel bound. The investigation of error bounds for the Stokes problem visualizes a relation of the LSFEM and the Ladyzhenskaya-Babuška-Brezzi (LBB) constant. This constant is a key in the existence and stability of solution to problems in fluid dynamics. The second part of this thesis utilizes this relation to design a competitive numerical scheme for the computation of the LBB constant. The third part of this thesis investigates the DPG method. It analyses an abstract framework which compiles existing applications of the DPG method. The analysis relates the DPG method with a slightly perturbed LSFEM. Hence, the results from the first part of this thesis extend to the DPG method. This enables a precise investigation of existing and the design of novel DPG schemes.