Orientador: Michel Daoud Yacoub / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-11T01:33:04Z (GMT). No. of bitstreams: 1 Costa_DanielBenevidesda_D.pdf: 3159088 bytes, checksum: 3d5d46070c5516bbaa070eba5e52e8e3 (MD5) Previous issue date: 2008 / Resumo: Recentemente, três novos modelos probabilísticos de canal, modelos a-u, ?-u e ?-u, foram propostos com o intuito de prover uma análise mais realística do sinal propagante. Por apresentarem um grau de liberdade a mais que os demais já existentes na literatura, um melhor ajuste a medidas de campo verificou-se com a utilização dos mesmos. Esta tese provê uma caracterização estatística para estes modelos de desvanecimento generalizados. Tal caracterização engloba tanto estatísticas de primeira como de segunda ordem. Aproximações simples e precisas para a soma de variáveis e processos aleatórios são propostas. Inúmeras métricas de desempenho em ambientes com e sem diversidade na recepção são investigadas de forma exata e aproximada. Dentre estas, podemos citar: probabilidade de outage, taxa de erro de bit, capacidade de canal, taxa de cruzamento de nível, duração média de desvanecimento, dentre outras. Além disso, mostra-se também qual das distribuições generalizadas melhor aproxima a soma de variáveis e processos Nakagami-m, uma vez que todas incluem Nakagami-m como caso especial. Finalmente, expressões exatas e aproximadas para a taxa de cruzamento de nível de canaisWeibull correlacionados e não idênticos em receptores multirramos são apresentadas / Abstract: Recently, three new channel models, a-u, ?-u and ?-u, were proposed with the aim to provide a more realistic analysis of the propagate signal. Due to they have one degree of freedom more than those already existing in the literature, a better adjust to field measurement data was attested with their use. This thesis deals with the statistical characterization of these generalized fading models. Such a characterization includes both first and second order statistics. Simple and precise approximations to the sum of random variables and processes are proposed. Several performance metrics in scenarios with and without diversity are investigated in an exact and approximate manner. Among them, we may cite: outage probability, bit error probability, channel capacity, level crossing rate, average fade duration, such others. Furthermore, it is shown what is the generalized distribution that better approximate the sum of Nakagami-m variates and processes, once that all of them include Nakagami-m as special case. Finally, exact and approximate expressions for the crossing rates of non-identical correlated Weibull channels in multibranch receivers are presented. / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica

Orientadores: João Marcos Travassos Romano, Francisco Rodrigo Porto Cavalcanti / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-04T00:19:46Z (GMT). No. of bitstreams: 1 Cavalcante_CharlesCasimiro_D.pdf: 8652621 bytes, checksum: bf432c4988b60a8e2465828f4f748b47 (MD5) Previous issue date: 2004 / Resumo: Esta tese é dedicada ao estudo de tecnicas de separação cega de fontes aplicadas ao contexto de processamento multiusuario em comunicações digitais. Utilizando estrategias de estimação da função de densidade de probabilidade (fdp), são propostos dois metodos de processamento multiusuario que permitem recuperar os sinais transmitidos pela medida de similaridade de Kullback-Leibler entre a fdp dos sinais a saida do dispositivo de separação e um modelo parametrico que contem as caracteristicas dos sinais transmitidos. Alem desta medida de similaridade, são empregados diferentes metodos que garantem a descorrelação entre as estimativas das fontes de tal forma que os sinais recuperados sejam provenientes de diferentes fontes. E ainda realizada a analise de convergencia dos metodos e suas equivalencias com tecnicas classicas resultando em algumas importantes relações entre criterios cegos e supervisionados, tais como o criterio proposto e o criterio de maxima a posteriori. Estes novos metodos aliam a capacidade de recuperação da informação uma baixa complexidade computacional. A proposição de metodos baseados na estimativa da fdp permitiu a realização de um estudo sobre o impacto das estatisticas de ordem superior em algoritmos adaptativos para separação cega de fontes. A utilização da expansão da fdp em series ortonormais permite avaliar atraves dos cumulantes a dinamica de um processo de separação de fontes. Para tratar com problemas de comunicação digital e proposta uma nova serie ortonormal, desenvolvida em torno de uma função de densidade de probabilidade dada por um somatorio de gaussianas. Esta serie e utilizada para evidenciar as diferenças em relação ao desempenho em tempo real ao se reter mais estatisticas de ordem superior. Simulações computacionais são realizadas para evidenciar o desempenho das propostas frente a tecnicas conhecidas da literatura em varias situações de necessidade de alguma estrategia de recuperação de sinais / Abstract: This thesis is devoted to study blind source separation techniques applied to multiuser processing in digital communications. Using probability density function (pdf) estimation strategies, two multiuser processing methods are proposed. They aim for recovering transmitted signal by using the Kullback-Leibler similarity measure between the signals pdf and a parametric model that contains the signals characteristics. Besides the similarity measure, different methods are employed to guarantee the decorrelation of the sources estimates, providing that the recovered signals origin from different sources. The convergence analysis of the methods as well as their equivalences with classical techniques are presented, resulting on important relationships between blind and supervised criteria such as the proposal and the maximum a posteriori one. Those new methods have a good trade-off between the recovering ability and computational complexity. The proposal os pdf estimation-based methods had allowed the investigation on the impact of higher order statistics on adaptive algorithms for blind source separation. Using pdf orthonormal series expansion we are able to evaluate through cumulants the dynamics of a source separation process. To be able to deal with digital communication signals, a new orthonormal series expansion is proposed. Such expansion is developed in terms of a Gaussian mixture pdf. This new expansion is used to evaluate the differences in real time processing when we retain more higher order statistics. Computational simulations are carried out to stress the performance of the proposals, faced to well known techniques reported in the literature, under the situations where a recovering signal strategy is required. / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica

Les principales contributions de cette thèse concernent l'identification à temps continu des systèmes par modèles non entiers dans un contexte à erreurs en les variables. Deux classes de méthodes sont développées : la première classe est fondée sur les statistiques d'ordre trois et la deuxième est fondée sur les statistiques d'ordre quatre. Dans chaque classe, deux cas différents sont distingués : le premier cas suppose que tous les ordres de dérivation non entiers sont connus a priori et seuls les coefficients de l'équation différentielle non entière sont estimés en utilisant les estimateurs fondés sur les statistiques d'ordre supérieur. Le deuxième cas suppose que les ordres de dérivation sont commensurables à un ordre nu estimé au même titre que les coefficients de l'équation différentielle non entière par des techniques d'optimisation non linéaire combinées aux estimateurs fondés sur les cumulants d'ordre trois et quatre. Des exemples de simulation numérique illustrent les développements théoriques. Des applications pratiques sur la modélisation du phénomène de diffusion de chaleur dans un barreau d'Aluminium et sur la modélisation d'un système électronique ont montré la pertinence des méthodes développées. / This thesis deals with continuous-time system identification by fractional models in the EIV context. Two classes of methods are developed : the first class is based on third-order statistics and the second one is based on fourth-order statistics. Firstly, all differentiation orders are known a priori and only the coefficients of the differential equation are estimated using the developed algorithms based on higher-order statistics. Then, they are extended to estimate both the fractional differential equation coefficients and the commensurate order. Simulation examples display the theoretical developments on system identification in the EIV context. A practical application for modeling heat transfer phenomena in an aluminium rod and for modeling an electronic real system have shown the efficiency of the developed methods.

Dans cette thèse, nous nous attachons à étudier des classes de graphes infinis et leurs propriétés, Notamment celles de vérification de modèles, d'accessibilité et de langages reconnus.Nous définissons une notion d'arbres de piles ainsi qu'une notion liée de réécriture suffixe, permettant d'étendre à la fois les automates à piles d'ordre supérieur et la réécriture suffixe d'arbres de manière minimale. Nous définissons également une notion de reconnaissabilité sur les ensembles d'opérations à l'aide d'automates qui induit une notion de reconnaissabilité sur les ensembles d'arbres de piles et une notion de normalisation des ensembles reconnaissables d'opérations analogues à celles existant sur les automates à pile d'ordre supérieur. Nous montrons que les graphes définis par ces systèmes de réécriture suffixe d'arbres de piles possèdent une FO-théorie décidable, en montrant que ces graphes peuvent être obtenu par une interprétation à ensembles finis depuis un graphe de la hiérarchie à piles.Nous nous intéressons également au problème d'algébricité des langages de traces des systèmes à compteurs et au problème lié de la stratifiabilité d'un ensemble semi-linéaire. Nous montrons que dans le cas des polyèdres d'entiers, le problème de stratifiabilité est décidable et possède une complexité coNP-complète. Ce résultat nous permet ensuite de montrer que le problème d'algébricité des traces de systèmes à compteurs plats est décidable et coNP-complet. Nous donnons également une nouvelle preuve de la décidabilité des langages de traces des systèmes d'addition de vecteurs, préalablement étudié par Schwer / In this thesis, we study classes of infinite graphs and their properties,especially the model-checking problem, the accessibility problem and therecognised languages.We define a notion of stack trees, and a related notionof ground rewriting, which is an extension of both higher-order pushdownautomata and ground tree rewriting systems. We also define a notion ofrecognisability on the sets of ground rewriting operations through operationautomata. This notion induces a notion of recognisability over sets of stacktrees and a normalisation of recognisable sets of operations, similar to theknown notions over higher-order pushdown automata. We show that the graphsdefined by these ground stack tree rewriting systems have a decidableFO-theory, by exhibiting a finite set interpretation from a graph defined bya higher-order automaton to a graph defined by a ground stack tree rewritingsystem.We also consider the context-freeness problem for counter systems, andthe related problem of stratifiability of semi-linear sets. We prove thedecidability of the stratifiability problem for integral polyhedra and that itis coNP-complete. We use this result to show that the context-freeness problemfor flat counter systems is as well coNP-complete. Finally, we give a new proofof the decidability of the context-freeness problem for vector additionsystems, previously studied by Schwer

Philosophiae Doctor - PhD / In recent years, there has been a great interest towards the higher order numerical methods for singularly perturbed problems. As compared to their lower order counterparts, they provide better accuracy with fewer mesh points. Construction and/or implementation of direct higher order methods is usually very complicated. Thus a natural choice is to use some convergence acceleration techniques, e.g., Richardson extrapolation, defect correction, etc. In this thesis, we will consider various classes of problems described by singularly perturbed ordinary and partial differential equations. For these problems, we design some novel numerical methods and attempt to increase their accuracy as well as the order of convergence. We also do the same for existing numerical methods in some instances. We find that, even though the Richardson extrapolation technique always improves the accuracy, it does not perform equally well when applied to different methods for certain classes of problems. Moreover, while in some cases it improves the order of convergence, in other cases it does not. These issues are discussed in this thesis for linear and nonlinear singularly perturbed ODEs as well as PDEs. Extrapolation techniques are analyzed thoroughly in all the cases, whereas the limitations of the defect correction approach for certain problems is indicated at the end of the thesis. / South Africa

Philosophiae Doctor - PhD / In this thesis, we solve some time-dependent partial differential equations, and systems of such equations, that governs reaction-diffusion models in biology. we design and implement some novel exponential time differencing schemes to integrate stiff systems of ordinary differential equations which arise from semi-discretization of the associated partial differential equations. We split the semi-linear PDE(s) into a linear, which contains the highly stiff part of the problem, and a nonlinear part, that is expected to vary more slowly than the linear part. Then we introduce higher-order finite difference approximations for the spatial discretization. Resulting systems of stiff ODEs are then solved by using exponential time differencing methods. We present stability properties of these methods along with extensive numerical simulations for a number of different reaction-diffusion models, including single and multi-species models. When the diffusivity is small many of the models considered in this work are found to exhibit a form of localized spatiotemporal patterns. Such patterns are correctly captured by our proposed numerical schemes. Hence, the schemes that we have designed in this thesis are dynamically consistent. Finally, in many cases, we have compared our results with those obtained by other researchers.

Current learning support in an effort to address the learning needs of learners with learning disabilities tends to focus on their language abilities (reading and writing), without enough emphasis on the cognitive manifestations that could contribute to barriers to learning, if not addressed appropriately from within the school system. In this study the organisation skills of learners with learning disabilities were studied to determine their true nature. The research was undertaken with Grade 8 and 9 pupils in a private school for learners with learning disabilities. The research was conducted in two phases. In the first phase, assessment data of the learners with learning disabilities were analysed. Three different categories of learning needs regarding the organisation skills of learners with learning disabilities were identified. In the second phase, these categories of learning needs were explored using an Ethnographic Approach with Action Research as design. The outcomes of the action research were examined by analysing behaviours and written products of the learners, consistently within the context of the learning situation. It was established that the barriers to learning regarding the organisation skills of these learners are at least in part intrinsic and therefore make a strong appeal to the learning system for support. Learning support should be seen as an integral part of the teaching and learning process in all schools. It was therefore clear that a Systemic approach should be used to address the barriers to learning that learners with learning disabilities experience. A different perspective than that of the fragmented medical model was taken in exploring and addressing these needs. It was a shift towards a more holistic Ecological Systemic Approach. / Thesis (PhD (Educational Psychology))--University of Pretoria, 2006. / Educational Psychology / unrestricted

Higher order modes (HOM) are electromagnetic resonant fields. They can be excited by an electron beam entering an accelerating cavity, and constitute a component of the wakefield. This wakefield has the potential to dilute the beam quality and, in the worst case, result in a beam-break-up instability. It is therefore important to ensure that these fields are well suppressed by extracting energy through special couplers. In addition, the effect of the transverse wakefield can be reduced by aligning the beam on the cavity axis. This is due to their strength depending on the transverse offset of the excitation beam. For suitably small offsets the dominant components of the transverse wakefield are dipole modes, with a linear dependence on the transverse offset of the excitation bunch. This fact enables the transverse beam position inside the cavity to be determined by measuring the dipole modes extracted from the couplers, similar to a cavity beam position monitor (BPM), but requires no additional vacuum instrumentation.At the FLASH facility in DESY, 1.3 GHz (known as TESLA) and 3.9 GHz (third harmonic) cavities are installed. Wakefields in 3.9 GHz cavities are significantly larger than in the 1.3 GHz cavities. It is therefore important to mitigate the adverse effects of HOMs to the beam by aligning the beam on the electric axis of the cavities. This alignment requires an accurate beam position diagnostics inside the 3.9 GHz cavities. It is this aspect that is focused on in this thesis. Although the principle of beam diagnostics with HOM has been demonstrated on 1.3 GHz cavities, the realization in 3.9 GHz cavities is considerably more challenging. This is due to the dense HOM spectrum and the relatively strong coupling of most HOMs amongst the four cavities in the third harmonic cryo-module. A comprehensive series of simulations and HOM spectra measurements have been performed in order to study the modal band structure of the 3.9 GHz cavities. The dependencies of various dipole modes on the offset of the excitation beam were subsequently studied using a spectrum analyzer. Various data analysis methods were used: modal identification, direct linear regression, singular value decomposition and k-means clustering. These studies lead to three modal options promising for beam position diagnostics, upon which a set of test electronics has been built. The experiments with these electronics suggest a resolution of 50 micron accuracy in predicting local beam position in the cavity and a global resolution of 20 micron over the complete module. This constitutes the first demonstration of HOM-based beam diagnostics in a third harmonic 3.9 GHz superconducting cavity module. These studies have finalized the design of the online HOM-BPM for 3.9 GHz cavities at FLASH.

In this thesis we investigate how to improve the performance of MU-MIMO wireless system in terms of achieving Shannon capacity limit and efficient use of precious resource of radio spectrum in wireless communication. First a new suboptimal volume-based scheduling algorithm is presented, which can be applied in MU-MIMO downlink system to transmit signals concurrently to multiple users under the assumption of perfect channel information at transmitter and receiver. The volume-based scheduling algorithm utilises Block Diagonalisation precoding and Householder reduction procedure of QR factorisation. In comparison with capacity-based suboptimal scheduling algorithm, the volume-based algorithm has much reduced computational complexity with only a fraction of sum-rate capacity penalty from the upper bound of system capacity limit. In comparison with semi-orthogonal user selection suboptimal scheduling algorithm, the volume-based scheduling algorithm can be implemented with less computational complexity. Furthermore, the sum-rate capacity achieved via volume-based scheduling algorithm is higher than that achieved by SUS scheduling algorithm in the MIMO case. Then, a two-step scheduling algorithm is proposed, which can be used in the MU-MIMO system and under the assumption that channel state information is known to the receiver, but it is not known to the transmitter and the system under the feedback resource constraint. Assume that low bits codebook and high bits codebook are stored at the transmitter and receiver. The users are selected by using the low bits codebook; subsequently the BD precoding vectors for selected users are designed by employing high bits codebook. The first step of the algorithm can alleviate the load on feedback uplink channel in the MU-MIMO wireless system while the second step can aid precoding design to improve system sum-rate capacity. Next, a MU-MIMO cognitive radio (CR) wireless system has been studied. In such system, a primary wireless network and secondary wireless network coexist and the transmitters and receivers are equipped with multiple antennas. Spectrum sensing methods by which a portion of spectrum can be utilised by a secondary user when the spectrum is detected not in use by a primary user were investigated. A Free Probability Theory (FPT) spectrum sensing method that is a blind spectrum sensing method is proposed. By utilizing the asymptotic behaviour of random matrix based on FPT, the covariance matrix of transmitted signals can be estimated through a large number of observations of the received signals. The method performs better than traditional energy spectrum sensing method. We also consider cooperative spectrum sensing by using the FPT method in MU-MIMO CR system. Cooperative spectrum sensing can improve the performance of signal detection. Furthermore, with the selective cooperative spectrum sensing approach, high probability of detection can be achieved when the system is under false alarm constraint. Finally, spectrum sensing method based on the bispectrum of high-order statistics (HOS) and receive diversity in SIMO CR system is proposed. Multiple antennas on the receiver can improve received SNR value and therefore enhance spectrum sensing performance in terms of increase of system-level probability of detection. Discussions on cooperative spectrum sensing by using the spectrum sensing method based on HOS and receive diversity are presented.

Dans cette thèse, nous étudions plusieurs problèmes géométriques concernant les liens-selles de surfaces plates définies par des formes différentielles méromorphes ayant des pôles de degré arbitrairement grand. Dans le cas des 1-formes holomorphes, les surfaces sont d'aire finie et ont une infinité de liens-selles. Au contraire, pour les 1-formes méromorphes ainsi que les différentielles d'ordre supérieur (quadratiques et au delà) ayant des pôles dont le degré est suffisamment grand, les surfaces sont d'aire infinie et il est courant que le nombre de liens-selles soit fini. Nous étudions trois problèmes au sujet de telles surfaces. Le premier problème est la caractérisation des strates de différentielles dont les surfaces plates correspondantes ont toujours un nombre fini de liens-selles. Nous sommes parvenus à réduire le problème à un simple critère combinatoire relatif au profil de singularités de la strate. Pour ce premier problème, nous nous plaçons dans le cadre le plus général possible : celui des k-différentielles (de la forme f(z)dz^{k}) ayant au moins un pôle d'ordre supérieur ou égal à k. Le deuxième problème est celui de la caractérisation des groupes de Veech des surfaces plates avec pôles. Dans le cas classique des surfaces de (demi)-translation, il s'agit d'un problème très difficile. Ici, au contraire, la rigidité induite par la présence de pôles permet de donner une réponse complète. Enfin, nous proposons une caractérisation complète des familles de nombres complexes pouvant apparaître comme résidus aux pôles d'une différentielle méromorphe appartenant à une strate donnée. Ainsi, la géométrie plate permet de donner une réciproque au théorème des résidus dans laquelle on contrôle la multiplicité des singularités. Ce dernier résultat est le fruit d'une collaboration avec Quentin Gendron. / In this thesis, we consider several geometric problems about saddle connections of flat surfaces defined by meromorphic differentials with poles of arbitrarily large degree. In the case of holomorphic 1-forms, surfaces are of finite area an have infinitely many saddle connections. On the contrary, if we consider meromorphic 1-forms and differentials of higher orders (quadratic and beyond) with at least one pole whose degree is large enough, flat surface are of infinite area and their number of saddle connections may be finite. We study three problems about such surfaces. The first problem is the characterization of the strata of differentials such that the corresponding flat surfaces always have a finite number of saddle connections. We achieved to reduce the problem to a to single combinatorial criterium depending on the singularity pattern of the stratum. When we deal with this problem, we adopt the most general framework of k-differentials (of the form f(z)dz^{k}) with at least one pole of order at least k. The second problem is characterization of Veech groups of flat surfaces with poles. In the classical case of (half)-translation surfaces, it is a very difficult problem. Here, rigidity induced by the poles makes possible to provide a complete answer. Finally, we provide a complete characterization of the families of complex numbers that can appear as residues at the poles of a meromorphic differential belonging to a gien stratum. Thus, flat geometry provides a reciprocal to the residue theorem in which we control the multiplicities of the singularities. This last result is the product of a collaboration with Quentin Gendron.