SEARCH · Engineering Papers

Results for “Fixed-point numbers”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

25 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS2010

Optimized FPGA Implementation of Multi-Rate FIR Filters Through Thread Decomposition

Multirate (decimation/interpolation) filters are among the essential signal processing components in spaceborne instruments where Finite Impulse Response (FIR) filters are often used to minimize nonlinear group delay and finite-precision effects. Cascaded (multi-stage) designs of Multi-Rate FIR (MRFIR) filters are further used for large rate change ratio, in order to lower the required throughput while simultaneously achieving comparable or better performance than single-stage designs. Traditional representation and implementation of MRFIR employ polyphase decomposition of the original filter structure, whose main purpose is to compute only the needed output at the lowest possible sampling rate. In this paper, an alternative representation and implementation technique, called TD-MRFIR (Thread Decomposition MRFIR), is presented. The basic idea is to decompose MRFIR into output computational threads, in contrast to a structural decomposition of the original filter as done in the polyphase decomposition. Each thread represents an instance of the finite convolution required to produce a single output of the MRFIR. The filter is thus viewed as a finite collection of concurrent threads. The technical details of TD-MRFIR will be explained, first showing its applicability to the implementation of downsampling, upsampling, and resampling FIR filters, and then describing a general strategy to optimally allocate the number of filter taps. A particular FPGA design of multi-stage TD-MRFIR for the L-band radar of NASA's SMAP (Soil Moisture Active Passive) instrument is demonstrated; and its implementation results in several targeted FPGA devices are summarized in terms of the functional (bit width, fixed-point error) and performance (time closure, resource usage, and power estimation) parameters.

DSP↗

DOE OSTI2020

Subcritical Multiplication with a Fixed Source

In a subcritical, multiplying medium, the system multiplication describes the expected total number of neutrons created by a single source neutron. Subcriticality plays a large role in criticality safety and thus it is vital for the subcritical multiplication factor be accurate, especially as a system approaches criticality. This work examines the accuracy of calculating the system multiplication using the MCNP6.2 ® k-eigenvalue power iteration (KCODE) method when a fixed-point source is present in a multiplying medium, for near critical systems. This work compares the standard approach for calculating system multiplication, using the fixed-source calculational approach, to a new, single k-eigenvalue power iteration approach that incorporates a fixed-source component and a fission-source component into a single calculation. For the remainder of this paper, some theoretical background and numerical results for an approximate k eigenvalue approach, an accurate fixed-source approach and a new and more accurate k-eigenvalue approach to computing system multiplication are provided.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS2009

Hardware Implementation of Serially Concatenated PPM Decoder

A prototype decoder for a serially concatenated pulse position modulation (SCPPM) code has been implemented in a field-programmable gate array (FPGA). At the time of this reporting, this is the first known hardware SCPPM decoder. The SCPPM coding scheme, conceived for free-space optical communications with both deep-space and terrestrial applications in mind, is an improvement of several dB over the conventional Reed-Solomon PPM scheme. The design of the FPGA SCPPM decoder is based on a turbo decoding algorithm that requires relatively low computational complexity while delivering error-rate performance within approximately 1 dB of channel capacity. The SCPPM encoder consists of an outer convolutional encoder, an interleaver, an accumulator, and an inner modulation encoder (more precisely, a mapping of bits to PPM symbols). Each code is describable by a trellis (a finite directed graph). The SCPPM decoder consists of an inner soft-in-soft-out (SISO) module, a de-interleaver, an outer SISO module, and an interleaver connected in a loop (see figure). Each SISO module applies the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm to compute a-posteriori bit log-likelihood ratios (LLRs) from apriori LLRs by traversing the code trellis in forward and backward directions. The SISO modules iteratively refine the LLRs by passing the estimates between one another much like the working of a turbine engine. Extrinsic information (the difference between the a-posteriori and a-priori LLRs) is exchanged rather than the a-posteriori LLRs to minimize undesired feedback. All computations are performed in the logarithmic domain, wherein multiplications are translated into additions, thereby reducing complexity and sensitivity to fixed-point implementation roundoff errors. To lower the required memory for storing channel likelihood data and the amounts of data transfer between the decoder and the receiver, one can discard the majority of channel likelihoods, using only the remainder in operation of the decoder. This is accomplished in the receiver by transmitting only a subset consisting of the likelihoods that correspond to time slots containing the largest numbers of observed photons during each PPM symbol period. The assumed number of observed photons in the remaining time slots is set to the mean of a noise slot. In low background noise, the selection of a small subset in this manner results in only negligible loss. Other features of the decoder design to reduce complexity and increase speed include (1) quantization of metrics in an efficient procedure chosen to incur no more than a small performance loss and (2) the use of the max-star function that allows sum of exponentials to be computed by simple operations that involve only an addition, a subtraction, and a table lookup. Another prominent feature of the design is a provision for access to interleaver and de-interleaver memory in a single clock cycle, eliminating the multiple clock-cycle latency characteristic of prior interleaver and de-interleaver designs.

Moision, Bruce↗

NASA NTRS1998

Non-Gimbaled Antenna Pointing: Summary of Results and Analysis

There is considerable interest at this time in developing small satellites for quick-turnaround missions to investigate near-earth phenomena from space. One problem to be solved in mission planning is the means of communication between the control infrastructure in the ground segment and the satellite in the space segment. A nominal small-satellite mission design often includes an omni-directional or similar wide-pattern antenna on the satellite and a dedicated ground station for telemetry, tracking, and command support. These terminals typically provide up to 15 minutes of coverage during an orbit that is within the visibility of the ground station; however, not all orbits will pass over the ground station so that coverage gaps will exist in the data flow. To overcome this general limitation on data transmission for low-earth orbiting satellites, the Space Network (SN), operated by the National Aeronautics and Space Administration, (NASA) has been designed to transmit data to and from user satellites through the Tracking and Data Relay Satellites (TDRS) in geostationary orbit and interfacing to the White Sands Complex (WSC) in New Mexico for the data's ground entry point. The advantage of the SN over a fixed ground station is that all low-earth-satellite orbits will be within the visibility area of at least one TDRS within the SN for a large part of the orbit and the potential exists to establish a communications link if the user satellite can point an antenna in the direction of any one of the relay satellites. Within NASA, there is considerable interest in seeing that small satellite developers are aware of the advantages to the SN and that designs to include the SN are part of the satellite design. Small satellite users have not often considered using the SN because of: (1) The 26-dB link penalty differential between direct broadcast to a ground station and transmission through a TDRS to the ground; (2) The class of satellite is too small to support high-gain antennas and associated attitude control and drive electronics; (3) The class of satellites is severely weight and power limited; (4) There are perceived problems in scheduling communications for this class of user on the SN. This report addresses the potential for SN access using non-gimbaled, i.e. fixed-pointed, antennas in the design of the small satellite using modest transmission power to achieve the necessary space-to-ground transmissions. The advantage of using the SN is in the reduction of mission costs arising from using the SN infrastructure instead of a dedicated, proprietary ground station using a similar type of communications package. From the simulations and analysis presented, we will show that a modest satellite configuration can be used with the space network to achieve the data transmission goals of a number of users and thereby rival the performance achieved with proprietary ground stations. In this study, we will concentrate on the return data link (from the user satellite through a TDRS to the ground data entry point). The forward command link (from the ground data entry point through a TDRS to the user satellite) will usually be a lower data rate service and the data volume will also be considerably lower than the return link's requirement. Therefore, we assume that if the return link requirements are satisfied, then the forward link requirements can also be satisfied.

Horan, Stephen↗

DOE OSTI2021

A DG-IMEX Method for Two-moment Neutrino Transport: Nonlinear Solvers for Neutrino–Matter Coupling

Neutrino-matter interactions play an important role in core-collapse supernova (CCSN) explosions as they contribute to both lepton number and/or four-momentum exchange between neutrinos and matter, and thus act as the agent for neutrino-driven explosions. Due to the multiscale nature of neutrino transport in CCSN simulations, an implicit treatment of neutrino-matter interactions is desired, which requires solutions of coupled nonlinear systems in each step of the time integration scheme. In this paper we design and compare nonlinear iterative solvers for implicit systems with energy coupling neutrino-matter interactions commonly used in CCSN simulations. Specifically, we consider electron neutrinos and antineutrinos, which interact with static matter configurations through the Bruenn 85 opacity set. The implicit systems arise from the discretization of a nonrelativistic two-moment model for neutrino transport, which employs the discontinuous Galerkin (DG) method for phase-space discretization and an implicit-explicit (IMEX) time integration scheme. In the context of this DG-IMEX scheme, we propose two approaches to formulate the nonlinear systems — a coupled approach and a nested approach. For each approach, the resulting systems are solved with Anderson-accelerated fixedpoint iteration and Newton’s method. The performance of these four iterative solvers has been compared on relaxation problems with various degree of collisionality, as well as proto-neutron star deleptonization problems with several matter profiles adopted from spherically symmetric CCSN simulations. Here, numerical results suggest that the nested Anderson-accelerated fixed-point solver is more efficient than other tested solvers for solving implicit nonlinear systems with energy coupling neutrino-matter interactions.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Scaling and adiabaticity in a rapidly expanding gluon plasma

In this work we aim to gain qualitative insight on the far-from-equilibrium behavior of the gluon plasma produced in the early stages of a heavy-ion collision. It was recently discovered [1] that the distribution functions of quarks and gluons in QCD effective kinetic theory (EKT) exhibit self-similar “scaling” evolution with time-dependent scaling exponents long before those exponents reach their pre-hydrodynamic fixed-point values. In this work we shed light on the origin of this time-dependent scaling phenomenon in the small-angle approximation to the Boltzmann equation. We first solve the Boltzmann equation numerically and find that time-dependent scaling is a feature of this kinetic theory, and that it captures key qualitative features of the scaling of hard gluons in QCD EKT. We then proceed to study scaling analytically and semi-analytically in this equation. We find that an appropriate momentum rescaling allows the scaling distribution to be identified as the instantaneous ground state of the operator describing the evolution of the distribution function, and the approach to the scaling function is described by the decay of the excited states. That is to say, there is a frame in which the system evolves adiabatically. Furthermore, from the conditions for adiabaticity we can derive evolution equations for the time-dependent scaling exponents. In addition to the known free-streaming and BMSS fixed points, we identify a new “dilute” fixed point when the number density becomes small before hydrodynamization. Corrections to the fixed point exponents in the small-angle approximation agree quantitatively with those found previously in QCD EKT and arise from the evolution of the ratio between hard and soft scales.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

Slow scrambling and hidden integrability in a random rotor model

In this work, we analyze the out-of-time-order correlation functions of a solvable model of a large number $\textit{N}$ of $\textit{M}$-component quantum rotors coupled by Gaussian-distributed random, infinite-range exchange interactions. We focus on the growth of commutators of operators at a temperature $\textit{T}$ above the zero temperature quantum critical point separating the spin-glass and paramagnetic phases. In the large $\textit{N, M}$ limit, the squared commutators of the rotor fields do not display any exponential growth of commutators, in spite of the absence of any sharp quasiparticlelike excitations in the disorder-averaged theory. We show that in this limit, the problem is integrable and points out interesting connections to random-matrix theory. At leading order in 1/$\textit{M}$, there are no modifications to the critical behavior but an irrelevant term in the fixed-point action leads to a small exponential growth of the squared commutator. We also introduce and comment on a generalized model involving $\textit{p}$-pair rotor interactions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗