Search NASA⌕ Search

SEARCH · Search NASA

Results for “block errors”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1977

The proposed coding standard at GSFC

As part of the continuing effort to introduce standardization of spacecraft and ground equipment in satellite systems, NASA's Goddard Space Flight Center and other NASA facilities have supported the development of a set of standards for the use of error control coding in telemetry subsystems. These standards are intended to ensure compatibility between spacecraft and ground encoding equipment, while allowing sufficient flexibility to meet all anticipated mission requirements. The standards which have been developed to date cover the application of block codes in error detection and error correction modes, as well as short and long constraint length convolutional codes decoded via the Viterbi and sequential decoding algorithms, respectively. Included are detailed specifications of the codes, and their implementation. Current effort is directed toward the development of standards covering channels with burst noise characteristics, channels with feedback, and code concatenation.

Morakis, J. C.↗
NASA NTRS1982

Analysis of backward error recovery for concurrent processes with recovery blocks

Three different methods of implementing recovery blocks (RB's). These are the asynchronous, synchronous, and the pseudo recovery point implementations. Pseudo recovery points so that unbounded rollback may be avoided while maintaining process autonomy are proposed. Probabilistic models for analyzing these three methods under standard assumptions in computer performance analysis, i.e., exponential distributions for related random variables were developed. The interval between two successive recovery lines for asynchronous RB's mean loss in computation power for the synchronized method, and additional overhead and rollback distance in case PRP's are used were estimated.

Shin, K. G.↗
NASA NTRS1998

Parallel processing spacecraft communication system

An uplink controlling assembly speeds data processing using a special parallel codeblock technique. A correct start sequence initiates processing of a frame. Two possible start sequences can be used; and the one which is used determines whether data polarity is inverted or non-inverted. Processing continues until uncorrectable errors are found. The frame ends by intentionally sending a block with an uncorrectable error. Each of the codeblocks in the frame has a channel ID. Each channel ID can be separately processed in parallel. This obviates the problem of waiting for error correction processing. If that channel number is zero, however, it indicates that the frame of data represents a critical command only. That data is handled in a special way, independent of the software. Otherwise, the processed data further handled using special double buffering techniques to avoid problems from overrun. When overrun does occur, the system takes action to lose only the oldest data.

Bolotin, Gary S.↗
NASA NTRS2013

Human Factors Evaluation of Conflict Detection Tool for Terminal Area

A conflict detection and resolution tool, Terminal-area Tactical Separation-Assured Flight Environment (T-TSAFE), is being developed to improve the timeliness and accuracy of alerts and reduce the false alert rate observed with the currently deployed technology. The legacy system in use today, Conflict Alert, relies primarily on a dead reckoning algorithm, whereas T-TSAFE uses intent information to augment dead reckoning. In previous experiments, T-TSAFE was found to reduce the rate of false alerts and increase time between the alert to the controller and a loss of separation over the legacy system. In the present study, T-TSAFE was tested under two meteorological conditions, 1) all aircraft operated under instrument flight regimen, and 2) some aircraft operated under mixed operating conditions. The tool was used to visually alert controllers to predicted Losses of separation throughout the terminal airspace, and show compression errors, on final approach. The performance of T-TSAFE on final approach was compared with Automated Terminal Proximity Alert (ATPA), a tool recently deployed by the FAA. Results show that controllers did not report differences in workload or situational awareness between the T-TSAFE and ATPA cones but did prefer T-TSAFE features over ATPA functionality. T-TSAFE will provide one tool that shows alerts in the data blocks and compression errors via cones on the final approach, implementing all tactical conflict detection and alerting via one tool in TRACON airspace.

Verma, Savita Arora↗
NASA NTRS1973

Inventory of forest and rangeland and detection of forest stress

The author has identified the following significant results. At the Atlanta site (226B) it was found that bulk color composites for October 15, 1972, and April 13, 1973, can be interpreted together to disclose the location of the perennial Kudzu vine (Pyeraria lobata). Land managers concerned with Kudzu eradication could use ERTS-1 to inventory locations over 200 meters (660 feet) square. Microdensitometer data collected on ERTS-1 Bulk photographic products for the Manitou test site (226C) have shown that the 15-step gray-scale tablets are not of systematic equal values corresponding to 1/14 the maximum radiant energy incident on the MSS sensor. The gray-scale values present a third-order polynomial function rather than a direct linear relationship. Although data collected on step tablets for precision photographic products appear more discrete, the density variation within blocks in almost as great as variations between blocks. These system errors will cause problems when attempting to analyze radiometric variances among vegetation and land use classes.

Heller, R. C.↗
NASA NTRS1981

Modulation/demodulation techniques for satellite communications. Part 1: Background

Basic characteristics of digital data transmission systems described include the physical communication links, the notion of bandwidth, FCC regulations, and performance measurements such as bit rates, bit error probabilities, throughputs, and delays. The error probability performance and spectral characteristics of various modulation/demodulation techniques commonly used or proposed for use in radio and satellite communication links are summarized. Forward error correction with block or convolutional codes is also discussed along with the important coding parameter, channel cutoff rate.

Omura, J. K.↗
NASA NTRS1982

The development version control and visibility subsystem

A prototype development version control and programming environment visibility subsystem (DVCS) is described. DVCS provides an implementation/management interface serving both the implementor and management. The DVCS provides the implementor listings annotated with change bars, detects errors in the block structure of the design and indicates when standards requiring the use of structured programming constructs in the design of software are violated.

Hawley, L. R.↗
NASA NTRS1982

Initial vector magnetic anomaly map from Magsat

Global magnetic component anomaly field maps have been derived from the Magsat vector magnetometer data obtained from November 1979 through May 1980. The amplitude of variations of the components over the maps are between 10 and 15 nT, well above the noise in the data. Averaged data, in 2-by-2 deg blocks, exhibit standard errors of the mean of about 1 nT over most of the X and Z maps, and about 2 nT over most of the Y maps. Errors rise to about twice these amounts near the auroral belts. Most of the anomalies in the component data are consistent with a crustal magnetization model which incorporates dipoles aligned only in the direction of the main field. However, there appear to be some regions which require dipoles aligned in some other direction i.e., remanent magnetization.

Langel, R. A.↗
NASA NTRS1994

Triple-Error-Correcting Codec ASIC

Coder/decoder constructed on single integrated-circuit chip. Handles data in variety of formats at rates up to 300 Mbps, correcting up to 3 errors per data block of 256 to 512 bits. Helps reduce cost of transmitting data. Useful in many high-data-rate, bandwidth-limited communication systems such as; personal communication networks, cellular telephone networks, satellite communication systems, high-speed computing networks, broadcasting, and high-reliability data-communication links.

Jones, Robert E.↗
NASA NTRS1994

High performance compression of science data

Two papers make up the body of this report. One presents a single-pass adaptive vector quantization algorithm that learns a codebook of variable size and shape entries; the authors present experiments on a set of test images showing that with no training or prior knowledge of the data, for a given fidelity, the compression achieved typically equals or exceeds that of the JPEG standard. The second paper addresses motion compensation, one of the most effective techniques used in the interframe data compression. A parallel block-matching algorithm for estimating interframe displacement of blocks with minimum error is presented. The algorithm is designed for a simple parallel architecture to process video in real time.

Storer, James A.↗
NASA NTRS1994

High Performance Compression of Science Data

Two papers make up the body of this report. One presents a single-pass adaptive vector quantization algorithm that learns a codebook of variable size and shape entries; the authors present experiments on a set of test images showing that with no training or prior knowledge of the data, for a given fidelity, the compression achieved typically equals or exceeds that of the JPEG standard. The second paper addresses motion compensation, one of the most effective techniques used in interframe data compression. A parallel block-matching algorithm for estimating interframe displacement of blocks with minimum error is presented. The algorithm is designed for a simple parallel architecture to process video in real time.

Storer, James A.↗
NASA NTRS2015

Error Propagation in a System Model

Embodiments of the present subject matter can enable the analysis of signal value errors for system models. In an example, signal value errors can be propagated through the functional blocks of a system model to analyze possible effects as the signal value errors impact incident functional blocks. This propagation of the errors can be applicable to many models of computation including avionics models, synchronous data flow, and Kahn process networks.

Schloegel, Kirk↗
NASA NTRS1991

A comparison of Manchester symbol tracking loops for block 5 applications

The linearized tracking errors of three Manchester (biphase coded) symbol tracking loops are compared to determine which is appropriate for Block 5 receiver applications. The first is a nonreturn to zero (NRZ) symbol synchronizer loop operating at twice the symbol rate (NRZ x 2) so that it operates on half symbols. The second near optimally processes the mid-symbol transitions and ignores the between symbol transitions. In the third configuration, the first two approaches are combined as a hybrid to produce the best performance. Although this hybrid loop is the best at low symbol signal to noise ratios (SNRs), it has about the same performance as the NRZ x 2 loop at higher SNRs (greater than 0-dB E sub s/N sub 0). Based on this analysis, it is tentatively recommended that the hybrid loop be implemented for Manchester data in the Block 5 receiver. However, the high data rate case and the hardware implications of each implementation must be understood and analyzed before the hybrid loop is recommended unconditionally.

Holmes, J. K.↗
NASA NTRS1973

The random coding bound is tight for the average code.

The random coding bound of information theory provides a well-known upper bound to the probability of decoding error for the best code of a given rate and block length. The bound is constructed by upperbounding the average error probability over an ensemble of codes. The bound is known to give the correct exponential dependence of error probability on block length for transmission rates above the critical rate, but it gives an incorrect exponential dependence at rates below a second lower critical rate. Here we derive an asymptotic expression for the average error probability over the ensemble of codes used in the random coding bound. The result shows that the weakness of the random coding bound at rates below the second critical rate is due not to upperbounding the ensemble average, but rather to the fact that the best codes are much better than the average at low rates.

Gallager, R. G.↗
NASA NTRS1972

Adaptive line by line encoder for image transmission.

A simple adaptive algorithm is applied to the line by line encoding of images. Among its desirable properties the algorithm includes a control of encoding errors independently of the image statistics. This block transform encoder, because of its adaptive nature gives rise to nonstationary errors and end of block effects. Two methods are proposed to reduce these effects and thus improve the subjective quality of reconstructed images. The performance of the algorithm is image dependent and several illustrative examples are given.

Algazi, V. R.↗
NASA NTRS2004

Using Block-local Atomicity to Detect Stale-value Concurrency Errors

Data races do not cover all kinds of concurrency errors. This paper presents a data-flow-based technique to find stale-value errors, which are not found by low-level and high-level data race algorithms. Stale values denote copies of shared data where the copy is no longer synchronized. The algorithm to detect such values works as a consistency check that does not require any assumptions or annotations of the program. It has been implemented as a static analysis in JNuke. The analysis is sound and requires only a single execution trace if implemented as a run-time checking algorithm. Being based on an analysis of Java bytecode, it encompasses the full program semantics, including arbitrarily complex expressions. Related techniques are more complex and more prone to over-reporting.

Artho, Cyrille↗