Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “N 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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

An extended Reed Solomon decoder design

It has previously been shown that the Reed-Solomon (RS) codes can correct errors beyond the Singleton and Rieger Bounds with an arbitrarily small probability of a miscorrect. That is, an (n,k) RS code can correct more than (n-k)/2 errors. An implementation of such an RS decoder is presented in this paper. An existing RS decoder, the AHA4010, is utilized in this work. This decoder is especially useful for errors which are patterned with a long burst plus some random errors.

Chen, J.↗
NASA NTRS1994

Mapping Between Distinct Reed-Solomon Codes

One-to-one mapping between two Reed-Solomon (RS) codes devised to enable decoder designed for one of codes to operate on other one also. Codes in question must have same N and K parameters (defined below) but otherwise be two distinct RS codes. Mapping intended to enable same ground-based decoder to decode telemetry signals from two spacecraft in two different RS codes of (N,K) = (255,223). Also useful in purely terrestrial data communications and in optical and magnetic recording and playback of digitized audio and video signals. Implemented in interface circuitry and/or software to enable communication between coding systems of different manufacturers using different RS codes within same (N,K) family.

Perlman, Marvin↗
DOE OSTI2022

Verification of Upcoming MCNP Features For Estimating Nuclear Data Sensitivities in Fixed Source Simulations [Abstract]

Predictive simulation codes, like the Monte Carlo N-Particle (MCNP) transport code, are used throughout the nuclear community. These simulations are based on nuclear data. Maximizing the accuracy and precision of nuclear data maximizes the accuracy and precision of the overall simulation. This is imperative to applications that rely on simulations. For example, improving nuclear data for special nuclear material improves simulation accuracy in stockpile stewardship applications, which results in larger safety margins and decreased operational costs. The improvement and validation of nuclear data is completed through integral benchmark experiments. Past benchmarks have primarily been limited to focus on the effective multiplication factor ($\kappa$ eff ); broadening the purview of benchmarks beyond $\kappa$ eff -dependent nuclear data addresses nuclear data deficiencies. Different response types depend on different areas of nuclear data. This dependence is quantified as nuclear data sensitivity: the change in response due to perturbation of a contributing parameter. The larger the nuclear data sensitivity of a response, the more the experiment is influenced by the uncertainties of the nuclear data. The optimization of nuclear data sensitivities in future benchmarks would result in more detailed validation of lesser studied areas of nuclear data. Currently, direct sensitivity capabilities are not easily found for all experiment types and parameters. An MCNP tool to directly estimate the cross section sensitivities of tallied values is under development. Additionally, updates have been made to the perturbation feature of MCNP, which can be used in a less direct approach to estimating sensitivities. This work verifies these features to estimate nuclear data sensitivities in fixed source simulations of a 4.5-kg sphere of alpha- phase weapons-grade plutonium surrounded by differing amounts of copper and polyethylene. Integrated estimates made using MCNP’s tools were found to statistically agree with integrated estimates made from manual perturbation of nuclear data proving the validity of the MCNP tools.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2004

A Scalable Architecture of a Structured LDPC Decoder

We present a scalable decoding architecture for a certain class of structured LDPC codes. The codes are designed using a small (n,r) protograph that is replicated Z times to produce a decoding graph for a (Z x n, Z x r) code. Using this architecture, we have implemented a decoder for a (4096,2048) LDPC code on a Xilinx Virtex-II 2000 FPGA, and achieved decoding speeds of 31 Mbps with 10 fixed iterations. The implemented message-passing algorithm uses an optimized 3-bit non-uniform quantizer that operates with 0.2dB implementation loss relative to a floating point decoder.

optical communications↗
DOE OSTI2026

Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic States

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for $n$-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of $n$-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the $(n+1)$D Dijkgraaf-Witten gauge theories with non-Abelian topological order. We construct transversal non-Clifford gates through automorphism symmetries represented by cup products. In 2D, we obtain the first transversal non-Clifford logical gates including T and CS for Clifford stabilizer codes, using the automorphism of the twisted $\mathbb{Z}_2^3$ gauge theory (equivalent to $\mathbb{D}_4$ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in $O(d)$ rounds via code switching. In 3D, we construct a transversal logical $\sqrt{\text{T}}$ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted $\mathbb{Z}_2^4$ gauge theory. Furthermore, our constructions surpass the Bravyi-König bound by achieving the logical gates in the $(n+1)$-th level of Clifford hierarchy in $n$ spatial dimension.

Kobayashi, Ryohei [Institute for Advanced Study, P↗
NASA NTRS1981

The elements just beyond iron - Formation during explosive carbon burning

It is pointed out that the details of the synthesis of the elements just beyond iron are unclear. Thus, a reexamination of the role played by neutron-capture reactions during explosive carbon burning is indicated. A description is given of calculations of explosive carbon-burning nucleosynthesis using a complete neutron capture (n-process) computer code with a network extending from Cr through Zr and including not only (n,gamma), (gamma,n) reactions and beta-decay but also (p,n), (n,p), (p,gamma), and (p,alpha) reactions. Initial conditions indicative of the composition of a massive star following core helium burning were selected, and a comparison is made with conditions similar to those used by Howard et al. (1972). It is found that neutron reactions during explosive carbon burning are an important source for the elements just beyond iron.

Wefel, J. P.↗
NASA NTRS1978

Quasi-optimal decoding of linear block codes using soft decision detection

A simple but effective decoding procedure, applicable to any (n,k) linear block code with symbols from GF(q), is described. The technique involves a transformation of the parity check equations which focuses the code's correction power on the soft symbol set while still retaining the capability to correct one symbol error from outside this set. The soft symbol set is defined to be the n-k least reliably detected code symbol positions whose parity check row-spaces are linearly independent. The process generates a number of error vector screening candidates, each a solution to the parity check equations, and the maximum-likelihood candidate is accepted.

Greene, E. P.↗
NASA NTRS1977

Minimax decoding of cyclic block codes

A minimax decoding algorithm utilizing soft bit detection of an (n,k) cyclic block code is described which will permit the correction of up to n-k bit errors interspersed at random locations throughout the block. The decoding solution consists of: (1) identifying the ordered soft bit set and, (2) finding the minimum order solution to the resulting syndrome equations where the nonzero error vector components are constrained to be a subset of the soft bit set. An efficient implementation of the decoding operation is described. In essence, this algorithm focuses the correction capability of the code on those bit positions which have the lowest a posteriori probabilities of correct detection.

Greene, E. P.↗
NASA NTRS1987

The binary weight distribution of the extended (2 sup m, 2 sup m-4) code of Reed-Solomon code over GF(2 sup m) with generator polynomial (x-alpha sup 2) (x-alpha sup 3)

Consider an (n,k) linear code with symbols from GF(2 sup m). If each code symbol is represented by a binary m-tuple using a certain basis for GF(2 sup m), a binary (nm,km) linear code called a binary image of the original code is obtained. A lower bound is presented on the minimum weight enumerator for a binary image of the extended (2 sup m, 2 sup m -4) code of Reed-Solomon code over GF(2 sup m) with generator polynomical (x - alpha)(x- alpha squared)(x - alpha cubed) and its dual code, where alpha is a primitive element in GF(2 sup m).

Lin, Shu↗
DOE OSTI2024

Shielding Benchmark Comparison - MCNP6.2

This report documents the calculations performed for a shielding code comparison between various Department of Energy (DOE) sites. These shielding calculations were performed using an experiment drawn from the International Handbook of Evaluated Criticality Safety Benchmark Experiments, published by the Organisation for Economic Cooperation and Development/Nuclear Energy Agency (OECD/NEA). The benchmark selected for comparison is ALARM-CF-AIR-LAB-001 (“Neutron Fields in the Three-Section Concrete Labyrinth from Cf-252 Source, Benchmark ALARM CF AIR LAB-001”). The Y-12 submission for this code comparison was performed with Monte Carlo N Particle (MCNP) Transport Code System, Version 6.2 and Automated Variance Reduction Generator (ADVANTG).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1990

New multi-level codes over GF(q)

Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.

Wu, Jiantian↗
NASA NTRS1992

New multilevel codes over GF(q)

Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.

Wu, Jiantian↗
DOE OSTI2025

Magic State Distillation using Asymptotically Good Codes on Qudits

Qudits offer the potential for low-overhead magic state distillation, although previous results for asymptotically good codes have required qudit dimension $q\gg 100$ or code length $\mathcal{N}\gg 100$. These parameters far exceed experimental demonstrations of qudit platforms, and thus motivate the search for better codes. Using a novel lifting procedure, we construct the first family of good triorthogonal codes on the $\mathbb{F}_{2^{2m}}$ alphabet with $m \geq 3$ that lies above the Tsfasman-Vladut-Zink bound. These codes yield a family of asymptotically good quantum codes with transversal CCZ gates, enabling constant space overhead magic state distillation with qudit dimension as small as $q=64$. Further, we identify a promising code with parameters $[[42,14,6]]_{64}$. Finally, we show that a distilled $|{CCZ}\rangle_{2^{2m}}$ can be reduced to a $|{CCZ}\rangle_{2^n}$ state for arbitrary $n$ with a constant-depth Clifford circuit of at most 9 computational basis measurements, 12 single-qudit and 9 two-qudit Clifford gates.

Cervia, Michael J. [Washington U., Seattle] (ORCID↗
DOE OSTI2021

A Verification of Flux Sensitivity Estimates Using the MCNP Tally Perturbation Tool

Nuclear data is commonly used in applications such as nuclear nonproliferation, safeguards, and criticality safety. More specifically, nuclear data is used in predictive simulation codes like the Monte-Carlo N-Particle (MCNP ® ) transport code, Serpent, and similar radiation transport codes. The improvement of nuclear data enables more precise and accurate simulations, which result in higher fidelity designs and reduced operational/procedural costs. Therefore, the improvement of nuclear data is of paramount importance across the nuclear community. Nuclear data is improved and validated through integral benchmark experiments. The design of benchmark experiments is an extensive process; therefore, these experiments are often optimized on multiple characteristics, including sensitivity to the nuclear data, during the design process. Sensitivity is a measure of how much a quantity changes due to changes in independent variables such as experimental configuration. An experimental design that has a larger sensitivity to the nuclear data of interest will have a larger impact on the accuracy and precision of the validated data. Past integral benchmark experiments have primarily used the effective multiplication factor ($k_{eff}$) as the predominant measured quantity; however, experiments designed with other quantities in mind would be able to optimize on validating different areas of the nuclear data. A primary goal of the EUCLID project is to design, constrain, and reduce compensating errors in experiments focused on quantities other than $k_{eff}$ to better validate nuclear data across the board. Currently, there is a capability in MCNP to easily calculate the sensitivity of $k_{eff}$ to specific nuclear data of numerous reactions types and isotopes (KSEN card); however, the sensitivity of other quantities must be estimated in more strenuous manners. For example, the perturbation feature (PERT card) of MCNP can be used to estimate first-order sensitivities of some response in fixed source simulations. A recent announcement revealed that the first- and second-order perturbation features in previous releases of MCNP contained a bug. It was identified that particles were being scored into the wrong energy bin. The bug is in the most recent public release (MCNP6.2); however, a patch has been added to the most up to date version (MCNP6.2.2) that has not been released publicly. A direct comparison of the PERT card results for an F4 (neutron flux averaged over a cell) tally before and after the patch are shown in figure 1. All simulations used in the sensitivity estimates in this report were performed with MCNP6.2.2. This work verifies the patched MCNP perturbation tool by comparing first order sensitivities made using the PERT card to estimates made using manual perturbation of the compact ENDF (ACE) files.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Edaphic controls on genome size and GC content of bacteria in soil microbial communities

Nutrient limitation has been shown to reduce bacterial genome size and influence nucleotide composition; however, much of this work has been conducted in marine systems and the factors which shape soil bacterial genomic traits remain largely unknown. Here, for this work, we determined average genome size, GC content, codon usage, and amino acid content from 398 soil metagenomes across a broad geographic range and used machine-learning to determine the environmental parameters that most strongly explain the distribution of these traits. We found that genomic trait averages were most related to pH, which we suggest is primarily due to the correlation of pH with several environmental parameters, particularly soil carbon content. Low pH soils had higher carbon to nitrogen ratios (C:N) and tended to have communities with lower GC content and larger genomes, potentially a response to increased physiological stress and a requirement for metabolic diversity. Conversely, communities in high pH and low soil C:N had smaller genomes and higher GC content—indicating potential resource driven selection against AT base pairs, which have a higher C:N than GC base pairs. Similarly, we found that nutrient conservation also applied to amino acid stoichiometry, where bacteria in soils with low C:N ratios tended to code for amino acids with lower C:N. Together, these relationships point towards fundamental mechanisms that underpin genome size, and nucleotide and amino acid selection in soil bacteria.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Fission product yields from the 238 U ( n,f ) reaction at E n = 4.6 MeV

Here, we present cumulative fission product yields from the 238 U (n, f) reaction at an incident energy of 4.6 MeV for fission products with half-lives from less than one second to several hours. We employed direct γ-ray spectroscopy to measure unseparated fission products with a conventional neutron activation analysis and a cyclic activation technique using the RApid Belt-driven Irradiated Target Transfer System (RABITTS). Yields were determined for 78 isotopes and isomers, covering the mass range 84 ≤ A ≤ 148 and the charge range from 33(As) ≤ Z ≤ 58(Ce). Our experimental cumulative yields are compared to the literature and evaluated data at E n ≈0.5 MeV from ENDF/B-VIII.0 and JEFF-3.3 libraries and with theoretical models using the GEF and FREYA codes at E n =4.6 MeV.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1975

Short, unit-memory, Byte-oriented, binary convolutional codes having maximal free distance

It is shown that (n sub 0, k sub 0) convolutional codes with unit memory always achieve the largest free distance among all codes of the same rate k sub 0/n sub 0 and same number 2MK sub 0 of encoder states, where M is the encoder memory. A unit-memory code with maximal free distance is given at each place where this free distance exceeds that of the best code with k sub 0 and n sub 0 relatively prime, for all Mk sub 0 less than or equal to 6 and for R = 1/2, 1/3, 1/4, 2/3. It is shown that the unit-memory codes are byte-oriented in such a way as to be attractive for use in concatenated coding systems.

Lee, L. N.↗