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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

A proposed study of multiple scattering through clouds up to 1 THz

A rigorous computation of the electromagnetic field scattered from an atmospheric liquid water cloud is proposed. The recent development of a fast recursive algorithm (Chew algorithm) for computing the fields scattered from numerous scatterers now makes a rigorous computation feasible. A method is presented for adapting this algorithm to a general case where there are an extremely large number of scatterers. It is also proposed to extend a new binary PAM channel coding technique (El-Khamy coding) to multiple levels with non-square pulse shapes. The Chew algorithm can be used to compute the transfer function of a cloud channel. Then the transfer function can be used to design an optimum El-Khamy code. In principle, these concepts can be applied directly to the realistic case of a time-varying cloud (adaptive channel coding and adaptive equalization). A brief review is included of some preliminary work on cloud dispersive effects on digital communication signals and on cloud liquid water spectra and correlations.

Gerace, G. C.↗
NASA NTRS1994

An interactive environment for the analysis of large Earth observation and model data sets

Envision is an interactive environment that provides researchers in the earth sciences convenient ways to manage, browse, and visualize large observed or model data sets. Its main features are support for the netCDF and HDF file formats, an easy to use X/Motif user interface, a client-server configuration, and portability to many UNIX workstations. The Envision package also provides new ways to view and change metadata in a set of data files. It permits a scientist to conveniently and efficiently manage large data sets consisting of many data files. It also provides links to popular visualization tools so that data can be quickly browsed. Envision is a public domain package, freely available to the scientific community. Envision software (binaries and source code) and documentation can be obtained from either of these servers: ftp://vista.atmos.uiuc.edu/pub/envision/ and ftp://csrp.tamu.edu/pub/envision/. Detailed descriptions of Envision capabilities and operations can be found in the User's Guide and Reference Manuals distributed with Envision software.

Bowman, Kenneth P.↗
NASA NTRS1996

An Iterative Soft-Decision Decoding Algorithm

This paper presents a new minimum-weight trellis-based soft-decision iterative decoding algorithm for binary linear block codes. Simulation results for the RM(64,22), EBCH(64,24), RM(64,42) and EBCH(64,45) codes show that the proposed decoding algorithm achieves practically (or near) optimal error performance with significant reduction in decoding computational complexity. The average number of search iterations is also small even for low signal-to-noise ratio.

Lin, Shu↗
NASA NTRS2002

NASA LaRC FIB Multi-Channel Anemometry Recording System-User's Manual

This report is part of a series of reports describing a flow physics high-lift experiment conducted in NASA Langley Research Center's Low-Turbulence Pressure Tunnel (LTPT) in 1996. The anemometry system used in the experiment was originally designed for and used in flight tests with NASA's Boeing 737 airplane. Information that may be useful in the evaluation or use of the experimental data has been compiled. The report also contains details regarding record structure, how to read the embedded time code, as well as the output file formats used in the code reading the binary data.

Johnson, Sherylene↗
DOE OSTI2025

Value of Information App (Value of Information App for Binary Geothermal Decisions and Binary Geothermal Possibilities) (Negative/Positive) [SWR-25-15]

Code base to run Streamlit Value of Information App for binary decision with geothermal techno economics. An open-source VOI app that models binary decisions (e.g. do something (drill) or walk away (do nothing)) and binary geothermal scenarios (positive or negative) has been developed. Users can input their anticipated economic values (profits or losses) directly into the value matrix to represent all four combinations of these actions and geothermal possibilities. VOI in general requires probabilities to be assigned for “probability of success”, or probability of experiencing a positive geothermal scenario versus negative. The users of the App can toggle this probability of success both in the demo problem and in the Value of Imperfect Information problem. The VOI App allows users to upload their own labeled data to evaluate how well it allows them to distinguish between positive versus negative sites. We have been using IGNENIOUS data to test and demonstrate; industry members have prepared their own labeled data, and have present their examples from diverse use cases at a conference workshop. The VOI App is open to the public at: https://voigeothermalrising.streamlit.app

Trainor-Guitton, Whitney [National Renewable Energ↗
NASA NTRS2003

Formation and Evolution of Binary Systems Containing Collapsed Stars

This research includes theoretical studies of the formation and evolution of five types of interacting binary systems. Our main focus has been on developing a number of comprehensive population synthesis codes to study the following types of binary systems: (i) cataclysmic variables (#3, #8, #12, #15), (ii) low- and intermediate-mass X-ray binaries (#13, #20, #21), (iii) high-mass X-ray binaries (#14, #17, #22), (iv) recycled binary millisecond pulsars in globular clusters (#5, #10, #ll), and (v) planetary nebulae which form in interacting binaries (#6, #9). The numbers in parentheses refer to papers published or in preparation that are listed in this paper. These codes take a new unified approach to population synthesis studies. The first step involves a Monte Carlo selection of the primordial binaries, including the constituent masses, and orbital separations and eccentricities. Next, a variety of analytic methods are used to evolve the primary star to the point where either a dynamical episode of mass transfer to the secondary occurs (the common envelope phase), or the system evolves down an alternate path. If the residual core of the primary is greater than 2.5 solar mass, it will evolve to Fe core collapse and the production of a neutron star and a supernova explosion. In the case of systems involving neutron stars, a kick velocity is chosen randomly from an appropriate distribution and added to the orbital dynamics which determine the state of the binary system after the supernova explosion. In the third step, all binaries which commence stable mass transfer from the donor star (the original secondary in the binary system) to the compact object, are followed with a detailed binary evolution code. Finally, we include all the relevant dynamics of the binary system. For example, in the case of LMXBs, the binary system, with its recoil velocity from the supernova explosion, is followed in time through its path in the Galactic potential. For our globular cluster study, detailed three-body calculations are used to follow the interactions of the binary with passing field stars.

Rappaport, Saul↗
NASA NTRS1986

Universal Noiseless Coding Subroutines

Software package consists of FORTRAN subroutines that perform universal noiseless coding and decoding of integer and binary data strings. Purpose of this type of coding to achieve data compression in sense that coded data represents original data perfectly (noiselessly) while taking fewer bits to do so. Routines universal because they apply to virtually any "real-world" data source.

Schlutsmeyer, A. P.↗
NASA NTRS1989

Generalized Multiple-Trellis-Coded Modulation

Generalized multiple-trellis-coded modulation technique combines multiple trellis coding (more than one channel symbol per trellis branch transmitted) with symmetrical M-ary phase-shift keying. Transmitter puts out k M-ary code symbols for every b input binary symbols. Throughout performances, b/k, of trellis-coded multiple-phase-shift-keying channels compared with computational cutoff rates, R0, of multiple-phase-shift keying. Performs better than conventional trellis-coded modulation technique, with no increase in complexity.

Divsalar, D.↗
NASA NTRS1999

Punctured Parallel and Serial Concatenated Convolutional Codes for BPSK/QPSK Channels

As available bandwidth for communication applications becomes scarce, bandwidth-efficient modulation and coding schemes become ever important. Since their discovery in 1993, turbo codes (parallel concatenated convolutional codes) have been the center of the attention in the coding community because of their bit error rate performance near the Shannon limit. Serial concatenated convolutional codes have also been shown to be as powerful as turbo codes. In this dissertation, we introduce algorithms for designing bandwidth-efficient rate r = k/(k + 1),k = 2, 3,..., 16, parallel and rate 3/4, 7/8, and 15/16 serial concatenated convolutional codes via puncturing for BPSK/QPSK (Binary Phase Shift Keying/Quadrature Phase Shift Keying) channels. Both parallel and serial concatenated convolutional codes have initially, steep bit error rate versus signal-to-noise ratio slope (called the -"cliff region"). However, this steep slope changes to a moderate slope with increasing signal-to-noise ratio, where the slope is characterized by the weight spectrum of the code. The region after the cliff region is called the "error rate floor" which dominates the behavior of these codes in moderate to high signal-to-noise ratios. Our goal is to design high rate parallel and serial concatenated convolutional codes while minimizing the error rate floor effect. The design algorithm includes an interleaver enhancement procedure and finds the polynomial sets (only for parallel concatenated convolutional codes) and the puncturing schemes that achieve the lowest bit error rate performance around the floor for the code rates of interest.

Acikel, Omer Fatih↗
NASA NTRS1993

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

The Need for Vendor Source Code at NAS

The Numerical Aerodynamic Simulation (NAS) Facility has a long standing practice of maintaining buildable source code for installed hardware. There are two reasons for this: NAS's designated pathfinding role, and the need to maintain a smoothly running operational capacity given the widely diversified nature of the vendor installations. NAS has a need to maintain support capabilities when vendors are not able; diagnose and remedy hardware or software problems where applicable; and to support ongoing system software development activities whether or not the relevant vendors feel support is justified. This note provides an informal history of these activities at NAS, and brings together the general principles that drive the requirement that systems integrated into the NAS environment run binaries built from source code, onsite.

Carter, Russell↗
NASA NTRS1976

Convolutional code performance in the Rician fading channel

The performance of short constraint length convolutional codes in conjunction with binary phase-shift keyed (BPSK) modulation and Viterbi maximum likelihood decoding on the classical Rician fading channel is examined in detail. Primary interest is in the bit error probability performance as a function of E sub b/N sub 0 parameterized by the fading channel parameters. Fairly general upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results in the two extremes of zero channel memory and infinite channel memory. The efficacy of simple block interleaving in combating the memory of the channel is thoroughly explored. Results include the effects of fading on tracking loop performance and the subsequent impact on overall coded system performance. The approach is analytical where possible; otherwise resort is made to digital computer simulation.

Modestino, J. W.↗
NASA NTRS1971

Systems of coding and their implementation

Engineering planning document surveys mechanics, utility, and potential improvements of codes which control noise-generated errors introduced into radio transmission of binary information. Chronological development of certain codes and a comprehensive bibliography are included.

Anderson, T. O.↗
NASA NTRS2005

Strong-field Gravitational Effects in the Timing and Spectroscopy of X-Ray Binaries

Using the ray-tracing code described, we developed additional features to the hot spot model to explain the broadening of the quasi-periodic oscillation (QPO) peaks as well as the damping of higher frequency harmonics in the power spectrum. We derived a number of analytic results that agree closely with more detailed numerical calculations. Three primary pieces are developed: the superposition of multiple hot spots with finite lifetimes and random phases, a width in the radial distribution of geodesic orbits, and the scattering of photons from the hot spot through a corona around the black hole. The complete model is used to fit the observed power spectra of both type A and type B QPOs seen in XTE 51550-564, giving confidence limits on each of the model parameters. These results were presented in a conference paper and in a refereed publication. We also explored the possibility of using higher-order statistics, particularly the bispectrum and bicoherence, to distinguish between competing QPO models. These methods were applied to the hot spot model and a method was proposed to map out the spacetime metric around Kerr black holes in Ref. 3 below.

Bertschinger, Edmund↗
NASA NTRS1974

Coding/modulation trade-offs for Shuttle wideband data links

This paper describes various modulation and coding schemes which are potentially applicable to the Shuttle wideband data relay communications link. This link will be capable of accommodating up to 50 Mbps of scientific data and will be subject to a power constraint which forces the use of channel coding. Although convolutionally encoded coherent binary PSK is the tentative signal design choice for the wideband data relay link, FM techniques are of interest because of the associated hardware simplicity and because an FM system is already planned to be available for transmission of television via relay satellite to the ground. Binary and M-ary FSK are considered as candidate modulation techniques, and both coherent and noncoherent ground station detection schemes are examined. The potential use of convolutional coding is considered in conjunction with each of the candidate modulation techniques.

Batson, B. H.↗
NASA NTRS1977

Thermodynamic properties of gaseous fluorocarbons and isentropic equilibrium expansions of two binary mixtures of fluorocarbons and argon

Equations and computer code are given for the thermodynamic properties of gaseous fluorocarbons in chemical equilibrium. In addition, isentropic equilibrium expansions of two binary mixtures of fluorocarbons and argon are included. The computer code calculates the equilibrium thermodynamic properties and, in some cases, the transport properties for the following fluorocarbons: CCl2F, CCl2F2, CBrF3, CF4, CHCl2F, CHF3, CCL2F-CCl2F, CCLF2-CClF2, CF3-CF3, and C4F8. Equilibrium thermodynamic properties are tabulated for six of the fluorocarbons(CCl3F, CCL2F2, CBrF3, CF4, CF3-CF3, and C4F8) and pressure-enthalpy diagrams are presented for CBrF3.

Talcott, N. A., Jr.↗
NASA NTRS1992

Presupernova evolution in massive interacting binaries

The way in which binary interaction affects the presupernova evolution of massive close binaries and the resulting supernova explosions is investigated systematically by means of a Henyey-type stellar evolution code that was modified to allow its application to binary stellar evolution calculations. The code makes it possible to trace the effects of mass and angular momentum loss from the binary, as well as mass transfer within the binary system. It is found that a large number of binary scenarios can be distinguished, depending on the type of binary interaction and the evolutionary stage of the supernova progenitor at the time of the interaction. Monte Carlo simulations are performed to estimate the frequencies of the occurrence of various scenarios. It is found that, because of a previous binary interaction, 15-30 percent of all massive stars (with initial masses greater than about 8 solar masses) become helium stars, and another 5 percent of all massive stars end their lives as blue supergiants rather than as red supergiants.

Podsiadlowski, PH.↗