Ranger command subsystem follow-on final engineering report no. 17-48420
Digital command detector and decoder for Ranger Block III command system
SEARCH · Engineering Papers
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.
Digital command detector and decoder for Ranger Block III command system
Application of sequential decoding algorithm to measurement problems
Distribution of matrices resulting from Newtons identities in field of characteristic two - decoding
Probability distribution study of data transmission time random variable - sequential decoding technique
Concatenation method for decoding of complex short codes
Information content of q-level m-sequences restricted to sums of n - analysis of enumeration, encoding, and decoding problems
Information theory in fabricating decoding schemes
Integrated circuit decoder for Apollo spacecraft up-data link
Computer program documentation of engineering analysis, decoding, program listing, input and output data display sheets, and computations
Adaptive telemetry conference on adaptive data control and processing, prediction, data compression, encoding, decoding, and modulation.
Pathcount and coding matrices for sequence time encoding and decoding for data compression
We propose a new solution to parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable iterative decoding structure. Examples are given for throughputs 2 bits/sec/Hz with 8PSK and 16QAM signal constellations.
Individual phases are commonly considered as the building blocks of materials. However, the accurate theoretical prediction of properties of individual phases remains elusive. The top-down approach by decoding genomic building blocks of individual phases from experimental observations is nonunique. The density functional theory (DFT), as a state-of-the-art solution of quantum mechanics, prescribes the existence of a ground-state configuration at 0 K for a given system. It is self-evident that the ground-state configuration alone is insufficient to describe a phase at finite temperatures as symmetry-breaking non-ground-state configurations are excited statistically at temperatures above 0 K. Our multiscale entropy approach (recently terms as Zentropy theory) postulates that the entropy of a phase is composed of the sum of the entropy of each configuration weighted by its probability plus the configurational entropy among all configurations. Consequently, the partition function of each configuration in statistical mechanics needs to be evaluated by its free energy rather than total energy. The combination of the ground-state and symmetry-breaking non-ground-state configurations represents the building blocks of materials and can be used to quantitatively predict free energy of individual phases with the free energy of each configuration predicted from DFT as well as all properties derived from free energy of individual phases.
Graph foundation models using graph neural networks promise sustainable, efficient atomistic modeling. To tackle challenges of processing multi-source, multi-fidelity data during pre-training, recent studies employ multi-task learning, in which shared message passing layers initially process input atomistic structures regardless of source, then route them to multiple decoding heads that predict data-specific outputs. This approach stabilizes pre-training and enhances a model’s transferability to unexplored chemical regions. Preliminary results on approximately four million structures are encouraging, yet questions remain about generalizability to larger, more diverse datasets and scalability on supercomputers. We propose a multi-task parallelism method that distributes each head across computing resources with GPU acceleration. Implemented in the open-source HydraGNN architecture, our method was trained on over 24 million structures from five datasets and tested on the Perlmutter, Aurora, and Frontier supercomputers, demonstrating efficient scaling on all three highly heterogeneous super-computing architectures.
The Python’s Lunch conjecture for the complexity of bulk reconstruction involves two types of nonminimal quantum extremal surfaces (QESs): bulges and throats, which differ by their local properties. The conjecture relies on the connection between bulk spatial geometry and quantum codes: a constricting geometry from bulge to throat encodes the bulk state nonisometrically, and so requires an exponentially complex Grover search to decode. However, thus far, the Python’s Lunch conjecture is only defined for spacetimes where all QESs are spacelike-separated from one another. Here we explicitly construct (time-reflection symmetric) spacetimes featuring both timelike-separated bulges and timelike-separated throats. Interestingly, all our examples also feature a third type of QES, locally resembling a de Sitter bifurcation surface, which we name a bounce. By analyzing the Hessian of generalized entropy at a QES, we argue that this classification into throats, bulges and bounces is exhaustive. We then propose an updated Python’s Lunch conjecture that can accommodate general timelike-separated QESs and bounces. Notably, our proposal suggests that the gravitational analogue of a tensor network is not necessarily the time-reflection symmetric slice, even when one exists.
Recent works have revealed that quantum extremal islands can contribute to the fine-grained entropy of black hole radiation reproducing the unitary Page curve. In this paper, we use these results to assess if an observer in de Sitter space can decode information hidden behind their cosmological horizon. By computing the fine-grained entropy of the Gibbons-Hawking radiation in a region where gravity is weak we find that this is possible, but the observer’s curiosity comes at a price. At the same time the island appears, which happens much earlier than the Page time, a singularity forms which the observer will eventually hit. We arrive at this conclusion by studying de Sitter space in Jackiw-Teitelboim gravity. We emphasize the role of the observer collecting radiation, breaking the thermal equilibrium studied so far in the literature. By analytically solving for the backreacted geometry we show how an island appears in this out-of-equilibrium state.
When absorbing boundary conditions are used to evaporate a black hole in AdS/CFT, we show that there is a phase transition in the location of the quantum Ryu-Takayanagi surface, at precisely the Page time. The new RT surface lies slightly inside the event horizon, at an infalling time approximately the scrambling time β/2 π logS BH into the past. We can immediately derive the Page curve, using the Ryu-Takayanagi formula, and the Hayden-Preskill decoding criterion, using entanglement wedge reconstruction. Because part of the interior is now encoded in the early Hawking radiation, the decreasing entanglement entropy of the black hole is exactly consistent with the semiclassical bulk entanglement of the late-time Hawking modes, despite the absence of a firewall.By studying the entanglement wedge of highly mixed states, we can understand the state dependence of the interior reconstructions. A crucial role is played by the existence of tiny, non-perturbative errors in entanglement wedge reconstruction. Directly after the Page time, interior operators can only be reconstructed from the Hawking radiation if the initial state of the black hole is known. As the black hole continues to evaporate, reconstructions become possible that simultaneously work for a large class of initial states. Using similar techniques, we generalise Hayden-Preskill to show how the amount of Hawking radiation required to reconstruct a large diary, thrown into the black hole, depends on both the energy and the entropy of the diary. Finally we argue that, before the evaporation begins, a single, state-independent interior reconstruction exists for any code space of microstates with entropy strictly less than the Bekenstein-Hawking entropy, and show that this is sufficient state dependence to avoid the AMPSS typical-state firewall paradox.