PN code synchronization is a common and essential task at the receiver in CDMA communication systems. In most literatures, there usually exists assumption of synchronization between the received spreading sequence and a locally generated replica. Few practical and detail synchronization schemes are showed in literatures. Moreover, there are no sufficient knowledge about operation characteristics of loop elements and operation strategies. Hence, in this thesis we propose some schemes about PN code synchronization and then do some analysis to compare performance of those schemes in AWGN channel. Code synchronization at DSSS receivers is performed in two steps. One is code acquisition and the other is code tracking. In acquisition process, we propose so called some ¡§auxiliary decision criterions¡¨ in multiple-dwell detection strategies. Analytical results are validated with computer simulations. By use of auxiliary decision criterions, the acquisition process is outperforms the conventional multiple-dwell and single-dwell detection strategies in AWGN channel. In code tracking process, we use coherent DLL. Loop filter parameters are tuned by observing phase-plane trajectories to acquire stable lock points and convergence property. In addition, we proposed a coherent DLL chip implementation, and accomplish the design flow that includes verification, synthesis, place and route, and simulation.

Two experiments tested the efficacy of gonadotropin-releasing hormone (GnRH) or estradiol cypionate (ECP) administration in combination with controlled internal drug release (CIDR) inserts on pregnancy rate to fixed-time artificial insemination (FTAI) in beef heifers. In the first experiment, heifers in the two ECP groups received ECP in conjunction with the CIDR insert. The CIDR insert was removed and PGF was administered on either d 7 or 9. Heifers received ECP 24 h after CIDR removal and were inseminated 30 h after ECP. Heifers in the two GnRH groups received GnRH in conjunction with the CIDR insert. Heifers received PGF on either d 6 or 7, and the CIDR insert was removed on d 7. Heifers were inseminated and received GnRH 48 h after CIDR removal. Pregnancy rates to FTAI were higher for heifers treated with GnRH. Pregnancy rate to FTAI was highest for heifers in the GnRH group that received PGF on d 6 and was lowest for the group that received ECP in combination with a 7-d CIDR insert. In the second experiment, heifers received GnRH in conjunction with the CIDR insert. CIDR inserts were removed and PGF was administered on d 7. Heifers were inseminated 60 h later, with one group receiving GnRH at insemination. Pregnancy rate to FTAI was higher for heifers that received GnRH at insemination. The final experiment tested the efficacy of estradiol 17_ (E17) or GnRH in combination with a CIDR insert on pregnancy rate to FTAI in Brahman cows. Either E17 or GnRH was administered in conjunction with the CIDR insert. CIDR inserts were removed on d 7. Cows in the GnRH group received PGF on d 6 and GnRH at insemination which occurred 48 h after CIDR removal. Cows in the E17 group received PGF on d 7, E17 24 h later, and were inseminated 30 h after E17 administration. Pregnancy rate to FTAI was higher for cows treated with E17. These data indicate acceptable pregnancy rates were obtained when the CIDR insert was combined with either GnRH in beef heifers or with E17 in Brahman cows.

orthogonal frequency division multiplexing (OFDM) systems are very sensitive to synchronization errors. Therefore, OFDM systems require the knowledge of symbol timing and frequency offset. Most OFDM synchronization algorithms proposed in the literature are data-aided estimation structures. Data-aided estimators use pilot symbols or training sequences to perform synchronization. However, the use of training data reduces the transmission data rate. The alternative, which we consider in this thesis, is nondata-aided methods that perform synchronization by utilizing the redundant guard interval or cyclic prefix. Recently, cyclo-stationarity of signals is applied for estimating synchronization error. Gini and Giannakis utilized the property for single carrier systems and Bolcskei applied the property for OFDM systems. In this thesis, we proposed a modified synchronization algorithm, which is extended from Giannakis and Bolcskei algorithms, in additive white Gaussian noise (AWGN) environment. According to Park¡¦s study, additional sub-carrier weightings are not needed to enhance the estimation performance. From simulation results, the proposed modified blind synchronization algorithm can achieve better performance.

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, December 2009. / Thesis Advisor: Julian, Alexander L. Second Reader: Cristi, Roberto. "December 2009." Description based on title screen as viewed on January 27, 2010. Author(s) subject terms: RS-232, USB, FPGA. Includes bibliographical references (p. 51-52). Also available in print.

This thesis is deriving from a telemedicine project "TeleCare" of constructing soft- ware for remote medical diagnosis between the doctor and the patient. The software has to fix the problem of managing local and remote media information. This thesis presents a telecommunication framework for synchronizing multiple media chan- nels, following research methodology, from problem description, iterative and incre- mental development to prototype finalization. For the framework, I have described the framework requirements and corresponding architecture design and implemen- tation. From the evaluation result of "TeleCare" software developed above it, I can conclude the framework has reached the problem.

published_or_final_version / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

No description available.

Synchronization is a problem of fundamental importance for a wide range of practical communication systems including reading media, multi-user optical channels, synchronous digital communication systems, packet-switched communication networks, distributed computing systems, etc. In this thesis I study various aspects of communication over channels with symbol synchronization errors. Symbol synchronization errors are harder to model than erasures or substitution errors caused by additive noise because they introduce uncertainties in timing. Consequently, the capacity of channels subjected to synchronization errors is a very challenging problem, even when considering the simplest channels for which only deletion errors occur. I improve on the best existing lower and upper bounds for the capacity of the deletion channel using convex and stochastic optimization techniques. I also show that simply finding closed-form expressions for the number of subsequences when deleting symbols from a string is computationally prohibitive. Constructing efficient synchronization error-correcting codes is also a challenging task. The main result of the thesis is the design of a new family of codes able to correct several types of synchronization errors. The codes use trellis and modified versions of the Viterbi decoding algorithm, and therefore have very low encoding and decoding complexities. They also have high data rates and work for reasonably noisy channels, which makes them one of the first synchronization-correcting codes that have any chance of being used in practical systems. In the last part of the thesis, I show that a synchronization approach can solve the opportunistic spectrum access problem in cognitive radio, where cognitive users want to communicate in presence of legacy users to whom the bandwidth has been licensed. I also consider the amount of communication required to solve a large class of distributed problems where synchronization errors can occur. More precisely, I study how allowing the parties to solve the problems incorrectly with small probability can reduce the total amount of communication or the number of messages that need to be exchanged.

No description available.

Data synchronization is the problem of bringing multiple versions of the same data on different remote devices to the most up to date version. This thesis looks into the particular problem of key-value storage systems synchronization between mobile devices in a peer-to-peer environment. In this research, we describe, implement and evaluate a new key-value storage system synchronization algorithm using a 2-phase approach, combining approximate synchronization in the first phase and exact synchronization in the second phase. The 2-phase architecture helps the algorithm achieve considerable boost in performance in all three major criteria of a data synchronization algorithm, namely synchronization time, processing time and communication cost, while still being suitable to operate in a peer-to-peer environment. The performance increase makes it feasible to employ database synchronization technique in a wider range of mobile applications, especially those operating on a slow peer-to-peer network.