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 199 records · Page 11

A novel scheme to aid coherent detection of GMSK signals in fast Rayleigh fading channels

A novel scheme to insert carrier pilot to Gaussian Minimum Shift Keying (GMSK) signal using Binary Block Code (BBC) and a highpass filter in baseband is proposed. This allows the signal to be coherently demodulated even in a fast Rayleigh fading environment. As an illustrative example, the scheme is applied to a 16 kb/s GMSK signal, and its performance over a fast Rayleigh fading channel is investigated using computer simulation. This modem's 'irreducible error rate' is found to be Pe = 5.5 x 10(exp -5) which is more than that of differential detection. The modem's performance in Rician fading channel is currently under investigation.

Leung, Patrick S. K.↗

Modifications of the Griesmer bound

The Griesmer bound is a classical technique (developed in 1960) for estimating the minimum length n required for a binary linear code with a given dimension k and minimum distance d. In this article, a unified derivation of the Griesmer bound and two new variations on it are presented. The first variation deals with linear codes which contain the all-ones vector; such codes are quite common and are useful in practice because of their 'transparent' properties. The second variation deals with codes that are constrained to contain a word of weight greater than or equal to M. In both cases these constraints (the all-ones word or a word of high weight) can increase the minimum length of a code with given k and d.

Mceliece, R. J.↗

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↗

A Digital Solar Aspect Sensor

The solar aspect sensor described herein performs the analog-to-digital conversion of data optically. To accomplish this, it uses a binary "Gray code" light mask to produce a digital indication, in vehicle-fixed coordinates, of the elevation and azimuth angles of incident light from the sun. This digital solar aspect sensor system, in Explorer X, provided measurements of both elevation and azimuth angles to +/- 2 degrees at a distance of over 140,000 statute miles.

Albus, James S.↗

Digital to synchro converter

A digital-to-synchro converter is provided where a binary input code specifies a desired shaft angle and where an resolver type position transducer is employed with additional circuitry to generate a shaft position error signal indicative of the angular difference between the desired shaft angle and the actual shaft angle. The additional circuitry corrects for known and calculated errors in the shaft position detection process and equipment.

Predina, Joseph P.↗

Protograph LDPC Codes for the Erasure Channel

This viewgraph presentation reviews the use of protograph Low Density Parity Check (LDPC) codes for erasure channels. A protograph is a Tanner graph with a relatively small number of nodes. A "copy-and-permute" operation can be applied to the protograph to obtain larger derived graphs of various sizes. For very high code rates and short block sizes, a low asymptotic threshold criterion is not the best approach to designing LDPC codes. Simple protographs with much regularity and low maximum node degrees appear to be the best choices Quantized-rateless protograph LDPC codes can be built by careful design of the protograph such that multiple puncturing patterns will still permit message passing decoding to proceed

long erasure codes↗

Cross-Compiler for Modeling Space-Flight Systems

Ripples is a computer program that makes it possible to specify arbitrarily complex space-flight systems in an easy-to-learn, high-level programming language and to have the specification automatically translated into LibSim, which is a text-based computing language in which such simulations are implemented. LibSim is a very powerful simulation language, but learning it takes considerable time, and it requires that models of systems and their components be described at a very low level of abstraction. To construct a model in LibSim, it is necessary to go through a time-consuming process that includes modeling each subsystem, including defining its fault-injection states, input and output conditions, and the topology of its connections to other subsystems. Ripples makes it possible to describe the same models at a much higher level of abstraction, thereby enabling the user to build models faster and with fewer errors. Ripples can be executed in a variety of computers and operating systems, and can be supplied in either source code or binary form. It must be run in conjunction with a Lisp compiler.

James, Mark↗

Medium-Frequency Pseudonoise Georadar

Ground-probing radar systems featuring medium-frequency carrier signals phase-modulated by binary pseudonoise codes have been proposed. These systems would be used to locate and detect movements of subterranean surfaces; the primary intended application is in warning of the movement of underground water toward oil-well intake ports in time to shut down those ports to avoid pumping of water. Other potential applications include oil-well logging and monitoring of underground reservoirs. A typical prior georadar system operates at a carrier frequency of at least 50 MHz in order to provide useable range resolution. This frequency is too high for adequate penetration of many underground layers of interest. On the other hand, if the carrier frequency were to be reduced greatly to increase penetration, then bandwidth and thus range resolution would also have to be reduced, thereby rendering the system less useful. The proposed medium-frequency pseudonoise georadar systems would offer the advantage of greater penetration at lower carrier frequencies, but without the loss of resolution that would be incurred by operating typical prior georadar systems at lower frequencies.

Arendt, G. Dickey↗

Goldstone Solar System Radar Waveform Generator

Due to distances and relative motions among the transmitter, target object, and receiver, the time-base between any transmitted and received signal will undergo distortion. Pre-distortion of the transmitted signal to compensate for this time-base distortion allows reception of an undistorted signal. In most radar applications, an arbitrary waveform generator (AWG) would be used to store the pre-calculated waveform and then play back this waveform during transmission. The Goldstone Solar System Radar (GSSR), however, has transmission durations that exceed the available memory storage of such a device. A waveform generator capable of real-time pre-distortion of a radar waveform to a given time-base distortion function is needed. To pre-distort the transmitted signal, both the baseband radar waveform and the RF carrier must be modified. In the GSSR, this occurs at the up-conversion mixing stage to an intermediate frequency (IF). A programmable oscillator (PO) is used to generate the IF along with a time-varying phase component that matches the time-base distortion of the RF carrier. This serves as the IF input to the waveform generator where it is mixed with a baseband radar waveform whose time-base has been distorted to match the given time-base distortion function producing the modulated IF output. An error control feedback loop is used to precisely control the time-base distortion of the baseband waveform, allowing its real-time generation. The waveform generator produces IF modulated radar waveforms whose time-base has been pre-distorted to match a given arbitrary function. The following waveforms are supported: continuous wave (CW), frequency hopped (FH), binary phase code (BPC), and linear frequency modulation (LFM). The waveform generator takes as input an IF with a time varying phase component that matches the time-base distortion of the carrier. The waveform generator supports interconnection with deep-space network (DSN) timing and frequency standards, and is controlled through a 1 Gb/s Ethernet UDP/IP interface. This real-time generation of a timebase distorted radar waveform for continuous transmission in a planetary radar is a unique capability.

Quirk, Kevin J.↗

Quasi-complementary codes - A new technique for MST radar sounding

The binary phase complementary code set has been used in stratospheric radar sounding. The quasi-complementary code technique presented here has nearly complementary properties and offers significant reduction of side lobes caused by imperfections in the radar transmitter. The new technique and its application are described; a simulation of the performance of the two techniques when certain imperfections are present in the transmitter is presented. The results are compared with the actual performance of the Arecibo 430-MHz radar transmitter.

Sulzer, M. P.↗

Compact, Flexible Telemetry-Coding Circuits

Circuits encoding binary telemetry data designed to synthesize any number of selectable codes. Designed for use aboard spacecraft, with features also making them attractive for terrestrial applications: Simple and compact relative to prior coding circuits, built with commercial integrated circuits, and incorporate protective redundancy. Output distortions minimized, and spurious attenuated and/or abbreviated output pulses eliminated.

Katz, Richard B.↗

Using the COSMIC Population Synthesis Code to Investigate How Metallicity Affects the Rates of Interacting Binaries

We use COSMIC, a galaxy population synthesis code, to investigate how metallicity affects the rate of formation of massive stars with a closely orbiting compact object companion. Metallicity—a crucial component to stellar evolution and binary system formation—can affect how and when these systems form. We present the formation time of these systems at different metallicities, and the anti-correlation the rates have with metallicity. In particular, these systems occur about 10 times more frequently at metallicities between Z = 2 × 10 −4 and 2 × 10 −3 , compared to those between Z = 2 × 10 −3 and 2 × 10 −2 . This work serves as a prerequisite to predicting global rates of these systems as a function of redshift, ultimately giving crucial insight into our understanding of the progenitors of long gamma-ray bursts and their evolution over cosmic time.

79 ASTRONOMY AND ASTROPHYSICS↗

On the structure of rate 1/n convolutional codes.

It is shown what choice there is in assigning output digits to transitions of binary rate 1/n code trellis so that the latter will correspond to a convolutional code. A new upper bound on free distance of rate 1/n convolutional codes is also derived, and the results obtained are used to determine the length of the largest input sequence that can conceivably result in an output whose weight is equal to the free distance of a code of rate 1/2.

Bahl, L.↗

Golay and other box codes

The (24,12;8) extended Golay Code can be generated as a 6 x 4 binary matrix from the (15,11;3) BCH-Hamming Code, represented as a 5 x 3 matrix, by adding a row and a column, both of odd or even parity. The odd-parity case provides the additional 12th dimension. Furthermore, any three columns and five rows of the 6 x 4 Golay form a BCH-Hamming (15,11;3) Code. Similarly a (80,58;8) code can be generated as a 10 x 8 binary matrix from the (63,57;3) BCH-Hamming Code represented as a 9 x 7 matrix by adding a row and a column both of odd and even parity. Furthermore, any seven columns along with the top nine rows is a BCH-Hamming (53,57;3) Code. A (80,40;16) 10 x 8 matrix binary code with weight structure identical to the extended (80,40;16) Quadratic Residue Code is generated from a (63,39;7) binary cyclic code represented as a 9 x 7 matrix, by adding a row and a column, both of odd or even parity.

Solomon, G.↗

serial-log-replayer

The code records or logs serial input along with a timestamp to a binary file. The code can then read this log file and replay the serial data with the same relative timings.

Sikkema, Isaac [Oak Ridge National Laboratory (ORN↗

Performance analysis of a cascaded coding scheme with interleaved outer code

A cascaded coding scheme for a random error channel with a bit-error rate is analyzed. In this scheme, the inner code C sub 1 is an (n sub 1, m sub 1l) binary linear block code which is designed for simultaneous error correction and detection. The outer code C sub 2 is a linear block code with symbols from the Galois field GF (2 sup l) which is designed for correcting both symbol errors and erasures, and is interleaved with a degree m sub 1. A procedure for computing the probability of a correct decoding is presented and an upper bound on the probability of a decoding error is derived. The bound provides much better results than the previous bound for a cascaded coding scheme with an interleaved outer code. Example schemes with inner codes ranging from high rates to very low rates are evaluated. Several schemes provide extremely high reliability even for very high bit-error rates say 10 to the -1 to 10 to the -2 power.

Lin, S.↗

Protograph LDPC Codes Over Burst Erasure Channels

In this paper we design high rate protograph based LDPC codes suitable for binary erasure channels. To simplify the encoder and decoder implementation for high data rate transmission, the structure of codes are based on protographs and circulants. These LDPC codes can improve data link and network layer protocols in support of communication networks. Two classes of codes were designed. One class is designed for large block sizes with an iterative decoding threshold that approaches capacity of binary erasure channels. The other class is designed for short block sizes based on maximizing minimum stopping set size. For high code rates and short blocks the second class outperforms the first class.

protgraph based codes↗