Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time synchronization”

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.

At least 559 records · Page 31

Synchronization trigger control system for flow visualization

The use of cinematography or holographic interferometry for dynamic flow visualization in an internal combustion engine requires a control device that globally synchronizes camera and light source timing at a predefined shaft encoder angle. The device is capable of 0.35 deg resolution for rotational speeds of up to 73 240 rpm. This was achieved by implementing the shaft encoder signal addressed look-up table (LUT) and appropriate latches. The developed digital signal processing technique achieves 25 nsec of high speed triggering angle detection by using direct parallel bit comparison of the shaft encoder digital code with a simulated angle reference code, instead of using angle value comparison which involves more complicated computation steps. In order to establish synchronization to an AC reference signal whose magnitude is variant with the rotating speed, a dynamic peak followup synchronization technique has been devised. This method scrutinizes the reference signal and provides the right timing within 40 nsec. Two application examples are described.

Chun, K. S.↗

Memory-based frame synchronizer

A frame synchronizer for use in digital communications systems wherein data formats can be easily and dynamically changed is described. The use of memory array elements provide increased flexibility in format selection and sync word selection in addition to real time reconfiguration ability. The frame synchronizer comprises a serial-to-parallel converter which converts a serial input data stream to a constantly changing parallel data output. This parallel data output is supplied to programmable sync word recognizers each consisting of a multiplexer and a random access memory (RAM). The multiplexer is connected to both the parallel data output and an address bus which may be connected to a microprocessor or computer for purposes of programming the sync word recognizer. The RAM is used as an associative memory or decorder and is programmed to identify a specific sync word. Additional programmable RAMs are used as counter decoders to define word bit length, frame word length, and paragraph frame length.

Stattel, R. J.↗

Constructing a working taxonomy of functional Ada software components for real-time embedded system applications

A major impediment to a systematic attack on Ada software reusability is the lack of an effective taxonomy for software component functions. The scope of all possible applications of Ada software is considered too great to allow the practical development of a working taxonomy. Instead, for the purposes herein, the scope of Ada software application is limited to device and subsystem control in real-time embedded systems. A functional approach is taken in constructing the taxonomy tree for identified Ada domain. The use of modular software functions as a starting point fits well with the object oriented programming philosophy of Ada. Examples of the types of functions represented within the working taxonomy are real time kernels, interrupt service routines, synchronization and message passing, data conversion, digital filtering and signal conditioning, and device control. The constructed taxonomy is proposed as a framework from which a need analysis can be performed to reveal voids in current Ada real-time embedded programming efforts for Space Station.

Wallace, Robert↗

Critique of a Hughes shuttle Ku-band data sampler/bit synchronizer

An alternative bit synchronizer proposed for shuttle was analyzed in a noise-free environment by considering the basic operation of the loop via timing diagrams and by linearizing the bit synchronizer as an equivalent, continuous, phased-lock loop (PLL). The loop is composed of a high-frequency phase-frequency detector which is capable of detecting both phase and frequency errors and is used to track the clock, and a bit transition detector which attempts to track the transitions of the data bits. It was determined that the basic approach was a good design which, with proper implementation of the accumulator, up/down counter and logic should provide accurate mid-bit sampling with symmetric bits. However, when bit asymmetry occurs, the bit synchronizer can lock up with a large timing error, yet be quasi-stable (timing will not change unless the clock and bit sequence drift). This will result in incorrectly detecting some bits.

Holmes, J. K.↗

Probabilistic Processing of Asynchronous Geiger-Mode Avalanche Photodiode Arrays for Background Rate Measurements

A system-level performance evaluation of Geiger-mode avalanche photodiode (GmAPD) arrays requires accurate measurement and prediction of the background rate of the device due to dark counts and other spurious detection events. Since a GmAPD detector reports only a binary value and timestamp associated with an avalanche event, dark count rates are typically measured by averaging thousands of frames to support a statistically significant measurement. For both synchronous and asynchronous detector, the Poisson distributed background rates are referenced to the time each pixel is armed. Unlike for synchronous GmAPD imagers where all the pixels are armed to an array-wide arm signal, an asynchronous pixel operates independently from its neighboring pixels; requiring the background rates to be calculated using an interarrival histogram. For both types of imagers, the background rate is typically evaluated by fitting an exponential distribution to a fixed window within a measured histogram of time intervals between detection events However, if the statistics of the background rate are insufficient – whether that is due to low population sizes, saturation, or a large dynamic range of population size across the array, the pixel, or array-wide, performance metrics may report results with varying accuracy. This paper reports on an implementation of an algorithm that evaluates GmAPD background rates based on statistical metrics rather than fixed windows. The algorithm functions by determining the appropriate integration window within the interarrival time histogram based on a per-pixel count rate set by a predetermined tolerable measurement error. The implementation of the algorithm allows us to characterize GmAPD arrays with orders of magnitude spread in background rates across the detector using common statistical parameters.

Mumolo, J.↗

A Self-Stabilizing Byzantine-Fault-Tolerant Clock Synchronization Protocol

This report presents a rapid Byzantine-fault-tolerant self-stabilizing clock synchronization protocol that is independent of application-specific requirements. It is focused on clock synchronization of a system in the presence of Byzantine faults after the cause of any transient faults has dissipated. A model of this protocol is mechanically verified using the Symbolic Model Verifier (SMV) [SMV] where the entire state space is examined and proven to self-stabilize in the presence of one arbitrary faulty node. Instances of the protocol are proven to tolerate bursts of transient failures and deterministically converge with a linear convergence time with respect to the synchronization period. This protocol does not rely on assumptions about the initial state of the system other than the presence of sufficient number of good nodes. All timing measures of variables are based on the node s local clock, and no central clock or externally generated pulse is used. The Byzantine faulty behavior modeled here is a node with arbitrarily malicious behavior that is allowed to influence other nodes at every clock tick. The only constraint is that the interactions are restricted to defined interfaces.

Malekpour, Mahyar R.↗

Clock Synchronization Characterization of the Washington DC Metropolitan Area Quantum Network (DC-QNet)

Quantum networking protocols relying on interference and precise time-of-flight measurements require high-precision clock synchronization. This study describes the design, implementation, and characterization of two optical time transfer methods in a metropolitan-scale quantum networking research testbed. With active electronic stabilization, sub-picosecond time deviation (TDEV) was achieved at integration times between 1 s and 10 5 s over 53 km of deployed fiber. Over the same integration periods, 10-picosecond level TDEV was observed using the White Rabbit-Precision Time Protocol (WR-PTP) over 128 km. Measurement methods are described to understand the sources of environmental fluctuations on clock synchronization towards the development of in-situ compensation methods. Path delay gradients, chromatic dispersion, polarization drift, and optical power variations all contributed to clock synchronization errors. The results from this study will inform future work in the development of link noise management methods essential for enabling experimental research in developing practical quantum networking protocols.

PIKTime↗

A versatile pulse programmer for pulsed nuclear magnetic resonance spectroscopy.

A digital pulse programmer producing the standard pulse sequences required for pulsed nuclear magnetic resonance spectroscopy is described. In addition, a 'saturation burst' sequence, useful in the measurement of long relaxation times in solids, is provided. Both positive and negative 4 V trigger pulses are produced that are fully synchronous with a crystal-controlled time base, and the pulse programmer may be phase-locked with a maximum pulse jitter of 3 ns to the oscillator of a coherent pulse spectrometer. Medium speed TTL integrated circuits are used throughout.

Tarr, C. E.↗

Self-stabilizing byzantine-fault-tolerant clock synchronization system and method

Systems and methods for rapid Byzantine-fault-tolerant self-stabilizing clock synchronization are provided. The systems and methods are based on a protocol comprising a state machine and a set of monitors that execute once every local oscillator tick. The protocol is independent of specific application specific requirements. The faults are assumed to be arbitrary and/or malicious. All timing measures of variables are based on the node's local clock and thus no central clock or externally generated pulse is used. Instances of the protocol are shown to tolerate bursts of transient failures and deterministically converge with a linear convergence time with respect to the synchronization period as predicted.

Malekpour, Mahyar R.↗

DEEP CELLULAR RECURRENT NEURAL ARCHITECTURE FOR EFFICIENT MULTIDIMENSIONAL TIME-SERIES DATA PROCESSING

Efficient processing of time series data is a fundamental yet challenging problem in pattern recognition. Though recent developments in machine learning and deep learning have enabled remarkable improvements in processing large scale datasets in many application domains, most are designed and regulated to handle inputs that are static in time. Many real-world data, such as in biomedical, surveillance and security, financial, manufacturing and engineering applications, are rarely static in time, and demand models able to recognize patterns in both space and time. Current machine learning (ML) and deep learning (DL) models adapted for time series processing tend to grow in complexity and size to accommodate the additional dimensionality of time. Specifically, the biologically inspired learning based models known as artificial neural networks that have shown extraordinary success in pattern recognition, tend to grow prohibitively large and cumbersome in the presence of large scale multi-dimensional time series biomedical data such as EEG. Consequently, this work aims to develop representative ML and DL models for robust and efficient large scale time series processing. First, we design a novel ML pipeline with efficient feature engineering to process a large scale multi-channel scalp EEG dataset for automated detection of epileptic seizures. With the use of a sophisticated yet computationally efficient time-frequency analysis technique known as harmonic wavelet packet transform and an efficient self-similarity computation based on fractal dimension, we achieve state-of-the-art performance for automated seizure detection in EEG data. Subsequently, we investigate the development of a novel efficient deep recurrent learning model for large scale time series processing. For this, we first study the functionality and training of a biologically inspired neural network architecture known as cellular simultaneous recurrent neural network (CSRN). We obtain a generalization of this network for multiple topological image processing tasks and investigate the learning efficacy of the complex cellular architecture using several state-of-the?art training methods. Finally, we develop a novel deep cellular recurrent neural network (CDRNN) architecture based on the biologically inspired distributed processing used in CSRN for processing time series data. The proposed DCRNN leverages the cellular recurrent architecture to promote extensive weight sharing and efficient, individualized, synchronous processing of multi-source time series data. Experiments on a large scale multi-channel scalp EEG, and a machine fault detection dataset show that the proposed DCRNN offers state-of-the-art recognition performance while using substantially fewer trainable recurrent units.

Vidyaratne, Lasitha S.↗

Using GLONASS signal for clock synchronization

Although in accuracy parameters GLONASS is correlated with GPS, using GLONASS signals for high-precision clock synchronization was, up to the recent time, of limited utility due to the lack of specialized time receivers. In order to improve this situation, in late 1992 the Russian Institute of Radionavigation and Time (RMT) began to develop a GLONASS time receiver using as a basis the airborne ASN-16 receiver. This paper presents results of estimating user clock synchronization accuracy via GLONASS signals using ASN-16 receiver in the direct synchronization and common-view modes.

Gouzhva, Yuri G.↗

Performance comparison of token ring protocols for hard-real-time communication

The ability to guarantee the deadlines of synchronous messages while maintaining a good aggregate throughput is an important consideration in the design of distributed real-time systems. In this paper, we study two token ring protocols, the priority driven protocol and the timed token protocol, for their suitability for hard real-time systems. Both these protocols use a token to control access to the transmission medium. In a priority driven protocol, messages are assigned priorities and the protocol ensures that messages are transmitted in the order of their priorities. Timed token protocols do not provide for priority arbitration but ensure that the maximum access delay for a station is bounded. For both protocols, we first derive the schedulability conditions under which the transmission deadlines of a given set of synchronous messages can be guaranteed. Subsequently, we use these schedulability conditions to quantitatively compare the average case behavior of the protocols. This comparison demonstrates that each of the protocols has its domain of superior performance and neither dominates the other for the entire range of operating conditions.

Kamat, Sanjay↗

Firearm discharge location systems and methods

Firearm discharge location systems and methods are described. According to one aspect, a firearm discharge location system includes a plurality of microphones spaced from one another, timing circuitry configured to generate a plurality of asynchronous timing references, wherein data capture operations with respect to the microphones of a first pair are synchronized with one another using a first of the timing references and data capture operations with respect to the microphones of a second pair are synchronized with one another using a second of the timing references, and processing circuitry configured to use outputs of the first and second pairs of the microphones to identify a location of a firearm discharge.

Gonzalez, Eric G.↗

Coding for Communication Channels with Dead-Time Constraints

Coding schemes have been designed and investigated specifically for optical and electronic data-communication channels in which information is conveyed via pulse-position modulation (PPM) subject to dead-time constraints. These schemes involve the use of error-correcting codes concatenated with codes denoted constrained codes. These codes are decoded using an interactive method. In pulse-position modulation, time is partitioned into frames of Mslots of equal duration. Each frame contains one pulsed slot (all others are non-pulsed). For a given channel, the dead-time constraints are defined as a maximum and a minimum on the allowable time between pulses. For example, if a Q-switched laser is used to transmit the pulses, then the minimum allowable dead time is the time needed to recharge the laser for the next pulse. In the case of bits recorded on a magnetic medium, the minimum allowable time between pulses depends on the recording/playback speed and the minimum distance between pulses needed to prevent interference between adjacent bits during readout. The maximum allowable dead time for a given channel is the maximum time for which it is possible to satisfy the requirement to synchronize slots. In mathematical shorthand, the dead-time constraints for a given channel are represented by the pair of integers (d,k), where d is the minimum allowable number of zeroes between ones and k is the maximum allowable number of zeroes between ones. A system of the type to which the present schemes apply is represented by a binary- input, real-valued-output channel model illustrated in the figure. At the transmitting end, information bits are first encoded by use of an error-correcting code, then further encoded by use of a constrained code. Several constrained codes for channels subject to constraints of (d,infinity) have been investigated theoretically and computationally. The baseline codes chosen for purposes of comparison were simple PPM codes characterized by M-slot PPM frames separated by d-slot dead times.

Moision, Bruce↗

Time Manager Software for a Flight Processor

Data analysis is a process of inspecting, cleaning, transforming, and modeling data to highlight useful information and suggest conclusions. Accurate timestamps and a timeline of vehicle events are needed to analyze flight data. By moving the timekeeping to the flight processor, there is no longer a need for a redundant time source. If each flight processor is initially synchronized to GPS, they can freewheel and maintain a fairly accurate time throughout the flight with no additional GPS time messages received. How ever, additional GPS time messages will ensure an even greater accuracy. When a timestamp is required, a gettime function is called that immediately reads the time-base register.

Zoerne, Roger↗

A seasonal change in the effect of field-aligned currents at synchronous orbit

The expected signature of substorm field-aligned currents is described for synchronous satellites near 10 deg magnetic latitude. The main effect is a positive D perturbation premidnight and a negative D perturbation postmidnight. This behavior is illustrated for two substorms near the fall equinox. A second pair of substorms taken from winter solstice do not show the expected behavior. The absence of this effect in winter observations is verified statistically by superposed epoch analysis. A simple explanation of this behavior based on the geometry of the plane of magnetic symmetry is presented. During disturbed times at winter solstice a synchronous satellite nominally at 10 deg magnetic latitude is effectively at the magnetic equator. This distortion of the magnetic equator must be considered in future models of the disturbed magnetospheric magnetic field.

Mcpherron, R. L.↗

Delivery and application of precise timing for a traveling wave powerline fault locator system

The Bonneville Power Administration (BPA) has successfully operated an in-house developed powerline fault locator system since 1986. The BPA fault locator system consists of remotes installed at cardinal power transmission line system nodes and a central master which polls the remotes for traveling wave time-of-arrival data. A power line fault produces a fast rise-time traveling wave which emanates from the fault point and propagates throughout the power grid. The remotes time-tag the traveling wave leading edge as it passes through the power system cardinal substation nodes. A synchronizing pulse transmitted via the BPA analog microwave system on a wideband channel sychronizes the time-tagging counters in the remote units to a different accuracy of better than one microsecond. The remote units correct the raw time tags for synchronizing pulse propagation delay and return these corrected values to the fault locator master. The master then calculates the power system disturbance source using the collected time tags. The system design objective is a fault location accuracy of 300 meters. BPA's fault locator system operation, error producing phenomena, and method of distributing precise timing are described.

Street, Michael A.↗

Pedestal formation via different trajectories in the stability space in response to the timing scan of neutral beam heating in DIII-D

The frequency of type-I ELMs decreases as the initiation of the neutral beam injection (NBI) heating is delayed with respect to the time when plasma current (I p ) reaches flat-top in the ITER Baseline Scenario discharges in DIII-D. Henceforth, the time gap between the NBI initiation and I p flat-top will be referred to as “heating delay.” As the heating delay is modified, pedestal formation follows different trajectories in the edge current density–pedestal pressure gradient (j edge -∇p e ped ) space from the L-H transition toward the first ELM event. During the stationary phase after the first ELM, the ELM frequency (f ELM ) decreases by a factor of ~2 as the heating delay is increased. A longer pedestal recovery time in the inter-ELM period is observed for the low f ELM discharges as compared to the high f ELM discharges. Both low and high f ELM discharges show nearly identical profiles of electron density and temperature and have a similar MHD stability just before an ELM crash. However, a marked difference is observed in the magnetic spectrogram of the high and low f ELM discharges in response to the variation in the heating delay. The main difference is in the 200–400 kHz range of the magnetic spectra. A quasi-coherent mode (QCM) at 220 kHz and weaker broadband fluctuations are observed in the high f ELM discharges, while only strong broadband fluctuations are prevalent in the low f ELM discharges. ELM-synchronized analysis shows that the time evolution of these modes is different for the high and low f ELM discharges. The localization of both these modes is confirmed at the maximum gradient region of the pedestal. We hypothesize that these modes cause important pedestal transport and that the difference in the pedestal recovery of the high and low f ELM discharges is a result of the difference in transport driven by these modes, as they change with changes in the heating delay. It is demonstrated experimentally for the first time that discharges with similar pedestal parameters can carry the history of the heating delay into the stationary phase and that changes in turbulent-driven transport are a likely cause of changes in f ELM observed with variations of heating delay.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗