Search NASA⌕ Search

SEARCH · Search NASA

Results for “arraying algorithms”

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 973 records · Page 54

Field-Programmable Gate Array Implementation of a Single Photon-Counting Receive Modem

We present a field-programmable gate array (FPGA) implementation of a single photon-counting receive modem for a pulse position modulated signal. The modem is compliant with the Consultative Committee for Space Data Systems (CCSDS) High Photon Efficiency (HPE) Optical Communications Coding and Synchronization standard and is capable of a maximum data rate of 267 Mbps. The system is designed on a commercial off-the-shelf FPGA platform and utilizes superconducting nanowire single photon counting detectors, analog to digital converters (ADC s) to sample the detectors, and two FPGAs. Symbol timing recovery, photon counting, convolutional deinterleaving, and codeword synchronization areis performed in the first FPGA. The second FPGA performs iterative decoding on each codeword of the serially concatenated pulse position modulated (SCPPM) signal. A digital filter is included to compensate for timing jitter of the detector, and the decoder throughput can be modified adjusted through reconfigurable parallelization. The decoder also implements a resource-efficient, algorithmic polynomial interleaver and deinterleaver. Both FPGAs can be reconfigured to switch between pulse position modulation (PPM)-16 and PPM-32 with code rates 1/3, 1/2, and 2/3. In this paper, we describe the receiver architecture and FPGA implementation of the timing recovery loop and SCPPM decoder, FPGA utilization for the different modes, and receive modem characterization test results.

Field-programmable Gate Array↗

Parallel beamlet dose calculation via beamlet contexts in a distributed multi‐GPU framework

Purpose Dose calculation is one of the most computationally intensive, yet essential tasks in the treatment planning process. With the recent interest in automatic beam orientation and arc trajectory optimization techniques, there is a great need for more efficient model‐based dose calculation algorithms that can accommodate hundreds to thousands of beam candidates at once. Foundational work has shown the translation of dose calculation algorithms to graphical processing units ( GPU s), lending to remarkable gains in processing efficiency. But these methods provide parallelization of dose for only a single beamlet, serializing the calculation of multiple beamlets and under‐utilizing the potential of modern GPU s. In this paper, the authors propose a framework enabling parallel computation of many beamlet doses using a novel beamlet context transformation and further embed this approach in a scalable network of multi‐ GPU computational nodes. Methods The proposed context‐based transformation separates beamlet‐local density and TERMA into distinct beamlet contexts that independently provide sufficient data for beamlet dose calculation. Beamlet contexts are arranged in a composite context array with dosimetric isolation, and the context array is subjected to a GPU collapsed‐cone convolution superposition procedure, producing the set of beamlet‐specific dose distributions in a single pass. Dose from each context is converted to a sparse representation for efficient storage and retrieval during treatment plan optimization. The context radius is a new parameter permitting flexibility between the speed and fidelity of the dose calculation process. A distributed manager‐worker architecture is constructed around the context‐based GPU dose calculation approach supporting an arbitrary number of worker nodes and resident GPU s. Phantom experiments were executed to verify the accuracy of the context‐based approach compared to Monte Carlo and a reference CPU ‐ CCCS implementation for single beamlets and broad beams composed by addition of beamlets. Dose for representative 4 π beam sets was calculated in lung and prostate cases to compare its efficiency with that of an existing beamlet‐sequential GPU ‐ CCCS implementation. Code profiling was also performed to evaluate the scalability of the framework across many networked GPU s. Results The dosimetric accuracy of the context‐based method displays <1.35% and 2.35% average error from the existing serialized CPU ‐ CCCS algorithm and Monte Carlo simulation for beamlet‐specific PDD s in water and slab phantoms, respectively. The context‐based method demonstrates substantial speedup of up to two orders of magnitude over the beamlet‐sequential GPU ‐ CCCS method in the tested configurations. The context‐based framework demonstrates near linear scaling in the number of distributed compute nodes and GPU s employed, indicating that it is flexible enough to meet the performance requirements of most users by simply increasing the hardware utilization. Conclusions The context‐based approach demonstrates a new expectation of performance for beamlet‐based dose calculation methods. This approach has been successful in accelerating the dose calculation process for very large‐scale treatment planning problems ‐ such as automatic 4 π IMRT beam orientation and VMAT arc trajectory selection, with hundreds of thousands of beamlets ‐ in clinically feasible timeframes. The flexibility of this framework makes it as a strong candidate for use in a variety of other very large‐scale treatment planning tasks and clinical workflows.

Neph, Ryan↗

SQMS Quantum R&D in Machine Learning, Optimization and Sensing beyond Fundamental Physics Applications

This newly formed team at SQMS under the Ecosystem Thrust is looking to develop capabilities impacting societal advances outside the core domain of HEP and condensed matter physics. We explicitly leverage the experimental and algorithmic innovations developed across all groups as well as connect to broad-scope external projects of the diverse team of PIs. As the inaugural set of projects, we are studying numerically quantum machine learning models inspired by efficiently trainable echo-state and orthogonal neural networks and developing designs for related experiments to be performed on quantum processors based on SQMS SRF cQED technology and Rigetti s transmon arrays. Investigated models exploit ideas and lessons learned from multiple prior work by SQMS team members in a variety of internal and external activities [R1]. Target initial applications include noisy signal processing, potentially captured by quantum sensors or noisy QPUs, as well as simulation and classification of healthcare data. For instance, image reconstruction of the brain s electrical properties by solving the inverse Maxwell equation problem with uncertainty [R2] through a hybrid quantum-classical physics-informed architecture for time-dependent processes [R3]. The group is also investigating the application and development of novel quantum sensors based on magnetic levitation of a superconducting sphere coupled to a superconducting qubit. This coupling enables high-precision measurements of the position of the sphere, which can be used for sensitive detection of forces, enabling practical applications such as gravimetry for geophysics analysis, or accelerometry for GPS-denied navigation [R4] [R1] Rieffel, Eleanor G., Ata Akbari Asanjan, M. Sohaib Alam, Namit Anand, David E. Bernal Neira, Sophie Block, Lucas T. Brady et al. "Assessing and advancing the potential of quantum computing: A NASA case study." Future Generation Computer Systems (2024). [R2] Yu, X., Serrall s, J.E., Giannakopoulos, I.I., Liu, Z., Daniel, L., Lattanzi, R. and Zhang, Z., 2023. Pifon-ept: Mr-based electrical property tomography using physics-informed fourier networks. IEEE Journal on Multiscale and Multiphysics Computational Techniques. [R3] Wudarski, Filip, Daniel OConnor, Shaun Geaney, Ata Akbari Asanjan, Max Wilson, Elena Strbac, P. Aaron Lott, and Davide Venturelli. "Hybrid quantum-classical reservoir computing for simulating chaotic systems." arXiv preprint arXiv:2311.14105 (2023). [R4] Higgins, Gerard, Saarik Kalia, and Zhen Liu. "Maglev for dark matter: Dark-photon and axion dark matter sensing with levitated superconductors." Physical Review D 109.5 (2024): 055024.

Venturelli, Davide↗

A critical analysis of transverse vorticity measurements in a large plane shear layer

An evaluation is made of the roles played in four-wire hot wire probe arrays by the influence of (1) the transverse velocity component on pitch angle measurement; (2) the instantaneous spatial gradient of the pitch angle on transverse vorticity computation; (3) the uncertainties in the magnitude of instantaneous pitch angle spatial gradient in the transverse vorticity computation; and (4) the spatial dimension of the microcirculation domain and the evaluation of transverse vorticity. Attention is given to the probe configuration and its computation algorithm.

Foss, J. F.↗

The alignment-distribution graph

Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

Chatterjee, Siddhartha↗

Wavelet compression techniques for hyperspectral data

Hyperspectral sensors are electro-optic sensors which typically operate in visible and near infrared bands. Their characteristic property is the ability to resolve a relatively large number (i.e., tens to hundreds) of contiguous spectral bands to produce a detailed profile of the electromagnetic spectrum. In contrast, multispectral sensors measure relatively few non-contiguous spectral bands. Like multispectral sensors, hyperspectral sensors are often also imaging sensors, measuring spectra over an array of spatial resolution cells. The data produced may thus be viewed as a three dimensional array of samples in which two dimensions correspond to spatial position and the third to wavelength. Because they multiply the already large storage/transmission bandwidth requirements of conventional digital images, hyperspectral sensors generate formidable torrents of data. Their fine spectral resolution typically results in high redundancy in the spectral dimension, so that hyperspectral data sets are excellent candidates for compression. Although there have been a number of studies of compression algorithms for multispectral data, we are not aware of any published results for hyperspectral data. Three algorithms for hyperspectral data compression are compared. They were selected as representatives of three major approaches for extending conventional lossy image compression techniques to hyperspectral data. The simplest approach treats the data as an ensemble of images and compresses each image independently, ignoring the correlation between spectral bands. The second approach transforms the data to decorrelate the spectral bands, and then compresses the transformed data as a set of independent images. The third approach directly generalizes two-dimensional transform coding by applying a three-dimensional transform as part of the usual transform-quantize-entropy code procedure. The algorithms studied all use the discrete wavelet transform. In the first two cases, a wavelet transform coder was used for the two-dimensional compression. The third case used a three dimensional extension of this same algorithm.

Evans, Bruce↗

Communications and control for electric power systems: Power flow classification for static security assessment

This report investigates the classification of power system states using an artificial neural network model, Kohonen's self-organizing feature map. The ultimate goal of this classification is to assess power system static security in real-time. Kohonen's self-organizing feature map is an unsupervised neural network which maps N-dimensional input vectors to an array of M neurons. After learning, the synaptic weight vectors exhibit a topological organization which represents the relationship between the vectors of the training set. This learning is unsupervised, which means that the number and size of the classes are not specified beforehand. In the application developed in this report, the input vectors used as the training set are generated by off-line load-flow simulations. The learning algorithm and the results of the organization are discussed.

Niebur, D.↗

The alignment-distribution graph

Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment-distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

Chatterjee, Siddhartha↗

Satellite Proving Ground for the GOES-R Geostationary Lightning Mapper (GLM)

The key mission of the Satellite Proving Ground is to demonstrate new satellite observing data, products and capabilities in the operational environment to be ready on Day 1 to use the GOES-R suite of measurements. Algorithms, tools, and techniques must be tested, validated, and assessed by end users for their utility before they are finalized and incorporated into forecast operations. The GOES-R Proving Ground for the Geostationary Lightning Mapper (GLM) focuses on evaluating how the infusion of the new technology, algorithms, decision aids, or tailored products integrate with other available tools (weather radar and ground strike networks; nowcasting systems, mesoscale analysis, and numerical weather prediction models) in the hands of the forecaster responsible for issuing forecasts and warning products. Additionally, the testing concept fosters operation and development staff interactions which will improve training materials and support documentation development. Real-time proxy total lightning data from regional VHF lightning mapping arrays (LMA) in Northern Alabama, Central Oklahoma, Cape Canaveral Florida, and the Washington, DC Greater Metropolitan Area are the cornerstone for the GLM Proving Ground. The proxy data will simulate the 8 km Event, Group and Flash data that will be generated by GLM. Tailored products such as total flash density at 1-2 minute intervals will be provided for display in AWIPS-2 to select NWS forecast offices and national centers such as the Storm Prediction Center. Additional temporal / spatial combinations are being investigated in coordination with operational needs and case-study proxy data and prototype visualizations may also be generated from the NASA heritage Lightning Imaging Sensor and Optical Transient Detector data. End users will provide feedback on the utility of products in their operational environment, identify use cases and spatial/temporal scales of interest, and provide feedback to the developers for adjusted or new products.

Goodman, Steven J.↗

Thermal Transport Model for Heat Sink Design

A document discusses the development of a finite element model for describing thermal transport through microcalorimeter arrays in order to assist in heat-sinking design. A fabricated multi-absorber transition edge sensor (PoST) was designed in order to reduce device wiring density by a factor of four. The finite element model consists of breaking the microcalorimeter array into separate elements, including the transition edge sensor (TES) and the silicon substrate on which the sensor is deposited. Each element is then broken up into subelements, whose surface area subtends 10 10 microns. The heat capacity per unit temperature, thermal conductance, and thermal diffusivity of each subelement are the model inputs, as are the temperatures of each subelement. Numerical integration using the Finite in Time Centered in Space algorithm of the thermal diffusion equation is then performed in order to obtain a temporal evolution of the subelement temperature. Thermal transport across interfaces is modeled using a thermal boundary resistance obtained using the acoustic mismatch model. The document concludes with a discussion of the PoST fabrication. PoSTs are novel because they enable incident x-ray position sensitivity with good energy resolution and low wiring density.

Chervenak, James A.↗

Data Sets for Evaluation of Building Fault Detection and Diagnostics Algorithms

This documentation and dataset can be used to test the performance of automated fault detection and diagnostics algorithms for buildings. The dataset was created by LBNL, PNNL, NREL, ORNL and ASHRAE RP-1312 (Drexel University). It includes data for air-handling units and rooftop units simulated with PNNL's large office building model.

AHU↗

Physical Layer Security at a Point-to-Point MIMO System With 1-Bit DACs and ADCs

Low-resolution converters reduce the power consumption of wireless devices and help enable large energy-efficient arrays. In this letter, we evaluate the secrecy rate for the extreme case of 1-bit single-user multiple-input multiple-output systems following two signaling approaches. In the first method, the system uses discrete signaling. In the second, the system combines Gaussian signaling with artificial noise alongside power allocation. In the first case, we give a closed-form expression of the secrecy rate and propose an algorithm that provides near-optimal results for low signal-to-noise ratios (SNRs). Further, in the second scenario, depending on the channel state information, we suggest different precoding plans and derive a secrecy rate lower bound. At low SNR, power is allocated to the main signal. Only at high SNR is optimal power allocation effective. Moreover, knowing the eavesdropper channel greatly improves the system’s secrecy.

1-bit digital-to-analog (DAC) and analog-to-digita↗

Use of polarimetric radar measurements to constrain simulated convective cell evolution: a pilot study with Lagrangian tracking

Abstract. To probe the potential value of a radar-driven field campaign to constrain simulation of isolated convection subject to a strong aerosol perturbation, convective cells observed by the operational KHGX weather radar in the vicinity of Houston, Texas, are examined individually and statistically. Cells observed in a single case study of onshore flow conditions during July 2013 are first examined and compared with cells in a regional model simulation. Observed and simulated cells are objectively identified and tracked from observed or calculated positive specific differential phase ( K DP ) above the melting level, which is related to the presence of supercooled liquid water. Several observed and simulated cells are subjectively selected for further examination. Below the melting level, we compare sequential cross sections of retrieved and simulated raindrop size distribution parameters. Above the melting level, we examine time series of K DP and radar differential reflectivity ( Z DR ) statistics from observations and calculated from simulated supercooled rain properties, alongside simulated vertical wind and supercooled rain mixing ratio statistics. Results indicate that the operational weather radar measurements offer multiple constraints on the properties of simulated convective cells, with substantial value added from derived K DP and retrieved rain properties. The value of collocated three-dimensional lightning mapping array measurements, which are relatively rare in the continental US, supports the choice of Houston as a suitable location for future field studies to improve the simulation and understanding of convective updraft physics. However, rapid evolution of cells between routine volume scans motivates consideration of adaptive scan strategies or radar imaging technologies to amend operational weather radar capabilities. A 3-year climatology of isolated cell tracks, prepared using a more efficient algorithm, yields additional relevant information. Isolated cells are found within the KHGX domain on roughly 40&thinsp;% of days year-round, with greatest concentration in the northwest quadrant, but roughly 5-fold more cells occur during June through September. During this enhanced occurrence period, the cells initiate following a strong diurnal cycle that peaks in the early afternoon, typically follow a south-to-north flow, and dissipate within 1&thinsp;h, consistent with the case study examples. Statistics indicate that ~ &thinsp;150 isolated cells initiate and dissipate within 70&thinsp;km of the KHGX radar during the enhanced occurrence period annually, and roughly 10 times as many within 200&thinsp;km, suitable for multi-instrument Lagrangian observation strategies. In addition to ancillary meteorological and aerosol measurements, robust vertical wind speed retrievals would add substantial value to a radar-driven field campaign.

54 ENVIRONMENTAL SCIENCES↗

Remote Observing with the Keck Telescope Using the ACTS Satellite

As a technical demonstration project for the NASA Advanced Communications Technology Satellite (ACTS), we have implemented remote observing on the 10-meter Keck II telescope on Mauna Kea in Hawaii from the California Institute of Technology campus in Pasadena. The data connection consists of optical fiber networks in Hawaii and California, connecting the end-points to high data rate (HDR) ACTS satellite antennae at JPL in Pasadena and at the Tripler Army Medical Center in Honolulu. The terrestrial fiber networks run the asynchronous transfer mode (ATM) protocol at DS-3 (45 Mbit/sec) speeds, providing ample bandwidth to enable remote observing with a software environment identical to that used for on-site observing in Hawaii. This experiment has explored the data requirements of remote observing with a modern research telescope and large-format detector arrays. While the maximum burst data rates are lower than those required for many other applications (e.g., HDTV), the network reliability and data integrity requirements are critical. As we show in this report, the former issue particularly may be the greatest challenge for satellite networks for this class of application. We have also experimented with the portability of standard TCP/IP applications to satellite networks, demonstrating the need for alternative TCP congestion algorithms and minimization of bit error rates (BER). Reliability issues aside, we have demonstrated that true remote observing over high-speed networks provides several important advantages over standard observing paradigms. Technical advantages of the high-speed network access include more rapid download of data to a user's home institution and the opportunity for alternative communication facilities between members of an observing team, such as audio- and videoconferencing.

SATELLITE COMMUNICATIONS↗

Use of Polarimetric Radar Measurements to Constrain Simulated Convective Cell Evolution: A Pilot Study with Lagrangian Tracking

To probe the potential value of a radar-driven field campaign to constrain simulation of isolated convection subject to a strong aerosol perturbation, convective cells observed by the operational KHGX weather radar in the vicinity of Houston, Texas, are examined individually and statistically. Cells observed in a single case study of onshore flow conditions during July 2013 are first examined and compared with cells in a regional model simulation. Observed and simulated cells are objectively identified and tracked from observed or calculated positive specific differential phase (K(sub DP)) above the melting level, which is related to the presence of supercooled liquid water. Several observed and simulated cells are subjectively selected for further examination. Below the melting level, we compare sequential cross sections of retrieved and simulated raindrop size distribution parameters. Above the melting level, we examine time series of KDP and radar differential reflectivity (Z(sub DR)) statistics from observations and calculated from simulated supercooled rain properties, alongside simulated vertical wind and supercooled rain mixing ratio statistics. Results indicate that the operational weather radar measurements offer multiple constraints on the properties of simulated convective cells, with substantial value added from derived K(sub DP) and retrieved rain properties. The value of collocated three-dimensional lightning mapping array measurements, which are relatively rare in the continental US, supports the choice of Houston as a suitable location for future field studies to improve the simulation and understanding of convective updraft physics. However, rapid evolution of cells between routine volume scans motivates consideration of adaptive scan strategies or radar imaging technologies to amend operational weather radar capabilities. A 3-year climatology of isolated cell tracks, prepared using a more efficient algorithm, yields additional relevant information. Isolated cells are found within the KHGX domain on roughly 40 % of days year-round, with greatest concentration in the northwest quadrant, but roughly 5-fold more cells occur during June through September. During this enhanced occurrence period, the cells initiate following a strong diurnal cycle that peaks in the early afternoon, typically follow a south-to-north flow, and dissipate within 1 h, consistent with the case study examples. Statistics indicate that ∼ 150 isolated cells initiate and dissipate within 70 km of the KHGX radar during the enhanced occurrence period annually, and roughly 10 times as many within 200 km, suitable for multi-instrument Lagrangian observation strategies. In addition to ancillary meteorological and aerosol measurements, robust vertical wind speed retrievals would add substantial value to a radar-driven field campaign.

Fridlind, Ann M.↗

Analysis of GPU Data Access Patterns on Complex Geometries for the D3Q19 Lattice Boltzmann Algorithm

GPU performance of the lattice Boltzmann method (LBM) depends heavily on memory access patterns. When implemented with GPUs on complex domains, typically, geometric data is accessed indirectly and lattice data is accessed lexicographically. Although there are a variety of other options, no study has examined the relative efficacy between them. Here, we examine a suite of memory access schemes via empirical testing and performance modeling. We find strong evidence that semi-direct is often better suited than the more common indirect addressing, providing increased computational speed and reducing memory consumption. For the layout, we find that the Collected Structure of Arrays (CSoA) and bundling layouts outperform the common Structure of Array layout; on V100 and P100 devices, CSoA consistently outperforms bundling, however the relationship is more complicated on K40 devices. When compared to state-of-the-art practices, our recommendations lead to speedups of 10–40 percent and reduce memory consumption up to 17 percent. Using performance modeling and computational experimentation, we determine the mechanisms behind the accelerations. We demonstrate that our results hold across multiple GPUs on two leadership class systems, and present the first near-optimal strong results for LBM with arterial geometries run on GPUs.

42 ENGINEERING↗

A Data Science and Machine Learning Platform Supporting Large Particle Accelerator Control and Diagnostics Applications Final Report: SBIR Initial Phase II DE-SC0022583

The Machine Learning Data Platform (MLDP) is a product providing full-stack support for data science, Machine Learning, and Artificial Intelligence (ML/AI) applications at particle accelerator and large experimental physics facilities. It supports ML/AI applications from front-end, high-speed acquisition of heterogeneous, time-series data, through data archiving and management, to back-end analysis. The MLDP embodies a “data-science ready” platform for data analysis and ML/AI applications in diagnosis, modelling, control, and optimization of these facilities. It provides data scientists and applications a consistent, datacentric interface to archive data standardizing implementation and deployment of ML/AI algorithms to different operations configurations within the same facility, or between facilities. Being an open-source, public-domain project, the MLDP is intended for broadest possible impact by increasing accessibility and minimizing the required expertise for installation and operation. The MLDP can also be deployed at user facilities for experimental data collection, archiving, and analysis. It is capable of acquisition and archiving of heterogeneous data from experimental equipment (e.g., images, arrays, structures, etc.) along with system hardware configurations (e.g., scalars, tables), control system process variables, and any metadata required for provenance. Thus, the MLDP can manage experimental data through its entire lifecycle, from acquisition and archiving, through analysis and investigation, to release and final publication.

43 PARTICLE ACCELERATORS↗

Hiding the Disk and Network Latency of Out-of-Core Visualization

This paper describes an algorithm that improves the performance of application-controlled demand paging for out-of-core visualization by hiding the latency of reading data from both local disks or disks on remote servers. The performance improvements come from better overlapping the computation with the page reading process, and by performing multiple page reads in parallel. The paper includes measurements that show that the new multithreaded paging algorithm decreases the time needed to compute visualizations by one third when using one processor and reading data from local disk. The time needed when using one processor and reading data from remote disk decreased by two thirds. Visualization runs using data from remote disk actually ran faster than ones using data from local disk because the remote runs were able to make use of the remote server's high performance disk array.

Ellsworth, David↗