Search NASA⌕ Search

SEARCH · Search NASA

Results for “code patterns”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2006

Instruments for Reading Direct-Marked Data-Matrix Symbols

Improved optoelectronic instruments (specially configured digital cameras) for reading direct-marked data-matrix symbols on the surfaces of optically reflective objects (including specularly reflective ones) are undergoing development. Data-matrix symbols are two-dimensional binary patterns that are used, like common bar codes, for automated identification of objects. The first data-matrix symbols were checkerboard-like patterns of black-and-white rectangles, typically existing in the forms of paint, ink, or detachable labels. The major advantage of direct marking (the marks are more durable than are painted or printed symbols or detachable labels) is offset by a major disadvantage (the marks generated by some marking methods do not provide sufficient contrast to be readable by optoelectronic instruments designed to read black-and-white data-matrix symbols). Heretofore, elaborate lighting, lensing, and software schemes have been tried in efforts to solve the contrast problem in direct-mark matrix- symbol readers. In comparison with prior readers based on those schemes, the readers now undergoing development are expected to be more effective while costing less. All of the prior direct-mark matrix-symbol readers are designed to be aimed perpendicularly to marked target surfaces, and they tolerate very little angular offset. However, the reader now undergoing development not only tolerates angular offset but depends on angular offset as a means of obtaining the needed contrast, as described below. The prototype reader (see Figure 1) includes an electronic camera in the form of a charge-coupled-device (CCD) image detector equipped with a telecentric lens. It also includes a source of collimated visible light and a source of collimated infrared light for illuminating a target. The visible and infrared illumination complement each other: the visible illumination is more useful for aiming the reader toward a target, while the infrared illumination is more useful for reading symbols on highly reflective surfaces. By use of beam splitters, the visible and infrared collimated lights are introduced along the optical path of the telecentric lens, so that the target is illuminated and viewed from the same direction.

Schramm, Harry F.↗
NASA NTRS1989

Antenna pattern study, task 2

Two electromagnetic scattering codes, NEC-BSC and ESP3, were delivered and installed on a NASA VAX computer for use by Marshall Space Flight Center antenna design personnel. The existing codes and certain supplementary software were updated, the codes installed on a computer that will be delivered to the customer, to provide capability for graphic display of the data to be computed by the use of the codes and to assist the customer in the solution of specific problems that demonstrate the use of the codes. With the exception of one code revision, all of these tasks were performed.

Harper, Warren↗
DOE OSTI2025

Serpentine Magnet Designs for the Interaction Region of the Electron-Ion Collider (EIC)

The Electron-Ion Collider (EIC), hosted by Brookhaven National Laboratory, is designed to deliver a peak luminosity of 1 × 10 34 cm −2 sec −1 . The interaction region (IR) of the EIC imposes several constraints in terms of field quality, aperture, and spatial layout, which necessitates the development of several unique superconducting serpentine direct wind magnets. These magnets are constructed using either a single strand or a small-diameter 6-around-1 NbTi cable, presenting unique challenges for design and optimization. This paper introduces a new computational code specifically developed to streamline and integrate the design process for these magnets, enabling faster design iterations while addressing their complex requirements. Here, in this paper, we first introduce the code, which builds on established electromagnetic fundamentals. The code incorporates tools for optimizing winding patterns and for correcting magnetic multipoles; additionally, it interfaces with established magnet design software. We also present the design of several serpentine magnets for the EIC IR, demonstrating the code’s capability to deliver precise and efficient solutions. These designs highlight the code’s ability to accelerate the development cycle, ensuring the serpentine magnets meet the demanding specifications of the EIC project.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1989

Mesh-matrix analysis method for electromagnetic launchers

The mesh-matrix method is a procedure for calculating the current distribution in the conductors of electromagnetic launchers with coil or flat-plate geometry. Once the current distribution is known the launcher performance can be calculated. The method divides the conductors into parallel current paths, or meshes, and finds the current in each mesh by matrix inversion. The author presents procedures for writing equations for the current and voltage relations for a few meshes to serve as a pattern for writing the computer code. An available subroutine package provides routines for field and flux coefficients and equation solution.

Elliott, David G.↗
NASA NTRS1989

On the decoder error probability of linear codes

By using coding and combinatorial techniques, an approximate formula for the weight distribution of decodable words of most linear block codes is evaluated. This formula is then used to give an approximate expression for the decoder error probability P(sub E)(u) of linear block codes, given that an error pattern of weight u has occurred. It is shown that P(sub E)(u) approaches the constant Q as u gets large, where Q is the probability that a completely random error pattern will cause decoder error.

Cheung, K.-M.↗
NASA NTRS1990

A numerical simulation of the flow in the diffuser of the NASA Lewis icing research tunnel

The flow in the diffuser section of the Icing Research Tunnel at the NASA Lewis Research Center is numerically investigated. To accomplish this, an existing computer code is utilized. The code, known as PARC3D, is based on the Beam-Warming algorithm applied to the strong conservation law form of the complete Navier-Stokes equations. The first portion of the paper consists of a brief description of the diffuser and its current flow characteristics. A brief discussion of the code work follows. Predicted velocity patterns are then compared with the measured values.

Addy, Harold E., Jr.↗
NASA NTRS1990

A numerical simulation of the flow in the diffuser of the NASA Lewis Icing Research Tunnel

The flow in the diffuser section of the Icing Research Tunnel at the NASA Lewis Research Center is numerically investigated. To accomplish this, an existing computer code is utilized. The code, known as PARC3D, is based on the Beam-Warming algorithm applied to the strong conservation law form of the complete Navier-Stokes equations. The first portion of the paper consists of a brief description of the diffuser and its current flow characteristics. A brief discussion of the code work follows. Predicted velocity patterns are then compared with the measured values.

Addy, Harold E., Jr.↗
NASA NTRS1991

Monte Carlo simulation of ion-neutral charge exchange collisions and grid erosion in an ion thruster

A combined particle-in-cell (PIC)/Monte Carlo simulation model has been developed in which the PIC method is used to simulate the charge exchange collisions. It is noted that a number of features were reproduced correctly by this code, but that its assumption of two-dimensional axisymmetry for a single set of grid apertures precluded the reproduction of the most characteristic feature of actual test data; namely, the concentrated grid erosion at the geometric center of the hexagonal aperture array. The first results of a three-dimensional code, which takes into account the hexagonal symmetry of the grid, are presented. It is shown that, with this code, the experimentally observed erosion patterns are reproduced correctly, demonstrating explicitly the concentration of sputtering between apertures.

Peng, Xiaohang↗
NASA NTRS2022

Resolving the fine structure in the energy landscapes of repeat proteins

Ankyrin (ANK) repeat proteins are coded by tandem occurrences of patterns with around 33 amino acids. They often mediate protein–protein interactions in a diversity of biological systems. These proteins have an elongated non-globular shape and often display complex folding mechanisms. This work investigates the energy landscape of representative proteins of this class made up of 3, 4 and 6 ANK repeats using the energy-landscape visualisation method (ELViM). By combining biased and unbiased coarse-grained molecular dynamics AWSEM simulations that sample conformations along the folding trajectories with the ELViM structure-based phase space, one finds a three-dimensional representation of the globally funnelled energy surface. In this representation, it is possible to delineate distinct folding pathways. We show that ELViMs can project, in a natural way, the intricacies of the highly dimensional energy landscapes encoded by the highly symmetric ankyrin repeat proteins into useful low-dimensional representations. These projections can discriminate between multiplicities of specific parallel folding mechanisms that otherwise can be hidden in oversimplified depictions.

Murilo N. Sanches↗
NASA NTRS1995

Method for coding low entrophy data

A method of lossless data compression for efficient coding of an electronic signal of information sources of very low information rate is disclosed. In this method, S represents a non-negative source symbol set, (s(sub 0), s(sub 1), s(sub 2), ..., s(sub N-1)) of N symbols with s(sub i) = i. The difference between binary digital data is mapped into symbol set S. Consecutive symbols in symbol set S are then paired into a new symbol set Gamma which defines a non-negative symbol set containing the symbols (gamma(sub m)) obtained as the extension of the original symbol set S. These pairs are then mapped into a comma code which is defined as a coding scheme in which every codeword is terminated with the same comma pattern, such as a 1. This allows a direct coding and decoding of the n-bit positive integer digital data differences without the use of codebooks.

Yeh, Pen-Shu↗
DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗
DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗
DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗
NASA NTRS1992

Antenna pattern control using impedance surfaces

The modification of a moment method code is described. Analyses of horn antennas were conducted extensively. Excellent agreements with measured results were observed for pyramidal horn antennas with perfectly conducting surfaces. The predicted results are so accurate that even the finest ripple structures in the far-field radiation patterns are computed correctly. Preliminary results for the radiation patterns of pyramidal horns with impedance surfaces were also obtained. Discussions of using the code in accurate modeling of practical pyramidal horn antennas are also included. After the code for the analysis of the horn antennas with impedance materials is finalized, the synthesis problem will be examined in the coming research period.

Balanis, Constantine A.↗
NASA NTRS1991

Antenna pattern control using impedance surfaces

The implementation of a moment method code for the analysis of horn antennas was accomplished. The code can analyze the antenna with or without lossy material coatings. It predicts the antenna gain, voltage standing wave ratio (VSWR) on the feeding waveguide, the existing modes on the radiating aperture, and radiation patterns of the antenna. Many computations were performed on three pyramidal horn antennas, and their radiation and VSWR's are presented and compared with experimental data. Although the code is still being finalized, some discussions on using the code are included.

Balanis, Constantine A.↗
DOE OSTI2026

High-speed quantitative X-ray multi-contrast imaging with deep learning based modulated pattern analysis

The advent of X-ray multi-contrast imaging methods, providing absorption, phase, and dark-field images, holds tremendous promise for complementary and non-destructive visualization of inner structures within materials and bio-samples. However, the low efficiency in measuring and analyzing X-ray modulated patterns has hindered their application in high-resolution in situ imaging. In this work, the Enhanced Scanning Pattern-based Imaging Neural Network (ESPINNet) is introduced as a powerful tool for achieving high-speed, high-resolution quantitative imaging. ESPINNet is faster than correlation-based speckle tracking methods such as XSVT and UMPA, and provides a balanced performance in terms of resolution and speed for data collection by using fewer scanning images. In comparison with our previously developed neural network, ESPINNet introduces the capability to generate dark-field images, further enhancing its versatility. By leveraging scanning patterns, ESPINNet significantly improves resolution and measurement precision. Furthermore, its adaptability to various modulation patterns, including those produced by sandpaper, coded masks, or gratings, ensures broad applicability. These features enable real-time 2D and 3D multi-contrast imaging, positioning ESPINNet as a transformative solution for applications in materials science and biomedical research, particularly for high-speed and in situ measurements.

X-ray at-wavelength metrology↗
NASA NTRS1975

A boundary finding algorithm and its applications

An algorithm for locating gray level and/or texture edges in digitized pictures is presented. The algorithm is based on the concept of hypothesis testing. The digitized picture is first subdivided into subsets of picture elements, e.g., 2 x 2 arrays. The algorithm then compares the first- and second-order statistics of adjacent subsets; adjacent subsets having similar first- and/or second-order statistics are merged into blobs. By continuing this process, the entire picture is segmented into blobs such that the picture elements within each blob have similar characteristics. The boundaries between the blobs comprise the boundaries. The algorithm always generates closed boundaries. The algorithm was developed for multispectral imagery of the earth's surface. Application of this algorithm to various image processing techniques such as efficient coding, information extraction (terrain classification), and pattern recognition (feature selection) are included.

Gupta, J. N.↗