Search NASA⌕ Search

SEARCH · Search NASA

Results for “channel coding”

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 415 records · Page 23

Soft-Decision-Data Reshuffle to Mitigate Pulsed Radio Frequency Interference Impact on Low-Density-Parity-Check Code Performance

This presentation briefly discusses a research effort on mitigation techniques of pulsed radio frequency interference (RFI) on a Low-Density-Parity-Check (LDPC) code. This problem is of considerable interest in the context of providing reliable communications to the space vehicle which might suffer severe degradation due to pulsed RFI sources such as large radars. The LDPC code is one of modern forward-error-correction (FEC) codes which have the decoding performance to approach the Shannon Limit. The LDPC code studied here is the AR4JA (2048, 1024) code recommended by the Consultative Committee for Space Data Systems (CCSDS) and it has been chosen for some spacecraft design. Even though this code is designed as a powerful FEC code in the additive white Gaussian noise channel, simulation data and test results show that the performance of this LDPC decoder is severely degraded when exposed to the pulsed RFI specified in the spacecraft s transponder specifications. An analysis work (through modeling and simulation) has been conducted to evaluate the impact of the pulsed RFI and a few implemental techniques have been investigated to mitigate the pulsed RFI impact by reshuffling the soft-decision-data available at the input of the LDPC decoder. The simulation results show that the LDPC decoding performance of codeword error rate (CWER) under pulsed RFI can be improved up to four orders of magnitude through a simple soft-decision-data reshuffle scheme. This study reveals that an error floor of LDPC decoding performance appears around CWER=1E-4 when the proposed technique is applied to mitigate the pulsed RFI impact. The mechanism causing this error floor remains unknown, further investigation is necessary.

Ni, Jianjun David↗

Model-Invariant Hybrid RANS-LES Computations on Unstructured Meshes

Hybrid RANS-LES computations combine the bene ts of RANS and LES so that LES is used in regions where the accuracy of RANS deteriorates. The numerous hybrid approaches are limited by the speci cation of the LES-RANS interface, which can cause nonphysical results such as log-layer mismatch and low shear stress. The hybrid RANS-LES approach based on the concept of model invariance, mitigates these problems, enabling seamless blending of the RANS and LES regions while forming the basis for interpreting the results in the interface region. This hybrid formulation was implemented in the NASA FUN3D unstructured code and computations for ow in a channel at Reynolds number of 3300 (based on the channel half width h and the bulk in ow velocity u(infinity) were carried out. An isotropic stochastic turbulence generator was implemented to generate in ow turbulence. The present approach was able to eliminate the log-layer mismatch and predict the shear stress fairly well. Thus, the model-invariant hybrid formulation coupled with the isotropic turbulence in ow generation serves as a physically meaningful way of performing hybrid RANS-LES computations.

Sreekanth, R.↗

Frame sync acquisition for biorthogonally coded data

The paper analyzes the optimum frame-synchronization problem for biorthogonally coded data received over the additive white Gaussian noise (AWGN) channel and decoded prior to sync acquisition. In deriving the optimum frame-sync algorithm, the discussion is restricted to the case in which each frame contains F complete code words, including a frame-sync prefix of P complete code words. The k-bit source words and k-bit decoded words are regarded as super symbols from an alphabet of binary k-tuples. The biorthogonal encoder, the AWGN channel, and the decoder are lumped into a super symbol channel whose characteristics determine the form of the optimum frame-sync decision rule. A union-bound approach is used to provide a quantitative measure of the probability of false synchronization for the algorithm derived.

Levitt, B. K.↗

A forward error correction technique using a high-speed, high-rate single chip codec

The authors describe an error-correction coding approach that allows operation in either burst or continuous modes at data rates of multiple hundreds of megabits per second. Bandspreading is low since the code rate is 7/8 or greater, which is consistent with high-rate link operation. The encoder, along with a hard-decision decoder, fits on a single application-specific integrated circuit (ASIC) chip. Soft-decision decoding is possible utilizing applique hardware in conjunction with the hard-decision decoder. Expected coding gain is a function of the application and is approximately 2.5 dB for hard-decision decoding at 10-5 bit-error rate with phase-shift-keying modulation and additive Gaussian white noise interference. The principal use envisioned for this technique is to achieve a modest amount of coding gain on high-data-rate, bandwidth-constrained channels. Data rates of up to 300 Mb/s can be accommodated by the codec chip. The major objective is burst-mode communications, where code words are composed of 32 n data bits followed by 32 overhead bits.

Boyd, R. W.↗

Flow Solver for Incompressible Rectangular Domains

This is an extension of the Flow Solver for Incompressible 2-D Drive Cavity software described in the preceding article. It solves the Navier-Stokes equations for incompressible flow using finite differencing on a uniform, staggered grid. There is a runtime choice of either central differencing or modified upwinding for the convective term. The domain must be rectangular, but may have a rectangular walled region within it. Currently, the position of the interior region and exterior boundary conditions are changed by modifying parameters in the code and recompiling. These features make it possible to solve a variety of classical fluid flow problems such as an L-shaped cavity, channel flow, or wake flow past a square cylinder. The code uses fourth-order Runge-Kutta time-stepping and overall second-order spatial accuracy. This software permits the walled region to be positioned such that flow past a square cylinder, an L-shaped cavity, and the flow over a back-facing step can all be solved by reconfiguration. Also, this extension has an automatic detection of periodicity, as well as use of specialized data structure for ease of configuring domain decomposition and computing convergence in overlap regions.

Kalb, Virginia L.↗

Spin glasses and error-correcting codes

In this article, we study a model for error-correcting codes that comes from spin glass theory and leads to both new codes and a new decoding technique. Using the theory of spin glasses, it has been proven that a simple construction yields a family of binary codes whose performance asymptotically approaches the Shannon bound for the Gaussian channel. The limit is approached as the number of information bits per codeword approaches infinity while the rate of the code approaches zero. Thus, the codes rapidly become impractical. We present simulation results that show the performance of a few manageable examples of these codes. In the correspondence that exists between spin glasses and error-correcting codes, the concept of a thermal average leads to a method of decoding that differs from the standard method of finding the most likely information sequence for a given received codeword. Whereas the standard method corresponds to calculating the thermal average at temperature zero, calculating the thermal average at a certain optimum temperature results instead in the sequence of most likely information bits. Since linear block codes and convolutional codes can be viewed as examples of spin glasses, this new decoding method can be used to decode these codes in a way that minimizes the bit error rate instead of the codeword error rate. We present simulation results that show a small improvement in bit error rate by using the thermal average technique.

Belongie, M. L.↗

Assessment of UMUSCL Scheme for DNS of Turbulent Flows

Direct Numerical Simulations (DNS) are performed using the FUN3D code ( https://fun3d.larc.nasa.gov) for three validation cases: (1) flow through a plane channel, (2) flow through a channel with a constriction, and (3) flow over a flat plate. FUN3D is a node-centered finite-volume code developed at the NASA Langley Research Center that solves the three-dimensional compressible Navier-Stokes equations on unstructured computational grids. The simulations are performed employing the 2nd-order unstructured monotonic upstream scheme for conservation laws (UMUSCL). The results are compared with available experimental and numerical data. The effect of the UMUSCL reconstruction parameter (κ) is assessed, and the results indicate that κ = 0.9 yields satisfactory results in terms of accuracy and robustness compared to available data. Further analyses of the results, along with additional test cases and grids will be presented in the final manuscript.

Direct Numerical Simulation↗

Patterns of Activity in A Global Model of A Solar Active Region

In this work we investigate the global activity patterns predicted from a model active region heated by distributions of nanoflares that have a range of frequencies. What differs is the average frequency of the distributions. The activity patterns are manifested in time lag maps of narrow-band instrument channel pairs. We combine hydrodynamic and forward modeling codes with a magnetic field extrapolation to create a model active region and apply the time lag method to synthetic observations. Our aim is not to reproduce a particular set of observations in detail, but to recover some typical properties and patterns observed in active regions. Our key findings are the following. (1) Cooling dominates the time lag signature and the time lags between the channel pairs are generally consistent with observed values. (2) Shorter coronal loops in the core cool more quickly than longer loops at the periphery. (3) All channel pairs show zero time lag when the line of sight passes through coronal loop footpoints. (4) There is strong evidence that plasma must be re-energized on a timescale comparable to the cooling timescale to reproduce the observed coronal activity, but it is likely that a relatively broad spectrum of heating frequencies are operating across active regions. (5) Due to their highly dynamic nature, we find nanoflare trains produce zero time lags along entire flux tubes in our model active region that are seen between the same channel pairs in observed active regions.

Bradshaw, S. J.↗

Noisy quantum trees: infinite protection without correction

We study quantum networks with tree structures, in which information propagates from a root to leaves. At each node in the network, the received qubit unitarily interacts with fresh ancilla qubits, after which each qubit is sent through a noisy channel to a different node in the next level. Therefore, as the tree depth grows, there is a competition between the irreversible effect of noise and the protection against such noise achieved by the delocalization of information. In the classical setting, where each node simply copies the input bit into multiple output bits, this model has been studied as the broadcasting or reconstruction problem on trees, which has broad applications. In this work, we study the quantum version of this problem. We consider a Clifford encoder at each node that encodes the input qubit in a stabilizer code, along with a single qubit Pauli noise channel at each edge. Such noisy quantum trees describe a scenario in which one has access to a stream of fresh (low-entropy) ancilla qubits, but cannot perform error correction. Therefore, they provide a different perspective on quantum fault tolerance. Furthermore, they provide a useful model for describing the effect of noise within the encoders of concatenated codes. We prove that above certain noise thresholds, which depend on the properties of the code such as its distance, as well as the properties of the encoder, information decays exponentially with the depth of the tree. On the other hand, by studying certain efficient decoders, we prove that for codes with distance d ≥ 2 and for sufficiently small (but non-zero) noise, classical information and entanglement propagate over a noisy tree with infinite depth. Indeed, we find that this remains true even for binary trees with certain 2-qubit encoders at each node, which encodes the received qubit in the binary repetition code with distance d = 1.

Quantum information↗

Performance Simulation for Unit-memory Convolutional Codes with Byte-oriented Viterbi Decoding Algorithm

A software package developed to simulate the performance of the byte-oriented Viterbi decoding algorithm for unit-memory (UM) codes on both 3-bit and 4-bit quantized AWGN channels is described. The simulation is shown to require negligible memory and less time than that for the RTMBEP algorith, although they both provide similar performance in terms of symbol-error probability. This makes it possible to compute the symbol-error probability of large codes and to determine the signal-to-noise ratio required to achieve a bit error rate (BER) of 0.000001 for corresponding concatenated systems. A (7, 10/48) UM code, 10-bit Reed-Solomon code combination achieves the required BER at 1.08 dB for a 3-bit quantized channel and at 0.91 dB for a 4-bit quantized channel.

Vo, Q. D.↗

Thermal stratification potential in rocket engine coolant channels

The potential for rocket engine coolant channel flow stratification was computationally studied. A conjugate, 3-D, conduction/advection analysis code (SINDA/FLUINT) was used. Core fluid temperatures were predicted to vary by over 360 K across the coolant channel, at the throat section, indicating that the conventional assumption of a fully mixed fluid may be extremely inaccurate. Because of the thermal stratification of the fluid, the walls exposed to the rocket engine exhaust gases will be hotter than an assumption of full mixing would imply. In this analysis, wall temperatures were 160 K hotter in the turbulent mixing case than in the full mixing case. The discrepancy between the full mixing and turbulent mixing analyses increased with increasing heat transfer. Both analysis methods predicted identical channel resistances at the coolant inlet, but in the stratified analysis the thermal resistance was negligible. The implications are significant. Neglect of thermal stratification could lead to underpredictions in nozzle wall temperatures. Even worse, testing at subscale conditions may be inadequate for modeling conditions that would exist in a full scale engine.

Kacynski, Kenneth J.↗

$\mathcal{R}$ -matrix analysis of η + nat Cl reactions relevant to molten-salt reactor designs [Abstract]

Performed with support from the U.S. Nuclear Criticality Safety Program in an effort to provide improved chlorine cross section and corresponding covariance data, the R-matrix analysis of neutron induced reactions for two stable chlorine isotopes, 35,37 Cl, was performed in the energy range of thermal up to 1.2 MeV. Starting from the repository of the ENDF/B-VIII.0 library and following recent measurement campaigns, this work represents a significant improvement in the evaluation of the ( η , p ) reaction channel. The evaluation methodology uses the $\mathcal{R}$ -matrix code SAMMY to generate a set of Reich-Moore resonance parameters. As predicted by recently measured 35 Cl( η , p ) data, the presented evaluation features a dramatic increase in the magnitude of the ( η , p ) reaction channel over the ENDF/B-VIII.0 and previous nuclear data ENDF/B released libraries. Together with details of the evaluation procedure, the impact of the updates in the outgoing proton emissions on reactivity coefficients for different molten-salt reactor designs is presented and discussed.

charged-particle↗

ML-based Micro-CT SOFC Microstructure Models (from Kent 2026 Microstructural Augmentation paper)

Overview -------------------------- This repository contains datasets from the manuscript **"Enhanced Generalizability to Deep-Learning Quantification of 3D Microstructural Characteristics through Microstructurally Aware Augmentation of Scarce Data"** (*William F. Kent, Rochan Bajpai, Rachel C. Kurchin, William K. Epting, Harry W. Abernathy, Paul A. Salvador. Submitted 2026*). The methods are also described in the dissertation **Data Intensive Analysis of Solid Oxide Cell Microstructures** (*Doctoral dissertation, Carnegie Mellon University, 2025*). The datasets here are trained convolutional neural network (CNN) models for predicting key microstructural properties of solid oxide cell (SOC) electrodes from low-res, 2-channel 3D images, as well as some helpful code. The parameters for input images are provided in the paper. Sample data is provided in the file `Combined_anode_aug_dual_1k_examples` - that particular data was used to train `anode_all_aug.pth` and will work most accurately with that model. Please familiarize yourself with all caveats on accuracy and applicability, as detailed in the associated paper. Usage -------------------------- The basic usage is as follows, assuming `model_fn` is the path to the .pth file, and `X` is 2-channel input image(s) of the proper dimensions (either one image of shape `[2,12,24,24]`, or a batch of N input images of shape `[N,2,12,24,24]`): from CNN_inferencer import load_model_for_inference model = load_model_for_inference(model_fn) y_predicted = model(X) The model object automatically handles input scaling and output de-scaling based on the way the models were trained - in other words, pass in a 2-channel micro-CT image, and it will output microstructural property values in real units. ## Other model object attributes Note that model has useful attributes other than its forward pass model(X). * `model.output_descaler` - returns the output descaler object. Model does the de-scaling when generating inferences, but you may want to re-use this de-scaler on other values to e.g. compare predictions to ground truth from already-scaled training data. * `model.prop_names` - Gives the property names of the predicted y values, in order. Only exists if there's an output scaler as part of the model object, which there will be in the models provided here. ## Usage with sample data Here is a short script to use with the included sample data. from CNN_inferencer import display_predictions, load_model_for_inference, calculate_mape, parity_plot import h5py import numpy as np model_fn = 'anode_all_aug.pth' data_fn = 'Combined_anode_aug_dual_1k_examples.h5' N_samples = 200 figure_outdir = '.' model = load_model_for_inference(model_fn) with h5py.File(data_fn,'r') as f: XX = f['X'] #These are the 2-channel 3D images yy = f['y'] #These are the ground-truth microstructural properties, but they have been scaled for training - need to de-scale below N = XX.shape[0] #How many images total in the input data file #Run inferences on N_samples random samples from XX. #Run in a batch, much more efficient than one at a time. ii = np.random.choice(N,N_samples,replace=False) ii.sort() y_pred = model(XX[ii]) #Get the original/true (but normalized/scaled) values from the training dataset... #Because they were normalized, they are not in real units yet. So let's also de-scale them using model.output_scaler. y_true = model.output_scaler.transform(yy[ii]) #Let's display actual values for just 5 random ones for i in np.random.choice(N_samples,5,replace=False): display_predictions(y_true[i], y_pred[i], model.prop_names) #Make parity plots for each property (ground truth vs predicted values) #Also label each plot with the mean abs. percent error (MAPE) of the predicted values for i,key in enumerate(model.prop_names): mape = calculate_mape(y_true[:,i], y_pred[:,i]) parity_plot(y_true[:,i], y_pred[:,i], figure_outdir, key, extra_title=f' ({mape:.2f}% MAPE)')

3D microstructure↗

Use of CCSDS and OSI Protocols on the Advanced Communications Technology Satellite

Although ACTS (Advanced Communications Technology Satellite) provides an almost error-free channel during much of the day and under most conditions, there are times when it is not suitable for reliably error-free data communications when operating in the uncoded mode. Because coded operation is not always available to every earth station, measures must be taken in the end system to maintain adequate throughput when transferring data under adverse conditions. The most effective approach that we tested to improve performance was the addition of an 'outer' Reed-Solomon code through use of CCSDS (Consultative Committee for Space Data Systems) GOS 2 (a forward error correcting code). This addition can benefit all users of an ACTS channel including those applications that do not require totally reliable transport, but it is somewhat expensive because additional hardware is needed. Although we could not characterize the link noise statistically (it appeared to resemble uncorrelated white noise, the type that block codes are least effective in correcting), we did find that CCSDS GOS 2 gave an essentially error-free link at BER's (bit error rate) as high as 6x10(exp -4). For users that demand reliable transport, an ARQ (Automatic Repeat Queuing) protocol such as TCP (Transmission Control Protocol) or TP4 (Transport Protocol, Class 4) will probably be used. In this category, it comes as no surprise that the best choice of the protocol suites tested over ACTS was TP4 using CCSDS GOS 2. TP4 behaves very well over an error-free link which GOS 2 provides up to a point. Without forward error correction, however, TP4 service begins to degrade in the 10(exp -7)-10(exp -6) range and by 4x10(exp -6), it barely gives any throughput at all. If Congestion Avoidance is used in TP4, the degradation is even more pronounced. Fortunately, as demonstrated here, this effect can be more than compensated for by choosing the Selective Acknowledgment option. In fact, this option can enable TP4 to deliver some throughput at error rates as high as 10(exp -5).

Chirieleison, Don↗

Computational simulation of transition to turbulence through inverse modeling

The present investigation has focused on a computational methodology for the fundamental case of transition in channel flow, in which recently published experimental data are utilized both as a stimulus and as a measure of merit of the method. The research has proceeded along three avenues in parallel. The first task has consisted of the development and verification of a computer code which calculates the mean evolution of flow in a channel similar to the one employed experimentally by Blair and Anderson. An analytical test case was created for the dual purposes of code verification and of highlighting the interactions between the Reynolds stress and the mean velocity profile. This test case generated a Reynolds stress by the residue in the momentum equation which is produced by a typical analytical velocity profile. By a substitution of this Reynolds stress into the appropriate code module, the correctness of the code may be verified, along with the accuracy of the computational method. The second task pursued has involved the development of a triple layer model for the Reynolds stress profile, which was suggested and derived from experimental velocity profiles. It is demonstrated that the innermost length scale is based on the local friction velocity, the intermediate layer corresponds to the usual logarithmic law of the wall region in which the normalized Reynolds stress is approximately unity, and the outermost layer is represented by a closed mathematical form depending explicitly on the velocity profile in the wake region. The third task was comprised of scrutiny of the excellent databases developed by Blair and others, and the planning of its incorporation into the transition analysis. These extensive measurements indicate that turbulent statistics in the transition regime may be considered to alternate between laminar and fully turbulent types, the proportions of which are quantified by a measured intermittency function.

Sepri, Paavo↗

Analysis of a Channeled Centerbody Supersonic Inlet for F-15B Flight Research

The Propulsion Flight Test Fixture at the NASA Dryden Flight Research Center is a unique test platform available for use on the NASA F-15B airplane, tail number 836, as a modular host for a variety of aerodynamics and propulsion research. The first experiment that is to be flown on the test fixture is the Channeled Centerbody Inlet Experiment. The objectives of this project at Dryden are twofold: 1) flight evaluation of an innovative new approach to variable geometry for high-speed inlets, and 2) flight validation of channeled inlet performance prediction by complex computational fluid dynamics codes. The inlet itself is a fixed-geometry version of a mixed-compression, variable-geometry, supersonic in- let developed by TechLand Research, Inc. (North Olmsted, Ohio) to improve the efficiency of supersonic flight at off-nominal conditions. The concept utilizes variable channels in the centerbody section to vary the mass flow of the inlet, enabling efficient operation at a range of flight conditions. This study is particularly concerned with the starting characteristics of the inlet. Computational fluid dynamics studies were shown to align well with analytical predictions, showing the inlet to remain unstarted as designed at the primary test point of Mach 1.5 at an equivalent pressure altitude of 29,500 ft local conditions. Mass-flow-related concerns such as the inlet start problem, as well as inlet efficiency in terms of total pressure loss, are assessed using the flight test geometry.

Ratnayake, Nalin A.↗