Spelling suggestions: "subject:"llr"" "subject:"rlr""
1 |
Improving the dynamical model of the Moon using lunar laser ranging (LLR) and spacecraft data / Amélioration du modèle dynamique de la Lune à l'aide de données de télémétrie laser lunaire (LLR)Viswanathan, Vishnu 10 November 2017 (has links)
L'objectif principal de ce travail était d'améliorer le modèle dynamique de la Lune dans les éphémérides numériques INPOP et d’exploiter cette amélioration en vu d’une meilleure caractérisation de la structure interne de la Lune et d’effectuer des tests de la relativité générale. Dans un premier temps, un travail d’analyse des algorithmes nécessaires aux calculs des points normaux utilisés pour la construction des éphémérides lunaire a été effectué. Une analyse approfondie des procédures utilisées par l’équipe de Grasse montre l'impact du choix de l’algorithme sur le calcul de l'incertitude. L'importance de l'incertitude du point normal se reflète dans la méthode du moindre carré pondéré utilisée pour la construction des éphémérides. En particulier, l'absence d'un algorithme standardisé entre les différentes stations LLR introduit des biais dans l’estimation des incertitudes qu’il est important de prendre en compte. La thèse a également bénéficié d'un ensemble de données plus dense en raison des améliorations techniques et du passage de la longueur d'onde à l'infrarouge à la station de Grasse (Courde et al., 2017). Dans un second temps, afin de permettre des analyses multi-techniques combinant mesures SLR et LLR, la réduction des observations LLR a été introduite dans le logiciel de détermination d'orbites GINS du CNES. La modélisation suit les recommandations de IERS et été validée par une comparaison étape par étape avec les groupes d'analyse LLR de l’Observatoire de Paris et à Hanovre avec une précision de l’ordre de 1 mm. En outre, la correction des effets due au chargement hydrologique observé à la station Grasse a été mise en œuvre et a fait l’objet d’une première communication poster en 2016 (Mémin et al. 2016). Une version améliorée du modèle de réduction LLR a été intégrée à la dernière version distribuée du logiciel GINS par l’équipe de géodésie spatiale (GRGS) du CNES.Le modèle dynamique lunaire d’INPOP a d'abord été développé par Manche (2011). Cependant, en raison de l'absence du noyau fluide dans la version précédente (INPOP13c), les résidus obtenus après ajustement étaient au niveau de 5 cm pour la période moderne (2006). Une comparaison détaillée des équations dynamiques avec les éphémérides JPL DE430 a permis d'identifier les changements requis dans INPOP pour l'activation du noyau liquide lunaire. D'autres modifications ont permis l'utilisation d'un champ de gravité lunaire déterminé par la mission spatiale GRAIL. L'utilisation d'un algorithme de moindres carrés sous contraintes a aussi été utilisé afin de maintenir les paramètres connus dans des bornes compatibles avec leurs incertitudes. La nouvelle éphéméride (INPOP17a) produit un résidu de 1,4 à 1,8 cm, compatible avec (Folkner et al. 2014) et (Pavlov et al. 2016). INPOP17a est distribuée sur le site de l’imcce (www.imcce.fr/inpop) et une documentation a été publiée (Viswanathan et al. 2017) dans les notes scientifiques de l’imcce.En outre, en fournissant des contraintes plus sévères dans le modèle dynamique sur le champ de gravité lunaire à partir de l'analyse des données GRAIL, une signature caractéristique de libration lunaire avec une période de 6 ans a été révélée avec une amplitude de +/- 5 mm. Plusieurs pistes ont été étudiées pour l'identification de cet effet, impliquant des termes de marée et des composants de couple à plus haut degré. Cela reste encore un travail en cours, qui se poursuivra grâce à un contrat postdoctoral à Paris. Une publication est en cours de révision à ce sujet.Les résidus au niveau d'un centimètre permettent des tests précis du principe d'équivalence dans le système solaire. La valeur ajustée du paramètre caractérisant l'accélération différentielle de la Terre et de la Lune vers le Soleil a été obtenue et les résultats sont conformes aux travaux antérieurs (Williams et al 2012, Hofmann et al. 2016). Une interprétation en terme de théorie du dilaton est proposée. Une publication est en cours de finalisation. / The main goal of the Ph.D. thesis of Vishnu Viswanathan was to improve the dynamical model of the Moon within the numerically integrated ephemeris (INPOP) and to derive results of scientific value from this improvement through the characterization of the lunar internal structure and tests of general relativity.At first, raw binaries of LLR echoes obtained from the Grasse ILRS station was used to analyze the algorithm used by the facility, for the computation of a normal point from the full-rate data. Further analysis shows the dependence of the algorithm on the reported uncertainty contained within the distributed LLR normal points from Grasse. The importance of the normal point uncertainty is reflected in the weighted least square procedure used for parameter estimation, especially in the absence of a standardized algorithm between different LLR ground stations. The thesis also benefitted in terms of a more dense dataset due to technical improvements and the switch of operational wavelength to infrared at the Grasse LLR facility (Courde et al. 2017).The reduction of the LLR observations was carried out on GINS orbit determination software from CNES. The modeling follows the IERS 2010 recommendations for the correction of all known effects on the light-time computation. The subroutines were verified through a step by step comparison study using simulated data, with LLR analysis groups in Paris and Hannover, maintaining any discrepancies in the Earth-Moon distance below 1mm. Additionally, correction of effects due to hydrological loading observed at the Grasse station has been implemented. An improved version of the LLR reduction model was submitted to the space geodesy team of CNES (GRGS).The lunar dynamical model of INPOP was first developed by Manche (2011). However, due to the absence of the fluid core within the previous version of INPOP (13c), the residuals obtained after a least-square fit were in the level of 5cm for the modern day period (2006 onwards). A detailed comparison of the dynamical equations with DE430 JPL ephemeris helped to identify required changes within INPOP for the activation of the lunar fluid core. Other modifications allowed the use of a spacecraft determined lunar gravity field within the dynamical model. The use of a bounded value least square algorithm during the regression procedure accounted for variability to well-known parameters from their reported uncertainties. The resulting iteratively fit solution of INPOP ephemeris then produces a residual of 1.4-1.8 cm, on par with that reported by Folkner et al. 2014 and Pavlov et al. 2016. The new INPOP ephemeris (INPOP17a) is distributed through the IMCCE website (www.imcce.fr/inpop) with a published documentation (Viswanathan et al. 2017) in the scientific notes of IMCCE.Furthermore, on providing tighter constraints on the lunar gravity field from GRAIL-data analysis within the dynamical model, a characteristic lunar libration signature with a period of 6 years was revealed with an amplitude of +/- 5mm. Several tracks were investigated for the identification of the unmodelled effect, involving higher degree tidal terms and torque components. This remains as a work in progress, which will be continued through a postdoctoral contract in Paris. A publication is under revision on this subject.Residuals at the level of a centimeter allow precision tests of the principle of equivalence in the solar system. The fitted value of the parameter characterizing the differential acceleration of the Earth and the Moon towards the Sun was obtained with numerically integrated partial derivatives. The results are consistent with the previous work by Williams et al (2009, 2012), and Hofmann et al. (2010, 2016). An article on this work is in preparation.
|
2 |
Design and Decoding LDPC Codes With Low ComplexityZheng, Chao Unknown Date
No description available.
|
3 |
Design and Implementation of Efficient Algorithms for Wireless MIMO Communication SystemsRoger Varea, Sandra 16 July 2012 (has links)
En la última década, uno de los avances tecnológicos más importantes que han hecho culminar la nueva generación de banda ancha inalámbrica es la comunicación mediante sistemas de múltiples entradas y múltiples salidas (MIMO). Las tecnologías MIMO han sido adoptadas por muchos estándares inalámbricos tales como LTE, WiMAS y WLAN. Esto se debe principalmente a su capacidad de aumentar la máxima velocidad de transmisión , junto con la fiabilidad alcanzada y la cobertura de las comunicaciones inalámbricas actuales sin la necesidad de ancho de banda extra ni de potencia de transmisión adicional. Sin embargo, las ventajas proporcionadas por los sistemas MIMO se producen a expensas de un aumento sustancial del coste de implementación de múltiples antenas y de la complejidad del receptor, la cual tiene un gran impacto sobre el consumo de energía. Por esta razón, el diseño de receptores de baja complejidad es un tema importante que se abordará a lo largo de esta tesis.
En primer lugar, se investiga el uso de técnicas de preprocesado de la matriz de canal MIMO bien para disminuir el coste computacional de decodificadores óptimos o bien para mejorar las prestaciones de detectores subóptimos lineales, SIC o de búsqueda en árbol. Se presenta una descripción detallada de dos técnicas de preprocesado ampliamente utilizadas: el método de Lenstra, Lenstra, Lovasz (LLL) para lattice reduction (LR) y el algorimo VBLAST ZF-DFE. Tanto la complejidad como las prestaciones de ambos métodos se han evaluado y comparado entre sí. Además, se propone una implementación de bajo coste del algoritmo VBLAST ZF-DFE, la cual se incluye en la evaluación.
En segundo lugar, se ha desarrollado un detector MIMO basado en búsqueda en árbol de baja complejidad, denominado detector K-Best de amplitud variable (VB K-Best). La idea principal de este método es aprovechar el impacto del número de condición de la matriz de canal sobre la detección de datos con el fin de disminuir la complejidad de los sistemas / Roger Varea, S. (2012). Design and Implementation of Efficient Algorithms for Wireless MIMO Communication Systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/16562 / Palancia
|
4 |
Astronomical seeing conditions as determined by turbulence modelling and optical measurementNickola, Marisa 12 February 2013 (has links)
Modern space geodetic techniques are required to provide measurements of millimetre-level accuracy. A new fundamental space geodetic observatory for South Africa has been proposed. It will house state-of-the-art equipment in a location that guarantees optimal scientific output. Lunar Laser Ranging (LLR) is one of the space geodetic techniques to be hosted on-site. This technique requires optical (or so-called astronomical) seeing conditions, which allow for the propagation of a laser beam through the atmosphere without excessive beam degradation. The seeing must be at ~ 1 arc second resolution level for LLR to deliver usable ranging data. To establish the LLR system at the most suitable site and most suitable on-site location, site characterisation should include a description of the optical seeing conditions. Atmospheric turbulence in the planetary boundary layer (PBL) contributes significantly to the degradation of optical seeing quality. To evaluate astronomical seeing conditions at a site, a two-sided approach is considered – on the one hand, the use of a turbulence-resolving numerical model, the Large Eddy Simulation NERSC (Nansen Environmental and Remote Sensing Centre) Improved Code (LESNIC) to simulate seeing results, while, on the other hand, obtaining quantitative seeing measurements with a seeing monitor that has been developed in-house. / Dissertation (MSc)--University of Pretoria, 2012. / Geography, Geoinformatics and Meteorology / MSc / Unrestricted
|
5 |
Low-complexity list detection algorithms for the multiple-input multiple-output channelMilliner, David Louis 20 October 2009 (has links)
Modern communication systems demand ever-increasing data rates. Meeting this increased demand is not easy due to regulation and fundamental physical constraints. The utilization of more than one antenna at both the transmitter and receiver produces a multiple-input multiple-output (MIMO) channel, thereby enabling (under certain channel conditions) increased data rates without the need for increased bandwidth or transmission power. Concurrent with this increase in bandwidth is an increase in the receiver's computational complexity which, for a brute-force detector, increases exponentially. For receivers that possess error correcting capabilities, the problem of constructing a detector with low computational complexity that allows for near-exact a posteriori detection is challenging for transmission schemes employing even a modest number of transmit antennas and modulation alphabet sizes. The focus of this dissertation is on the construction of MIMO detection algorithms with low and fixed computational complexity. Specifically, the detection algorithms in this dissertation generate a list of potential transmission vectors resulting in realizable communication receivers with low and fixed computational complexity combined with low error rate performance in both coded and uncoded systems.
A key contribution in this dissertation is a breadth-first fixed-complexity algorithm known as the smart-ordered and candidate-adding algorithm that achieves a desirable performance-complexity tradeoff. This algorithm requires only a single pass of a search tree to find its list of transmission vectors. We then construct a framework within which we classify a large class of breadth-first detection algorithms.
The design of receiver algorithms for MIMO systems employing space-time codes and error correction is an important area of study. In this dissertation we propose a low and fixed computational complexity algorithm for an increasingly significant algebraic space-time code known as the golden code.
The notion of computational complexity is critical in the design of practical MIMO receivers. We provide an analysis of computational complexity in relation to list-based soft-output detection where, in some instances, bounds are placed on the computational complexity of MIMO detection. For this analysis we utilize a metric known as the number of branch metric computations.
The value at which the log-likelihood ratio (LLR) of conditional probabilities for a transmitted bit being either a 1 or a 0 is 'clipped' has an impact on a system's error rate performance. We propose a new approach for determining LLR clipping levels that, in contrast to prior approaches which clip to a predetermined fixed LLR clipping level, exploits channel state information to improve the error rate performance of suboptimal detection algorithms.
Orthogonal frequency-division (OFDM) multiplexing is an effective technique for combating frequency-selective wideband communication channels. It is common practice for MIMO-OFDM detectors to implement the same detector at each subcarrier, in which case the overall performance is dominated by the weakest subcarrier. We propose a hard-output list detection receiver strategy for MIMO-OFDM channels called nonuniform computational complexity allocation, whereby the receiver adapts the computational resources of the MIMO detector at each subcarrier to match a metric of the corresponding channel quality. The proposed nonuniform algorithm improves performance over uniform allocation.
|
6 |
Turbo konvoluční a turbo blokové kódy / Turbo-convolution and turbo-block codesŠedý, Jakub January 2011 (has links)
The aim is to explain the Turbo convolutional and block turbo codes and decoding the secure message. The practical part focuses on the design of a demonstration program in Matlab. The work is divided into four parts. The first two deal with theoretical analysis of coding and decoding. The third section contains a description created a demonstration program that allows you to navigate the process of encoding and decoding. The fourth is devoted to simulation and performance of turbo codes.
|
7 |
Analysis of open and laparoscopic liver resections in a german high-volume liver tumor centerGuice, Hanna 04 August 2022 (has links)
In recent years laparoscopic liver surgery established itself into today’s standard of care regarding surgical liver treatment. It was a long way for minimally invasive liver resection to develop and popularize as it was accompanied by initial reservations and concerns. Some of these already had been clarified while other questions still remain and require further investigation in the complex field of laparoscopic liver surgery.
Initial concerns with respect to oncological inferiority and technical inapplicability in contrast to open surgery treatment could have been disproved within the framework of retrospective studies. In contribution to that, the aim of the study was to compare the surgical results and postoperative outcomes of consecutive laparoscopic liver resections (LLR) and open liver resections (OLR) at the high-volume liver tumor center of Leipzig university hospital.
Since common classification systems for open liver surgery cannot be applied for LLR, the introduction of specific difficulty scoring systems for LLR helps to assess and classify the complexity of minimal invasive liver resection. With an increase in experience, modification of hybrid surgery and the application of novel visualization techniques such as indocyanine green (ICG) staining or hyperspectral imaging (HSI), more challenging procedures were accomplished, that initially would have been contraindicated for the laparoscopic approach (e.g. perihilar cholangiocarcinoma (pCCA) requiring biliary reconstruction). During the years 2018 and 2019 42% of all liver resections were approached laparoscopically at the Leipzig University hospital.
A retrospective data analysis of n=231 patients undergoing LLR or OLR for the years 2018 and 2019 was performed and previously determined variables were collected. As a primary outcome measure, the short-term surgical and postoperative outcome of patients receiving LLR (=LLR group) compared to the patient cohort being treated by open resection (=OLR group) was evaluated. All liver resections were executed or assisted by the same two surgeons. Prior to surgery, every case was reviewed in a multidisciplinary tumor-board meeting and primarily assessed for possible minimal invasive approach. Analysis for patient demographics, pathologic diagnosis, radiologic findings and peri- and intraoperative surgical data was carried out. For LLRs intraoperatively, ICG counter perfusion staining was used in anatomic liver resection and direct ICG tumor staining was employed for tumor demarcation.
With respect to classification, the extent of OLR was graded according to the Brisbane 2000 terminology in minor and major resections, whereas LLRs were categorized by means of difficulty (in accordance with Ban et al. and Di Fabio et al.). For measurement of surgical complication and assessment of morbidity, the Clavien-Dindo classification was applied.
OLR was performed in n=124 (57%) and LLR in n=93 (43%). From all minimally invasive treated patients, 79% were operated totally laparoscopic and 16% were laparoscopic-hand-assisted due to infeasible lesions in the posterosuperior segments 7, 8 and 4a. In 5 cases a conversion to open surgery was necessary because of inaccessibility, tumor infiltration or morbid obesity. 28% of patients had previous upper abdominal surgery, whereof 36% in the OLR group and 19% in the LLR group.
Regarding patient demographics, the mean age was significantly higher in OLR and the sex ratio was in favor of men for both groups.
Malignant tumor lesions comprised 77%, while 24% were benign lesions. In both groups this larger number of malignant oncologic operation remained valid. The most common benign indications comprised focal nodular hyperplasia (FNH) and liver adenomas.
It was shown that patients with CCA and Colorectal liver metastases (CRLM) were predominantly treated by open surgery, while patients with HCC diagnosis received LLR to a greater extent.
Concerning the type of liver resection, non-anatomical resections were the most frequent in the cohort with 47%, thereof 55% LLR and 40% OLR. Followed second most by anatomic right and left hemihepatectomies and third most by left lateral resections, which were predominantly performed in laparoscopic technique. On the other hand, extended resections and trisectionectomies were predominantly operated by OLR. Radical lymphadenectomy was performed to a greater extent during OLR.
Results showed that the mean operative time was longer for OLR (341 minutes in median) compared to LLR (273 minutes in median). Also the mean length of hospital stay was shorter for LLR patients, as well as abdominal drains were placed to lesser extent in LLR compared to OLR. In regard to R0-resection, R0-rates were higher in LLR with 98% vs. 86% in OLR. Thereby being highest for CRLM resections, followed by HCC and CCA.
Putting all liver resections into classification systems, it was found that of all open procedures, 52% had major and 48% underwent minor resection according to Brisbane 2000. From the LLR group, in accordance with Di Fabio et al. 39% were classified as laparoscopic major hepatectomies, comprising 44% laparoscopic traditional major hepatectomies (LTMH) and 56% laparoscopic posterosuperior major hepatectomies (LPMH), which were technically challenging. The difficulty index stated by Ban et al. was classified as low for 8% of all performed LLRs, intermediate for 45% and of high difficulty in even 47%.
Relating to morbidity (=Clavien-Dindo 3b or greater), patients with LLR had significantly lower morbidity compared to OLR. The same applies for in-hospital mortality.
Our data show that despite the high number of complex and high-difficulty-classified liver resections that were performed, morbidity and mortality rates were low. As mentioned before, R0 resection rate in the LLR group was better than in the OLR group, however, this was not a case matched study, so a direct comparison is not valid. But still the study could demonstrate that the high number of LLRs being performed at the Leipzig University hospital, did not impair R0-resection rates. With an overall hospital mortality rate of 5.9% in the cohort, good results were achieved. Particularly the low rate of 1% in the LLR group speaks for itself and confirms that the development of a minimal invasive liver resection program should be on the right track.
The majority of patients in the LLR and OLR group received an oncologic resection, what also resembles the global attitude that minimally invasive techniques are not reserved for selected tumor entities. Still it should be emphasized, the indication for a liver resection should not be loosened just due to minimal invasive accessibility, especially in benign liver lesions. Nevertheless, in the study the majority of benign lesions was operated by LLR.
A few patients diagnosed with CCA received LLR. Thereof predominantly iCCA cases were indicated for a minimal invasive approach without biliary duct reconstruction and satisfying short-term outcomes over OLR could be obtained. However, only one case of pCCA which required Roux-Y bile duct reconstruction was treated with LLR in the study group, so if laparoscopic surgery is capable to replace the open approach in terms of treatment strategies for pCCA remains questionable.
Patients with CRLM represent the centerpiece of our study population, still only 13% received LLR. The main reason of applying OLR was the high tumor load requiring future liver remnant augmentation strategies. As liver resection is confirmed to be the approach of choice for patients with HCC in cirrhosis, it is not surprising that HCC diagnosis accounted for the major part of LLRS in our collective.:Vorbemerkung und Bibliographie, 3
Abkürzungsverzeichnis, 4
Einführung, 5
- 1. Development of minimal invasive liver surgery, 5
- 2. Prior concerns of LLR, 6
- 3. Benefits of laparoscopic surgery, 6
3.1 General advantages of minimal invasive surgery, 6
3.2 Specific benefits of applying LLR, 7
- 4. Indications for LLR, 7
4.1 Benign liver lesions, 8
4.2 Malignant liver lesions, 8
4.3 Liver transplantation, 9
- 5. Technical supplement, 9
5.1 Hybrid and hand-assisted techniques, 10
- 6. Classification systems, 11
6.1 Difficulty scoring, 11
6.2 Clavien-Dindo Classification ,12
- 7. Limitations of LLR, 12
- 8. Aim of the study, 13
Publikation, 14
Zusammenfassung, 26
Literaturverzeichnis, 30
Darstellung des eignen Beitrags, 34
Selbstständigkeitserklärung, 35
|
8 |
Reliable Communications under Limited Knowledge of the ChannelYazdani, Raman Unknown Date
No description available.
|
Page generated in 0.0348 seconds