Search NASA⌕ Search

SEARCH · Search NASA

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 181 records · Page 10

An evidential reasoning extension to quantitative model-based failure diagnosis

The detection and diagnosis of failures in physical systems characterized by continuous-time operation are studied. A quantitative diagnostic methodology has been developed that utilizes the mathematical model of the physical system. On the basis of the latter, diagnostic models are derived each of which comprises a set of orthogonal parity equations. To improve the robustness of the algorithm, several models may be used in parallel, providing potentially incomplete and/or conflicting inferences. Dempster's rule of combination is used to integrate evidence from the different models. The basic probability measures are assigned utilizing quantitative information extracted from the mathematical model and from online computation performed therewith.

Gertler, Janos J.↗

The analysis of convolutional codes via the extended Smith algorithm

Convolutional codes have been the central part of most error-control systems in deep-space communication for many years. Almost all such applications, however, have used the restricted class of (n,1), also known as 'rate 1/n,' convolutional codes. The more general class of (n,k) convolutional codes contains many potentially useful codes, but their algebraic theory is difficult and has proved to be a stumbling block in the evolution of convolutional coding systems. In this article, the situation is improved by describing a set of practical algorithms for computing certain basic things about a convolutional code (among them the degree, the Forney indices, a minimal generator matrix, and a parity-check matrix), which are usually needed before a system using the code can be built. The approach is based on the classic Forney theory for convolutional codes, together with the extended Smith algorithm for polynomial matrices, which is introduced in this article.

Mceliece, R. J.↗

Tutorial: Performance and reliability in redundant disk arrays

A disk array is a collection of physically small magnetic disks that is packaged as a single unit but operates in parallel. Disk arrays capitalize on the availability of small-diameter disks from a price-competitive market to provide the cost, volume, and capacity of current disk systems but many times their performance. Unfortunately, relative to current disk systems, the larger number of components in disk arrays leads to higher rates of failure. To tolerate failures, redundant disk arrays devote a fraction of their capacity to an encoding of their information. This redundant information enables the contents of a failed disk to be recovered from the contents of non-failed disks. The simplest and least expensive encoding for this redundancy, known as N+1 parity is highlighted. In addition to compensating for the higher failure rates of disk arrays, redundancy allows highly reliable secondary storage systems to be built much more cost-effectively than is now achieved in conventional duplicated disks. Disk arrays that combine redundancy with the parallelism of many small-diameter disks are often called Redundant Arrays of Inexpensive Disks (RAID). This combination promises improvements to both the performance and the reliability of secondary storage. For example, IBM's premier disk product, the IBM 3390, is compared to a redundant disk array constructed of 84 IBM 0661 3 1/2-inch disks. The redundant disk array has comparable or superior values for each of the metrics given and appears likely to cost less. In the first section of this tutorial, I explain how disk arrays exploit the emergence of high performance, small magnetic disks to provide cost-effective disk parallelism that combats the access and transfer gap problems. The flexibility of disk-array configurations benefits manufacturer and consumer alike. In contrast, I describe in this tutorial's second half how parallelism, achieved through increasing numbers of components, causes overall failure rates to rise. Redundant disk arrays overcome this threat to data reliability by ensuring that data remains available during and after component failures.

Gibson, Garth A.↗

Radiative lifetimes in B I using ultraviolet and vacuum-ultraviolet laser-induced fluorescence

Radiative lifetimes of the eight lowest even parity levels in the doublet system of B I are measured using time-resolved laser-induced fluorescence in the UV and VUV on an atomic beam of boron. The accurate lifetimes provide a base for improved determination of absolute transition probabilities in B I. The techniques described are broadly applicable to measurement of lifetimes of levels with transitions in the visible, UV, and VUV in almost any element.

O'Brian, T. R.↗

Site partitioning for distributed redundant disk arrays

Distributed redundant disk arrays can be used in a distributed computing system or database system to provide recovery in the presence of temporary and permanent failures of single sites. In this paper, we look at the problem of partitioning the sites into redundant arrays in such way that the communication costs for maintaining the parity information are minimized. We show that the partitioning problem is NP-complete and we propose two heuristic algorithms for finding approximate solutions.

Mourad, Antoine N.↗

Recovery issues in databases using redundant disk arrays

Redundant disk arrays provide a way for achieving rapid recovery from media failures with a relatively low storage cost for large scale database systems requiring high availability. In this paper we propose a method for using redundant disk arrays to support rapid recovery from system crashes and transaction aborts in addition to their role in providing media failure recovery. A twin page scheme is used to store the parity information in the array so that the time for transaction commit processing is not degraded. Using an analytical model, we show that the proposed method achieves a significant increase in the throughput of database systems using redundant disk arrays by reducing the number of recovery operations needed to maintain the consistency of the database.

Mourad, Antoine N.↗

Isospin flip as a relativistic effect: NN interactions

Results are presented of an analytic relativistic calculation of a OBE nucleon-nucleon (NN) interaction employing the Gross equation. The calculation consists of a non-relativistic reduction that keeps the negative energy states. The result is compared to purely non-relativistic OBEP results and the relativistic effects are separated out. One finds that the resulting relativistic effects are expressable as a power series in (tau(sub 1))(tau(sub 2)) that agrees, qualitatively, with NN scattering. Upon G-parity transforming this NN potential, one obtains, qualitatively, a short range NN spectroscopy in which the S-states are the lowest states.

Buck, W. W.↗

Box codes of lengths 48 and 72

A self-dual code length 48, dimension 24, with Hamming distance essentially equal to 12 is constructed here. There are only six code words of weight eight. All the other code words have weights that are multiples of four and have a minimum weight equal to 12. This code may be encoded systematically and arises from a strict binary representation of the (8,4;5) Reed-Solomon (RS) code over GF (64). The code may be considered as six interrelated (8,7;2) codes. The Mattson-Solomon representation of the cyclic decomposition of these codes and their parity sums are used to detect an odd number of errors in any of the six codes. These may then be used in a correction algorithm for hard or soft decision decoding. A (72,36;15) box code was constructed from a (63,35;8) cyclic code. The theoretical justification is presented herein. A second (72,36;15) code is constructed from an inner (63,27;16) Bose Chaudhuri Hocquenghem (BCH) code and expanded to length 72 using box code algorithms for extension. This code was simulated and verified to have a minimum distance of 15 with even weight words congruent to zero modulo four. The decoding for hard and soft decision is still more complex than the first code constructed above. Finally, an (8,4;5) RS code over GF (512) in the binary representation of the (72,36;15) box code gives rise to a (72,36;16*) code with nine words of weight eight, and all the rest have weights greater than or equal to 16.

Solomon, G.↗

Fault detection and isolation

In order for a current satellite-based navigation system (such as the Global Positioning System, GPS) to meet integrity requirements, there must be a way of detecting erroneous measurements, without help from outside the system. This process is called Fault Detection and Isolation (FDI). Fault detection requires at least one redundant measurement, and can be done with a parity space algorithm. The best way around the fault isolation problem is not necessarily isolating the bad measurement, but finding a new combination of measurements which excludes it.

Bernath, Greg↗

Error coding simulations in C

When data is transmitted through a noisy channel, errors are produced within the data rendering it indecipherable. Through the use of error control coding techniques, the bit error rate can be reduced to any desired level without sacrificing the transmission data rate. The Astrionics Laboratory at Marshall Space Flight Center has decided to use a modular, end-to-end telemetry data simulator to simulate the transmission of data from flight to ground and various methods of error control. The simulator includes modules for random data generation, data compression, Consultative Committee for Space Data Systems (CCSDS) transfer frame formation, error correction/detection, error generation and error statistics. The simulator utilizes a concatenated coding scheme which includes CCSDS standard (255,223) Reed-Solomon (RS) code over GF(2(exp 8)) with interleave depth of 5 as the outermost code, (7, 1/2) convolutional code as an inner code and CCSDS recommended (n, n-16) cyclic redundancy check (CRC) code as the innermost code, where n is the number of information bits plus 16 parity bits. The received signal-to-noise for a desired bit error rate is greatly reduced through the use of forward error correction techniques. Even greater coding gain is provided through the use of a concatenated coding scheme. Interleaving/deinterleaving is necessary to randomize burst errors which may appear at the input of the RS decoder. The burst correction capability length is increased in proportion to the interleave depth. The modular nature of the simulator allows for inclusion or exclusion of modules as needed. This paper describes the development and operation of the simulator, the verification of a C-language Reed-Solomon code, and the possibility of using Comdisco SPW(tm) as a tool for determining optimal error control schemes.

Noble, Viveca K.↗

Fault detection and exclusion in multisensor navigation systems

In order for a multisensor navigation system to meet integrity requirements, there must be a way of detecting erroneous measurements, using only data from those measurements. This can be accomplished using a parity space estimation algorithm. Erroneous measurements must then be removed from the position solution; the entire process is called fault detection and exclusion (FDE). A baseline FDE algorithm has been determined, and is capable of working in real time on present affordable hardware.

Bernath, Gregory N.↗

Radiative and Nonradiative Transitions of the Rare-Earth Ions Tm(3+) and Ho(3+) in Y3AI5O12 and LiYF4

The optical spectra of rare earth ions in solids arise primarily from electric and magnetic dipole transitions between stark split multiplets of the 4f(sup N) electronic configuration. Electric dipole transitions are parity forbidden between levels of the 4f(sup N) configuration, while those of magnetic dipole origin are allowed. It is known from experiment, however, that the significant contributions to the intensities of most transitions are electric dipole in nature. Judd and Ofelt developed the theory of forced electric dipole transitions of rare-earth ions. This study is devoted to determining electric dipole transition probabilities and branching ratios for Tm(3+) and Ho(3+) ions in Yttrium Aluminum Garnet (YAG) and Yttrium Lithium Fluoride (YLF) using the theory of Judd and Ofelt. The radiative rates determined from the Judd-Ofelt analysis are used with measured lifetimes to find nonradiative rates of relaxation.

Walsh, Brian M.↗

Fault tolerance in space-based digital signal processing and switching systems: Protecting up-link processing resources, demultiplexer, demodulator, and decoder

Fault tolerance features in the first three major subsystems appearing in the next generation of communications satellites are described. These satellites will contain extensive but efficient high-speed processing and switching capabilities to support the low signal strengths associated with very small aperture terminals. The terminals' numerous data channels are combined through frequency division multiplexing (FDM) on the up-links and are protected individually by forward error-correcting (FEC) binary convolutional codes. The front-end processing resources, demultiplexer, demodulators, and FEC decoders extract all data channels which are then switched individually, multiplexed, and remodulated before retransmission to earth terminals through narrow beam spot antennas. Algorithm based fault tolerance (ABFT) techniques, which relate real number parity values with data flows and operations, are used to protect the data processing operations. The additional checking features utilize resources that can be substituted for normal processing elements when resource reconfiguration is required to replace a failed unit.

Redinbo, Robert↗

Computational Study of Chaotic and Ordered Solutions of the Kuramoto-Sivashinsky Equation

We report the results of extensive numerical experiments on the Kuramoto-Sivashinsky equation in the strongly chaotic regime as the viscosity parameter is decreased and increasingly more linearly unstable modes enter the dynamics. General initial conditions are used and evolving states do not assume odd-parity. A large number of numerical experiments are employed in order to obtain quantitative characteristics of the dynamics. We report on different routes to chaos and provide numerical evidence and construction of strange attractors with self-similar characteristics. As the 'viscosity' parameter decreases the dynamics becomes increasingly more complicated and chaotic. In particular it is found that regular behavior in the form of steady state or steady state traveling waves is supported amidst the time-dependent and irregular motions. We show that multimodal steady states emerge and are supported on decreasing windows in parameter space. In addition we invoke a self-similarity property of the equation, to show that these profiles are obtainable from global fixed point attractors of the Kuramoto-Sivashinsky equation at much larger values of the viscosity.

Smyrlis, Yiorgos S.↗

Concatenated Coding Using Trellis-Coded Modulation

In the late seventies and early eighties a technique known as Trellis Coded Modulation (TCM) was developed for providing spectrally efficient error correction coding. Instead of adding redundant information in the form of parity bits, redundancy is added at the modulation stage thereby increasing bandwidth efficiency. A digital communications system can be designed to use bandwidth-efficient multilevel/phase modulation such as Amplitude Shift Keying (ASK), Phase Shift Keying (PSK), Differential Phase Shift Keying (DPSK) or Quadrature Amplitude Modulation (QAM). Performance gain can be achieved by increasing the number of signals over the corresponding uncoded system to compensate for the redundancy introduced by the code. A considerable amount of research and development has been devoted toward developing good TCM codes for severely bandlimited applications. More recently, the use of TCM for satellite and deep space communications applications has received increased attention. This report describes the general approach of using a concatenated coding scheme that features TCM and RS coding. Results have indicated that substantial (6-10 dB) performance gains can be achieved with this approach with comparatively little bandwidth expansion. Since all of the bandwidth expansion is due to the RS code we see that TCM based concatenated coding results in roughly 10-50% bandwidth expansion compared to 70-150% expansion for similar concatenated scheme which use convolution code. We stress that combined coding and modulation optimization is important for achieving performance gains while maintaining spectral efficiency.

Thompson, Michael W.↗

On the Role of Resonances in Nonradial Pulsators

Resonances or near resonances are ubiquitous among the excited nonradial pulsation modes of variable stars and they must play an important role in determining their pulsational behavior. Here in a first step at nonlinear asteroseismology, we explore some of the consequences of resonances by means of the amplitude equation formalism. We show how parity and angular momentum constraints can be used to eliminate many of the possible nonlinear resonant couplings between modes (and multiplets of modes), and how the amplitude equations can thus be simplified. Even when we may not be able, nor wish, to make an ab initio computation of the values of the coupling coefficients, it is still possible to obtain constraints on the nature of the excited modes if a resonance between observed frequencies can be identified. Resonances can cause nonlinear frequency locking of modes. This means that the observed frequencies appear in exact resonance even though the linear frequencies are only approximately in resonance. The nonlinear frequency lock, when it occurs, it does so over a range of departures from linear resonance, and it is accompanied by constant pulsation amplitudes. The locked, nonlinear frequencies can differ noticeably from their nonresonant counterparts which are usually used in seismology. This is particularly true for multiplets of modes split by rotation. Beyond the regime of the frequency lock, amplitude and frequency modulations can appear in the pulsations. Far from the resonance condition one recovers the regime of steady pulsations with nonresonant frequencies for which the seismological studies, as they are presently carried out, are justified (provided furthermore, of course, that nonlinear frequency shifts are negligible). Success in identifying a resonance in an observed power spectrum depends on the quality of the data. While keeping this limitation in mind, ew discuss the possible existence of peculiar resonances the pulsations specific variable white dwarfs and delta Scuti stars.

Buchler, J. R.↗

Dark Matter in the Universe and in the Galaxy

During the past four years, Prof. Kamionkowski and collaborators have made progress in research on the nature and distribution of dark-matter in the Universe and in the Galaxy, and on related topics in astrophysics and cosmology. We have made progress on research on the cosmic microwave background, large-scale structure, issues related to particle dark matter, and the gamma-ray-burst enigma. A significant fraction of the research supported by this ATP has been on the cosmic microwave background (CMB). Prof. Kamionkowski and collaborators showed how the polarization of the CMB could be used to detect long-wavelength gravitational waves, such as those produced by inflation. With Kosowsky, Prof. Kamionkowski calculated the amplitude of a stochastic gravitational-wave background that could be detected for a satellite experiment of a given sensitivity and angular resolution. They showed that polarization should improve the sensitivity oa MAP to these gravity waves, and that the Planck Surveyor should do even better. Prof. Kamionkowski, Caldwell, and a student calculated and illustrated the CMB temperature/polarization pattern produced by a single plane-wave gravitational wave. They calculated the amplitude of such a wave that would be detectable with MAP and Planck, and compared that with the sensitivity of traditional gravitational-wave detectors like LIGO and LISA. With Lue and Wang, the PI showed how parity violation from new high-energy physics could conceivably give rise to an observable signature in the CMB polarization. With Loeb, Prof. Kamionkowski showed how measurement of the polarization of CMB photons scattered by hot gas in a cluster could be used to determine the quadrupole moment of the CMB incident on that cluster. Prof. Kamionkowski and Jaffe calculated the amplitude of secondary anisotropies produced by scattering of CMB photons from reionized regions. Research has also been carried out on probing the large-scale distribution of mass in the Universe today, and on structure-formation theories. They investigated the possibility of determining the large-scale distribution of mass in the Universe via measurement of ellipticity-ellipticity correlations in the FIRST radio survey induced by weak gravitational lensing due to mass inhomogeneities along the line of sight. Dr. Summers, Prof. Kamionkowski, and a student investigated the distribution of protogalactic masses and angular momenta in an effort to understand how the luminosity function and angular-momentum distribution of disk galaxies arises from an initial power spectrum of density perturbations. Several projects related to the distribution and possible detection of dark matter in our Galactic halo were studied. The PI was involved in several projects involving the calculation of nuclear-reaction rates needed for stellar evolution and for predictions of solar-neutrino fluxes.

Kamionkowski, Marc↗

Cascade Error Projection with Low Bit Weight Quantization for High Order Correlation Data

In this paper, we reinvestigate the solution for chaotic time series prediction problem using neural network approach. The nature of this problem is such that the data sequences are never repeated, but they are rather in chaotic region. However, these data sequences are correlated between past, present, and future data in high order. We use Cascade Error Projection (CEP) learning algorithm to capture the high order correlation between past and present data to predict a future data using limited weight quantization constraints. This will help to predict a future information that will provide us better estimation in time for intelligent control system. In our earlier work, it has been shown that CEP can sufficiently learn 5-8 bit parity problem with 4- or more bits, and color segmentation problem with 7- or more bits of weight quantization. In this paper, we demonstrate that chaotic time series can be learned and generalized well with as low as 4-bit weight quantization using round-off and truncation techniques. The results show that generalization feature will suffer less as more bit weight quantization is available and error surfaces with the round-off technique are more symmetric around zero than error surfaces with the truncation technique. This study suggests that CEP is an implementable learning technique for hardware consideration.

Duong, Tuan A.↗