Pour permettre l’accroissement de débit et de robustesse dans les futurs systèmes de communication sans fil, les processus itératifs sont de plus considérés dans les récepteurs. Cependant, l’adoption d’un traitement itératif pose des défis importants dans la conception du récepteur. Dans cette thèse, un récepteur itératif combinant les techniques de détection multi-antennes avec le décodage de canal est étudié. Trois aspects sont considérés dans un contexte MIMOOFDM: la convergence, la performance et la complexité du récepteur. Dans un premier temps, nous étudions les différents algorithmes de détection MIMO à décision dure et souple basés sur l’égalisation, le décodage sphérique, le décodage K-Best et l’annulation d’interférence. Un décodeur K-best de faible complexité (LC-K-Best) est proposé pour réduire la complexité sans dégradation significative des performances. Nous analysons ensuite la convergence de la combinaison de ces algorithmes de détection avec différentes techniques de codage de canal, notamment le décodeur turbo et le décodeur LDPC en utilisant le diagramme EXIT. En se basant sur cette analyse, un nouvel ordonnancement des itérations internes et externes nécessaires est proposé. Les performances du récepteur ainsi proposé sont évaluées dans différents modèles de canal LTE, et comparées avec différentes techniques de détection MIMO. Ensuite, la complexité des récepteurs itératifs avec différentes techniques de codage de canal est étudiée et comparée pour différents modulations et rendement de code. Les résultats de simulation montrent que les approches proposées offrent un bon compromis entre performance et complexité. D’un point de vue implémentation, la représentation en virgule fixe est généralement utilisée afin de réduire les coûts en termes de surface, de consommation d’énergie et de temps d’exécution. Nous présentons ainsi une représentation en virgule fixe du récepteur itératif proposé basé sur le décodeur LC K-Best. En outre, nous étudions l’impact de l’estimation de canal sur la performance du système. Finalement, le récepteur MIMOOFDM itératif est testé sur la plateforme matérielle WARP, validant le schéma proposé. / Recently, iterative processing has been widely considered to achieve near-capacity performance and reliable high data rate transmission, for future wireless communication systems. However, such an iterative processing poses significant challenges for efficient receiver design. In this thesis, iterative receiver combining multiple-input multiple-output (MIMO) detection with channel decoding is investigated for high data rate transmission. The convergence, the performance and the computational complexity of the iterative receiver for MIMO-OFDM system are considered. First, we review the most relevant hard-output and soft-output MIMO detection algorithms based on sphere decoding, K-Best decoding, and interference cancellation. Consequently, a low-complexity K-best (LCK- Best) based decoder is proposed in order to substantially reduce the computational complexity without significant performance degradation. We then analyze the convergence behaviors of combining these detection algorithms with various forward error correction codes, namely LTE turbo decoder and LDPC decoder with the help of Extrinsic Information Transfer (EXIT) charts. Based on this analysis, a new scheduling order of the required inner and outer iterations is suggested. The performance of the proposed receiver is evaluated in various LTE channel environments, and compared with other MIMO detection schemes. Secondly, the computational complexity of the iterative receiver with different channel coding techniques is evaluated and compared for different modulation orders and coding rates. Simulation results show that our proposed approaches achieve near optimal performance but more importantly it can substantially reduce the computational complexity of the system. From a practical point of view, fixed-point representation is usually used in order to reduce the hardware costs in terms of area, power consumption and execution time. Therefore, we present efficient fixed point arithmetic of the proposed iterative receiver based on LC-KBest decoder. Additionally, the impact of the channel estimation on the system performance is studied. The proposed iterative receiver is tested in a real-time environment using the MIMO WARP platform.

Dizertační práce se věnuje funkcionálním diferenciálním rovnicím smíšeného typu. Poskytuje kritéria pro existenci globálních a semi-globálních řešení diferenciálních systémů smíšeného typu. Metody použité v teto práci spočívají v sestavení vhodných operátorů pro diferenciální rovnice a prokázání existence jejich pevných bodů. Tyto pevné body jsou potom použity ke konstrukci řešení rovnic s předcházením a zpožděním. V důkazech tvrzení jsou použity monotónní iterační metoda a Schauderovy-Tychonovovy věty o existenci pevného bodu. V obou případech jsou uvedeny také odhady řešení. Pokud je použita iterační metoda, lze tyto odhady zlepšit iterováním. Kromě toho jsou odvozena kritéria pro lineární rovnice a systémy a je uvedena řada přikladů. Dosažené výsledky lze aplikovat také pro obyčejné diferenciální rovnice nebo diferenciální rovnice se zpožděním či s předcházením argumentu.

This thesis presents an investigation of the possibility of using the fixed-point arithmetic in the inertial navigation systems, which use the local level navigation frame mechanization equations. Two square root filtering methods, the Potter's square root Kalman filter and UD factorized Kalman filter, are compared with respect to the conventional Kalman filter and its Joseph's stabilized form. The effect of rounding errors to the Kalman filter optimality and the covariance matrix or its factors conditioning is evaluated for a various lengths of the fractional part of the fixed-point computational word. Main contribution of this research lies in an evaluation of the minimal fixed-point arithmetic word length for the Phi-angle error model with noise statistics which correspond to the tactical grade inertial measurements units.

The diploma thesis is focused on design and optimalization of digital octave and fraction-octave band filters. This thesis describe the behavior of filters in systems with fixed point arithmetics and investigate the impact of quantization coefficients for frequency response of filter. Filters, whitch has been designed, are implemented into simple software in C. Designed filters are in accordance with standard IEC 61260.

<p>It is predicted that there would be 41.6 billion IoT devices by 2025, which has kindled new interests on the timing coordination between sensors and controllers, i.e., how to use the waiting time to improve the performance. Sun et al. showed that a <i>controller</i> can strictly improve the data freshness, the so-called Age-of-Information (AoI), via careful scheduling designs. The optimal waiting policy for the <i>sensor</i> side was later characterized in the context of remote estimation. The first part of this work develops the jointly optimal sensor/controller waiting policy. It generalizes the above two important results in that not only do we consider joint sensor/controller designs, but we also assume random delay in both the forward and feedback directions. </p> <p> </p> <p>The second part of the work revisits and significantly strengthens the seminal results of Sun et al on the following fronts: (i) When designing the optimal offline schemes with full knowledge of the delay distributions, a new <i>fixed-point-based</i> method is proposed with <i>quadratic convergence rate</i>; (ii) When the distributional knowledge is unavailable, two new low-complexity online algorithms are proposed, which provably attain the optimal average AoI penalty; and (iii) the online schemes also admit a modular architecture, which allows the designer to <i>upgrade</i> certain components to handle additional practical challenges. Two such upgrades are proposed: (iii.1) the AoI penalty function incurred at the destination is unknown to the source node and must also be estimated on the fly, and (iii.2) the unknown delay distribution is Markovian instead of i.i.d. </p> <p> </p> <p>With the exponential growth of interconnected IoT devices and the increasing risk of excessive resource consumption in mind, the third part of this work derives an optimal joint cost-and-AoI minimization solution for multiple coexisting source-destination (S-D) pairs. The results admit a new <i>AoI-market-price</i>-based interpretation and are applicable to the setting of (i) general heterogeneous AoI penalty functions and Markov delay distributions for each S-D pair, and (ii) a general network cost function of aggregate throughput of all S-D pairs. </p> <p> </p> <p>In each part of this work, extensive simulation is used to demonstrate the superior performance of the proposed schemes. The discussion on analytical as well as numerical results sheds some light on designing practical network utility maximization protocols.</p>

<p>U ovoj tezi dokazane su teoreme o nepokretnoj tački koje predstavljaju jednoznačna i vi&scaron;eznačna uop&scaron;tenja Banahovog prin&shy;cipa kontrakcije u verovatnosnim metričkim i fazi metričkim pros&shy;torima. Dokazana je teorema koja predstavlja uop&scaron;tenje teoreme o nepokretnoj tački za verovatnosnu ^-kontrakciju / :&nbsp; S &mdash;* S,gde je&nbsp; ( S ,&nbsp; J7, T ) kompletan Mengerov prostor. Uveden je pojam jake (6n)-kontrakcije i dokazana je teorema koja predstavlja uop&scaron;tenje teoreme Sehgala i Bharuche-Reid kada je preslikavanje / :&nbsp; S &mdash;&gt; S jaka (6n)-kontrakcija. Teorema Caristija, koja predstavlja jedan od najvažnijih rezultata za teoriju nepokretne tačke i nelinearnu analizu uop&scaron;tena je u kompletnom Mengerovom prostoru&nbsp; (S ,&nbsp; F , T ), gde je t-norma&nbsp; T H -tipa. Kako Mengerovi prostori pripadaju klasi kvazi-uniformnih prostora dokazana je teorema o nepokretnoj tački tri preslikavanja u jednoj specijalnoj klasi kvazi-uniformnih prostora. Dokazana je teorema o nepokretnoj tački koja predstavlja verovatnosno uop&scaron;tenje Nadlerove g-kontrakcije za tri preslikavanja kao i uop&scaron;tenje Hiksovog principa kontrakcije za tri preslikavanja. Teorija<br />kontraktora, koju je uveo M. Altman, odnosi se na re&scaron;avanje nelin&shy;earnih operatorskih jednačina u Banahovim prostorima. U tezi su dokazane teoreme koje obezbeđuju postojanje i jedinstvenost re&scaron;enja za nelinearne operatorske jednačine sa jednoznačnim i vi&scaron;eznačnim operatorom u nearhimedovskim Mengerovim verovatnosnim normi&shy; ranim prostorima.</p> / <p>In this thesis fixed point theorems which present singleval&shy;<br />ued and multivalued generalization of Banach contraction principle<br />in probabilistic metric and fuzzy metric spaces are proved. The<br />theorem which presents generalization of fixed point theorem for<br />probabilistic g-contraction / :&nbsp; S &mdash;* S is proved, where ( S ,&nbsp; J7, T ) is<br />complete Menger space. A notion of strong (&pound;&gt;n)-contraction is in&shy;<br />troduced and the theorem which presents a generalization of Sehgal<br />and Bharucha-Raid theorem when the mapping / :&nbsp; S&nbsp; &mdash;&raquo;&nbsp; S is strong<br />(6n)-contraction is proved. Caristi&rsquo;s theorem, which presents one of<br />the most imortant results for the fixed point theorem and nonlinear<br />analysis is generalized in complete Menger space&nbsp; (S, J-, T ), where<br />t-norm&nbsp; T is of&nbsp; H -type. As Menger&rsquo;s spaces belong to the class of<br />quasi-uniformizable spaces, the fixed point theorem for three map&shy;<br />pings in one special class of quasi-uniformizable spaces is proved.<br />The fixed point theorem which presents a probabilistic generaliza&shy;<br />tion of Nadler g-contraction for three mappings is proved as well<br />as the generalization of Hicks&rsquo;s contraction principle for three map&shy;<br />pings. The theory of contractor, which was introduced by M. A lt&shy;<br />man refers to solving nonlinear operator equations in Banach spaces.<br />This thesis proves the theorems which provide the existence and<br />uniqueness of the solutions for nonlinear operator equations with<br />singlevalued and multivalued operators in nonarhimedian Menger&rsquo;s<br />probabilistic normed spaces</p>

Ce mémoire de thèse est consacré à l’équation de Fokker-Planckpartial_ f=∆f+div(Ef).Il est subdivisé en deux parties :une partie linéaire et une partie non linéaire. Dans la partie linéaire on considère un champ de vecteur E(x) dépendant seulement de x. Cette partie est constituée des chapitres 3, 4 et 5. Dans le chapitre 3 on montre que l’opérateur linéaire Lf :=∆ f + div(E f ) est le générateur d’un semi-groupe fortement continu (SL(t))_{t≥0} dans tous les espaces L^p. On y établit également que le semi-groupe (SL(t))_{t≥0} est positif et ultracontractif. Dans le chapitre 4 nous montrons comment est qu’une décomposition adéquate de l’opérateur L permet d’établir certaines propriétés du semi-groupe (SL(t))_{t≥0} notamment sa bornitude. Le chapitre 5 est consacré à l’existence d’un état d’équilibre. De plus on y montre que cet état d’équi- libre est asymptotiquement stable. Dans la partie non linéaire on considère un champ de vecteur de la forme E(x,f) := x+nabla (a*f) ou a et f sont des fonctions assez régulières et * est l’opérateur de convolution. Cette parties est contituée des chapitre 6 et 7. Dans le chapitre 6 nous établissons que poura appartenant à W^{2,infini}_locl’équation de Fokker-Planck non linéaire admet une unique solution locale dans l’espace L^2_{K_alpha} (R^d). Dans le dernier chapitre nous montrons que le problème non linéaire admet une solution globale. De plus cette solution dépend continument des données. / This thesis is devoted to the Fokker-Planck équation partial_t f =∆f + div(E f).It is divided into two parts. The rst part deals with the linear problem. In this part we consider a vector E(x) depending only on x. It is composed of chapters 3, 4 and 5. In chapter 3 we prove that the linear operator Lf :=∆f + div(Ef ) is an in nitesimal generator of a strong continuous semigroup (SL(t))_{t≥0}. We establish also that (SL(t))_{t≥0} is positive and ultracontractive. In chapter 4 we show how an adequate decomposition of the linear operator L allows us to deduce interesting properties for the semigroup (SL(t))_{t≥0}. Indeed using this decomposition we prove that (SL(t))_{t≥0} is a bounded semigroup. In the last chapter of this part we establish that the linear Fokker-Planck admits a unique steady state. Moreover this stationary solution is asymptotically stable.In the nonlinear part we consider a vector eld of the form E(x, f ) := x +nabla (a *f ), where a and f are regular functions. It is composed of two chapters. In chapter 6 we establish that fora in W^{2,infini}_locthe nonlinear problem has a unique local solution in L^2_{K_alpha}(R^d); . To end this part we prove in chapter 7 that the nonlinear problem has a unique global solution in L^2_k(R^d). This solution depends continuously on the data.

No description available.

Ce mémoire présente une méthode de reconstruction de la surface d’un pare-brise à partir d’une image observée au travers de celui-ci. Cette image est déformée, car les rayons lumineux traversant le pare-brise subissent deux réfractions : une de chaque côté du verre. La déformation de l’image est dépendante de la forme du pare-brise, c’est donc cette donnée qui est utilisée pour résoudre le problème. La première étape est la construction d’un champ de vecteurs dans l’espace ambiant à partir des déviations des rayons lumineux passant par le pare-brise. Elle repose sur la loi de la réfraction de Snell-Descartes et sur des hypothèses simplificatrices au sujet de la courbure et de l’épaisseur du pare-brise. Le vecteur en un point de ce champ correspond à une prédiction du vecteur normal à la surface, sous l’hypothèse que celle-ci passe par le point en question. La deuxième étape est de trouver une surface compatible avec le champ de vecteurs obtenu. Pour y arriver, on formule un problème de minimisation où la donnée minimisée est la différence entre les vecteurs normaux à la surface et ceux construits à partir des mesures du système d’inspection. Il en résulte une équation d’Euler-Lagrange non linéaire à laquelle on impose des conditions de Dirichlet. Le graphe de la solution à ce problème est alors la surface recherchée. La troisième étape est une méthode de point fixe pour résoudre l’équation d’Euler-Lagrange. Elle donne une suite d’équations de Poisson linéaires dont la limite des solutions respecte l’équation non linéaire étudiée. On utilise le théorème du point fixe de Banach pour obtenir des conditions suffisantes d’existence et d’unicité de la solution, qui sont aussi des conditions suffisantes pour lesquelles la méthode de point fixe converge. / This Master’s thesis presents a method for the reconstruction of a windshield surface using an image observed through it. This image is distorted because the light rays passing through the windshield undergo two refractions : one on each side of the glass. The distortion depends on the windshield shape and therefore this data is used to solve the problem. The first step is the construction of a vector field in the ambient space, from the deviations of the light rays passing through the windshield. This step relies on the Snell-Descartes refraction law and on simplifying assumptions regarding the curvature and thickness of a windshield. A vector at a point of this field corresponds to a prediction of the surface normal vector at this point, under the hypothesis that this point lies on the surface. The second step is to find a surface that is compatible with the obtained vector field. For this purpose, a minimisation problem is formulated for which the minimized variable is the difference between the surface normal vector and the one deduced from the system’s measurements. This leads to a nonlinear Euler- Lagrange equation for which the Dirichlet boundary conditions are imposed. The graph of the solution is the desired surface. The third step is a fixed-point method to solve the Euler- Lagrange equation. At the center of this method is a sequence of linear Poisson equations, each giving an approximating solution. It is shown that the limit of this sequence of solutions respects the original nonlinear equation. The Banach fixed-point theorem is used to get sufficient existence and uniqueness conditions, that are also sufficient conditions under which the proposed fixed-point method converges.

Model predictive control is a popular research focus in electric motor control as it allows designers to specify optimization goals and exhibits fast transient response. Availability of faster and more affordable computers makes it possible to implement these algorithms in real-time. Real-time implementation is not without challenges however as these algorithms exhibit high computational complexity. Field-programmable gate arrays are a potential solution to the high computational requirements. However, they can be time-consuming to develop for. In this thesis, we present a methodology that reduces the size and development time of field-programmable gate array based fixed-point model predictive motor controllers using automated numerical analysis, optimization and code generation. The methods can be applied to other domains where model predictive control is used. Here, we demonstrate the benefits of our methodology by using it to build a motor controller at various sampling rates for an interior permanent magnet synchronous motor, tested in simulation at up to 125 kHz. Performance is then evaluated on a physical test bench with sampling rates up to 35 kHz, limited by the inverter. Our results show that the low latency achievable in our design allows for the exclusion of delay compensation common in other implementations and that automated reduction of numerical precision can allow the controller design to be compacted. / Thesis / Master of Applied Science (MASc)