Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multiple iterations”

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 271 records · Page 15

Evolution of the Next Exploration Toilet Through Human-in-the-Loop (HITL) Testing

Human waste collection in space is a unique and necessary function that all crewmembers must perform. The variability in how each crewmember uses the toilet to urinate and defecate introduces complexities and challenges with regards to overall hardware design. Because of this variability, it is important to consider crew inputs in all aspects of a toilet design especially with regards to crew interfaces that could impact overall waste collection. Access to crew feedback is essential to the design process and should be considered early and often through the various design phases. In 2020, NASA started a project for the Human Landing System (HLS) program to develop a Government Furnished Equipment (GFE) toilet option. The project is known as the Lavatory On-Orbit (LOO). During the early development of the LOO, the project team conducted several crew evaluations to collect and summarize valuable crew feedback on system design, function, and overall usability to influence the next design iteration. Because every person could use the system differently in space, it was extremely important to collect and analyze the data in a very methodical manner to appropriately influence the design based on the evaluation results. Establishing a standard process ensures consistent data collection from one evaluation to another, helps to maintain privacy for each test subject’s inputs and removes any potential bias from test subject to test subject. To date, the team has completed four rounds of crew evaluations with multiple crewmembers on prototypes for the different LOO subsystems. This paper will summarize the methodology used to conduct the evaluations as well as how data was collected and analyzed. The paper will also provide details on each of the evaluations and how the design was updated based on the results.

toilet↗

Evolution of the Next Exploration Toilet Through Human-in-the-Loop (HITL) Testing

Human waste collection in space is a unique and necessary function that all crewmembers must perform. The variability in how each crewmember uses the toilet to urinate and defecate introduces complexities and challenges with regards to overall hardware design. Because of this variability, it is important to consider crew inputs in all aspects of a toilet design especially with regards to crew interfaces that could impact overall waste collection. Access to crew feedback is essential to the design process and should be considered early and often through the various design phases. In 2020, NASA started a project for the Human Landing System (HLS) program to develop a Government Furnished Equipment (GFE) toilet option. The project is known as the Lavatory On-Orbit (LOO). During the early development of the LOO, the project team conducted several crew evaluations to collect and summarize valuable crew feedback on system design, function, and overall usability to influence the next design iteration. Because every person could use the system differently in space, it was extremely important to collect and analyze the data in a very methodical manner to appropriately influence the design based on the evaluation results. Establishing a standard process ensures consistent data collection from one evaluation to another, helps to maintain privacy for each test subject’s inputs and removes any potential bias from test subject to test subject. To date, the team has completed four rounds of crew evaluations with multiple crewmembers on prototypes for the different LOO subsystems. This paper will summarize the methodology used to conduct the evaluations as well as how data was collected and analyzed. The paper will also provide details on each of the evaluations and how the design was updated based on the results.

toilet↗

A Framework for Robust Multivariable Optimization of Integrated Circuits in Space Applications

Application Specific Integrated Circuit (ASIC) design for space applications involves multiple challenges of maximizing performance, minimizing power and ensuring reliable operation in extreme environments. This is a complex multidimensional optimization problem which must be solved early in the development cycle of a system due to the time required for testing and qualification severely limiting opportunities to modify and iterate. Manual design techniques which generally involve simulation at one or a small number of corners with a very limited set of simultaneously variable parameters in order to make the problem tractable are inefficient and not guaranteed to achieve the best possible results within the performance envelope defined by the process and environmental requirements. What is required is a means to automate design parameter variation, allow the designer to specify operational constraints and performance goals, and to analyze the results in a way which facilitates identifying the tradeoffs defining the performance envelope over the full set of process and environmental corner cases. The system developed by the Mixed Signal ASIC Group (MSAG) at the Goddard Space Flight Center is implemented as framework of software modules, templates and function libraries. It integrates CAD tools and a mathematical computing environment, and can be customized for new circuit designs with only a modest amount of effort as most common tasks are already encapsulated. Customization is required for simulation test benches to determine performance metrics and for cost function computation. Templates provide a starting point for both while toolbox functions minimize the code required. Once a test bench has been coded to optimize a particular circuit, it is also used to verify the final design. The combination of test bench and cost function can then serve as a template for similar circuits or be re-used to migrate the design to different processes by re-running it with the new process specific device models. The system has been used in the design of time to digital converters for laser ranging and time-of-flight mass spectrometry to optimize analog, mixed signal and digital circuits such as charge sensitive amplifiers, comparators, delay elements, radiation tolerant dual interlocked (DICE) flip-flops and two of three voter gates.

DuMonthier, Jeffrey↗

Robust Multivariable Optimization and Performance Simulation for ASIC Design

Application-specific-integrated-circuit (ASIC) design for space applications involves multiple challenges of maximizing performance, minimizing power, and ensuring reliable operation in extreme environments. This is a complex multidimensional optimization problem, which must be solved early in the development cycle of a system due to the time required for testing and qualification severely limiting opportunities to modify and iterate. Manual design techniques, which generally involve simulation at one or a small number of corners with a very limited set of simultaneously variable parameters in order to make the problem tractable, are inefficient and not guaranteed to achieve the best possible results within the performance envelope defined by the process and environmental requirements. What is required is a means to automate design parameter variation, allow the designer to specify operational constraints and performance goals, and to analyze the results in a way that facilitates identifying the tradeoffs defining the performance envelope over the full set of process and environmental corner cases. The system developed by the Mixed Signal ASIC Group (MSAG) at the Goddard Space Flight Center is implemented as a framework of software modules, templates, and function libraries. It integrates CAD tools and a mathematical computing environment, and can be customized for new circuit designs with only a modest amount of effort as most common tasks are already encapsulated. Customization is required for simulation test benches to determine performance metrics and for cost function computation.

DuMonthier, Jeffrey↗

An Automated Detection Methodology for Dry Well-Mixed Layers

The intense surface heating over arid land surfaces produces dry well-mixed layers (WML) via dry convection. These layers are characterized by nearly constant potential temperature and low, nearly constant water vapor mixing ratio. To further the study of dry WMLs, we created a detection methodology and supporting software to automate the identification and characterization of dry WMLs from multiple data sources including rawinsondes, remote sensing platforms, and model products. The software is a modular code written in Python, an open source language. Radiosondes from a network of synoptic stations in North Africa were used to develop and test the WML detection process. The detection involves an iterative decision tree that ingests a vertical profile from an input data file, performs a quality check for sufficient data density, and then searches upward through the column for successive points where the simultaneous changes in water vapor mixing ratio and potential temperature are less than the specified maxima. If points in the vertical profile meet the dry WML identification criteria, statistics are generated detailing the characteristics of each layer in the profile. At the end of the vertical profile analysis, there is an option to plot analyzed profiles in a variety of file formats. Initial results show that the detection methodology can be successfully applied across a wide variety of input data and North African environments and for all seasons. It is sensitive enough to identify dry WMLs from other types of isentropic phenomena such as subsidence layers and distinguish the current day’s dry WML from previous days.

Stephen D. Nicholls↗

Array architectures for iterative algorithms

Regular mesh-connected arrays are shown to be isomorphic to a class of so-called regular iterative algorithms. For a wide variety of problems it is shown how to obtain appropriate iterative algorithms and then how to translate these algorithms into arrays in a systematic fashion. Several 'systolic' arrays presented in the literature are shown to be specific cases of the variety of architectures that can be derived by the techniques presented here. These include arrays for Fourier Transform, Matrix Multiplication, and Sorting.

Jagadish, Hosagrahar V.↗

Decoding of DBEC-TBED Reed-Solomon codes

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256 K bit DRAM's are organized in 32 K x 8 bit-bytes. Byte-oriented codes such as Reed-Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. The paper presents a special decoding technique for double-byte-error-correcting, triple-byte-error-detecting RS codes which is capable of high-speed operation. This technique is designed to find the error locations and the error values directly from the syndrome without having to use the iterative algorithm to find the error locator polynomial.

Deng, Robert H.↗

An Algorithm for the Fitting of Planet Models to Kepler Light Curves

We describe an algorithm which fits model planetary system parameters to light curves from Kepler Mission target stars. The algorithm begins by producing an initial model of the system which is used to seed the fit,with particular emphasis on obtaining good transit timing parameters. An attempt is then made to determine whether the observed transits are more likely due to a planet or an eclipsing binary. In the event that the transits are consistent with a transiting planet, an iterative fitting process is initiated: a wavelet-based whitening filter is used to eliminate stellar variations on timescales long compared to a transit; a robust nonlinear fitter operating on the whitened light curve produces a new model of the system; and the procedure iterates until convergence upon a self-consistent whitening filter and planet model. The fitted transits are removed from the light curve anda search for additional planet candidates is performed upon the residual light curve. The fitted models are used in additional tests which identify false positive planet detections: multiple planet candidates with near-identical fitted periods are far more likely to be an eclipsing binary, for example, while target stars in which the model lightcurve is correlated with the star centroid position may indicate a background eclipsing binary, and subtraction of all model planet candidates yields a light curve of pure noise and stellar variability, which can be used to study the probability that the planet candidates result from statistical fluctuations in the data.

Exoplanet↗

The free-wake computation of rotor-body flows

In this paper a method is described for predicting the compressible, free-wake, flow about a lifting rotor-body configuration. The method is an extension of a unique vorticity embedded full-potential method used to calculate free-wake rotor hover performance. An unusual feature of this method is that it obviates the requirement for multiple grids to treat the rotor-body problem. The approach used to treat the body is similar to that used to include the rotor wake in the full potential calculation. The body is modeled as a structured circulation sheet and the strength of this sheet is determined in an iterative manner. Initially the method is tested to compute the flow past simple isolated bodies like cylinders and spheres. After a comparison of these simple computations with exact solutions this procedure is included into the HELIX-I, free-wake rotor code, to compute the flow around a rotor mounted on a large whirl tower. The effects of the tower on rotor wake geometry and load distribution are presented.

Ramachandran, K.↗

Terrestrial Single-Station Analog for Constraining the Martian Core and Deep Interior: Implications for InSight

We used a terrestrial single-station seismometer to quantify the uncertainty of InSight (INterior explorations using Seismic Investigations, Geodesy and Heat Transport) data for determining Martian core size. To mimic Martian seismicity, we formed a catalog using 917 terrestrial earthquakes, from which we randomly selected events. We stacked ScS amplitudes on modeled arrival times and searched for where ScS produced coherent seismic amplitudes. A core detection was defined by a coherent peak with small offset between predicted and user-selected arrival times. Iterating the detection algorithm with varying signal-to-noise (SNR) ranges and quantity of events determined the selection frequency of each model and quantified core depth uncertainty. Increasing the quantity of events reduced core depth uncertainty while increasing the recovery rate, while increasing event SNR had little effect. Including ScS2 multiples increased the recovery rate and reduced core depth uncertainty when we used low quantities of events. The most-frequent core depths varied by back azimuth, suggesting our method is sensitive to the presence of mantle heterogeneities. When we added 1° in source distance errors, core depth uncertainty increased by up to 11 km and recovery rates decreased by <5%. Altering epicentral distances by 25% added ~35 km of uncertainty and reduced recovery rates to <50% in some cases. From these experiments, we estimate that if InSight can detect five events with high location precision (<10% epicentral distance errors), that there is at least an 88% chance of core depth recovery using ScS alone with uncertainty in core depth approaching 18 km and decreasing as more events are located.

Marusiak, Angela G.↗

Terrestrial Single-Station Analog for Constraining the Martian Core and Deep Interior: Implications for InSight

We used a terrestrial single-station seismometer to quantify the uncertainty of InSight (INterior explorations using Seismic Investigations, Geodesy and Heat Transport) data for determining Martian core size. To mimic Martian seismicity, we formed a catalog using 917 terrestrial earthquakes, from which we randomly selected events. We stacked ScS amplitudes on modeled arrival times and searched for where ScS produced coherent seismic amplitudes. A core detection was defined by a coherent peak with small offset between predicted and user-selected arrival times. Iterating the detection algorithm with varying signal-to-noise (SNR) ranges and quantity of events determined the selection frequency of each model and quantified core depth uncertainty. Increasing the quantity of events reduced core depth uncertainty while increasing the recovery rate, while increasing event SNR had little effect. Including ScS2 multiples increased the recovery rate and reduced core depth uncertainty when we used low quantities of events. The most-frequent core depths varied by back azimuth, suggesting our method is sensitive to the presence of mantle heterogeneities. When we added 1° in source distance errors, core depth uncertainty increased by up to 11 km and recovery rates decreased by <5%. Altering epicentral distances by 25% added ~35 km of uncertainty and reduced recovery rates to <50% in some cases. From these experiments, we estimate that if InSight can detect five events with high location precision (< 10% epicentral distance errors), that there is at least an 88% chance of core depth recovery using ScS alone with uncertainty in core depth approaching 18 km and decreasing as more events are located.

Angela G Marusiak↗

Reliable use of determinants to solve nonlinear structural eigenvalue problems efficiently

The analytical derivation, numerical implementation, and performance of a multiple-determinant parabolic interpolation method (MDPIM) for use in solving transcendental eigenvalue (critical buckling or undamped free vibration) problems in structural mechanics are presented. The overall bounding, eigenvalue-separation, qualified parabolic interpolation, accuracy-confirmation, and convergence-recovery stages of the MDPIM are described in detail, and the numbers of iterations required to solve sample plane-frame problems using the MDPIM are compared with those for a conventional bisection method and for the Newtonian method of Simpson (1984) in extensive tables. The MDPIM is shown to use 31 percent less computation time than bisection when accuracy of 0.0001 is required, but 62 percent less when accuracy of 10 to the -8th is required; the time savings over the Newtonian method are about 10 percent.

Williams, F. W.↗

Task 7: ADPAC User's Manual

The overall objective of this study was to develop a 3-D numerical analysis for compressor casing treatment flowfields. The current version of the computer code resulting from this study is referred to as ADPAC (Advanced Ducted Propfan Analysis Codes-Version 7). This report is intended to serve as a computer program user's manual for the ADPAC code developed under Tasks 6 and 7 of the NASA Contract. The ADPAC program is based on a flexible multiple- block grid discretization scheme permitting coupled 2-D/3-D mesh block solutions with application to a wide variety of geometries. Aerodynamic calculations are based on a four-stage Runge-Kutta time-marching finite volume solution technique with added numerical dissipation. Steady flow predictions are accelerated by a multigrid procedure. An iterative implicit algorithm is available for rapid time-dependent flow calculations, and an advanced two equation turbulence model is incorporated to predict complex turbulent flows. The consolidated code generated during this study is capable of executing in either a serial or parallel computing mode from a single source code. Numerous examples are given in the form of test cases to demonstrate the utility of this approach for predicting the aerodynamics of modem turbomachinery configurations.

Hall, E. J.↗

ISS Double-Gimbaled CMG Subsystem Simulation Using the Agile Development Method

This paper presents an evolutionary approach in simulating a cluster of 4 Control Moment Gyros (CMG) on the International Space Station (ISS) using a common sense approach (the agile development method) for concurrent mathematical modeling and simulation of the CMG subsystem. This simulation is part of Training systems for the 21st Century simulator which will provide training for crew members, instructors, and flight controllers. The basic idea of how the CMGs on the space station are used for its non-propulsive attitude control is briefly explained to set up the context for simulating a CMG subsystem. Next different reference frames and the detailed equations of motion (EOM) for multiple double-gimbal variable-speed control moment gyroscopes (DGVs) are presented. Fixing some of the terms in the EOM becomes the special case EOM for ISS's double-gimbaled fixed speed CMGs. CMG simulation development using the agile development method is presented in which customer's requirements and solutions evolve through iterative analysis, design, coding, unit testing and acceptance testing. At the end of the iteration a set of features implemented in that iteration are demonstrated to the flight controllers thus creating a short feedback loop and helping in creating adaptive development cycles. The unified modeling language (UML) tool is used in illustrating the user stories, class designs and sequence diagrams. This incremental development approach of mathematical modeling and simulating the CMG subsystem involved the development team and the customer early on, thus improving the quality of the working CMG system in each iteration and helping the team to accurately predict the cost, schedule and delivery of the software.

Inampudi, Ravi↗

Multi-Impulse to Time Optimal Finite Burn Trajectory Conversion

A novel algorithm is presented that provides an improvement over a traditional parameter optimization method when solving time-optimal, finite-burn pseudo-rendezvous spacecraft trajectory problems. A hybrid optimization procedure is described that converts a set of multiple-impulses, representing high- or low-thrust maneuvers, to an exact time-optimal finite-burn trajectory for a thrust limited, constant exhaust velocity spacecraft. The Hybrid Method applies a control law derived from the Euler-Lagrange system of equations within the classical Indirect Method to a modern Direct Method. An iterative adjoint-control transformation and an evolving constraint vector are introduced to solve the optimal control two-point boundary value problem. This method requires no prior knowledge of the solution, which adds simplicity to the trajectory design process and aids automation. Examples are shown for low-thrust apogee raise maneuvers, non-coplanar Earth orbit transfers, and a modified Deep Space 1 low-thrust trajectory. A numerically significant improvement to objective cost is shown across all application problems compared to a traditional solution method, as well as a significant improvement to convergence speed for a select class of problems.

Joshua A Fogel↗

Elliptic integral solutions to a class of space flight optimization problems

This paper is initially concerned with the minimum-time, exoatmospheric flight of a rocket with constant thrust acceleration magnitude, as in the cases of nuclear and solar electric propulsion. Gravitational acceleration is assumed to be a constant scalar multiple of the radius vector, plus a correction term which is a given function of time. The solution to the state equations is obtained in terms of elliptic integrals. A method is presented for the solution of the two-point boundary-condition problem associated with orbital transfer. At most, the latter method requires iteration upon final time, angle of injection, and two other parameters which are bounded. An example problem is provided which involves a rocket with very low thrust and a spiraling trajectory of many revolutions, but an altitude change of only several hundred miles above the earth. Finally, the original elliptic integral solution is extended to a larger class of low and intermediate thrust problems with constant thrust magnitude, mass decreasing with time, and an inverse square gravitational force.

Andrus, J. F.↗

An analytical solution to obtain the optimum source location using multiple direction finders on a spherical surface

An analytical solution is presented for determining the optimum location of a radiating source on the surface of a sphere, given multiple bearings. The bearings are assumed to have small errors of the order of 0-10 deg. The optimum location is found by minimizing the sum of the squares of the perpendicular great-circle distances from the source to the bearing lines. This is achieved analytically through an eigenvalue approach, rather than the usual iterative, numerical approach. Bearings of different weight are taken into account by approximating the distance from each direction finder to the source. The result is general and may have wide application. Since it is simple and nearly as fast as the triangulation technique for source location, it is now used in the SUNY-Albany East Coast Lightning Detection Network to compute the optimum location for lightning in real time.

Orville, Richard E., Jr.↗

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↗