Search NASA⌕ Search

SEARCH · Search NASA

Results for “BINARY CODE”

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 289 records · Page 16

A cascaded coding scheme for error control and its performance analysis

A coding scheme is investigated for error control in data communication systems. The scheme is obtained by cascading two error correcting codes, called the inner and outer codes. The error performance of the scheme is analyzed for a binary symmetric channel with bit error rate epsilon <1/2. It is shown that if the inner and outer codes are chosen properly, extremely high reliability can be attained even for a high channel bit error rate. Various specific example schemes with inner codes ranging form high rates to very low rates and Reed-Solomon codes as inner codes are considered, and their error probabilities are evaluated. They all provide extremely high reliability even for very high bit error rates. Several example schemes are being considered by NASA for satellite and spacecraft down link error control.

Lin, Shu↗

Ranging code processor

System extracts range data from pseudorandom-coded range radar used to track a moving body. Pseudorandom binary waveforms with favorable correlation properties are transmitted and their reflections received and processed. The phase difference between the received and transmitted codes gives an accurate measure of the distance to the moving body.

Anderson, T. O.↗

Syndrome source coding and its universal generalization

A method of using error-correcting codes to obtain data compression, called syndrome-source-coding, is described in which the source sequence is treated as an error pattern whose syndrome forms the compressed data. It is shown that syndrome-source-coding can achieve arbitrarily small distortion with the number of compressed digits per source digit arbitrarily close to the entropy of a binary memoryless source. A universal generalization of syndrome-source-coding is formulated which provides robustly-effective, distortionless, coding of source ensembles.

Ancheta, T. C., Jr.↗

Maximum-likelihood soft-decision decoding of block codes using the A* algorithm

The A* algorithm finds the path in a finite depth binary tree that optimizes a function. Here, it is applied to maximum-likelihood soft-decision decoding of block codes where the function optimized over the codewords is the likelihood function of the received sequence given each codeword. The algorithm considers codewords one bit at a time, making use of the most reliable received symbols first and pursuing only the partially expanded codewords that might be maximally likely. A version of the A* algorithm for maximum-likelihood decoding of block codes has been implemented for block codes up to 64 bits in length. The efficiency of this algorithm makes simulations of codes up to length 64 feasible. This article details the implementation currently in use, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained with this implementation of the A* algorithm for several codes.

Ekroot, L.↗

Formal specification and verification of Ada software

The use of formal methods in software development achieves levels of quality assurance unobtainable by other means. The Larch approach to specification is described, and the specification of avionics software designed to implement the logic of a flight control system is given as an example. Penelope is described which is an Ada-verification environment. The Penelope user inputs mathematical definitions, Larch-style specifications and Ada code and performs machine-assisted proofs that the code obeys its specifications. As an example, the verification of a binary search function is considered. Emphasis is given to techniques assisting the reuse of a verification effort on modified code.

Hird, Geoffrey R.↗

Performance results for a hybrid coding system.

Results of computer simulation studies of the hybrid pull-up bootstrap decoding algorithm, using a constraint length 24, nonsystematic, rate 1/2 convolutional code for the symmetric channel with both binary and eight-level quantized outputs. Computational performance was used to measure the effect of several decoder parameters and determine practical operating constraints. Results reveal that the track length may be reduced to 500 information bits with small degradation in performance. The optimum number of tracks per block was found to be in the range from 7 to 11. An effective technique was devised to efficiently allocate computational effort and identify reliably decoded data sections. Long simulations indicate that a practical bootstrap decoding configuration has a computational performance about 1.0 dB better than sequential decoding and an output bit error rate about .0000025 near the R sub comp point.

Hoffman, L. B.↗

Detection and period measurements of GX1+4 at hard x ray energies with the SIGMA telescope

The galactic Low Mass X ray Binary GX1+4 was detected by the coded aperture hard X ray gamma ray SIGMA telescope during the Feb. to April 1991 observations of the galactic center regions. The source, whose emission varied during the survey of a factor greater than 40 pct., reached a maximum luminosity in the 40 to 140 energy range of 1.03 x 10(exp 37) erg/s (D = 8.5 kpc), thus approaching the emission level of the 1970 to 1980 high state. Two minute flux pulsations were detected on Mar. 22 and on Mar. 31 and Apr. 1. Comparison with the last period measurements shows that the current spin-down phase of GX1+4 is ending. Concerning the proposed association of this source with the galactic center 511 keV annihilation emission, upper limits were derived.

Laurent, PH.↗

Data Format Classification for Autonomous Software Defined Radios

We present maximum-likelihood (ML) coherent and noncoherent classifiers for discriminating between NRZ and Manchester coded (biphase-L) data formats for binary phase-shift-keying (BPSK) modulation. Such classification of the data format is an essential element of so-called autonomous software defined radio (SDR) receivers (similar to so-called cognitive SDR receivers in the military application) where it is desired that the receiver perform each of its functions by extracting the appropriate knowledge from the received signal and, if possible, with as little information of the other signal parameters as possible. Small and large SNR approximations to the ML classifiers are also proposed that lead to simpler implementation with comparable performance in their respective SNR regions. Numerical performance results obtained by a combination of computer simulation and, wherever possible, theoretical analyses, are presented and comparisons are made among the various configurations based on the probability of misclassification as a performance criterion. Extensions to other modulations such as QPSK are readily accomplished using the same methods described in the paper.

classification↗

Performance of Low-Density Parity-Check Coded Modulation

This paper reports the simulated performance of each of the nine accumulate-repeat-4-jagged-accumulate (AR4JA) low-density parity-check (LDPC) codes [3] when used in conjunction with binary phase-shift-keying (BPSK), quadrature PSK (QPSK), 8-PSK, 16-ary amplitude PSK (16- APSK), and 32-APSK.We also report the performance under various mappings of bits to modulation symbols, 16-APSK and 32-APSK ring scalings, log-likelihood ratio (LLR) approximations, and decoder variations. One of the simple and well-performing LLR approximations can be expressed in a general equation that applies to all of the modulation types.

Hamkins, Jon↗

Fault-Tolerant Coding for State Machines

Two reliable fault-tolerant coding schemes have been proposed for state machines that are used in field-programmable gate arrays and application-specific integrated circuits to implement sequential logic functions. The schemes apply to strings of bits in state registers, which are typically implemented in practice as assemblies of flip-flop circuits. If a single-event upset (SEU, a radiation-induced change in the bit in one flip-flop) occurs in a state register, the state machine that contains the register could go into an erroneous state or could hang, by which is meant that the machine could remain in undefined states indefinitely. The proposed fault-tolerant coding schemes are intended to prevent the state machine from going into an erroneous or hang state when an SEU occurs. To ensure reliability of the state machine, the coding scheme for bits in the state register must satisfy the following criteria: 1. All possible states are defined. 2. An SEU brings the state machine to a known state. 3. There is no possibility of a hang state. 4. No false state is entered. 5. An SEU exerts no effect on the state machine. Fault-tolerant coding schemes that have been commonly used include binary encoding and "one-hot" encoding. Binary encoding is the simplest state machine encoding and satisfies criteria 1 through 3 if all possible states are defined. Binary encoding is a binary count of the state machine number in sequence; the table represents an eight-state example. In one-hot encoding, N bits are used to represent N states: All except one of the bits in a string are 0, and the position of the 1 in the string represents the state. With proper circuit design, one-hot encoding can satisfy criteria 1 through 4. Unfortunately, the requirement to use N bits to represent N states makes one-hot coding inefficient.

Naegle, Stephanie Taft↗

Constraining the Properties of the Eta Carinae System via 3-D SPH Models of Space-Based Observations: The Absolute Orientation of the Binary Orbit

The extremely massive (> 90 Stellar Mass) and luminous (= 5 x 10(exp 6) Stellar Luminosity) star Eta Carinae, with its spectacular bipolar "Homunculus" nebula, comprises one of the most remarkable and intensely observed stellar systems in the Galaxy. However, many of its underlying physical parameters remain unknown. Multiwavelength variations observed to occur every 5.54 years are interpreted as being due to the collision of a massive wind from the primary star with the fast, less dense wind of a hot companion star in a highly elliptical (e approx. 0.9) orbit. Using three-dimensional (3-D) Smoothed Particle Hydrodynamics (SPH) simulations of the binary wind-wind collision, together with radiative transfer codes, we compute synthetic spectral images of [Fe III] emission line structures and compare them to existing Hubble Space Telescope/Space Telescope Imaging Spectrograph (HST/STIS) observations. We are thus able, for the first time, to tightly constrain the absolute orientation of the binary orbit on the sky. An orbit with an inclination of approx. 40deg, an argument of periapsis omega approx. 255deg, and a projected orbital axis with a position angle of approx. 312deg east of north provides the best fit to the observations, implying that the orbital axis is closely aligned in 3-D space with the Homunculus symmetry axis, and that the companion star orbits clockwise on the sky relative to the primary.

Madura, Thomas I.↗

On the detectability of pulsars in close binary systems

The limitations of standard pulse searches in close binary systems are quantitively investigated. An efficiency factor gamma is introduced to describe the ease with which binary pulsars can be found, and the results of calculations of gamma as a function of pulsar spin period and binary orbital period are presented for both standard pulse searches and for searches using sophisticated acceleration codes. Two strategies are suggested which maximize the probability of finding pulsars in close binaries, and empirical relations between the optimum observation time and the parameters of a binary orbit are given.

Johnston, Helen M.↗

Demonstration program for Omega receiver prototype microcomputer data processing

The JOLT (TM) commercial microcomputer, based on the MOS Technology 6502 processor chip, for use in Omega navigation system is evaluated. A computer program was prepared in hand-assembled code to demonstrate receiver operation. The processor provides binary processing with interrupts enabled, a carriage return is given to initialize the teleprinter, and a jump is performed to enter the program loop to wait for an interrupt. The program loop operates continuously testing the interrupt flag. The interrupt routine reads the receiver status word and determines whether the current time-slot is the A slot. If so, the interrupt flag, which is also the data index pointer, is reset to zero. The status word is stored in the status buffer. If the time-slot is not A, the interrupt flag/pointer is incremented by one to index the phase and status to the proper buffer words for later use by the print routine.

Lilley, R. W.↗

Binary-to-Manchester encoders

Two circuit system converts 16-bit-word binary encoded data to 24-bit Manchester II code to allow easy interface of flight simulators with aircraft communications equipment.

St. Cyr, R. H., III↗

Doppler lidar signal and turbulence study

Comparison of the second moments of the Doppler lidar signal with aircraft and tower measured parameters is being carried out. Lidar binary data tapes were successfully converted to ASCII Code on the VAX 11/780. These data were used to develop the computer programs for analyzing data from the Marshall Space Flight Center field test. Raw lidar amplitude along the first 50 forward and backward beams of Run No. 2, respectively was plotted. Plotting techniques for the same beams except with the amplitude thresholded and range corrected were developed. Plotting routines for the corresponding lidar width of the first 50 forward and backward beams were also established. The relationship between raw lidar amplitude and lidar width was examined. The lidar width is roughly constant for lidar amplitudes less than 120 dB. A field test with the NASA/MSFC ground based Doppler lidar, the instrumented NASA B-57B gust gradient aircraft, and the NASA/MSFC eight tower array was carried out. The data tape for the lidar was received and read. The aircraft data and tower data are being digitized and converted to engineering units. Velocities computed sequentially along each of the lidar beams beginning at 16:40:00, May 12, 1983 were plotted for Run No. 1.

Frost, W.↗

Instruments for Reading Direct-Marked Data-Matrix Symbols

Improved optoelectronic instruments (specially configured digital cameras) for reading direct-marked data-matrix symbols on the surfaces of optically reflective objects (including specularly reflective ones) are undergoing development. Data-matrix symbols are two-dimensional binary patterns that are used, like common bar codes, for automated identification of objects. The first data-matrix symbols were checkerboard-like patterns of black-and-white rectangles, typically existing in the forms of paint, ink, or detachable labels. The major advantage of direct marking (the marks are more durable than are painted or printed symbols or detachable labels) is offset by a major disadvantage (the marks generated by some marking methods do not provide sufficient contrast to be readable by optoelectronic instruments designed to read black-and-white data-matrix symbols). Heretofore, elaborate lighting, lensing, and software schemes have been tried in efforts to solve the contrast problem in direct-mark matrix- symbol readers. In comparison with prior readers based on those schemes, the readers now undergoing development are expected to be more effective while costing less. All of the prior direct-mark matrix-symbol readers are designed to be aimed perpendicularly to marked target surfaces, and they tolerate very little angular offset. However, the reader now undergoing development not only tolerates angular offset but depends on angular offset as a means of obtaining the needed contrast, as described below. The prototype reader (see Figure 1) includes an electronic camera in the form of a charge-coupled-device (CCD) image detector equipped with a telecentric lens. It also includes a source of collimated visible light and a source of collimated infrared light for illuminating a target. The visible and infrared illumination complement each other: the visible illumination is more useful for aiming the reader toward a target, while the infrared illumination is more useful for reading symbols on highly reflective surfaces. By use of beam splitters, the visible and infrared collimated lights are introduced along the optical path of the telecentric lens, so that the target is illuminated and viewed from the same direction.

Schramm, Harry F.↗

Black-Hole Binaries, Gravitational Waves, and Numerical Relativity

Understanding the predictions of general relativity for the dynamical interactions of two black holes has been a long-standing unsolved problem in theoretical physics. Black-hole mergers are monumental astrophysical events ' releasing tremendous amounts of energy in the form of gravitational radiation ' and are key sources for both ground- and spacebased gravitational wave detectors. The black-hole merger dynamics and the resulting gravitational waveforms can only he calculated through numerical simulations of Einstein's equations of general relativity. For many years, numerical relativists attempting to model these mergers encountered a host of problems, causing their codes to crash after just a fraction of a binary orbit cnuld be simulated. Recently ' however, a series of dramatic advances in numerical relativity has ' for the first time, allowed stable / robust black hole merger simulations. We chronicle this remarkable progress in the rapidly maturing field of numerical relativity, and the new understanding of black-hole binary dynamics that is emerging. We also discuss important applications of these fundamental physics results to astrophysics, to gravitationalwave astronomy, and in other areas.

Kelly, Bernard J.↗