Search NASA⌕ Search

SEARCH · Search NASA

Results for “bandwidth optimization”

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 397 records · Page 22

Quantum optimality of photon counting for temperature measurement of thermal astronomical sources

Using the quantum Cramér–Rao bound from quantum estimation theory, we derive a fundamental quantum limit on the sensitivity of a temperature measurement of a thermal astronomical source. This limit is expressed in terms of the source temperature T{sub s}, input spectral bandwidth Δν, and measurement duration T, subject to a long measurement time assumption TΔν≫1. It is valid for any measurement procedure that yields an unbiased estimate of the source temperature. The limit agrees with the sensitivity of direct detection or photon counting, and also with that of the ideal radiometer in the regime kT{sub s}/hν{sub 0}≫1 for which the Rayleigh–Jeans approximation is valid, where ν{sub 0} is the center frequency at which the radiometer operates. While valid across the electromagnetic spectrum, the limit is especially relevant for radio astronomy in this regime, since it implies that no ingenious design or technological improvement can beat an ideal radiometer for temperature measurement. In this connection, our result refutes the recent claim of a radio astronomy technique with much-improved sensitivity over the radiometer.

79 ASTRONOMY AND ASTROPHYSICS↗

Stable and tunable MeV $$\gamma$$-ray generation via dual-laser inverse Thomson scattering from a laser-plasma accelerator

Abstract Inverse Thomson scattering from laser-plasma accelerators offers a pathway to compact, tunable MeV $$\gamma$$ -ray sources for reduced-dose radiography and enhanced performance in nuclear resonance fluorescence (NRF)-based isotope identification. However, photon yield and spectral quality are often limited by constraints on interaction geometry and scatter-laser tunability. Here we demonstrate a MeV $$\gamma$$ -ray source based on a dual-laser inverse Thomson scattering configuration driven by a 100-TW laser-plasma accelerator. Electron beams tunable from 122 to 204 MeV with $$<5$$ mrad divergence and $$<1$$ mrad pointing stability generate $$\gamma$$ rays with peak energies from 276 keV to 1.2 MeV and yields up to $$2\times 10^{7}$$ photons per shot. By independently controlling the interaction position and the scatter-pulse duration, we experimentally match the scatter pulse to the walk-off-limited interaction length. Extending the scatter pulse to 200 fs increases photon production by approximately $$15\%$$ while maintaining operation in the linear Thomson regime, thereby preserving narrow spectral bandwidth and controlled radiation divergence. Radiographic characterization demonstrates MeV-level penetration and $$\approx 0.1$$ mm spatial resolution, while stable operation is sustained over multi-hour timescales across multiple days. These results show that interaction-length optimization provides a scalable strategy for improving photon yield, spectral control, and operational stability in compact laser-plasma-accelerator-driven $$\gamma$$ -ray sources.

Tsai, Hai-En↗

A Survey on the Expanding Scope and Interdisciplinary Opportunities for Processing-in-Memory Techniques

Processing-in-Memory (PIM) is emerging as a practical path to overcome the limitations of traditional von Neumann architectures. At its core, PIM systems implement computing primitives such as logic operations and multiply-accumulate acceleration through compute-in-memory, near-memory processing, or hybrid designs. The role of memory cells varies widely across technologies, acting as inputs, outputs, or analog accumulators through bit-lines and sense amplifiers. This diversity creates trade-offs in precision, bandwidth, latency, and programmability, making it difficult to build a unified understanding on the progress of the field. In this survey, we organize recent advances of PIM into three areas. First, we discuss the progress on the architectural optimizations of PIM and its integration with both DRAM and emerging non-volatile memories. Second, we examine how PIM is being used to accelerate key computing domains, including generative AI workloads and high-performance kernels, along with new approaches. Third, we highlight the growing adoption of PIM in computational sciences, where it is being applied to solve interdisciplinary problems such as genome analysis, mRNA quantification, mass spectrometry, quantum circuit simulation, wave modeling, and secure computation. Finally, we synthesize the major challenges that continue to slow PIM adoption, including manufacturing constraints, power delivery, thermal reliability, data consistency, runtime and memory-management coordination, and the difficulty of building portable software abstractions without sacrificing commercial viability. This work provides an updated, structured perspective on PIM’s potential across computing and computational sciences and the barriers that must be solved for it to reach its full impact.

Asifuzzaman, Kazi [Oak Ridge National Laboratory (↗

Conductive Spray Paint Fabricated Cylindrical Coplanar Waveguide for Noncontact Liquid-Level Sensing

A noncontact liquid-level sensor using a cylindrical coplanar waveguide (CCPW) is proposed. The concept is demonstrated using a prototype device made by directly spraying conductive paint on the outer surface of a glass cylinder. The position of the air–liquid interface is measured using the time-domain reflection (TDR) signal from the CCPW. The geometric parameters of the prototype sensor were optimized using a full-wave simulation tool. The experimental results show that the prototype CCPW-based liquid-level sensor has a resolution of 29.8μm over a range of 210 mm at the sweeping frequency bandwidth of 500 MHz–4 GHz. The tradeoff between the resolution and the measurement range was discussed. The proposed sensor provides a low-cost, easy-to-fabricate, and noncontact method for liquid-level measurement, which has potential applications in fuel storage, chemical production, and wastewater treatment.

42 ENGINEERING↗

SZ3: A Modular Framework for Composing Prediction-Based Error-Bounded Lossy Compressors

Today's scientific simulations require a significant reduction of data volume because of extremely large amounts of data they produce and the limited I/O bandwidth and storage space. Here, error-bounded lossy compression has been considered one of the most effective solutions to the above problem. In practice, however, the best-fit compression method often needs to be customized or optimized in particular because of diverse characteristics in different datasets and various user requirements on the compression quality and performance. In this paper, we address this issue with a novel modular, composable compression framework named SZ3. Our contributions are four-folds. (1) We develop SZ3 which features an innovative modular abstraction for the prediction-based compression framework, such that compression modules can be plugged in easily to create new compressors based on characteristics of data and user requirements. (2) We create a new compression pipeline by SZ3 for GAMESS data, which significantly improves the compression ratios over state-of-the-art compressors. (3) We develop an adaptive compression pipeline by SZ3 for APS data with minimal efforts, which leads to the best rate-distortion among all existing error-bounded lossy compressors for any bit-rate. (4) We compare the sustainability of SZ3 with leading error-bounded prediction-based compressors, and then demonstrate the necessity of diverse pipelines by integrating and evaluating several compression pipelines on diverse scientific datasets from multiple disciplines. Experiments show that SZ3 incurs very limited overhead in compressor integration and our customized compression pipelines lead to up to 20% improvement in compression ratios under the same data distortion, when compared with the best existing approach.

97 MATHEMATICS AND COMPUTING↗

An all-electronic fail-safe for stimulated Brillouin scattering suppression

The mitigation of transverse stimulated Brillouin scattering (SBS) via phase modulation is mandatory to avoid damage in high-energy laser systems. A novel fail-safe system that indirectly monitors the optical bandwidth applied to suppress SBS by monitoring the input, reflected, and through rf power of the SBS-suppression lithium-niobate phase modulator is demonstrated. The fail-safe system has high sensitivity and reliability provided by optimized redundant circuits for power monitoring and fail-safe decision logic. Calibration of the fail-safe’s thresholds is straightforward. Furthermore, the fail-safe circuitry reacts within 45 ns to stop an incorrectly modulated pulse by blocking the propagation of an electronic timing trigger.

fail-safe↗

Quantitative Performance Assessment of Proxy Apps and Parents (ECP Proxy App Project Milestone ADCD-504-9)

This report presents highlights of these efforts. Section 2 describes work that has been done to compare the performance of proxy applications on AMD MI60 vs. Nvidia V100 GPUs. So far only a small set of ECP proxies are running on AMD GPUs, but we will continue to expand this analysis as additional proxies become available. We find that although the MI60 and V100 have nearly the same measured memory bandwidth, memory bound proxy app kernels perform 20-30% worse on the MI60. Further work is needed to refine these comparisons to determine whether the root cause is due to differences in the hardware, software stack, platform specific optimization, or some combination of the three. Section 3 describes our continuing effort to find methods to accurately assess the similarity of proxies and parents. We have recently seen very encouraging results using a cosine similarity metric. This technique uses the angle between two vectors of hardware performance counters to characterize the similarity (or difference) between two applications or proxies. We show not only that several widely used proxies are highly similar to their parents, but also that they differ from non-related codes. We also show that cosine similarity can be used to identify gaps and redundancies in suites and even to gain insight into the effects of architectural differences between platforms. Our work on assessing the Exascale toolchain is ongoing. Our successes with performance measurement tools are evident from the data provided in this report. However, our assessments across the broader tool chain are still too incomplete to provide a meaningful report at this time. We will continue to assess tools and work with vendors and third party developers as issues are identified.

97 MATHEMATICS AND COMPUTING↗

Optimizing conversion efficiency and reducing ion energy in a laser-produced Gd plasma

We have demonstrated an efficient extreme ultraviolet (EUV) source at 6.7 nm by irradiating Gd targets with 0.8 and 1.06 {mu}m laser pulses of 140 fs to 10 ns duration. Maximum conversion efficiency of 0.4% was observed within a 0.6% bandwidth. A Faraday cup observed ion yield and time of flight signals for ions from plasmas generated by each laser. Ion kinetic energy was lower for shorter pulse durations, which yielded higher electron temperatures required for efficient EUV emission, due to higher laser intensity. Picosecond laser pulses were found to be the best suited to 6.7 nm EUV source generation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Efficiency enhancement of octave-bandwidth traveling wave tubes by use of multistage depressed collectors

Small, three- and five-stage depressed collectors were evaluated in conjunction with a 4.8- to 9.6-GHz TWT of 325- to 675-W power output and a beam of 0.5 microperv. The multistage depressed collector (MDC) performed well even though its design had been optimized for a TWT of identical design but considerably less output power. Despite large, fixed losses significant efficiency enhancement was demonstrated with both the three- and five-stage depressed collectors. At saturated rf power output, the improvement in the overall efficiency ranged from a factor of 2.5 to 3.0 for the three-stage collector and a factor of 3.0 to 3.5 for the five-stage collector. At saturation three-stage collector efficiencies of 77 to 80 percent and five-stage collector efficiencies of 81 to 84 percent were obtained across the frequency band. An overall efficiency of 37.0 to 44.3 percent across the frequency band of 4.8 to 9.6 GHz was demonstrated with the use of harmonic injection. For operation below saturation, even larger relative improvements in the overall TWT efficiency were demonstrated. Collector performance was relatively insensitive to the degree of regulation of the collector power supply.

Ramins, P.↗

Novel schemes for the optimization of the SPARC narrow band THz source

A pulsed, tunable, narrow band radiation source with frequency in the THz region can be obtained collecting the coherent transition radiation produced by a train of ultra-short electron bunches having picosecond scale inter-distance. In this paper, we review the techniques feasible at the SPARC-LAB test facility to produce and manipulate the requested train of electron bunches and we examine the dynamics of their acceleration and compression. In addition, we show how the performances of the train compression and the radiation intensity and bandwidth can be significantly improved through the insertion of a fourth order harmonic cavity, working in the X-band and acting as a longitudinal phase space linearizer.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Minimum local distance density estimation

We present a local density estimator based on first-order statistics. To estimate the density at a point, $x$, the original sample is divided into subsets and the average minimum sample distance to $x$ over all such subsets is used to define the density estimate at $x$. The tuning parameter is thus the number of subsets instead of the typical bandwidth of kernel or histogram-based density estimators. The proposed method is similar to nearest-neighbor density estimators but it provides smoother estimates. We derive the asymptotic distribution of this minimum sample distance statistic to study globally optimal values for the number and size of the subsets. Simulations are used to illustrate and compare the convergence properties of the estimator. The results show that the method provides good estimates of a wide variety of densities without changes of the tuning parameter, and that it offers competitive convergence performance.

97 MATHEMATICS AND COMPUTING↗

Sequential Principal Component Analysis -An Optimal and Hardware-Implementable Transform for Image Compression

This paper presents the JPL-developed Sequential Principal Component Analysis (SPCA) algorithm for feature extraction / image compression, based on "dominant-term selection" unsupervised learning technique that requires an order-of-magnitude lesser computation and has simpler architecture compared to the state of the art gradient-descent techniques. This algorithm is inherently amenable to a compact, low power and high speed VLSI hardware embodiment. The paper compares the lossless image compression performance of the JPL's SPCA algorithm with the state of the art JPEG2000, widely used due to its simplified hardware implementability. JPEG2000 is not an optimal data compression technique because of its fixed transform characteristics, regardless of its data structure. On the other hand, conventional Principal Component Analysis based transform (PCA-transform) is a data-dependent-structure transform. However, it is not easy to implement the PCA in compact VLSI hardware, due to its highly computational and architectural complexity. In contrast, the JPL's "dominant-term selection" SPCA algorithm allows, for the first time, a compact, low-power hardware implementation of the powerful PCA algorithm. This paper presents a direct comparison of the JPL's SPCA versus JPEG2000, incorporating the Huffman and arithmetic coding for completeness of the data compression operation. The simulation results show that JPL's SPCA algorithm is superior as an optimal data-dependent-transform over the state of the art JPEG2000. When implemented in hardware, this technique is projected to be ideally suited to future NASA missions for autonomous on-board image data processing to improve the bandwidth of communication.

Duong, Tuan A.↗

Evaluating LULESH Kernels on OpenCL FPGA

FPGAs are becoming promising heterogeneous computing components for high-performance computing. In this paper, we evaluate the resource utilizations, performance, and performance per watt of our implementations of the LULESH kernels in OpenCL on an Arria10-based FPGA platform. LULESH is a complex proxy application in the CORAL benchmark suite. We choose two representative kernels “CalcFBHourglassForceForElems” and “EvalEOSForElems” from the application in our study. Compared with the baseline implementations, our optimizations improve the performance by a factor of 1.65X and 2.96X for the two kernels on the FPGA, respectively. Using directives for accelerator programming, we also evaluate the performance of the kernels on an Intel Xeon 16-core CPU and an Nvidia K80 GPU. We find that the FPGA, constrained by the memory bandwidth, can perform 1.05X to 3.4X better than the CPU and GPU for small problem sizes. For the first kernel, the performance per watt on the FPGA is 1.59X and 7.1X higher than that on an Intel Xeon 16-core CPU and an Nvidia K80 GPU, respectively. For the second kernel, the performance per watt on the GPU is 1.82X higher than that on the FPGA. However, the performance per watt on the FPGA is 1.77X higher than that on the CPU.

FPGA↗

Extending Parsimonious Bayesian Inference

Parsimonious Bayesian inference is a theoretical framework for efficient data assimilation that seeks to balance increased consistency between predictions and training data against corresponding increases in model complexity. Within this framework, over-training is understood as optimization that encodes excessive information within model parameters while only achieving small improvements between predictions and training data. This project aims to develop practical methods of limiting excess model information during optimization. One key observation is that practical heuristics for parsimonious learning in high-dimensions must balance expressivity, i.e. the ability of the model to capture diverse predictions with only a few non-zero parameters, against discoverability, i.e. the ability to train the model with gradient-based optimization and drive parameters to low information states. As such, we developed logical activation functions that are able to adaptively approximate arbitrary truth tables that define Boolean logic operations within a probabilistic framework. These functions have demonstrated the ability to learn exclusive disjunction (XOR) and conditioned disjunction (if [condition] then [result_if_true] else [result_if_false]) within a single layer of a neural network. To efficiently exploit these activation functions to drive parsimonious learning required several other advances within the domain of variational inference. The most efficient form of complexity suppression is structured sparsification, driving most model parameters to zero while achieving the structural coherence among nonzeros needed for bandwidth reduction. Such models are not only far more efficient at suppressing information-theoretic complexity, they also reduce the other forms of complexity (computations, communication, storage, and the number of dependencies needed to evaluate predictions). Aiming to support enhanced sparsification, this project examined new approaches to high-dimensional variational inference that allow us to calibrate and control parameter uncertainty during optimization. By identifying which parameters can sustain sparsifying perturbations with little impact on prediction quality, we can develop better pruning strategies by framing them as approximate Bayesian inference. These advances also open paths to mitigate concerns with deploying advanced learning methods in resource-constrained environments, such as running models on power-limited or communication-limited devices.

97 MATHEMATICS AND COMPUTING↗

Adaptive Sampling of Time Series During Remote Exploration

This work deals with the challenge of online adaptive data collection in a time series. A remote sensor or explorer agent adapts its rate of data collection in order to track anomalous events while obeying constraints on time and power. This problem is challenging because the agent has limited visibility (all its datapoints lie in the past) and limited control (it can only decide when to collect its next datapoint). This problem is treated from an information-theoretic perspective, fitting a probabilistic model to collected data and optimizing the future sampling strategy to maximize information gain. The performance characteristics of stationary and nonstationary Gaussian process models are compared. Self-throttling sensors could benefit environmental sensor networks and monitoring as well as robotic exploration. Explorer agents can improve performance by adjusting their data collection rate, preserving scarce power or bandwidth resources during uninteresting times while fully covering anomalous events of interest. For example, a remote earthquake sensor could conserve power by limiting its measurements during normal conditions and increasing its cadence during rare earthquake events. A similar capability could improve sensor platforms traversing a fixed trajectory, such as an exploration rover transect or a deep space flyby. These agents can adapt observation times to improve sample coverage during moments of rapid change. An adaptive sampling approach couples sensor autonomy, instrument interpretation, and sampling. The challenge is addressed as an active learning problem, which already has extensive theoretical treatment in the statistics and machine learning literature. A statistical Gaussian process (GP) model is employed to guide sample decisions that maximize information gain. Nonsta tion - ary (e.g., time-varying) covariance relationships permit the system to represent and track local anomalies, in contrast with current GP approaches. Most common GP models are stationary, e.g., the covariance relationships are time-invariant. In such cases, information gain is independent of previously collected data, and the optimal solution can always be computed in advance. Information-optimal sampling of a stationary GP time series thus reduces to even spacing, and such models are not appropriate for tracking localized anomalies. Additionally, GP model inference can be computationally expensive.

Thompson, David R.↗

Classification and Evaluation of Coherent Synchronous Sampled-Data Telemetry Systems

This paper analyzes the various types of continuous wave and pulse modulation for the transmission of sampled data over channels perturbed by white gaussian noise. Optimal coherent synchronous detection schemes for all the different modulation methods are shown to belong to one of two general classes: linear synchronous detection and correlation detection. The figures of merit, mean-square signal-to-error ratio and bandwidth occupancy, are determined for each system and compared.

Viterbi, Andrew↗

Performance analysis of an adaptive multiple access scheme for the message service of a land mobile satellite experiment (MSAT-X)

This paper describes an Adaptive Mobile Access Protocol (AMAP) for the message service of MSAT-X., a proposed experimental mobile satellite communication network. Message lengths generated by the mobiles are assumed to be uniformly distributed. The mobiles are dispersed over a wide geographical area and the channel data rate is limited. AMAP is a reservation based multiple access scheme. The available bandwidth is divided into subchannels, which are divided into reservation and message channels. The ALOHA multiple access scheme is employed in the reservation channels, while the message channels are demand assigned. AMAP adaptively reallocates the reservation and message channels to optimize the total average message delay.

Yan, T.-Y.↗

Placing dynamic sensors and actuators on flexible space structures

Input/Output Cost Analysis involves decompositions of the quadratic cost function into contributions from each stochastic input and each weighted output. In the past, these suboptimal cost decomposition methods of sensor and actuator selection (SAS) have been used to locate perfect (infinite bandwidth) sensor and actuators on large scale systems. This paper extends these ideas to the more practical case of imperfect actuators and sensors with dynamics of their own. NASA's SCOLE examples demonstrate that sensor and actuator dynamics affect the optimal selection and placement of sensors and actuators.

Norris, Gregory A.↗