In today's climate of increased criminal attacks on the privacy of personal or confidential data over digital communication systems, a more secure physical communication link is required. Chaotic signals which have bifurcation behavior (depending on some initial condition) can readily be exploited to enhance the security of communication systems. A chaotic generator produces disordered sequences that provide very good auto- and cross- correlation properties similar to those of random white noise. This would be an important feature in multiple access environments. These sequences are used to scramble data in spread spectrum systems as they can produce low co-channel interference, hence improve the system capacity and performance. The chaotic signal can be created from only a single mathematical relationship and is neither restricted in length nor is repetitive/ cyclic. On the other hand, with the progress in digital signal processing and digital hardware, there has been an increased interest in using adaptive algorithms to improve the performance of digital systems. Adaptive algorithms provide the system with the ability to self-adjust its coefficients according to the signal condition, and can be used with linear or non-linear systems; hence, they might find application in chaos communication. There has been a lot of literature that proposed the use of LMS adaptive algorithm in the communication arena for a variety of applications such as (but not limited to): channel estimation, channel equalization, demodulation, de-noising, and beamforming. In this thesis, we conducted a study on the application of chaos theory in communication systems as well as the application of adaptive algorithms in chaos communication. The First Part of the thesis tackled the application of chaos theory in com- munication. We examined different types of communication techniques utilizing chaos theory. In particular, we considered chaos shift keying (CSK) and mod- ified kind of logistic map. Then, we applied space-time processing and eigen- beamforming technique to enhance the performance of chaos communication. Following on, we conducted a study on CSK and Chaos-CDMA in conjunction with multi-carrier modulation (MCM) techniques such as OFDM (FFT/ IFFT) and wavelet-OFDM. In the Second Part of the thesis, we tried to apply adaptivity to chaos com- munication. Initially, we presented a study of multi-user detection utilizing an adaptive algorithm in a chaotic CDMA multi-user environment, followed by a study of adaptive beamforming and modified weight-vector adaptive beam- forming over CSK communication. At last, a study of modified time-varying adaptive filtering is presented and a conventional adaptive filtering technique is applied in chaotic signal environment. Twelve papers have been published during the PhD candidature, include two journal papers and ten refereed conference papers.

In this thesis we study a problem that arises in answering boolean queries submitted to a search engine. Usually a search engine stores the set of IDs of documents containing each word in a pre-computed sorted order and to evaluate a query like "computer AND science" the search engine has to evaluate the union of the sets of documents containing the words "computer" and "science". More complex queries will result in more complex set expressions. In this thesis we consider the problem of evaluation of a set expression with union and intersection as operators and ordered sets as operands. We explore properties of comparison-based algorithms for the problem. A <i>proof of a set expression</i> is the set of comparisons that a comparison-based algorithm performs before it can determine the result of the expression. We discuss the properties of the proofs of set expressions and based on how complex the smallest proofs of a set expression <i>E</i> are, we define a measurement for determining how difficult it is for <i>E</i> to be computed. Then, we design an algorithm that is adaptive to the difficulty of the input expression and we show that the running time of the algorithm is roughly proportional to difficulty of the input expression, where the factor is roughly logarithmic in the number of the operands of the input expression.

In this thesis we study a problem that arises in answering boolean queries submitted to a search engine. Usually a search engine stores the set of IDs of documents containing each word in a pre-computed sorted order and to evaluate a query like "computer AND science" the search engine has to evaluate the union of the sets of documents containing the words "computer" and "science". More complex queries will result in more complex set expressions. In this thesis we consider the problem of evaluation of a set expression with union and intersection as operators and ordered sets as operands. We explore properties of comparison-based algorithms for the problem. A <i>proof of a set expression</i> is the set of comparisons that a comparison-based algorithm performs before it can determine the result of the expression. We discuss the properties of the proofs of set expressions and based on how complex the smallest proofs of a set expression <i>E</i> are, we define a measurement for determining how difficult it is for <i>E</i> to be computed. Then, we design an algorithm that is adaptive to the difficulty of the input expression and we show that the running time of the algorithm is roughly proportional to difficulty of the input expression, where the factor is roughly logarithmic in the number of the operands of the input expression.

No description available.

Noise shaping is one of the distinguishing characteristics of the sigma-delta modulation technique that separates it from other types of pulse-width modulation schemes. In sigma-delta modulation, unwanted noise and harmonics caused by quantization are intentionally pushed toward the high-frequency band in order to achieve high resolution data conversion within the signal bandwidth. Due to its robust, high in-band linearity, the sigma-delta modulation technique finds numerous applications in industry. Generally speaking, as the order of a sigma-delta modulator increases, the modulator performance becomes better, which unfortunately comes along with a decrease in the modulator¡¦s stable input range. This thesis presents a novel adaptive law which is capable of on-line tuning the loop filter of a sigma-delta modulator and reducing the out of band gain of the resulting noise transfer function when the modulator input is large, thereby widening the stable input range of the modulator without significant sacrifice of the performance. The simulation and experimental results prove the effectiveness of the proposed adaptive sigma-delta modulator.

Ocean ambient noise is one of factors that can affect the performance of sonar and underwater communication system, it can degrade the performance of sonar system on listening or active detection, and also can affect the quality of underwater communication. Due to the variation of temperature and density in the ocean which make ambient noise has directionality. Beamforming can analyze the directionality of noise energy. Conventional beamforming is based on the assumption of plane wave sound field, so the energy from each angle is obtained by linear accumulation of every element. However plane wave assumption may not be satisfied because of the boundary interactions of sound propagation and energy attenuation of water column, therefore conventional beamforming may have poor beam resolution and SNR in applications. This research is to study of the influence of spatial coherence of ambient noise on beam resolution, and to improve the beam resolution by using the adaptive algorithm from the communication system theory. Firstly, simulations were performed to study spatial coherence between plane wave and non-plane wave in ambient noise, and the results were compared with beam resolution. This research also analyzes the influence of different conditions of noise spatial coherence on beamforming with ASIAEX data. The results showed that ambient noise has lower spatial coherence at high frequency, and the beamforming has poor beam resolution because of the lower spatial coherence in noise. Therefore, the adaptive beamforming were performed to improve the beam resolution, and compared with the conventional beamforming. The results showed that the highest improvement on beam resolution is 42.9 %, and increased SNR by 6 dB. On the other hand, the application of ASIAEX data show that, the highest improvement on beam resolution is 40.0 %, and increased SNR by 8 dB. The noise notch of ambient noise became more significant by increasing in beam resolution, and it also promoted the accuracy of analysis on noise directionality.

<div> <div> <div> <p>As cislunar and outer space exploration regains worldwide popularity, the low-thrust spacecraft technology, whether in the form of solar sails, electric propulsion or nuclear propulsion, has seen a major increase in the last two decades, as new technologies arise that not only seek for a reduction of the size of the spacecraft —and/or the payloads— but also to minimize the cost of spaceflights, while trying to approach further destinations in our solar system. Mission designers are being challenged with the need to develop new strategies to generate rapid and informed initial guesses for low-thrust spacecraft trajectory design, that are easily converged into fully continuous solutions in position, velocity and mass states, in a high-fidelity dynamical model that incorporates the true ephemerides and perturbations of the gravitational attracting bodies acting on the spacecraft as it navigates through space. </p> <p>In an effort to explore further mission options for spacecraft traveling in the lunar vicinity, new interest arises into the problem of constructing a general framework for the initial guess generation of low-thrust trajectories in cislunar space, that is independent of the force models in which the orbits of interest are de ned. Given the efficiency of the low-thrust engines, most vehicles are equipped to perform further exploration of the cislunar space after completion of their primary science and technology demonstrations in orbits around the Moon. In this investigation, a generalized strategy for constructing initial guesses for low-thrust spacecraft traveling between lunar orbits that exist within the context of multiple dynamical models is presented. These trajectories are converged as mass-optimal solutions in lower fidelity model, that are easily transitioned and validated in the higher-fidelity ephemeris model, and, achieve large orbital plane changes while evolving entirely within the cislunar region. </p> <p>The robustness of the initial guess generation of the spacecraft’s path, depends highly on the fidelity of the dynamical model utilized to construct such trajectories, as well as on the numerical techniques employed to converge and propagate them into continuous solutions. Other researchers have extensively investigated novel techniques for the generation of initial guesses for the low-thrust spacecraft trajectory design problem including, but not limited to, patched conics strategies, methodologies for the transformation of impulsive burns into nite burns, the orbit chaining framework and, more recently, artificial intelligence schemes. This investigation develops an adaptive orbit chaining type approach that relies on the energy parametrization of periodic orbits that exist within the context of the circular restricted three-body problem, to construct informed initial guess for the low-thrust spacecraft trajectory.</p> <div> <div> <div> <p>A variety of multiple transfer applications for vehicles traveling between orbits in the cislunar region is explored for a wide range of low-thrust spacecraft with varying thrust acceleration magnitude. The examples presented in this investigation are consistent with the low-thrust parameters of previously own missions that utilized the same propulsion capabilities, such as, the DAWN mission and the Japanese Hayabusa missions 1 and 2. The trajectories presented in this work are optimized for either propellant consumption or time- of-flight in the lower-fidelity model, and later transitioned into a higher-fidelity ephemeris model that includes the gravitational attraction of the Sun, the Earth and the Moon. </p> <p>Two strategies are explored for the transition of trajectories from a lower-fidelity model to the higher-fidelity ephemeris model, both of which are successful in retaining the transfer geometry. The framework presented in this investigation is further applied to the upcoming NASA Lunar IceCube (LIC) mission to explore possible extended mission options once its primary science and technology demonstration objectives are achieved. It is demonstrated in this investigation that the strategies developed and presented in this work are not only applicable to the specific low-thrust vehicles explored, but it is applicable to any spacecraft with any type of propulsion technology. Furthermore, the energy-informed adaptive algorithm is easily transition to generate trajectories in a range of varying dynamical models. </p> </div> </div> </div> </div> </div> </div>

No description available.

The increasing demand for mobile communication services without a corresponding increase in RF spectrum allocation motivates the need for new techniques to improve spectrum utilization. The CDMA and adaptive antenna array are two approaches that shows real promise for increasing spectrum efficiency. In this research, we investigate the performance of different blind adaptive array algorithms in the CDMA systems. Two novel algorithms, least-squares despread respread multitarget array (LS-DRMTA) and least-squares despread respread multitarget constant modulus algorithm (LS-DRMTCMA), are developed, and a MATLAB simulation testbed is created to compare the performance of these two novel algorithms with those of the multitarget least-squares constant modulus algorithm (MT-LSCMA) and multitarget steepest-descent decision-directed (MT-SDDD) algorithm. It is shown from the simulation results that these two novel algorithms can outperform the other algorithms in all the test situations (e.g., AWGN channel, timing offset case, frequency offset case, and multipath environment). It is also shown that these two algorithms have less complexity and can converge faster than the other algorithms. / Master of Science

This thesis consists of four papers that concern error estimates for the Born-Oppenheimer molecular dynamics, and adaptive algorithms for the Car-Parrinello and Ehrenfest molecular dynamics. In Paper I, we study error estimates for the Born-Oppenheimer molecular dynamics with nearly crossing potential surfaces. The paper first proves an error estimate showing that the difference of the values of observables for the time-independent Schrödinger equation, with matrix valued potentials, and the values of observables for the ab initio Born-Oppenheimer molecular dynamics of the ground state depends on the probability to be in the excited states and the nuclei/electron mass ratio. Then we present a numerical method to determine the probability to be in the excited states, based on the Ehrenfest molecular dynamics, and stability analysis of a perturbed eigenvalue problem. In Paper II, we present an approach, motivated by the so called Landau-Zener probability estimation, to systematically choose the artificial electron mass parameters appearing in the Car-Parrinello and Ehrenfest molecular dynamics methods to approximate the Born-Oppenheimer molecular dynamics solutions. In Paper III, we extend the work presented in Paper II for a set of more general problems with more than two electron states. A main conclusion of Paper III is that it is necessary to resolve the near avoided conical intersections between all electron eigenvalue gaps, including gaps between the occupied states. In Paper IV, we numerically compare, using simple model problems, the Ehrenfest molecular dynamics using the adaptive mass algorithm proposed in Paper II and III and the Born-Oppenheimer molecular dynamics based on the so called purification of the density matrix method concluding that the Born-Oppenheimer molecular dynamics based on purification of density matrix method performed better in terms of computational efficiency. / <p>QC 20161102</p>