Cette thèse est consacrée à l'analyse de l'association de codes LDPC non-binaires (LDPC-NB) à des modulations d’ordre élevé. Cette association vise à améliorer l’efficacité spectrale pour les futurs systèmes de communication sans fil. Notre approche a consisté à tirer au maximum profit de l'association directe des symboles d’un code LDPC-NB sur un corps de Galois avec une constellation de même cardinalité. Notre première contribution concerne la diversité spatiale obtenue dans un canal de Rayleigh avec et sans effacement en faisant subir une rotation à la constellation. Nous proposons d’utiliser l'information mutuelle comme paramètre d’optimisation de l’angle de rotation, et ce pour les modulations de type « BICM » et les modulations codées. Cette étude permet de mettre en évidence les avantages de la modulation codée par rapport à la modulation BICM de l’état de l’art. Par simulation de Monte-Carlo, nous montrons que les gains de codage théoriques se retrouvent dans les systèmes pratiques. Notre deuxième contribution consiste à concevoir conjointement l'étiquetage des points de constellation et le choix des coefficients d'une équation de parité en fonction de la distance euclidienne, et non plus de la distance de Hamming. Une méthode d’optimisation est proposée. Les codes ainsi construits offrent des gains de performance de 0.2 dB et ce, sans ajout de complexité. / This thesis is devoted to the analysis of the association of non-binary LDPC codes (NB-LDPC) with high-order modulations. This association aims to improve the spectral efficiency of future wireless communication systems. Our approach tries to take maximum advantage of the straight association between NB-LDPC codes over a Galois Field with modulation constellations of the same cardinality. We first investigate the optimization of the signal space diversity technique obtained with the Rayleigh channel (with and without erasure) thanks to the rotation of the constellation. To optimize the rotation angle, the mutual information analysis is performed for both coded modulation (CM) and bit-interleaved coded modulation (BICM) schemes. The study shows the advantages of coded modulations over the state-of-the-art BCIM modulations. Using Monte Carlo simulation, we show that the theoretical gains translate into actual gains in practical systems. In the second part of the thesis, we propose to perform a joint optimization of constellation labeling and parity-check coefficient choice, based on the Euclidian distance instead of the Hamming distance. An optimization method is proposed. Using the optimized matrices, a gain of 0.2 dB in performance is obtained with no additional complexity.

The thesis focuses on consideration of possible ways how to realize multi-state modulators for a laboratory instrument. This instrument will illustrate signals, which partake on generation QAM modulation. The design of the laboratory instrument includes theoretic schemata and the execution of a prototype. There are theoretical facts of multi-state signals and multi-state modulations in this thesis. A simple block diagram of the laboratory instrument is made by the theory of creating quadrature amplitude modulation. For each block there are made several schemata, which are compiled to the global scheme. A printed circuit board and the structure items are made by the aid of the global scheme. The next part is devoted to a software facility for a used microprocessor, which ensures the whole function of the laboratory instrument. The final section deals with measuring, which checks the function of the modulator and the right setting coder’s constellation diagrams.

<p>Large space-based communication networks have been growing in numbers of satellites, with plans to launch more than 10,000 satellites into Low Earth Orbit (LEO). While these constellations offer many advantages over ground-based communication systems, they pose a significant threat when they fail and generate space debris. Given the reliability of current satellites, engineers can use failure modeling to design satellite constellations that are more resilient to satellite failures. Several authors have analyzed the reliability of geostationary satellites, but few have expanded the work to multiple-satellite systems. </p> <p>To address this gap, we constructed a simulation model to show the performance of satellite constellations with different satellite reliability functions over time. The simulation model is broken down into four key parts: a satellite constellation model, a network model, a failure model, and a performance metric. We use a Walker star constellation, which is the most common constellation for LEO broadband satellite constellations. The network consists of satellite-to-satellite connections and satellite-to-groundstation connections, which routes data using a shortest-path algorithm. The failure model views satellites as either operational or failed (no partial failures) and considers the groundstation operator’s knowledge or lack thereof of the satellites’ operational status and uses satellite reliability to estimate the expected data throughput of the system. We also created a performance metric that measures how well the entire network is operating and helps us compare candidate constellations.</p> <p>We used the model to estimate performance for a range of satellite reliabilities, and for groundstations with different numbers of communication dishes (effectively, satellite-ground links). Satellite reliability is a significant contributing factor to the long-term constellation performance. Using the reliability of small-LEO satellites, we found that a constellation of 1,200 small-LEO satellites completely fails after less than 30 days, given that we do not consider partial failures. Satellite constellations with higher satellite reliability, such as large geostationary satellites, last less than 50 days. We expect the constellations in our model to perform worse than real satellite systems, since we are only modeling complete failures, however these findings provide a useful worst-case baseline for designing sustainable satellite constellations. We also found that the number of groundstation-to-satellite communication links at each groundstation is not a significant factor for more than five communication links, meaning that adding more communication antennas to existing satellite groundstations would not improve constellation performance significantly.</p>

Le contexte de cette thèse est la reconnaissance de systèmes de communication dans un contexte non coopératif. Nous nous intéressons au problème de la reconstruction de codes convolutifs et à la reconstruction du mapping (la bijection utilisée pour associer une séquence binaire à un signal modulé). Nous avons élaboré une nouvelle méthode statistique qui à partir d'une séquence binaire bruitée observée permet de détecter si une séquence binaire est codée par un codeur convolutif. Cette méthode consiste à former des blocs de séquence suffisamment grands pour contenir le support d'une équation de parité et à compter le nombre de blocs identiques. Elle a l'avantage de fournir la longueur du code utilisé lorsque le mapping est inconnu. Cette méthode peut également être utilisée pour reconstruire le dual d'un code convolutif lorsque le mapping est connu. Nous proposons par ailleurs un algorithme de reconnaissance de mapping basé sur le parcours de classes d'équivalences. Deux types de classes sont définies. Nous disposons d'un signal bruité partiellement démodulé (démodulé avec un mapping par défaut) et supposons que les données sont codées par un codeur convolutif. Nous utilisons la reconnaissance d'un tel code comme testeur et parcourons enfin les classes d'équivalences faisant apparaître une structure de codes convolutifs. Cette classification améliore la complexité de la recherche pour les petites constellations (4 et 8-PSK). Dans le cas des constellations 16 à 256-QAM l'algorithme est appliqué aux mappings Gray ou quasi-Gray. L'algorithme ne fournit pas un résultat unique mais il permet de trouver un ensemble de mappings possibles à partir de données bruitées. / The context of this thesis is the recognition of communication systems in a non-cooperative context. We are interested in the convolutional code reconstruction problem and in the constellation labeling reconstruction (the mapping used to associate a binary sequence to a modulated signal). We have defined a new statistical method for detecting if a given binary sequence is a noisy convolutional code-word obtained from an unknown convolutional code. It consists in forming blocks of sequence which are big enough to contain the support of a parity check equation and counting the number of blocks which are equal. It gives the length of the convolutional code without knowledge of the constellation labeling. This method can also be used to reconstruct the dual of a convolutional code when the constellation labeling is known. Moreover we propose a constellation labeling recognition algorithm using some equivalence classes. Two types of classes are defined: linear and affine. We observe a noisy signal which is partially demodulated (with a default labeling) and assume that the data are coded by a convolutional encoder. Thus we use the reconstruction of a code as a test and run through the classes which reveal a code structure. This classification improves the complexity of the search for small constellations (4-PSK and 8-PSK). In case of 16-QAM to 256-QAM constellations we apply the algorithm to Gray or quasi-Gray labelings. The algorithm does not give a unique result but it allows to find a small set of possible constellation labelings from noisy data.

Lunar constellations providing the capabilities of situational awareness and surveillance for future mission operators are analyzed in this study. The use of specialty orbits, such as sun-synchronous and frozen orbits, are analyzed to determine the applicability of these unique orbits. Additionally, altitude and inclination trades are performed to determine the degree to which mission objectives are achieved through ranges of these orbital parameters. Using the analyzed orbits, constellations of varying patterns are developed and surface coverage figures of merit are used to evaluate them. The research concludes with calculation of the yearly cross-track and in-track stationkeeping costs of a representative constellation. This stationkeeping is necessary for preservation of the designed coverage statistics.

Recent interest surrounding large scale satellite constellations has increased analysis efforts to create the most efficient designs. Multiple studies have successfully optimized constellation patterns using equations of motion propagation methods and genetic algorithms to arrive at optimal solutions. However, these approaches are computationally expensive for large scale constellations, making them impractical for quick iterative design analysis. Therefore, a minimalist algorithm and efficient computational method could be used to improve solution times. This thesis will provide a tool for single target constellation optimization using spherical trigonometry propagation, and an evolutionary genetic algorithm based on a multi-objective optimization function. Each constellation will be evaluated on a normalized fitness scale to determine optimization. The performance objective functions are based on average coverage time, average revisits, and a minimized number of satellites. To adhere to a wider audience, this design tool was written using traditional Matlab, and does not require any additional toolboxes. To create an efficient design tool, spherical trigonometry propagation will be utilized to evaluate constellations for both coverage time and revisits over a single target. This approach was chosen to avoid solving complex ordinary differential equations for each satellite over a long period of time. By converting the satellite and planetary target into vectors of latitude and longitude in a common celestial sphere (i.e. ECI), the angle can be calculated between each set of vectors in three-dimensional space. A comparison of angle against a maximum view angle, , controlled by the elevation angle of the target and the satellite’s altitude, will determine coverage time and number of revisits during a single orbital period. Traditional constellations are defined by an altitude (a), inclination (I), and Walker Delta Pattern notation: T/P/F. Where T represents the number of satellites, P is the number of orbital planes, and F indirectly defines the number of adjacent planes with satellite offsets. Assuming circular orbits, these five parameters outline any possible constellation design. The optimization algorithm will use these parameters as evolutionary traits to iterate through the solutions space. This process will pass down the best traits from one generation to the next, slowly evolving and converging the population towards an optimal solution. Utilizing tournament style selection, multi-parent recombination, and mutation techniques, each generation of children will improve on the last by evaluating the three performance objectives listed. The evolutionary algorithm will iterate through 100 generations (G) with a population (n) of 100. The results of this study explore optimal constellation designs for seven targets evenly spaced from 0° to 90° latitude on Earth, Mars and Jupiter. Each test case reports the top ten constellations found based on optimal fitness. Scatterplots of the constellation design solution space and the multi-objective fitness function breakdown are provided to showcase convergence of the evolutionary genetic algorithm. The results highlight the ratio between constellation altitude and planetary radius as the most influential aspects for achieving optimal constellations due to the increased field of view ratio achievable on smaller planetary bodies. The multi-objective fitness function however, influences constellation design the most because it is the main optimization driver. All future constellation optimization problems should critically determine the best multi-objective fitness function needed for a specific study or mission.

Spacecraft operating on the Martian surface have used relay satellites as a means of improving communication capabilities, mainly in terms of bandwidth and availability. However, the spacecraft used to achieve this have been large spacecraft (1000s of kilograms) and were not designed with relay capability as the design priority. This thesis explores the possibility of using a CubeSat-based constellation as a communications network for spacecraft operating on the Martian surface. Brute-force techniques are employed to explore the design space of possible constellations. An analysis of constellation configurations that provide complete, continuous coverage of the Martian surface is presented. The stability of these constellations are analyzed, and recommendations are made for stable configurations and the orbital maintenance thereof. Link budget analysis is used to determine the communications capability of each constellation, and recommendations are made for sizing each communication element. The results of these three analyses are synthesized to create an architecture generation tool. This tool is used to identify mission architectures that suit a variety of mission requirements, and these architectures are presented. The primary recommended architecture utilizes 18 CubeSats in three orbital planes with six additional larger relay satellites to provide an average of over one terabit/sol downlink and 100 kbps uplink capability.

Earth's atmosphere is a dynamic region with a complex interplay of energetic inputs, outputs, and transport mechanisms. A complete understanding of the atmosphere and how various fields within it interact is essential for predicting atmospheric shifts relevant for spaceflight, the evolution of Earth's climate, radio communications, and other practical applications. In-situ observations of a critical altitude region within Earth's atmosphere from 100-200 km in altitude, a subset of a larger 90 – 400 km altitude region deemed the "Thermospheric Gap", are required for constraining atmospheric models of wind, temperature, and density perturbations caused by atmospheric tides. Observations within this region that are sufficient to fully reconstruct and understand the evolution of tides therein are nonexistent. Certain missions have sought to fill portions of this observation gap, including Daedalus which was selected as a candidate for the Earth Explorer program by the European Space Agency in 2018. This study focuses on the design and optimization of a two-satellite, highly elliptical satellite constellation to perform in-situ observations and reconstruction of tidal features in the 100-200 km region. The model atmosphere for retrieving sample data is composed of DE3 and DE2 tidal features from the Climatological Model of the Thermosphere (CTMT) and background winds from the Thermosphere-Ionosphere-Electrodynamic General Circulation Model (TIEGCM). BoTorch, a Bayesian Optimization package for Python, is integrated with the Ansys Systems Tool Kit (STK) to model the constellation's propagation and simulated atmospheric sampling. A least squares fitting algorithm is utilized to fit the sampled data to a known tidal function form. Key results include 14 Pareto optimal solutions for the satellite constellation based on a set of 7 objective functions, 3 constellation input parameters, and a sample set of n = 86. Four of these solutions are discussed in more detail. The first two are the best and second-best options on the Pareto front for sampling and reconstruction of the input tidal fields. The third is the best solution for latitudinal tidal fitting coverage. The fourth is a compromise solution that nearly minimizes delta-v expenditure, while sacrificing some quality in tidal fitting and fitting coverage. / Master of Science / Earth's atmosphere, the envelope of gaseous material surrounding the planet from an altitude of 0 km to approximately 10,000 km, is a dynamic system with a diverse set of energy inputs, outputs, and transfer mechanisms. A complete understanding of the atmosphere and how various fields within it interact is essential for predicting atmospheric shifts relevant for spaceflight, the evolution of Earth's climate, radio communications, and other practical applications. The atmosphere life breathes on Earth's surface evolves in physical and chemical properties, such as temperature, pressure, and composition, as distance from Earth increases. In addition, the atmosphere varies temporally, with shifts in its properties occurring on several timescales, some as short as a few minutes and some on the order of the age of the planet itself. This thesis project seeks to study the optimization of a satellite system to further understand an important source of atmospheric variability – atmospheric tides. Just as the forces of gravity from the moon and sun cause tides in the oceans, the Earth's rotation and the periodic absorption of heat into the atmosphere from the sun cause atmospheric tides. A model atmosphere with a few tides and a background wind is generated to perform simulated tidal sampling. The latitude, longitude, and altitude coordinates of the satellites as they propagate through the atmosphere are used to model samples of the northward and southward atmospheric winds and determine how well the constellation does at regenerating the input tidal data. The integration of several software tools and a Bayesian Optimization algorithm automate the process of finding a range of options for the constellation to best perform the tidal fitting, minimize satellite fuel consumption, and cover as many latitude bands of the atmosphere as possible.

No description available.

No description available.