SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
One half of Professor Xiong's effort will investigate robust timing synchronization schemes for dynamically varying characteristics of aviation communication channels. The other half of his time will focus on efficient modulation and coding study for the emerging quantum communications.
This paper compares the performances of two different types of data-derived symbol synchronizers, namely, Filter and Square (FS) and Digital Data Transition Tracking Loop (DTTL), in the presence of unbalanced data streams.
This paper examines the implementaion of MOSFETs as synchronous rectifiers which results in a substantial improvement in power processing efficency and therefore may result in significant reduction of spacecraft mass and volum for the same payload.
Using the MAP estimation approach to carrier synchronization of digital modulations containing ISI together with a two pulse stream AMP representation of GMSK, it is possible to obtain an optimum closed loop configuration in the same manner as has been previously proposed for other conventional modulations with ISI.
This report presents the mechanical verification of a simplified model of a rapid Byzantine-fault-tolerant self-stabilizing protocol for distributed clock synchronization systems. This protocol does not rely on any assumptions about the initial state of the system. This protocol tolerates bursts of transient failures, and deterministically converges within a time bound that is a linear function of the self-stabilization period. A simplified model of the protocol is verified using the Symbolic Model Verifier (SMV) [SMV]. The system under study consists of 4 nodes, where at most one of the nodes is assumed to be Byzantine faulty. The model checking effort is focused on verifying correctness of the simplified model of the protocol in the presence of a permanent Byzantine fault as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period. Although model checking results of the simplified model of the protocol confirm the theoretical predictions, these results do not necessarily confirm that the protocol solves the general case of this problem. Modeling challenges of the protocol and the system are addressed. A number of abstractions are utilized in order to reduce the state space. Also, additional innovative state space reduction techniques are introduced that can be used in future verification efforts applied to this and other protocols.
A synchronized target subsystem for use in an automated docking or station keeping system for docking a chase vehicle with a target vehicle wherein the chase vehicle is provided with a video camera which provides adjacent frames each having a predetermined time duration. A light source mounted on the target vehicle flashes at a frequency which has a time duration which is a multiple of the duration time of the frames, the light being on for at least one frame duration and being off for the remainder of the cycle. An image processing unit is connected to the camera for receiving signals from the camera and subtracting one of the adjacent frames from the other to detect whether the light appears in one frame, both frames or neither frame. If the target light appears in both frames or neither frame, the image processing unit feeds a signal to a timing circuit to advance the video camera one frame. This process is continued until the target light appears in one frame and not in the other, at which time the process of advancing the video camera is stopped.
Apparatus and methods are directed to a perfusion culture system in which a rotating bioreactor is used to grow cells in a liquid culture medium, while these cells are attached to an adhesive-treated porous surface. As a result of this arrangement and its rotation, the attached cells divide, with one cell remaining attached to the substrate, while the other cell, a newborn cell is released. These newborn cells are of approximately the same age, that are collected upon leaving the bioreactor. The populations of newborn cells collected are of synchronous and are minimally, if at all, disturbed metabolically.
This paper presents the mechanical verification of a simplified model of a rapid Byzantine-fault-tolerant self-stabilizing protocol for distributed clock synchronization systems. This protocol does not rely on any assumptions about the initial state of the system except for the presence of sufficient good nodes, thus making the weakest possible assumptions and producing the strongest results. This protocol tolerates bursts of transient failures, and deterministically converges within a time bound that is a linear function of the self-stabilization period. A simplified model of the protocol is verified using the Symbolic Model Verifier (SMV). The system under study consists of 4 nodes, where at most one of the nodes is assumed to be Byzantine faulty. The model checking effort is focused on verifying correctness of the simplified model of the protocol in the presence of a permanent Byzantine fault as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period. Although model checking results of the simplified model of the protocol confirm the theoretical predictions, these results do not necessarily confirm that the protocol solves the general case of this problem. Modeling challenges of the protocol and the system are addressed. A number of abstractions are utilized in order to reduce the state space.
Traditional methods for establishing symbol synchronization (sync) in digital communication receivers assume that carrier sync has already been established, i.e., the problem is addressed at the baseband level assuming that a 'perfect' estimate of carrier phase is available. We refer to this approach as coherent symbol sync. Since, for NRZ signaling, a suppressed carrier sync loop such as an I-Q Costas loop includes integrate-and-dump (I and D) filters in its in-phase (1) and quadrature (Q) arms, the traditional approach is to first track the carrier in the absence of symbol sync information, then feed back the symbol sync estimate to these filters, and then iterate between the two to a desirable operating level In this paper, we revisit the symbol sync problem by examining methods for obtaining such sync in the absence of carrier phase information, i.e., so-called noncoherent symbol sync loops. We compare the performance of these loops with that of a well-known coherent symbol sync loop and examine the conditions under which one is preferable over the other.
An inter-symbol guard time has been proposed as a means of synchronizing the symbol and slot clocks of an optical pulse-position modulation (PPM) receiver with the symbol and slot periods of an incoming optical PPM signal.The proposal is applicable to the low-flux case in which the receiver photodetector operates in a photon-counting mode and the count can include contributions from incidental light sources and dark current.
A method has been proposed to increase the degree of synchronization of a radio receiver with the phase of a suppressed carrier signal modulated with a binary- phase-shift-keying (BPSK) or quaternary- phase-shift-keying (QPSK) signal representing a low-density parity-check (LDPC) code. This method is an extended version of the method described in Using LDPC Code Constraints to Aid Recovery of Symbol Timing (NPO-43112), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 54. Both methods and the receiver architectures in which they would be implemented belong to a class of timing- recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. The proposed method calls for the use of what is known in the art as soft decision feedback to remove the modulation from a replica of the incoming signal prior to feeding this replica to a phase-locked loop (PLL) or other carrier-tracking stage in the receiver. Soft decision feedback refers to suitably processed versions of intermediate results of iterative computations involved in the LDPC decoding process. Unlike a related prior method in which hard decision feedback (the final sequence of decoded symbols) is used to remove the modulation, the proposed method does not require estimation of the decoder error probability. In a basic digital implementation of the proposed method, the incoming signal (having carrier phase theta theta (sub c) plus noise would first be converted to inphase (I) and quadrature (Q) baseband signals by mixing it with I and Q signals at the carrier frequency [wc/(2 pi)] generated by a local oscillator. The resulting demodulated signals would be processed through one-symbol-period integrate and- dump filters, the outputs of which would be sampled and held, then multiplied by a soft-decision version of the baseband modulated signal. The resulting I and Q products consist of terms proportional to the cosine and sine of the carrier phase cc as well as correlated noise components. These products would be fed as inputs to a digital PLL that would include a number-controlled oscillator (NCO), which provides an estimate of the carrier phase, theta(sub c).
An apparatus, now undergoing development, for range imaging based on measurement of the round-trip phase delay of a pulsed laser beam is described. The apparatus would operate in a staring mode. A pulsed laser would illuminate a target. Laser light reflected from the target would be imaged on a verylarge- scale integrated (VLSI)-circuit image detector, each pixel of which would contain a photodetector and a phase-measuring circuit. The round-trip travel time for the reflected laser light incident on each pixel, and thus the distance to the portion of the target imaged in that pixel, would be measured in terms of the phase difference between (1) the photodetector output pulse and (2) a local-oscillator signal that would have a frequency between 10 and 20 MHz and that would be synchronized with the laser-pulse-triggering signal.
Natural movements in the sagittal plane involve pitch tilt relative to gravity combined with translation motion. The Gravito-Inertial Force (GIF) resolution hypothesis states that the resultant force on the body is perceptually resolved into tilt and translation consistently with the laws of physics. The purpose of this study was to test this hypothesis for human perception during combined tilt and translation motion. EXPERIMENTAL METHODS: Twelve subjects provided verbal reports during 0.3 Hz motion in the dark with 4 types of tilt and/or translation motion: 1) pitch tilt about an interaural axis at +/-10deg or +/-20deg, 2) fore-aft translation with acceleration equivalent to +/-10deg or +/-20deg, 3) combined "in phase" tilt and translation motion resulting in acceleration equivalent to +/-20deg, and 4) "out of phase" tilt and translation motion that maintained the resultant gravito-inertial force aligned with the longitudinal body axis. The amplitude of perceived pitch tilt and translation at the head were obtained during separate trials. MODELING METHODS: Three-dimensional mathematical modeling was performed to test the GIF-resolution hypothesis using a dynamical model. The model encoded GIF-resolution using the standard vector equation, and used an internal model of motion parameters, including gravity. Differential equations conveyed time-varying predictions. The six motion profiles were tested, resulting in predicted perceived amplitude of tilt and translation for each. RESULTS: The modeling results exhibited the same pattern as the experimental results. Most importantly, both modeling and experimental results showed greater perceived tilt during the "in phase" profile than the "out of phase" profile, and greater perceived tilt during combined "in phase" motion than during pure tilt of the same amplitude. However, the model did not predict as much perceived translation as reported by subjects during pure tilt. CONCLUSION: Human perception is consistent with the GIF-resolution hypothesis even when the gravito-inertial force vector remains aligned with the body during periodic motion. Perception is also consistent with GIF-resolution in the opposite condition, when the gravito-inertial force vector angle is enhanced by synchronized tilt and translation.
This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period.
This paper reports the ground demonstration of precision synchronized formation rotations with better than 6 arcmin/5 cm performance in the Formation Control Testbed (FCT). The FCT currently consists of two, five degree-of-freedom, air bearing-levitated robots. The sixth degree-of-freedom, vertical translation, is being added in November 2007. Each robot has a suite of flight-like avionics and actuators, including a star tracker, fiber-optic gyroscopes, reaction wheels, cold-gas thrusters, inter-robot communication, and on-board computers that run the Formation and Attitude Control System software.
This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV) for a subset of digraphs. Modeling challenges of the protocol and the system are addressed. The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period.
Experimental goals are: (1) synchronize 1 pulse per second outputs derived from two different crystal oscillator sources, (2) generate near atomic clock accuracy for other experimental needs.
In this report we present a strategy for solving the Byzantine general problem for self-stabilizing a fully connected network from an arbitrary state and in the presence of any number of faults with various severities including any number of arbitrary (Byzantine) faulty nodes. Our solution applies to realizable systems, while allowing for differences in the network elements, provided that the number of arbitrary faults is not more than a third of the network size. The only constraint on the behavior of a node is that the interactions with other nodes are restricted to defined links and interfaces. Our solution does not rely on assumptions about the initial state of the system and no central clock nor centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. We also present a mechanical verification of a proposed protocol. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV). The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirming claims of determinism and linear convergence with respect to the self-stabilization period. We believe that our proposed solution solves the general case of the clock synchronization problem.