Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Fast counting”

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
DOE OSTI2023

Time-walk and jitter correction in SNSPDs at high count rates

Superconducting nanowire single-photon detectors (SNSPDs) are a leading detector type for time correlated single photon counting, especially in the near-infrared. When operated at high count rates, SNSPDs exhibit increased timing jitter caused by internal device properties and features of the RF amplification chain. Variations in RF pulse height and shape lead to variations in the latency of timing measurements. To compensate for this, we demonstrate a calibration method that correlates delays in detection events with the time elapsed between pulses. The increase in jitter at high rates can be largely canceled in software by applying corrections derived from the calibration process. We demonstrate our method with a single-pixel tungsten silicide SNSPD and show it decreases high count rate jitter. The technique is especially effective at removing a long tail that appears in the instrument response function at high count rates. At a count rate of 11.4 MCounts/s, we reduce the full width at 1% maximum level (FW1%M) by 45%. The method, therefore, enables certain quantum communication protocols that are rate-limited by the FW1%M metric to operate almost twice as fast.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Signal processing to reduce dark noise impact in precision timing

We introduce a technique to mitigate the effects of low frequency noise on precision timing. The example of Dark Count Noise Rate (DCR) in Silicon Photomultipliers (SiPMs) is emphasized. This technique exploits the correlation between time shifts on the leading edge of a signal and the residual slope of the baseline (due to noise) which remains after baseline subtraction. In fast timing applications (such as for Time-of-flight particle ID) the signal arrival time is typically captured on the signal leading edge. The signal risetime is often fixed by the physics of the sensor and input circuit. Then accurate pulse timing can be achieved by correcting a leading edge threshold time (depending on a slope proportional to both the Amplitude and the risetime) to a “constant fraction” time. This compensation for time walk due to amplitude fluctuations breaks down once we introduce interference from low frequency noise on the leading edge. In this paper we demonstrate that an additional measurement of the slope at threshold can be used to correct for this noise jitter.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS2016

Low-Noise Free-Running High-Rate Photon-Counting for Space Communication and Ranging

We present performance data for low-noise free-running high-rate photon counting method for space optical communication and ranging. NASA GSFC is testing the performance of two types of novel photon-counting detectors 1) a 2x8 mercury cadmium telluride (HgCdTe) avalanche array made by DRS Inc., and a 2) a commercial 2880-element silicon avalanche photodiode (APD) array. We successfully measured real-time communication performance using both the 2 detected-photon threshold and logic AND-gate coincidence methods. Use of these methods allows mitigation of dark count, after-pulsing and background noise effects without using other method of Time Gating The HgCdTe APD array routinely demonstrated very high photon detection efficiencies ((is) greater than 50%) at near infrared wavelength. The commercial silicon APD array exhibited a fast output with rise times of 300 ps and pulse widths of 600 ps. On-chip individually filtered signals from the entire array were multiplexed onto a single fast output. NASA GSFC has tested both detectors for their potential application for space communications and ranging. We developed and compare their performances using both the 2 detected photon threshold and coincidence methods.

Photons↗
DOE OSTI2025

Super-Resolution Ptychography with Small Segmented Detectors

To overcome the spatial resolution limit set by aperture-limited diffraction in traditional scanning transmission electron microscopy, microscopists have developed ptychography enabled by iterative phase retrieval algorithms and high-dynamic-range pixel array detectors. Current detector designs are limited by the data rate off chip, so a high-pixel-count detector has a proportionally lower frame rate than the few-segment detectors used for differential phase contrast (DPC) imaging. This slower acquisition speed leads to heightened vulnerability to scan noise, drift, and potential sample damage. This creates opportunities for repurposing fast segmented detectors for ptychography by trading a reduction in reciprocal space pixels for an increase in real space pixels. Here, we explore a strategy of oversampling in real space and instead apply detector pixel upsampling during the reconstruction process. Further, we demonstrate the viability of achieving super-resolution ptychography on thin objects using only 2 × 2 detector pixels, surpassing the resolution of integrated DPC (iDPC) imaging. With optimization using simulated datasets and experiments on MoTe 2 /WSe 2 bilayer moiré superlattices, we achieved super-resolution ptychography reconstructions under rapid acquisition conditions (37.5 pA, 1 μs dwell time), yielding over 50% improvements in contrast and information limit compared to annular dark field and iDPC imaging on the same detectors.

2D materials↗
DOE OSTI2023

FAST Drift Scan Survey for Ηι Intensity Mapping: I. Preliminary Data Analysis

This work presents the initial results of the drift-scan observation for the neutral hydrogen (Hi) intensity mapping survey with the Five-hundred-meter Aperture Spherical radio Telescope (FAST). The data analyzed in this work were collected in night observations from 2019 through 2021. The primary findings are based on 28 hr of drift-scan observation carried out over 7 nights in 2021, which covers 60 deg 2 sky area. Our main findings are, first, our calibration strategy can successfully correct both the temporal and bandpass gain variation over the 4 hr drift-scan observation. Second, the continuum maps of the surveyed region are made with frequency resolution of 28 kHz and pixel area of $_{2.95\,{\mathrm{arcmin}}^{2}}$. The pixel noise levels of the continuum maps are slightly higher than the forecast assuming $T$ sys = 20 K, which are 36.0 mK (for 10.0 s integration time) at the 1050–1150 MHz band, and 25.9 mK (for 16.7 s integration time) at the 1323–1450 MHz band, respectively. Third, the flux-weighted differential number count is consistent with the NRAO-VLA Sky Survey (NVSS) catalog down to the confusion limit ~7 mJy beam –1 . Finally, the continuum flux measurements of the sources are consistent with those found in the literature. The difference in the flux measurement of 81 isolated NVSS sources is about 6.3%. Our research offers a systematic analysis for the FAST Hi intensity mapping drift-scan survey and serves as a helpful resource for further cosmology and associated galaxies sciences with the FAST drift-scan survey.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2014

NuSTAR J163433-4738.7: A Fast X-Ray Transient in the Galactic Plane

During hard X-ray observations of the Norma spiral arm region by the Nuclear Spectroscopic Telescope Array (NuSTAR) in 2013 February, a new transient source, NuSTAR J163433-4738.7, was detected at a significance level of 8sigma in the 3-10 keV bandpass. The source is consistent with having a constant NuSTAR count rate over a period of 40 ks and is also detected simultaneously by Swift at lower significance. The source is not significantly detected by NuSTAR, Swift, or Chandra in the days before or weeks after the discovery of the transient, indicating that the strong X-ray activity lasted between approx. 0.5 and 1.5 days. Near-infrared imaging observations were carried out before and after the X-ray activity, but we are not able to identify the counterpart. The combined NuSTAR and Swift energy spectrum is consistent with a power law with a photon index of Gamma = 4.1(+1.5/−1.0) (90% confidence errors), a blackbody with kT = 1.2+/-0.3 keV, or a Bremsstrahlung model with kT = 3.0(+2.1/−1.2) keV. The reduced-χ2 values for the three models are not significantly different, ranging from 1.23 to 1.44 for 8 degrees of freedom. The spectrum is strongly absorbed with NH = (2.8(+2.3/−1.4) × 10(exp23) cm(exp−2), (9(+15 /−7) ) × 10(exp22) cm(exp−2), and (1.7(+1.7/−0.9)) × 10(exp23) cm(exp−2), for the power-law, blackbody, and Bremsstrahlung models, respectively. Although the high column density could be due to material local to the source, it is consistent with absorption from interstellar material along the line of sight at a distance of 11 kpc, which would indicate an X-ray luminosity greater than 10(exp34) erg s(exp−1). Although we do not reach a definitive determination of the nature of NuSTAR J163433-4738.7, we suggest that it may be an unusually bright active binary or a magnetar.

Near-infrared imaging observations↗
DOE OSTI2025

High-Multiplicity Muon Airshower Analysis at NOvA Far Detector

We process and analyze muon airshower data from the NOvA far detector using various image processing algorithms, such as Fast Fourier Transformation, and Hough line transformation. From the processed event images, we calculate multiple parameters for our study. We are looking for physics features, including East-West Asymmetry, anisotropies in right ascension, and seasonal variation. Additionally, we have developed an algorithm to count the multiplicity of muons in the airshower events using the single muon data.

Lima, Aklima Khanam [Syracuse U.]↗
DOE OSTI2021

81-beam coherent combination using a programmable array generator

We have generated 81 independently controllable beams using a spatial light modulator and combined them on a diffractive combiner, to characterize the combiner and develop a fast phase error detection scheme. A key parameter of the diffractive combiner is measured in a new way, enabling an efficient combination when programming calibrated phases of each beam. This testbed provides a platform for development of advanced feedback phase control of high channel-count beam combination.

Du, Qiang (ORCID:0000000221969801)↗
DOE OSTI2024

Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks

There has been much recent interest in designing symmetry-aware neural networks (NNs) exhibiting relaxed equivariance. Such NNs aim to interpolate between being exactly equivariant and being fully flexible, affording consistent performance benefits. In a separate line of work, certain structured parameter matrices -- those with displacement structure, characterized by low displacement rank (LDR) -- have been used to design small-footprint NNs. Displacement structure enables fast function and gradient evaluation, but permits accurate approximations via compression primarily to classical convolutional neural networks (CNNs). In this work, we propose a general framework -- based on a novel construction of symmetry-based structured matrices -- to build approximately equivariant NNs with significantly reduced parameter counts. Our framework integrates the two aforementioned lines of work via the use of so-called Group Matrices (GMs), a forgotten precursor to the modern notion of regular representations of finite groups. GMs allow the design of structured matrices -- resembling LDR matrices -- which generalize the linear operations of a classical CNN from cyclic groups to general finite groups and their homogeneous spaces. We show that GMs can be employed to extend all the elementary operations of CNNs to general discrete groups. Further, the theory of structured matrices based on GMs provides a generalization of LDR theory focussed on matrices with cyclic structure, providing a tool for implementing approximate equivariance for discrete groups. We test GM-based architectures on a variety of tasks in the presence of relaxed symmetry. We report that our framework consistently performs competitively compared to approximately equivariant NNs, and other structured matrix-based compression frameworks, sometimes with a one or two orders of magnitude lower parameter count.

Samudre, Ashwin↗
DOE OSTI2020

Electron image contrast analysis of mosaicity in rutile nanocrystals using direct electron detection

Direct electron detection provides high detective quantum efficiency, significantly improved point spread function and fast read-out which have revolutionized the field of cryogenic electron microscopy. However, these benefits for high-resolution electron microscopy (HREM) are much less exploited, especially for in situ study where major impacts on crystallographic structural studies could be made. By using direct detection in electron counting mode, rutile nanocrystals have been imaged at high temperature inside an environmental transmission electron microscope. The improvements in image contrast are quantified by comparison with a charge-coupled device (CCD) camera and by image matching with simulations using an automated approach based on template matching. Together, these approaches enable a direct measurement of 3D shape and mosaicity (~1°) of a vacuum-reduced TiO 2 nanocrystal about 50 nm in size. Thus, this work demonstrates the possibility of quantitative HREM image analysis based on direct electron detection.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Godiva IV central cavity neutron environment characterization with threshold neutron detectors

Godiva IV is a cylindrical fast burst reactor comprised of approximately 65 kg of highly enriched uranium that is operated by Los Alamos National Laboratory and sited at the National Criticality Experiments Research Center at the Nevada National Security Site in Nevada in the United States. Godiva IV is typically operated at delayed critical and in the regime spanning from sub-prompt to super-prompt bursts. Godiva IV is used for sample irradiations, criticality safety demonstrations, dosimetry studies, and for studying super-prompt behavior. In preparation for both an upcoming experiment to reduce uncertainties in the prompt fission spectrum for 235U using threshold neutron detectors, and for future research using Godiva IV, it was desired to exercise the process of the selection of threshold neutron detectors/activation foils, radiation metrology, and the subsequent adjustment of the neutron spectrum. For this exercise, nine high purity threshold neutron detectors/activation foils were irradiated in a Godiva IV burst. The foils were then analyzed using a high-purity germanium detector in the NCERC counting laboratory to determine end of irradiation specific activities for available IRDFF-II reactions. This work summarizes the Godiva IV foil irradiation, radiation metrology results, and adjusted neutron spectrum. The results of this exercise ultimately characterized the neutron environment inside the sample irradiation cavity inside Godiva IV to a higher degree than previously performed, informed decisions for the upcoming larger scale experiment, and will inform future neutron spectrum characterizations at NCERC.

Whitman, Nicholas H.↗
DOE OSTI2020

Accelerating quantum optics experiments with statistical learning

Quantum optics experiments, involving the measurement of low-probability photon events, are known to be extremely time-consuming. We present a methodology for accelerating such experiments using physically motivated ansatzes together with simple statistical learning techniques such as Bayesian maximum a posteriori estimation based on few-shot data. We show that it is possible to reconstruct time-dependent data using a small number of detected photons, allowing for fast estimates in under a minute and providing a one-to-two order of magnitude speed-up in data acquisition time. We test our approach using real experimental data to retrieve the second order intensity correlation function, G (2) ($τ$), as a function of time delay τ between detector counts, for thermal light as well as anti-bunched light emitted by a quantum dot driven by periodic laser pulses. The proposed methodology has a wide range of applicability and has the potential to impact the scientific discovery process across a multitude of domains.

36 MATERIALS SCIENCE↗
NASA NTRS1992

On fast carry select adders

This paper presents an architecture for a high-speed carry select adder with very long bit lengths utilizing a conflict-free bypass scheme. The proposed scheme has almost half the number of transistors and is faster than a conventional carry select adder. A comparative study is also made between the proposed adder and a Manchester carry chain adder which shows that the proposed scheme has the same transistor count, without suffering any performance degradation, compared to the Manchester carry chain adder.

Shamanna, M.↗
DOE OSTI2020

Advanced Mixing Condensation Particle Counter (aMCPC) Instrument Handbook

The U.S. Department of Energy Atmospheric Radiation Measurement (ARM) user facility’s aerosol counting, composition, extinction, and sizing system (ACCESS) includes a base module (9400), a filter sampler (9401), an advanced mixing condensation particle counter (aMCPC, 9403), a miniaturized optical practical counter (MOPC, 9405), and a single-channel tricolor absorption photometer (STAP, 9406). This handbook focuses on the aMCPC, which measures the ultra-fast total aerosol particle number concentration at 180 ms response rate with a detection diameter (D 50 = 7 nm).

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1993

Detection of a long-duration solar gamma-ray flare on June 11, 1991 with EGRET on COMPTON-GRO

The detection of high energy photon emission from a long-duration solar gamma-ray flare on June 11, 1991 is reported. Gamma rays were detected up to energies above 1 GeV. The solar origin of this emission is assured by the time profile of the gamma-ray count rate and by time-resolved sky maps, which show a clear maximum at the position of the sun. There are indications for a spectral evolution with time, such that the emission below 100 MeV fades away earlier than the 100-300 MeV radiation, roughly on the time scale of the fast component. The spectrum of the flare can be well fitted with a composite of a proton generated pi exp 0 spectrum and an electron bremsstrahlung component. The latter can be identified with the fast decaying component of the lightcurve.

Kanbach, G.↗
DOE OSTI2024

GPU-enabled extreme-scale turbulence simulations: Fourier pseudo-spectral algorithms at the exascale using OpenMP offloading

Fourier pseudo-spectral methods for nonlinear partial differential equations are of wide interest in many areas of advanced computational science, including direct numerical simulation of three-dimensional (3-D) turbulence governed by the Navier-Stokes equations in fluid dynamics. This paper presents a new capability for simulating turbulence at a new record resolution up to 35 trillion grid points, on the world's first exascale computer, Frontier, comprising AMD MI250x GPUs with HPE's Slingshot interconnect and operated by the US Department of Energy's Oak Ridge Leadership Computing Facility (OLCF). Key programming strategies designed to take maximum advantage of the machine architecture involve performing almost all computations on the GPU which has the same memory capacity as the CPU, performing all-to-all communication among sets of parallel processes directly on the GPU, and targeting GPUs efficiently using OpenMP offloading for intensive number-crunching including 1-D Fast Fourier Transforms (FFT) performed using AMD ROCm library calls. With 99% of computing power on Frontier being on the GPU, leaving the CPU idle leads to a net performance gain via avoiding the overhead of data movement between host and device except when needed for some I/O purposes. Memory footprint including the size of communication buffers for MPI_ALLTOALL is managed carefully to maximize the largest problem size possible for a given node count. Detailed performance data including separate contributions from different categories of operations to the elapsed wall time per step are reported for five grid resolutions, from 2048 3 on a single node to 32768 3 on 4096 or 8192 nodes out of 9408 on the system. Both 1D and 2D domain decompositions which divide a 3D periodic domain into slabs and pencils respectively are implemented. The present code suite (labeled by the acronym GESTS, GPUs for Extreme Scale Turbulence Simulations) achieves a figure of merit (in grid points per second) exceeding goals set in the Center for Accelerated Application Readiness (CAAR) program for Frontier. The performance attained is highly favorable in both weak scaling and strong scaling, with notable departures only for 2048 3 where communication is entirely intra-node, and for 32768 3 , where a challenge due to small message sizes does arise. Communication performance is addressed further using a lightweight test code that performs all-to-all communication in a manner matching the full turbulence simulation code. Performance at large problem sizes is affected by both small message size due to high node counts as well as dragonfly network topology features on the machine, but is consistent with official expectations of sustained performance on Frontier. Overall, although not perfect, the scalability achieved at the extreme problem size of 32768 3 (and up to 8192 nodes — which corresponds to hardware rated at just under 1 exaflop/sec of theoretical peak computational performance) is arguably better than the scalability observed using prior state-of-the-art algorithms on Frontier's predecessor machine (Summit) at OLCF. New science results for the study of intermittency in turbulence enabled by this code and its extensions are to be reported separately in the near future.

3D fast Fourier transform↗