SEARCH · Search NASA

Results for “error correction.”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 487 records · Page 27

All sources NASA NTRS DOE OSTI

DOE OSTI2016

AMiBA: cluster Sunyaev-Zel'dovich effect observations with the expanded 13-element array

The Yuan-Tseh Lee Array for Microwave Background Anisotropy (AMiBA) is a co-planar interferometer array operating at a wavelength of 3 mm to measure the Sunyaev–Zel’dovich effect (SZE) of galaxy clusters at arcminute scales. The first phase of operation—with a compact 7-element array with 0.6 m antennas (AMiBA-7)—observed six clusters at angular scales from 5{sup ′} to 23{sup ′}. Here, we describe the expansion of AMiBA to a 13-element array with 1.2 m antennas (AMiBA-13), its subsequent commissioning, and cluster SZE observing program. The most noticeable changes compared to AMiBA-7 are (1) array re-configuration with baselines ranging from 1.4 m to 4.8 m, allowing us to sample structures between 2{sup ′} and 10{sup ′}, (2) 13 new lightweight carbon-fiber-reinforced plastic (CFRP) 1.2 m reflectors, and (3) additional correlators and six new receivers. Since the reflectors are co-mounted on and distributed over the entire six-meter CFRP platform, a refined hexapod pointing error model and phase error correction scheme have been developed for AMiBA-13. These effects—entirely negligible for the earlier central close-packed AMiBA-7 configuration—can lead to additional geometrical delays during observations. Our correction scheme recovers at least 80 ± 5% of the point-source fluxes. We, therefore, apply an upward correcting factor of 1.25 to our visibilities to correct for phase decoherence, and a ±5% systematic uncertainty is added in quadrature with our statistical errors. We demonstrate the absence of further systematics with a noise level consistent with zero in stacked uv-visibilities. From the AMiBA-13 SZE observing program, we present here maps of a subset of 12 clusters with signal-to-noise ratios above five. We demonstrate combining AMiBA-7 with AMiBA-13 observations on Abell 1689, by jointly fitting their data to a generalized Navarro–Frenk–White model. Our cylindrically integrated Compton-y values for five radii are consistent with results from the Berkeley-Illinois-Maryland Array, the Owens Valley Radio Observatory, the Sunyaev–Zel’dovich Array, and the Planck Observatory. We also report the first targeted SZE detection toward the optically selected cluster RCS J1447+0828, and we demonstrate the ability of AMiBA SZE data to serve as a proxy for the total cluster mass. Finally, we show that our AMiBA-SZE derived cluster masses are consistent with recent lensing mass measurements in the literature.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1986

On the decode error probability for Reed-Solomon codes

Upper bounds on the decoder error probability for Reed-Solomon codes are derived. By definition, decoder error occurs when the decoder finds a codeword other than the transmitted codeword; this is in contrast to decoder failure, which occurs when the decoder fails to find any codeword at all. The results imply, for example, that for a t error correcting Reed-Solomon code of length q - 1 over GF(q), if more than t errors occur, the probability of decoder error is less than 1/t! In particular, for the Voyager Reed-Solomon code, the probability of decoder error given a word error is smaller than 3 x 10 to the minus 14th power. Thus, in a typical operating region with probability 100,000 of word error, the probability of undetected word error is about 10 to the minus 14th power.

Mceliece, R. J.↗

NASA NTRS1986

On the decoder error probability for Reed-Solomon codes

Upper bounds on the decoder error probability for Reed-Solomon codes are derived. By definition, decoder error occurs when the decoder finds a codeword other than the transmitted codeword; this is in contrast to decoder failure, which occurs when the decoder fails to find any codeword at all. The results imply, for example, that for a t error-correcting Reed-Solomon code of length q - 1 over GF(q), if more than t errors occur, the probability of decoder error is less than 1/t. In particular, for the Voyager Reed-Solomon code, the probability of decoder error given a word error is smaller than 3 x 10 to the minus 14th power. Thus, in a typical operating region with probability 100,000 of word error, the probability of undetected word error is about 10 to the minus 14th power.

Mceliece, Robert J.↗

NASA NTRS1995

Analysis of filter tuning techniques for sequential orbit determination

This paper examines filter tuning techniques for a sequential orbit determination (OD) covariance analysis. Recently, there has been a renewed interest in sequential OD, primarily due to the successful flight qualification of the Tracking and Data Relay Satellite System (TDRSS) Onboard Navigation System (TONS) using Doppler data extracted onboard the Extreme Ultraviolet Explorer (EUVE) spacecraft. TONS computes highly accurate orbit solutions onboard the spacecraft in realtime using a sequential filter. As the result of the successful TONS-EUVE flight qualification experiment, the Earth Observing System (EOS) AM-1 Project has selected TONS as the prime navigation system. In addition, sequential OD methods can be used successfully for ground OD. Whether data are processed onboard or on the ground, a sequential OD procedure is generally favored over a batch technique when a realtime automated OD system is desired. Recently, OD covariance analyses were performed for the TONS-EUVE and TONS-EOS missions using the sequential processing options of the Orbit Determination Error Analysis System (ODEAS). ODEAS is the primary covariance analysis system used by the Goddard Space Flight Center (GSFC) Flight Dynamics Division (FDD). The results of these analyses revealed a high sensitivity of the OD solutions to the state process noise filter tuning parameters. The covariance analysis results show that the state estimate error contributions from measurement-related error sources, especially those due to the random noise and satellite-to-satellite ionospheric refraction correction errors, increase rapidly as the state process noise increases. These results prompted an in-depth investigation of the role of the filter tuning parameters in sequential OD covariance analysis. This paper analyzes how the spacecraft state estimate errors due to dynamic and measurement-related error sources are affected by the process noise level used. This information is then used to establish guidelines for determining optimal filter tuning parameters in a given sequential OD scenario for both covariance analysis and actual OD. Comparisons are also made with corresponding definitive OD results available from the TONS-EUVE analysis.

Lee, T.↗

NASA NTRSDate not supplied

Design and Performance of a Multi-mode Photon-counting Receiver for the NASA O2O Mission

The NASA Orion O2O mission was designed and tested to support high-rate bi-directional optical communications between one of multiple ground sites and a crewed capsule during a 10-day mission. This paper focuses on the design and performance of the receiver that will be based at the NASA White Sands Complex, New Mexico, USA. The main receiver components consist of two 40-cm apertures, each coupled to a specialty multi-mode optical fiber; each fiber coupled to a custom array of superconducting nanowire single-photon detectors; a high-speed, high-channel-count time-to-digital converter; and custom digitizing electronics to perform deserialization, demodulation, clock recovery, and forward error correction with a powerful serially-concatenated pulse-position-modulation turbo code. We show error-free data communication performance up to the maximum required data rate of 267 Mb/s.

optical↗

NASA NTRS1979

A /31,15/ Reed-Solomon Code for large memory systems

This paper describes the encoding and the decoding of a (31,15) Reed-Solomon Code for multiple-burst error correction for large memory systems. The decoding procedure consists of four steps: (1) syndrome calculation, (2) error-location polynomial calculation, (3) error-location numbers calculation, and (4) error values calculation. The principal features of the design are the use of a hardware shift register for both high-speed encoding and syndrome calculation, and the use of a commercially available (31,15) decoder for decoding Steps 2, 3 and 4.

Lim, R. S.↗

NASA NTRS1999

Cultural Variability in Crew Discourse

Four studies were conducted to determine features of effective crew communication in response to errors during flight. Study One examined whether US captains and first officers use different communication strategies to correct errors and problems on the flight deck, and whether their communications are affected by the two situation variables, level of risk and degree of face-threat involved in challenging an error. Study Two was the cross-cultural extension of Study One and involved pilots from three European countries. Study Three compared communication strategies of female and male air carrier pilots who were matched in terms of years and type of aircraft experience. The final study assessed the effectiveness of the communication strategies observed in Study One.

Fischer, Ute↗

NASA NTRSDate not supplied

Logical Shadow Tomography: Efficient Estimation of Error-mitigated Observables

In near-term quantum applications, reducing errors and improving device reliability is an essential task. Towards these ends, various techniques have been introduced in recent literature, collectively referred to as quantum error mitigation techniques, for reducing errors in pre-fault-tolerant devices. Here, we introduce logical shadow tomography as a versatile error mitigation method. Our technique uses a stabilizer code to encode information in a logical state. Instead of doing active error correction, quantum states will be measured at the end of computation via shadow tomography and non-logical errors are projected out in the classical post-processing. Relative to quantum subspace expansion which requires O(2(M-1)L) experiments to estimate an logical Pauli observable encoded by an [[M, L, d]] code, our technique only requires 2L experiments, an important practical reduction in resources.

Hong-Ye Hu↗

NASA NTRS1981

Anthropometric data error detecting and correction with a computer

Data obtained with automated anthropometric data aquisition equipment was examined for short term errors. The least squares curve fitting technique was used to ascertain which data values were erroneous and to replace them, if possible, with corrected values. Errors were due to random reflections of light, masking of the light rays, and other types of optical and electrical interference. It was found that the signals were impossible to eliminate from the initial data produced by the television cameras, and that this was primarily a software problem requiring a digital computer to refine the data off line. The specific data of interest was related to the arm reach envelope of a human being.

Chesak, D. D.↗

NASA NTRS1987

Local concurrent error detection and correction in data structures using virtual backpointers

A new technique, based on virtual backpointers, for local concurrent error detection and correction in linked data structures is presented. Two new data structures, the Virtual Double Linked List, and the B-tree with Virtual Backpointers, are described. For these structures, double errors can be detected in 0(1) time and errors detected during forward moves can be corrected in 0(1) time. The application of a concurrent auditor process to data structure error detection and correction is analyzed, and an implementation is described, to determine the effect on mean time to failure of a multi-user shared database system. The implementation utilizes a Sequent shared memory multiprocessor system operating on a shared databased of Virtual Double Linked Lists.

Li, C. C.↗

NASA NTRS1989

Local concurrent error detection and correction in data structures using virtual backpointers

A new technique, based on virtual backpointers, for local concurrent error detection and correction in linked data strutures is presented. Two new data structures, the Virtual Double Linked List, and the B-tree with Virtual Backpointers, are described. For these structures, double errors can be detected in 0(1) time and errors detected during forward moves can be corrected in 0(1) time. The application of a concurrent auditor process to data structure error detection and correction is analyzed, and an implementation is described, to determine the effect on mean time to failure of a multi-user shared database system. The implementation utilizes a Sequent shared memory multiprocessor system operating on a shared database of Virtual Double Linked Lists.

Li, Chung-Chi Jim↗

NASA NTRS1984

Reed Solomon codes for error control in byte organized computer memory systems

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K-bit DRAM's are organized in 32Kx8 bit-bytes. Byte oriented codes such as Reed Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. Some special decoding techniques for extended single-and-double-error-correcting RS codes which are capable of high speed operation are presented. These techniques are designed to find the error locations and the error values directly from the syndrome without having to use the iterative algorithm to find the error locator polynomial.

Lin, S.↗

NASA NTRS1976

Coordinated design of coding and modulation systems

Work on partial unit memory codes continued; it was shown that for a given virtual state complexity, the maximum free distance over the class of all convolutional codes is achieved within the class of unit memory codes. The effect of phase-lock loop (PLL) tracking error on coding system performance was studied by using the channel cut-off rate as the measure of quality of a modulation system. Optimum modulation signal sets for a non-white Gaussian channel considered an heuristic selection rule based on a water-filling argument. The use of error correcting codes to perform data compression by the technique of syndrome source coding was researched and a weight-and-error-locations scheme was developed that is closely related to LDSC coding.

Massey, J. L.↗

NASA NTRS1976

Implementation of an experimental fault-tolerant memory system

The experimental fault-tolerant memory system described in this paper has been designed to enable the modular addition of spares, to validate the theoretical fault-secure and self-testing properties of the translator/corrector, to provide a basis for experiments using the new testing and correction processes for recovery, and to determine the practicality of such systems. The hardware design and implementation are described, together with methods of fault insertion. The hardware/software interface, including a restricted single error correction/double error detection (SEC/DED) code, is specified. Procedures are carefully described which, (1) test for specified physical faults, (2) ensure that single error corrections are not miscorrections due to triple faults, and (3) enable recovery from double errors.

Carter, W. C.↗

DOE OSTI2020

3D Coded SUMMA: Communication-Efficient and Robust Parallel Matrix Multiplication

In this paper, we propose a novel fault-tolerant parallel matrix multiplication algorithm called 3D Coded SUMMA that achieves higher failure-tolerance than replication-based schemes for the same amount of redundancy. This work bridges the gap between recent developments in coded computing and fault-tolerance in high-performance computing (HPC). The core idea of coded computing is the same as algorithm-based fault-tolerance (ABFT), which is weaving redundancy in the computation using error-correcting codes. In particular, we show that MatDot codes, an innovative code construction for parallel matrix multiplications, can be integrated into three-dimensional SUMMA (Scalable Universal Matrix Multiplication Algorithm [30]) in a communication-avoiding manner. To tolerate any two node failures, the proposed 3D Coded SUMMA requires ~50% less redundancy than replication, while the overhead in execution time is only about 5–10%.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Quantum information in the Posner model of quantum cognition

Matthew Fisher recently postulated a mechanism by which quantum phenomena could influence cognition: Phosphorus nuclear spins may resist decoherence for long times. The spins would serve as biological qubits. The qubits may resist decoherence longer when in Posner molecules. We imagine that Fisher postulates correctly. How adroitly could biological systems process quantum information (QI)? We establish a framework for answering. Additionally, we construct applications of biological qubits to quantum error correction, quantum communication, and quantum computation. First, we posit how the QI encoded by the spins transforms as Posner molecules form. The transformation points to a natural computational basis for qubits in Posner molecules. From the basis, we construct a quantum code that detects arbitrary single-qubit errors. Each molecule encodes one qutrit. Shifting from information storage to computation, we define the model of Posner quantum computation. To illustrate the model’s quantum-communication ability, we show how it can teleport information incoherently: A state’s weights are teleported. Dephasing results from the entangling operation’s simulation of a coarse-grained Bell measurement. Whether Posner quantum computation is universal remains an open question. However, the model’s operations can efficiently prepare a Posner state usable as a resource in universal measurement-based quantum computation. The state results from deforming the Affleck–Kennedy–Lieb–Tasaki (AKLT) state and is a projected entangled-pair state (PEPS). Finally, we show that entanglement can affect molecular-binding rates, boosting a binding probability from 33.6% to 100% in an example. This work opens the door for the QI-theoretic analysis of biological qubits and Posner molecules.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

An Assessment of Receiver Algorithms for Distributed Massive MIMO Systems: Investigating Design Solutions and Performance

This study investigates receiver design solutions for distributed Massive Multiple Input Multiple Output (D-m MIMO) systems, taking into account parameters such as number of access points as well as concerns related to channel estimates that use single-carrier frequency-domain equalization (SC-FDE). A significant contribution of this research is the integration of Low-Density Parity-Check (LDPC) codes to simplify coding complexity and enhance communication efficiency. The research examines different receiver designs, such as spatial antenna correlation and sophisticated channel estimation methods. The authors propose integrating LDPC codes into the receiver architecture to simplify computations and enhance error correction and decoding. Moreover, the paper examines performance evaluation measures and approaches, highlighting the trade-offs among complexity, spectral efficiency, and error performance. The comparative analysis indicates the benefits, in terms of performance, of incorporating LDPC codes and improving system throughput and dependability. We examine four distinct receiver algorithms: zero-forcing (ZF), minimum mean square error (MMSE), maximum ratio combining (MRC), and equal gain combining (EGC). The study shows that MRC and EGC receivers work well in D-m MIMO because they make the receiver system less computationally demanding.

Gashtasbi, Ali↗

NASA NTRS1975

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.↗