Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “PARITY”

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

Quasi-optimal decoding of linear block codes using soft decision detection

A simple but effective decoding procedure, applicable to any (n,k) linear block code with symbols from GF(q), is described. The technique involves a transformation of the parity check equations which focuses the code's correction power on the soft symbol set while still retaining the capability to correct one symbol error from outside this set. The soft symbol set is defined to be the n-k least reliably detected code symbol positions whose parity check row-spaces are linearly independent. The process generates a number of error vector screening candidates, each a solution to the parity check equations, and the maximum-likelihood candidate is accepted.

Greene, E. P.↗
NASA NTRS1987

A vector-based failure detection and isolation algorithm for a dual fail-operational redundant strapdown inertial measurement unit

A vector-based failure detection and isolation technique for a skewed array of two degree-of-freedom inertial sensors is developed. Failure detection is based on comparison of parity equations with a threshold, and isolation is based on comparison of logic variables which are keyed to pass/fail results of the parity test. A multi-level approach to failure detection is used to ensure adequate coverage for the flight control, display, and navigation avionics functions. Sensor error models are introduced to expose the susceptibility of the parity equations to sensor errors and physical separation effects. The algorithm is evaluated in a simulation of a commercial transport operating in a range of light to severe turbulence environments. A bias-jump failure level of 0.2 deg/hr was detected and isolated properly in the light and moderate turbulence environments, but not detected in the extreme turbulence environment. An accelerometer bias-jump failure level of 1.5 milli-g was detected over all turbulence environments. For both types of inertial sensor, hard-over, and null type failures were detected in all environments without incident. The algorithm functioned without false alarm or isolation over all turbulence environments for the runs tested.

Morrell, Frederick R.↗
NASA NTRS1992

Self-dual (48,24;12) codes

Two self-dual (48,24;12) codes are constructed as 6 x 8 matrices whose columns add up to form an extended BCH-Hamming (8,4;4) code and whose rows sum to odd or even parity. The codes constructed have the identical weight structure of the extended quadratic residue code of length 48. Algebraic isomorphisms may exist between pairs of these three codes. However, because of their matrix form, the newly constructed codes are easily correctable for all five-error and many six-error patterns. The first code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix and then adjoining six dimensions to the extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. The second code comes from a slight modification in the parity (eighth) dimension of the Reed-Solomon (8,4;5) code over GF(64). Error correction in both codes uses the row sum parity information to detect errors in the correction algorithm.

Solomon, G.↗
NASA NTRS1992

More box codes

A new investigation shows that, starting from the BCH (21,15;3) code represented as a 7 x 3 matrix and adding a row and column to add even parity, one obtains an 8 x 4 matrix (32,15;8) code. An additional dimension is obtained by specifying odd parity on the rows and even parity on the columns, i.e., adjoining to the 8 x 4 matrix, the matrix, which is zero except for the fourth column (of all ones). Furthermore, any seven rows and three columns will form the BCH (21,15;3) code. This box code has the same weight structure as the quadratic residue and BCH codes of the same dimensions. Whether there exists an algebraic isomorphism to either code is as yet unknown.

Solomon, G.↗
NASA NTRS1993

A (72, 36; 15) box code

A (72,36;15) box code is constructed as a 9 x 8 matrix whose columns add to form an extended BCH-Hamming (8,4;4) code and whose rows sum to odd or even parity. The newly constructed code, due to its matrix form, is easily decodable for all seven-error and many eight-error patterns. The code comes from a slight modification in the parity (eighth) dimension of the Reed-Solomon (8,4;5) code over GF(512). Error correction uses the row sum parity information to detect errors, which then become erasures in a Reed-Solomon correction algorithm.

Solomon, G.↗
NASA NTRS1994

Convolutional encoding of self-dual codes

There exist almost complete convolutional encodings of self-dual codes, i.e., block codes of rate 1/2 with weights w, w = 0 mod 4. The codes are of length 8m with the convolutional portion of length 8m-2 and the nonsystematic information of length 4m-1. The last two bits are parity checks on the two (4m-1) length parity sequences. The final information bit complements one of the extended parity sequences of length 4m. Solomon and van Tilborg have developed algorithms to generate these for the Quadratic Residue (QR) Codes of lengths 48 and beyond. For these codes and reasonable constraint lengths, there are sequential decodings for both hard and soft decisions. There are also possible Viterbi-type decodings that may be simple, as in a convolutional encoding/decoding of the extended Golay Code. In addition, the previously found constraint length K = 9 for the QR (48, 24;12) Code is lowered here to K = 8.

Solomon, G.↗
NASA NTRS2009

Constructing LDPC Codes from Loop-Free Encoding Modules

A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to channel capacity limits can be achieved for the codes of the type in question having low maximum variable node degrees. The decoding thresholds in these examples are lower than those of the best-known unstructured irregular LDPC codes constrained to have the same maximum node degrees. Furthermore, the present method enables the construction of codes of any desired rate with thresholds that stay uniformly close to their respective channel capacity thresholds.

Divsalar, Dariush↗
NASA NTRS2013

Bilayer Protograph Codes for Half-Duplex Relay Channels

Direct to Earth return links are limited by the size and power of lander devices. A standard alternative is provided by a two-hops return link: a proximity link (from lander to orbiter relay) and a deep-space link (from orbiter relay to Earth). Although direct to Earth return links are limited by the size and power of lander devices, using an additional link and a proposed coding for relay channels, one can obtain a more reliable signal. Although significant progress has been made in the relay coding problem, existing codes must be painstakingly optimized to match to a single set of channel conditions, many of them do not offer easy encoding, and most of them do not have structured design. A high-performing LDPC (low-density parity-check) code for the relay channel addresses simultaneously two important issues: a code structure that allows low encoding complexity, and a flexible rate-compatible code that allows matching to various channel conditions. Most of the previous high-performance LDPC codes for the relay channel are tightly optimized for a given channel quality, and are not easily adapted without extensive re-optimization for various channel conditions. This code for the relay channel combines structured design and easy encoding with rate compatibility to allow adaptation to the three links involved in the relay channel, and furthermore offers very good performance. The proposed code is constructed by synthesizing a bilayer structure with a pro to graph. In addition to the contribution to relay encoding, an improved family of protograph codes was produced for the point-to-point AWGN (additive white Gaussian noise) channel whose high-rate members enjoy thresholds that are within 0.07 dB of capacity. These LDPC relay codes address three important issues in an integrative manner: low encoding complexity, modular structure allowing for easy design, and rate compatibility so that the code can be easily matched to a variety of channel conditions without extensive re-optimization. The main problem of half-duplex relay coding can be reduced to the simultaneous design of two codes at two rates and two SNRs (signal-to-noise ratios), such that one is a subset of the other. This problem can be addressed by forceful optimization, but a clever method of addressing this problem is via the bilayer lengthened (BL) LDPC structure. This method uses a bilayer Tanner graph to make the two codes while using a concept of "parity forwarding" with subsequent successive decoding that removes the need to directly address the issue of uneven SNRs among the symbols of a given codeword. This method is attractive in that it addresses some of the main issues in the design of relay codes, but it does not by itself give rise to highly structured codes with simple encoding, nor does it give rate-compatible codes. The main contribution of this work is to construct a class of codes that simultaneously possess a bilayer parity- forwarding mechanism, while also benefiting from the properties of protograph codes having an easy encoding, a modular design, and being a rate-compatible code.

Divsalar, Dariush↗
NASA NTRSDate not supplied

Artemis I Orion IMU Flight Performance

The Orion flight software’s parity algorithm runs onboard to verify all three OIMUs (Orion Inertial Measurement Units) are sensing relatively uniform rate and acceleration and to quickly identify any unit which is in significant disagreement with the other two units. During the Artemis-I Wet Dress Rehearsal tests and Launch Countdowns, one of the three OIMUs regularly reported an anomalous parity signature for a brief period of time during sensor warm up. This paper will review this anomalous performance on the pad and review flight data with the intent to supplement the findings of the initial root cause investigation. Outside of this start up behavior, initial investigation into Artemis I flight data did not reveal any behavior of the OIMUs outside of preflight expectations. Flight data from any significant parity events and relevant IMU calibrations will be presented. A brief discussion of impacts to future Artemis mission operations strategy will be provided.

Robert Earl↗
NASA NTRS2023

Testing Cosmic Microwave Background Anomalies in E-mode Polarization with Current and Future Data

In this paper, we explore the power of the cosmic microwave background (CMB) polarization (E-mode) data to corroborate four potential anomalies in CMB temperature data: the lack of large angular-scale correlations, the alignment of the quadrupole and octupole (Q–O), the point-parity asymmetry, and the hemispherical power asymmetry. We use CMB simulations with noise representative of three experiments—the Planck satellite, the Cosmology Large Angular Scale Surveyor (CLASS), and the LiteBIRD satellite—to test how current and future data constrain the anomalies. We find the correlation coefficients ρ between temperature and E-mode estimators to be less than 0.1, except for the point-parity asymmetry (ρ = 0.17 for cosmic-variance-limited simulations), confirming that E-modes provide a check on the anomalies that is largely independent of temperature data. Compared to Planck component-separated CMB data (smica), the putative LiteBIRD survey would reduce errors on E-mode anomaly estimators by factors of ∼3 for hemispherical power asymmetry and point-parity asymmetry, and by ∼26 for lack of large-scale correlation. The improvement in Q–O alignment is not obvious due to large cosmic variance, but we found the ability to pin down the estimator value will be improved by a factor ≳100. Improvements with CLASS are intermediate to these.

Cosmic microwave background radiation↗
DOE OSTI2018

Smart memory buffers

An example method involves receiving, at a first memory node, data to be written at a memory location in the first memory node. The data is received from a device. At the first memory node, old data is read from the memory location, without sending the old data to the device. The data is written to the memory location. The data and the old data are sent from the first memory node to a second memory node to store parity information in the second memory node without the device determining the parity information. The parity information is based on the data stored in the first memory node.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantum information processing with majorana bound states in superconducting circuits

In a weak link of two s-wave superconductors (SCs) coupled via a time-reversal-invariant (TRI) topological superconducting (TSC) island, a Josephson current can flow due to Cooper pairs tunneling in and out of spatially separated Majorana Kramers pairs (MKPs), which are doublets of Majorana bound states (MBSs). The sign of the resulting Josephson current is fixed by the joint parity of the four Majorana bound states that make up the MKPs on the TSC island. This parity-controlled Josephson effect can be used as a read-out mechanism for the joint parity in Majorana-based quantum computing. For a TSC island with four terminals, the SC leads can address a Majorana superconducting qubit (MSQ) formed by the charge ground states of the TSC island's terminals. Cooper pair splitting enables single-qubit operations, qubit read-out, as well as two-qubit entangling gates. Hence, TSC islands between SC leads may provide an alternative approach to superconducting quantum computation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Smart memory buffers

An example method involves receiving, at a first memory node, data to be written at a memory location in the first memory node. The data is received from a device. At the first memory node, old data is read from the memory location, without sending the old data to the device. The data is written to the memory location. The data and the old data are sent from the first memory node to a second memory node to store parity information in the second memory node without the device determining the parity information. The parity information is based on the data stored in the first memory node.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

System and methods for hardware-software cooperative pipeline error detection

An error reporting system utilizes a parity checker to receive data results from execution of an original instruction and a parity bit for the data. A decoder receives an error correcting code (ECC) for data resulting from execution of a shadow instruction of the original instruction, and data error correction is initiated on the original instruction result on condition of a mismatch between the parity bit and the original instruction result, and the decoder asserting a correctable error in the original instruction result.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Lattice Results for New Hadronic States

Recent results related to the new hadronic states from ab-initio lattice QCD calculations will be presented. I will focus on the charmonium and charmonium-like states as well as the interesting positive parity Ds and Bs mesons. Charmonia below open charm threshold are rather well understood, and their theoretical treatment is precise and reliable. I will consider charmomium(like) states near or above open charm threshold. These are very interesting, not only because of the experimental discoveries during the past decade, but also due to the theoretical challenges in their understanding. I will present one of the first studies that take into account the effects of thresholds for near-threshold states, and also the effect of strong decays for resonances above thresholds. New results on the exotic states X(3872) and Z+c, as well as on the more conventional charmonium resonances will be presented. The meson spectrum contains a few interesting states that are located slightly below strong decay threshold. Observed positive parity Ds mesons represent one such example and I will discuss the first simulation that takes into account the effect of the nearby D(*?)K threshold. The positive parity partners Bs are still missing experimentally, and mass prediction for those will be presented.

Prelovsek, Sasa↗
DOE OSTI2015

Galvano-rotational effect induced by electroweak interactions in pulsars

We study electroweakly interacting particles in rotating matter. The existence of the electric current along the axis of the matter rotation is predicted in this system. This new galvano-rotational effect is caused by the parity violating interaction between massless charged particles in the rotating matter. We start with the exact solution of the Dirac equation for a fermion involved in the electroweak interaction in the rotating frame. This equation includes the noninertial effects. Then, using the obtained solution, we derive the induced electric current which turns out to flow along the rotation axis. We study the possibility of the appearance of the galvano-rotational effect in dense matter of compact astrophysical objects. The particular example of neutron and hypothetical quark stars is discussed. It is shown that, using this effect, one can expect the generation of toroidal magnetic fields comparable with poloidal ones in old millisecond pulsars. We also briefly discuss the generation of the magnetic helicity in these stars. Finally we analyze the possibility to apply the galvano-rotational effect for the description of the asymmetric neutrino emission from a neutron star to explain pulsars kicks.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

Antideuterons from decaying gravitino dark matter

We study the possibility of improving the constraints on the lifetime of gravitino dark matter in scenarios with bilinear R-parity violation by estimating the amount of cosmic-ray antideuterons that can be produced in gravitino decays. Taking into account all different sources of theoretical uncertainties, we find that the margin of improvement beyond the limits already set by cosmic-ray antiproton data are quite narrow and unachievable for the next generation of experiments. However, we also identify more promising energy ranges for future experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

Breaking discrete symmetries in the effective field theory of inflation

We study the phenomenon of discrete symmetry breaking during the inflationary epoch, using a model-independent approach based on the effective field theory of inflation. We work in a context where both time reparameterization symmetry and spatial diffeomorphism invariance can be broken during inflation. We determine the leading derivative operators in the quadratic action for fluctuations that break parity and time-reversal. Within suitable approximations, we study their consequences for the dynamics of linearized fluctuations. Both in the scalar and tensor sectors, we show that such operators can lead to new direction-dependent phases for the modes involved. They do not affect the power spectra, but can have consequences for higher correlation functions. Moreover, a small quadrupole contribution to the sound speed can be generated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗