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.
Bit-synchronizers utilize all-digital phase-lock loops that are referenced to a high frequency digital clock. Phase-lock loop of first design acquires frequency within nominal range and tracks phase; second design is modified for random binary data by addition of simple transition detector; and third design acquires frequency over wide dynamic range.
An algorithm for determining the autocorrelation structure of a new sequence generated from an original sequence by proper decimation (a shift with each q-th term of the original sequence used) is presented, once autocorrelations for any repeating number sequence are known. The autocorrelation structure of the Tausworthe random number generator (RNG), based on proper decimation by q, is accepted as a RNG structure in which a proper decimation generates a long interval over which autocorrelations are small for all shifts. It is shown that if L bits of an N-bit Tausworthe RNG are L-bit binary numbers, L + 1 levels of correlation will exist, and L levels of correlation will each occur twice per RNG cycle length.
We provide a framework to bound the probability that accumulated errors were never above a given threshold on numerical algorithms. Such algorithms are used for example in aircraft and nuclear power plants. This report contains simple formulas based on Levy's and Markov's inequalities and it presents a formal theory of random variables with a special focus on producing concrete results. We selected four very common applications that fit in our framework and cover the common practices of systems that evolve for a long time. We compute the number of bits that remain continuously significant in the first two applications with a probability of failure around one out of a billion, where worst case analysis considers that no significant bit remains. We are using PVS as such formal tools force explicit statement of all hypotheses and prevent incorrect uses of theorems.
Performance of two coding systems is analyzed for a noisy optical channel with M(=2(L)-ary orthogonal signaling and random gain photomultiplier detection. The considered coding systems are the Reed Solomon (RS) coding with error only correction decoding and the interleaved binary convolutional system with soft decision Viterbi decoding. The required average number of received signal photons per information bit, N sub b, for a desired bit error of 0.000001 is found for a set of commonly used parameters and with a high background noise level. We find that the interleaved binary convolutional coding system is preferable to the RS coding system in performance complexity tradeoffs.
This is a fault-tolerant random access memory for use in fault-tolerant computers. It comprises a plurality of memory chips each comprising a plurality of on-line testable and correctable memory cells disposed in rows and columns for holding individually addressable binary bits and provision for error detection incorporated into each memory cell for outputting an error signal whenever a transient error occurs therein. In one embodiment, each of the memory cells comprises a pair of static memory sub-cells for simultaneously receiving and holding a common binary data bit written to the memory cell and the error detection provision comprises comparator logic for continuously sensing and comparing the contents of the memory sub-cells to one another and for outputting the error signal whenever the contents do not match. In another embodiment, each of the memory cells comprises a static memory sub-cell and a dynamic memory sub-cell for simultaneously receiving and holding a common binary data bit written to the memory cell and the error detection provision comprises comparator logic for continuously sensing and comparing the contents of the static memory sub-cell to the dynamic memory sub-cell and for outputting the error signal whenever the contents do not match. Capability for correction of errors is also included.
We consider a novel quantum population transfer protocol to solve binary optimization problems that exploits quantum many-body dynamics in the delocalized regime. Hard optimization problems are characterized by energy landscape with a large number of local minima separated by large Hamming distances which scale with the problem size. This landscape gives rise to an interesting computational primitive: given an initial bit-string, we are to produce other bit-strings within certain narrow range of energies around the initial state. We consider a specific model we call "impurity band": a system of n qubits in a transverse field, where a number of bitstrings $M<<2^n$ selected at random are assigned random energies distributed in a narrow window of width $W<<1$ around the mean energy $-n$. We demonstrate the existence of the many-body delocalized regime in this model when the spectrum of the model splits into many-body minibands, and a typical eigenstate wave function is a superposition of peaks centered at a large number of local minima. The typical width of the minibands in energy determines the efficiency of the population transfer protocol. We demonstrate theoretically that the population transfer protocol achieves Grover type speedup in the unstructured impurity band model.
Magnetoresistive random-access memory (MRAM) is a non-volatile memory that exploits electronic spin, rather than charge, to store data. Instead of moving charge on and off a floating gate to alter the threshold voltage of a CMOS transistor (creating different bit states), MRAM uses magnetic fields to flip the polarization of a ferromagnetic material thus switching its resistance and bit state. These polarized states are immune to radiation-induced upset, thus making MRAM very attractive for space application. These magnetic memory elements also have infinite data retention and erase/program endurance. Presented here are results of reliability testing of two space-qualified MRAM products from Aeroflex and Honeywell.
A memory-based parallel data output controller employs associative memories and memory mapping to decommutate multiple channels of telemetry data. The output controller contains a random access memory (RAM) which has at least as many address locations as there are channels. A word counter addresses the RAM which provides as it outputs an encoded peripheral device number and a MSB/LSB-first flag. The encoded device number and a bit counter address a second RAM which contains START and STOP flags to pick out the required bits from the specified word number. The LSB/MSB, START and STOP flags, along with the serial input digital data go to a control block which selectively fills a shift register used to drive the parallel data output bus.
This paper examines the requirements and functions of the telemetry-data recording and storage systems, and the data-storage-system technology projected for the Space Station, with particular attention given to the Space Optical Disk Recorder, an on-board storage subsystem based on 160 gigabit erasable optical disk units each capable of operating at 300 M bits per second. Consideration is also given to storage systems for ground transport recording, which include systems for data capture, buffering, processing, and delivery on the ground. These can be categorized as the first in-first out storage, the fast random-access storage, and the slow access with staging. Based on projected mission manifests and data rates, the worst case requirements were developed for these three storage architecture functions. The results of the analysis are presented.
In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The design criterion for random interleavers is based on maximizing the effective free distance of the turbo code, i.e., the minimum output weight of codewords due to weight-2 input sequences. An upper bound on the effective free distance of a turbo code is derived. This upper bound can be achieved if the feedback connection of convolutional codes uses primitive polynomials. We review multiple turbo codes (parallel concatenation of q convolutional codes), which increase the so-called 'interleaving gain' as q and the interleaver size increase, and a suitable decoder structure derived from an approximation to the maximum a posteriori probability decision rule. We develop new rate 1/3, 2/3, 3/4, and 4/5 constituent codes to be used in the turbo encoder structure. These codes, for from 2 to 32 states, are designed by using primitive polynomials. The resulting turbo codes have rates b/n (b = 1, 2, 3, 4 and n = 2, 3, 4, 5, 6), and include random interleavers for better asymptotic performance. These codes are suitable for deep-space communications with low throughput and for near-Earth communications where high throughput is desirable. The performance of these codes is within 1 dB of the Shannon limit at a bit-error rate of 10(exp -6) for throughputs from 1/15 up to 4 bits/s/Hz.
IMPRINT utility computer program developed to print graphics specified in raster files by use of Hewlett-Packard Paintjet(TM) color printer. Reads bit-mapped images from files on UNIX-based graphics workstation and prints out three different types of images: wire-frame images, solid-color images, and gray-scale images. Wire-frame images are in continuous tone or, in case of low resolution, in random gray scale. In case of color images, IMPRINT also prints by use of default palette of solid colors. Written in C language.
A charge coupled device designed for celestial spectroscopy has achieved readout noise as low as 0.6 electrons rms. A nondestructive output circuit was operated in a special manner to read a single pixel multiple times. Off-chip electronics averaged the multiple values, reducing the random noise by the square root of the number of readouts. Charge capacity was measured to be 500,000 electrons. The device format is 1600 pixels horizontal by 64 pixels vertical. Pixel size is 28 microns square. Two output circuits are located at opposite ends of the 1600 bit CCD register. The device was thinned and operated backside illuminated at -110 degrees C. Output circuit design, layout, and operation are described. Presented data includes the photon transfer curve, noise histograms, and bar-target images down to 3 electrons signal. The test electronics are described, and future improvements are discussed.
The results of fault injection experiments utilizing a gate-level emulation of the central processor unit of the Bendix BDX-930 digital computer are presented. The failure detection coverage of comparison-monitoring and a typical avionics CPU self-test program was determined. The specific tasks and experiments included: (1) inject randomly selected gate-level and pin-level faults and emulate six software programs using comparison-monitoring to detect the faults; (2) based upon the derived empirical data develop and validate a model of fault latency that will forecast a software program's detecting ability; (3) given a typical avionics self-test program, inject randomly selected faults at both the gate-level and pin-level and determine the proportion of faults detected; (4) determine why faults were undetected; (5) recommend how the emulation can be extended to multiprocessor systems such as SIFT; and (6) determine the proportion of faults detected by a uniprocessor BIT (built-in-test) irrespective of self-test.
In nonvolatile random-access memory (RAM) circuits of a proposed type, digital data would be stored in analog form in ferroelectric field-effect transistors (FFETs). This type of memory circuit would offer advantages over prior volatile and nonvolatile types: In a conventional complementary metal oxide/semiconductor static RAM, six transistors must be used to store one bit, and storage is volatile in that data are lost when power is turned off. In a conventional dynamic RAM, three transistors must be used to store one bit, and the stored bit must be refreshed every few milliseconds. In contrast, in a RAM according to the proposal, data would be retained when power was turned off, each memory cell would contain only two FFETs, and the cell could store multiple bits (the exact number of bits depending on the specific design). Conventional flash memory circuits afford nonvolatile storage, but they operate at reading and writing times of the order of thousands of conventional computer memory reading and writing times and, hence, are suitable for use only as off-line storage devices. In addition, flash memories cease to function after limited numbers of writing cycles. The proposed memory circuits would not be subject to either of these limitations. Prior developmental nonvolatile ferroelectric memories are limited to one bit per cell, whereas, as stated above, the proposed memories would not be so limited. The design of a memory circuit according to the proposal must reflect the fact that FFET storage is only partly nonvolatile, in that the signal stored in an FFET decays gradually over time. (Retention times of some advanced FFETs exceed ten years.) Instead of storing a single bit of data as either a positively or negatively saturated state in a ferroelectric device, each memory cell according to the proposal would store two values. The two FFETs in each cell would be denoted the storage FFET and the control FFET. The storage FFET would store an analog signal value, between the positive and negative FFET saturation values. This signal value would represent a numerical value of interest corresponding to multiple bits: for example, if the memory circuit were designed to distinguish among 16 different analog values, then each cell could store 4 bits. Simultaneously with writing the signal value in the storage FFET, a negative saturation signal value would be stored in the control FFET. The decay of this control-FFET signal from the saturation value would serve as a model of the decay, for use in regenerating the numerical value of interest from its decaying analog signal value. The memory circuit would include addressing, reading, and writing circuitry that would have features in common with the corresponding parts of other memory circuits, but would also have several distinctive features. The writing circuitry would include a digital-to-analog converter (DAC); the reading circuitry would include an analog-to-digital converter (ADC). For writing a numerical value of interest in a given cell, that cell would be addressed, the saturation value would be written in the control FFET in that cell, and the non-saturation analog value representing the numerical value of interest would be generated by use of the DAC and stored in the storage FFET in that cell. For reading the numerical value of interest stored in a given cell, the cell would be addressed, the ADC would convert the decaying control and storage analog signal values to digital values, and an associated fast digital processing circuit would regenerate the numerical value from digital values.
Statistical studies of telemetry errors were made on data from the Solar Mesosphere Explorer (SME). Examination of frame sync words, as received at the ground station, indicated a wide spread of Bit Error Rates (BER) among stations. A study of the distribution of errors per station pass, however, showed that there was a tendency for the station software to add an even number of spurious errors to the count. A count of wild points in science data, rejecting drop-outs and other system errors, yielded an average random BER of 3.1 x 10 to the -6 with 99% confidence limits of 2.6 and 3.8 x 10 to the -6. The system errors are typically 5 to 100 times more frequent than the truly random errors.
This paper summarizes some of the practical considerations and implementation techniques used in the development of the onboard software for an experimental navigation system. This software includes (1) a Kalman filter implementation in square-root form with gyro and accelerometer noises modeled as random forcing functions in the filter; (2) operational modes for inflight alignment, ground alignment, normal aided inertial navigation operation, and postflight analysis; (3) a sophisticated time-sharing system for obtaining a very flexible input-output capability during real-time operations; and (4) a problem formulation and scaling for complete operation in single-precision arithmetic using a 24-bit word. The paper emphasizes the procedures used in formulation, scaling, and time-sharing for the real-time Kalman filter application. Some flight results are presented to illustrate the performance of the filter during real-time operation.
The distributed processing concept is defined in terms of control primitives, variables, and structures and their use in performing a decomposed discrete Fourier transform (DET) application function. The design assumes interprocessor communications to be anonymous. In this scheme, all processors can access an entire common database by employing control primitives. Access to selected areas within the common database is random, enforced by a hardware lock, and determined by task and subtask pointers. This enables the number of processors to be varied in the configuration without any modifications to the control structure. Decompositional elements of the DFT application function in terms of tasks and subtasks are also described. The experimental hardware configuration consists of IMSAI 8080 chassis which are independent, 8 bit microcomputer units. These chassis are linked together to form a multiple processing system by means of a shared memory facility. This facility consists of hardware which provides a bus structure to enable up to six microcomputers to be interconnected. It provides polling and arbitration logic so that only one processor has access to shared memory at any one time.
This research addresses turbulent gas flows laden with fine solid particles at sufficiently large mass loading that strong two-way coupling occurs. By two-way coupling we mean that the particle motion is governed largely by the flow, while the particles affect the gas-phase mean flow and the turbulence properties. Our main interest is in understanding how the particles affect the turbulence. Computational techniques have been developed which can accurately predict flows carrying particles that are much smaller than the smallest scales of turbulence. Also, advanced computational techniques and burgeoning computer resources make it feasible to fully resolve very large particles moving through turbulent flows. However, flows with particle diameters of the same order as the Kolmogorov scale of the turbulence are notoriously difficult to predict. Some simple flows show strong turbulence attenuation with reductions in the turbulent kinetic energy by up to a factor of five. On the other hand, some seemingly similar flows show almost no modification. No model has been proposed that allows prediction of when the strong attenuation will occur. Unfortunately, many technological and natural two-phase flows fall into this regime, so there is a strong need for new physical understanding and modeling capability. Our objective is to study the simplest possible turbulent particle-laden flow, namely homogeneous, isotropic turbulence with a uniform dispersion of monodisperse particles. We chose such a simple flow for two reasons. First, the simplicity allows us to probe the interaction in more detail and offers analytical simplicity in interpreting the results. Secondly, this flow can be addressed by numerical simulation, and many research groups are already working on calculating the flow. Our detailed data can help guide some of these efforts. By using microgravity, we can further simplify the flow to the case of no mean velocity for either the turbulence or the particles. In fact the addition of gravity as a variable parameter may help us to better understand the physics of turbulence attenuation. The experiments are conducted in a turbulence chamber capable of producing stationary or decaying isotropic turbulence with nearly zero mean flow and Taylor microscale Reynolds numbers up to nearly 500. The chamber is a 410 mm cubic box with the corners cut off to make it approximately spherical. Synthetic jet turbulence generators are mounted in each of the eight corners of the box. Each generator consists of a loudspeaker forcing a plenum and producing a pulsed jet through a 20 mm diameter orifice. These synthetic jets are directed into ejector tubes pointing towards the chamber center. The ejector tubes increase the jet mass flow and decrease the velocity. The jets then pass through a turbulence grid. Each of the eight loudspeakers is forced with a random phase and frequency. The resulting turbulence is highly Isotropic and matches typical behavior of grid turbulence. Measurements of both phases are acquired using particle image velocimetry (PIV). The gas is seeded with approximately 1 micron diameter seeding particles while the solid phase is typically 150 micron diameter spherical glass particles. A double-pulsed YAG laser and a Kodak ES-1.0 10-bit PIV camera provide the PIV images. Custom software is used to separate the images into individual images containing either gas-phase tracers or large particles. Modern high-resolution PIV algorithms are then used to calculate the velocity field. A large set of image pairs are acquired for each case, then the results are averaged both spatially and over the ensemble of acquired images. The entire apparatus is mounted in two racks which are carried aboard NASA's KC-135 Flying Microgravity Laboratory. The rack containing the turbulence chamber, the laser head, and the camera floats freely in the airplane cabin (constrained by competent NASA personnel) to minimize g-jitter.