Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Q CODES”

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 37 records · Page 2

The Interplay of Surface Mount Solder Joint Quality and Reliability of Low Volume SMAs

Spacecraft electronics including those used at the Jet Propulsion Laboratory (JPL), demand production of highly reliable assemblies. JPL has recently completed an extensive study, funded by NASA's code Q, of the interplay between manufacturing defects and reliability of ball grid array (BGA) and surface mount electronic components.

Spacecraft electronics electronic assemblies J-lea↗

CBGA/PBGA Package Planarity and Assembly Reliability

Jet Propulsion Laboratory (JPL) is currently assessing the use of Ball Grid Arrays (BGAs) for National Aeronautics and Space Administration (NASA) spaceflight applications. This work is being funded through NASA Headquarters, Code Q. The objectives are to demonstrate the robustness, quality and reliability of BGAs technology, and to assist in the development of the repidly growing infastructure for this technology.

BGAs ball grid arrays test vehicles plastic and ce↗

Using software security analysis to verify the secure socket layer (SSL) protocol

nal Aeronautics and Space Administration (NASA) have tens of thousands of networked computer systems and applications. Software Security vulnerabilities present risks such as lost or corrupted data, information the3, and unavailability of critical systems. These risks represent potentially enormous costs to NASA. The NASA Code Q research initiative 'Reducing Software Security Risk (RSSR) Trough an Integrated Approach '' offers, among its capabilities, formal verification of software security properties, through the use of model based verification (MBV) to address software security risks. [1,2,3,4,5,6] MBV is a formal approach to software assurance that combines analysis of software, via abstract models, with technology, such as model checkers, that provide automation of the mechanical portions of the analysis process. This paper will discuss: The need for formal analysis to assure software systems with respect to software and why testing alone cannot provide it. The means by which MBV with a Flexible Modeling Framework (FMF) accomplishes the necessary analysis task. An example of FMF style MBV in the verification of properties over the Secure Socket Layer (SSL) communication protocol as a demonstration.

software↗

Reducing software security risk through an integrated approach research initiative model based verification of the Secure Socket Layer (SSL) Protocol

This document discusses the verification of the Secure Socket Layer (SSL) communication protocol as a demonstration of the Model Based Verification (MBV) portion of the verification instrument set being developed under the Reducing Software Security Risk (RSSR) Trough an Integrated Approach research initiative. Code Q of the National Aeronautics and Space Administration (NASA) funds this project. The NASA Goddard Independent Verification and Validation (IV&V) facility manages this research program at the NASA agency level and the Assurance Technology Program Office (ATPO) manages the research locally at the Jet Propulsion Laboratory (California institute of Technology) where the research is being carried out.

software security↗

Model based verification of the Secure Socket Layer (SSL) Protocol for NASA systems

The National Aeronautics and Space Administration (NASA) has tens of thousands of networked computer systems and applications. Software Security vulnerabilities present risks such as lost or corrupted data, information theft, and unavailability of critical systems. These risks represent potentially enormous costs to NASA. The NASA Code Q research initiative 'Reducing Software Security Risk (RSSR) Trough an Integrated Approach' offers formal verification of information technology (IT), through the creation of a Software Security Assessment Instrument (SSAI), to address software security risks.

software security↗

Decoding and optimized implementation of SECDED codes over GF(q)

A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.

97 MATHEMATICS AND COMPUTING↗

Design, decoding and optimized implementation of SECDED codes over GF(q)

A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.

97 MATHEMATICS AND COMPUTING↗

Decoding and optimized implementation of SECDED codes over GF(q)

A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.

97 MATHEMATICS AND COMPUTING↗

Burst decoding of binary block codes on Q-ary output channels.

The burst-b distance between two binary vectors is defined and shown to be a metric. This definition is applied to a binary-input, Q-ary output channel where errors occur in bursts. A decoding algorithm is presented for such a channel that is an extension of Weldon's (1971) weighted erasure decoding. Examples are presented illustrating the techniques.

Wainberg, S.↗

On the design of turbo codes

In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The design criterion for random interleavers is based on maximizing the effective free distance of the turbo code, i.e., the minimum output weight of codewords due to weight-2 input sequences. An upper bound on the effective free distance of a turbo code is derived. This upper bound can be achieved if the feedback connection of convolutional codes uses primitive polynomials. We review multiple turbo codes (parallel concatenation of q convolutional codes), which increase the so-called 'interleaving gain' as q and the interleaver size increase, and a suitable decoder structure derived from an approximation to the maximum a posteriori probability decision rule. We develop new rate 1/3, 2/3, 3/4, and 4/5 constituent codes to be used in the turbo encoder structure. These codes, for from 2 to 32 states, are designed by using primitive polynomials. The resulting turbo codes have rates b/n (b = 1, 2, 3, 4 and n = 2, 3, 4, 5, 6), and include random interleavers for better asymptotic performance. These codes are suitable for deep-space communications with low throughput and for near-Earth communications where high throughput is desirable. The performance of these codes is within 1 dB of the Shannon limit at a bit-error rate of 10(exp -6) for throughputs from 1/15 up to 4 bits/s/Hz.

Divsalar, D.↗

Uniform codes.

Existence of q-ary uniform convolutional codes where q is any prime-power, noting error- correcting ability comparable to familiar maximal- length block codes

ENCODING↗

Performance Assessment of LunaNet’s Augmented Forward Signal

LunaNet provides a common set of interoperable specifications for communication and position, navigation and time (PNT) services and interfaces soon to be implemented in lunar vicinity. The LunaNet Interoperability Specification (LNIS) provides the design for the GNSS-like Augmented Forward Signal (AFS), which enables orbiting and surface users in lunar space, such as Artemis, to estimate their position, velocity, and time. The specification of AFS defines two orthogonal signal components on a single carrier: the in-phase component (AFS-I), a lower-chip-rate data channel tailored for applications where low SWaP (Size, Weight, and Power) is critical (e.g., IoT devices or search and rescue), and the quadrature component (AFS-Q), a high-chip-rate data-less pilot signal for high-precision, robust lunar navigation and positioning applications. An initial description of AFS was provided in [1], with initial analysis results shown in [2] and [3] and the current signal in space description provided in [4]. As part of NASA's Lunar Communication Relay and Navigation Systems (LCRNS) project, this work expands upon the initial analysis results and proposes a new expanded set of AFS-Q spreading codes that exceed the cross-correlation and autocorrelation sidelobe performance of L1C and other GNSS signals, while providing additional expansion capabilities for future provider satellites. A set of 420 codes was selected from a Weil-based code derived from the prime number 10247, which is larger than the 10243 prime number used to derive Beidou’s B1C Weil sequences. Both the initial set of 210 codes and the expanded set of 420 codes are shown to provide the best cross-correlation of any 10230-chip satellite navigation codes. The performance is demonstrated for hierarchical sets of spreading codes optimized and organized in sets of 30 codes. The new codes were developed using an optimization approach and correlation methodology described in [5]. The work also compares LunaNet’s AFS to terrestrial GNSS signals in terms of acquisition, tracking, and data demodulation performance. Performance is evaluated for receivers that only track the 1.023 MCPS data channel spreading code for low SWaP IoT use cases, as well as for receivers that track both the 1.023 MCPS data channel and the 5.115 MCPS pilot channel spreading code for high-performance use cases. Performance is assessed in the presence of interference and thermal noise. The analysis is performed in terms of expected operating conditions on the lunar surface. Several unique flexibility aspects of the augmented forward signal are described, including the use of the Q channel’s secondary and tertiary codes to enable variable coherent integrations during acquisition. This is compared to GNSS signals such as L5/E5 and MBOC in terms of achievable processing gain for interference mitigation versus acquisition complexity. The work details acquisition and tracking techniques used to optimally acquire and track the primary, secondary, and tertiary codes on the Q channel, as well as acquisition of the I channel spreading code. Acquisition of the 8 ms Q channel spreading code is also compared to joint acquisition of the I and Q channel primary codes in noise and interference environments.

LCRNS↗

Performance Assessment of LunaNet’s Augmented Forward Signal

LunaNet provides a common set of interoperable specifications for communication and position, navigation and time (PNT) services and interfaces soon to be implemented in lunar vicinity. The LunaNet Interoperability Specification (LNIS) provides the design for the GNSS-like Augmented Forward Signal (AFS), which enables orbiting and surface users in lunar space, such as Artemis, to estimate their position, velocity, and time. The specification of AFS defines two orthogonal signal components on a single carrier: the in-phase component (AFS-I), a lower-chip-rate data channel tailored for applications where low SWaP (Size, Weight, and Power) is critical (e.g., IoT devices or search and rescue), and the quadrature component (AFS-Q), a high-chip-rate data-less pilot signal for high-precision, robust lunar navigation and positioning applications. An initial description of AFS was provided in LNIS 2023, with initial analysis results shown in Dafesh 2024 and Dafesh 2025, and the current signal in space description provided in LNIS 2025. As part of NASA's Lunar Communication Relay and Navigation Systems (LCRNS) project, this work expands upon the initial analysis results and proposes a new expanded set of AFS-Q spreading codes that exceed the cross-correlation and autocorrelation sidelobe performance of L1C and other GNSS signals, while providing additional expansion capabilities for future service satellites. A set of 420 codes was selected from a Weil-based code derived from the prime number 10247, which is larger than the 10243 prime number used to derive BeiDou’s B1C Weil sequences. Both the initial set of 210 codes and the expanded set of 420 codes are shown to provide the best cross-correlation of any 10230-chip satellite navigation codes. The performance is demonstrated for hierarchical sets of spreading codes optimized and organized in sets of 30 codes. The work also compares LunaNet’s AFS to terrestrial GNSS signals in terms of acquisition, tracking, and data demodulation performance. Performance is evaluated for receivers that only track the 1.023 MCPS data channel spreading code for low SWaP IoT use cases, as well as for receivers that track both the 1.023 MCPS data channel and the 5.115 MCPS pilot channel spreading code for high-performance use cases. Performance is assessed in the presence of interference and thermal noise. The analysis is performed in terms of expected operating conditions on the lunar surface. Several unique flexibility aspects of the augmented forward signal are described, including the use of the Q channel’s secondary and tertiary codes to enable variable coherent integrations during acquisition. This is compared to GNSS signals such as L5/E5 and MBOC in terms of achievable processing gain for interference mitigation versus acquisition complexity. The work details acquisition and tracking techniques used to optimally acquire and track the primary, secondary, and tertiary codes on the Q channel, as well as acquisition of the I channel spreading code. Acquisition of the 8 ms, Q channel spreading code is also compared to joint acquisition of the I and Q channel primary codes in noise and interference environments

LCRNS↗

Performance of convolutionally coded unbalanced QPSK systems

An evaluation is presented of the performance of three representative convolutionally coded unbalanced quadri-phase-shift-keying (UQPSK) systems in the presence of noisy carrier reference and crosstalk. The use of a coded UQPSK system for transmitting two telemetry data streams with different rates and different powers has been proposed for the Venus Orbiting Imaging Radar mission. Analytical expressions for bit error rates in the presence of a noisy carrier phase reference are derived for three representative cases: (1) I and Q channels are coded independently; (2) I channel is coded, Q channel is uncoded; and (3) I and Q channels are coded by a common 1/2 code. For rate 1/2 convolutional codes, QPSK modulation can be used to reduce the bandwidth requirement.

Divsalar, D.↗

Algebraic decoding of block codes over a q-ary input, Q-ary output channel, Q greater than q.

Decoding algorithms designed for one output alphabet are shown to be effectively usable for channels with a different output alphabet. The described technique that makes this possible can be used in conjunction with an arbitrary distance measure between input and output vectors. Thus, Hamming distance, Lee distance, or a burst distance can be assumed. Examples are presented for each of these distances.

Wainberg, S.↗

Computational Chemistry at the Petascale: Are We There Yet?

The field of electronic structure is struggling to get efficient parallel implementation on Petascaleclass hardware. One notable exception has been the achievement of Qbox, a planewavepseudopotential electronic structure code that obtained a performance of 207 TFlops on aBlueGene/L computer.Qbox makes use of the message-passing MPI library for parallelization. Instead, NWChemmakes use of the Global Arrays library; this allows the software developer to reach a high levelof abstraction and, at the same time, to use one-sided communication to efficiently exploitthe network hardware. In the remainder of the paper, we will discuss recent benchmarksand scientic results obtained with NWChem on a parallel computer whose theoretical peakperformance is in excess of 1 PFlops.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Calculation Method of Lateral Strengths and Ductility Factors of Constructions with Shear Walls of Different Ductility

For seismic design, ductility-related force modification factors are named R factor in Uniform Building Code of U.S, q factor in Euro Code 8 and Ds (inverse of R) factor in Japanese Building Code. These ductility-related force modification factors for each type of shear elements are appeared in those codes. Some constructions use various types of shear walls that have different ductility, especially for their retrofit or re-strengthening. In these cases, engineers puzzle the decision of force modification factors of the constructions. Solving this problem, new method to calculate lateral strengths of stories for simple shear wall systems is proposed and named 'Stiffness--Potential Energy Addition Method' in this paper. This method uses two design lateral strengths for each type of shear walls in damage limit state and safety limit state. Two lateral strengths of stories in both limit states are calculated from these two design lateral strengths for each type of shear walls in both limit states. Calculated strengths have the same quality as values obtained by strength addition method using many steps of load-deformation data of shear walls. The new method to calculate ductility factors is also proposed in this paper. This method is based on the new method to calculate lateral strengths of stories. This method can solve the problem to obtain ductility factors of stories with shear walls of different ductility.

58 GEOSCIENCES↗

Transverse effects in plasma wakefield acceleration at FACET - Simulation studies

We investigate transverse effects in the plasma-wakefield acceleration experiments planned and ongoing at FACET. We use PIC simulation tools, mainly QuickPIC, to simulate the interaction of the drive electron beam and the plasma. In FACET a number of beam dynamics knobs, including dispersion and bunch length knobs, can be used to vary the beam transverse characteristics in the plasma. We present simulation results and the status of the FACET experimental searches.

43 PARTICLE ACCELERATORS↗