• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 50
  • 34
  • 25
  • 21
  • 10
  • 5
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 177
  • 48
  • 26
  • 20
  • 18
  • 18
  • 17
  • 14
  • 14
  • 14
  • 14
  • 12
  • 12
  • 11
  • 11
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
51

ZX-Calculi for Quantum Computing and their Completeness / ZX-Calculs pour l'informatique quantique et leur complétude

Vilmart, Renaud 19 September 2019 (has links)
Le ZX-Calculus est un langage graphique puissant et intuitif, issu de la théorie des catégories, et qui permet de raisonner et calculer en quantique. Les évolutions quantiques sont vues dans ce formalisme comme des graphes ouverts, ou diagrammes, qui peuvent être transformés localement selon un ensemble d’axiomes qui préservent le résultat du calcul. Un aspect des plus importants du langage est sa complétude : Étant donnés deux diagrammes qui représentent la même évolution quantique, puis-je transformer l’un en l’autre en utilisant seulement les règles graphiques permises par le langage ? Si c’est le cas, cela veut dire que le langage graphique capture entièrement la mécanique quantique. Le langage est connu comme étant complet pour une sous-classe (ou fragment) particulière d’évolutions quantiques, appelée Clifford. Malheureusement, celle-ci n’est pas universelle : on ne peut pas représenter, ni même approcher, certaines évolutions. Dans cette thèse, nous proposons d’élargir l’ensemble d’axiomes pour obtenir la complétude pour des fragments plus grands du langage, qui en particulier sont approximativement universels, voire universels. Pour ce faire, dans un premier temps nous utilisons la complétude d’un autre langage graphique et transportons ce résultat au ZX-Calculus. Afin de simplifier cette fastidieuse étape, nous introduisons un langage intermédiaire, intéressant en lui-même car il capture un fragment particulier mais universel de la mécanique quantique : Toffoli-Hadamard. Nous définissons ensuite la notion de diagramme linéaire, qui permet d’obtenir une preuve uniforme pour certains ensembles d’équations. Nous définissons également la notion de décomposition d’un diagramme en valeurs singuliaires, ce qui nous permet de nous épargner un grand nombre de calculs. Dans un second temps, nous définissons une forme normale qui a le mérite d’exister pour une infinité de fragments du langage, ainsi que pour le langage lui-même, sans restriction. Grâce à cela, nous reprouvons les résultats de complétude précédents, mais cette fois sans utiliser de langage tiers, et nous en dérivons de nouveaux, pour d’autres fragments. Les états contrôlés, utilisés pour la définition de forme normale, s’avèrent en outre utiles pour réaliser des opérations non-triviales telles que la somme, le produit terme-à-terme, ou la concaténation. / The ZX-Calculus is a powerful and intuitive graphical language, based on category theory, that allows for quantum reasoning and computing. Quantum evolutions are seen in this formalism as open graphs, or diagrams, that can be transformed locally according to a set of axioms that preserve the result of the computation. One of the most important aspects of language is its completeness: Given two diagrams that represent the same quantum evolution, can I transform one into the other using only the graphical rules allowed by the language? If this is the case, it means that the graphical language captures quantum mechanics entirely. The language is known to be complete for a particular subclass (or fragment) of quantum evolutions, called Clifford. Unfortunately, this one is not universal: we cannot represent, or even approach, certain quantum evolutions. In this thesis, we propose to extend the set of axioms to obtain completeness for larger fragments of the language, which in particular are approximately universal, or even universal. To do this, we first use the completeness of another graphical language and transport this result to the ZX-Calculus. In order to simplify this tedious step, we introduce an intermediate language, interesting in itself as it captures a particular but universal fragment of quantum mechanics: Toffoli-Hadamard. We then define the notion of a linear diagram, which provides a uniform proof for some sets of equations. We also define the notion of singular value decomposition of a diagram, which allows us to avoid a large number of calculations. In a second step, we define a normal form that exists for an infinite number of fragments of the language, as well as for the language itself, without restriction. Thanks to this, we reprove the previous completeness results, but this time without using any third party language, and we derive new ones for other fragments. The controlled states, used for the definition of the normal form, are also useful for performing non-trivial operations such as sum, term-to-term product, or concatenation.
52

Byggproduktionsplanering : En studie av metoder och verktyg / Construction production planning : A study of methods and tools

Bruér, Björn, Lennartsson, Adam January 2012 (has links)
Examensarbetet redogör för byggproduktionsplanering med en fördjupning inom tidsplaneringsmetoder- och verktyg, vilka kan användas som hjälpmedel inom området.  Inom fördjupningen gjordes två praktiska försök och intervjuer genomfördes för att få en verklig bild av hur planeringen fungerar, samt för att få feedback på försöken.  Arbetet resulterade i slutsatsen att olika planeringsmetoder bör användas i olika skeden av byggproduktionsplaneringen, samt att de olika planeringsmetoderna är till olika nytta för de varierande arbetsrollerna i en byggorganisation.  Man kan med fördel använda sig av en kombination av planeringsmetoderna, CPM, LOB och den relativt okända ”Kontinuitetsmetoden” när man planerar och styr sin byggproduktion. Till sin hjälp bör Microsoft Excel och det mer produktionsanpassade programmet PlanCon + väljas.  Efter ett försök i arbetet att upprätta en 3D APD-plan med hjälp av verktyget Google Sketch Up, rekommenderas det varmt. Ett kostnadseffektivt verktyg som skapar en mer än det kostar. / The thesis describes the construction production planning, with focus in planning methods- and tools that can be used as an aid in the field. Within the recess, two practical tests and a couple of interviews were conducted to get an actual picture of how the planning works in the field, and to get feedback on the tests. This work resulted in the conclusion that different planning methods, should be used at various stages of the construction production planning, and that diverse methods have different benefits for different actors in the construction organization. One can usefully use a combination of the planning methods, CPM, LOB and the relatively unknown “Continuity method” when planning and controlling a construction project. For support in this work, Microsoft Excel and the more customized program PlanCon + should be used. After an attempt to create a 3D WPA-plan, using the Google SketchUp software, we strongly recommend it. SketchUp is a cost effective tool that creates more than it costs.
53

HOW WELL DOES A BLIND, ADAPTIVE CMA EQUALIZER WORK IN A SIMULATED TELEMETRY MULTIPATH ENVIRONMENT

Law, Eugene 10 1900 (has links)
International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California / This paper will present the results of experiments to characterize the performance of a blind, adaptive constant modulus algorithm (CMA) equalizer in simulated telemetry multipath environments. The variables included modulation method, bit rate, received signal-to-noise ratio, delay of the indirect path relative to the direct path, amplitude of the indirect path relative to the direct path, and fade rate. The main measured parameter was bit error probability (BEP). The tests showed that the equalizer usually improved the data quality in the presence of multipath.
54

EXPERIMENTAL RESULTS FOR PCM/FM, TIER 1 SOQPSK, AND TIER II MULTI-H CPM WITH TURBO PRODUCT CODES

Geoghegan, Mark 10 1900 (has links)
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Improving the spectral-efficiency of aeronautical telemetry has been a principal area of research over the last several years due to the increasing demand for more data and the limitation of available spectrum. These efforts have lead to the development of the ARTM Tier 1 SOQPSK and Tier II Multi-h CPM waveforms which improve the spectral efficiency by two and three times, as compared to legacy PCM/FM, while maintaining similar detection efficiency. Now that more spectrally efficient waveform options are becoming available, another challenge is to further increase the detection performance. Better detection efficiency translates into additional link margin that can be used to extend the operating range, support higher data throughput, or significantly improve the quality of the received data. It is well known that Forward Error Correction (FEC) is one means of achieving this objective at the cost of additional overhead and increased receiver complexity. However, as mentioned above, spectral efficiency is also vitally important meaning that the FEC must also have a low amount of overhead. Unfortunately, low overhead and high coding gain are generally conflicting trades, although recent work has shown that Turbo Product Codes (TPC) are a particularly attractive candidate. Computer simulations predict that very impressive gains in detection performance are possible for a relatively small increase in bandwidth. The main drawbacks are the additional complexity of the decoding circuitry and an increase in receive side latency. This paper presents the latest simulation and hardware performance results of PCM/FM, SOQPSK, and Multi-h CPM with TPC.
55

EXPERIMENTAL RESULTS FOR PCM/FM, TIER 1 SOQPSK, AND TIER II MULTI-H CPM WITH CMA EQUALIZATION

Geoghegan, Mark 10 1900 (has links)
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / It is widely recognized that telemetry channels, particularly airborne channels, are afflicted by multipath propagation effects. It has also been shown that adaptive equalization can be highly effective in mitigating these effects. However, numerous other factors influence the behavior of adaptive equalization, and the type of modulation employed is certainly one of these factors. This is particularly true on modulations that exhibit different operating bandwidths. Computer simulations using the Constant Modulus Algorithm (CMA) have recently been reported for PCM/FM, ARTM Tier 1 SOQPSK, and Tier II SOQPSK. These encouraging results have led to a hardware implementation of a CMA equalizer. This paper presents the latest results from this work.
56

BINARY GMSK: CHARACTERISTICS AND PERFORMANCE

Tsai, Kuang, Lui, Gee L. 10 1900 (has links)
International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Gaussian Minimum Shift Keying (GMSK) is a form of Continuous Phase Modulation (CPM) whose spectral occupancy can be easily tailored to the available channel bandwidth by a suitable choice of signal parameters. The constant envelope of the GMSK signal enables it to corporate with saturated power amplifier without the spectral re-growth problem. This paper provides a quantitative synopsis of binary GMSK signals in terms of their bandwidth occupancy and coherent demodulation performance. A detailed account of how to demodulate such signals using the Viterbi Algorithm (VA) is given, along with analytical power spectral density (PSD) and computer simulated bit-error-rate (BER) results for various signal BT products. The effect of adjacent channel interference (ACI) is also quantified. Ideal synchronization for both symbol time and carrier phase is assumed.
57

DATA-AIDED SYMBOL TIME AND CARRIER PHASE TRACKING FOR PRE-CODED CPM SIGNALS

Lui, Gee L., Tsai, Kuang 10 1900 (has links)
International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, Nevada / A data-aided approach to symbol time and carrier phase synchronization applicable to general continuous phase modulation (CPM) signals with modulation index 0.5 is described. Simulated BER performance of two receivers equipped with these synchronizers is presented for a GMSK BT=1/5 signal received in noise with constant and dynamic synchronization errors. Results demonstrate that these synchronizers provide a very promising and yet simple solution to the tracking problem in the design of coherent CPM receivers.
58

ARTM TIER II WAVEFORM PERFORMANCE

Temple, Kip 10 1900 (has links)
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / One of the charters of the Advanced Range Telemetry (ARTM) program was to develop more spectrally efficient waveforms while trying to maintain similar performance to the legacy waveform, Pulse Code Modulation/Frequency Modulation (PCM/FM). The first step toward this goal was the ARTM Tier I family of waveforms which include Feher patented, quadrature phase shift keying, -B version (FQSPKB) and shaped offset quadrature phase shift keying, Telemetry Group version (SOQPSK-TG). The final step was development of Tier II, an even more spectrally efficient waveform, multi-h Continuous Phase Modulation (CPM). This paper characterizes the performance of this waveform when applied in an airborne telemetry environment and, where appropriate, comparisons are made with existing Tier 0 and Tier I waveforms. The benefits, drawbacks, and trade-offs when applying this waveform in an airborne environment will also be discussed.
59

RECOMMENDED MINIMUM TELEMETRY FREQUENCY SPACING WITH CPFSK, CPM, SOQPSK, AND FQPSK SIGNALS

Law, Eugene 10 1900 (has links)
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / This paper will present equations for calculating the minimum recommended frequency separation of two digital telemetry signals. The signals can be filtered continuous phase frequency shift keying (CPFSK), multi-h continuous phase modulation (CPM) [1], shaped offset quadrature phase shift keying-Telemetry Group (SOQPSK-TG, aka SOQPSK-A*) [2], or Feher’s patented quadrature phase shift keying FQPSK-B (or FQPSK-JR [3]). The equations are based on measured data in an adjacent channel interference (ACI) environment for filtered CPFSK (aka PCM/FM), multi-h CPM (or CPM for short), SOQPSK-TG, FQPSK-JR, and FQPSK-B. This paper is an extension of my 2001 and 2002 International Telemetering Conference papers on this topic [4, 5]. The quantity measured was bit error probability (BEP) versus frequency separation at a given signal energy per bit to noise power spectral density ratio (Eb/No). The interferers were CPFSK, CPM, SOQPSK-TG or FQPSK-B (-JR) signals. The results presented in this paper will be for a desired signal bit rate of 1 to 20 Mb/s, one interferer 20 dB larger than the desired signal (a few tests included two interferers), and various center frequency spacings, interfering signals, receivers, and demodulators. The overall ACI test effort has collected data sets at several bit rates and with one and two interferers. The results will be useful to system designers and range operators as they attempt to maximize the number of Mb/s that can be simultaneously transmitted with minimal interference in the telemetry bands.
60

ADJACENT CHANNEL INTERFERENCE MEASUREMENTS WITH CPFSK, CPM AND FQPSK-B SIGNALS

Law, Eugene 10 1900 (has links)
International Telemetering Conference Proceedings / October 21, 2002 / Town & Country Hotel and Conference Center, San Diego, California / This paper will present measured data in an adjacent channel interference (ACI) environment for filtered continuous phase frequency shift keying (CPFSK or FM), multi-h continuous phase modulation (multi-h CPM or CPM for short) [1] and Feher’s patented quadrature phase shift keying (FQPSK-B) [2]. This paper is an extension of my 2001 International Telemetering Conference paper on this topic [3]. The quantity measured was bit error probability (BEP) versus signal energy per bit to noise power spectral density ratio (E(b)/N(o)). The interferers were CPFSK, CPM, or FQPSK-B signals. The results presented in this paper will be for a desired signal bit rate of 5 Mb/s, one interferer 20 dB larger than desired signal (a few tests included two interferers), and various center frequency spacings, interfering signals, receivers, and demodulators. The overall ACI test effort will collect data sets at several bit rates and with one and two interferers. The results will be useful to system designers and range operators as they attempt to maximize the number of Mb/s that can be simultaneously transmitted with minimal interference in the telemetry bands.

Page generated in 0.0241 seconds