Search NASA⌕ Search

SEARCH · Search NASA

Results for “block codes”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

Conceptual design of a 10 to the 8th power bit magnetic bubble domain mass storage unit and fabrication, test and delivery of a feasibility model

The conceptual design of a highly reliable 10 to the 8th power-bit bubble domain memory for the space program is described. The memory has random access to blocks of closed-loop shift registers, and utilizes self-contained bubble domain chips with on-chip decoding. Trade-off studies show that the highest reliability and lowest power dissipation is obtained when the memory is organized on a bit-per-chip basis. The final design has 800 bits/register, 128 registers/chip, 16 chips/plane, and 112 planes, of which only seven are activated at a time. A word has 64 data bits +32 checkbits, used in a 16-adjacent code to provide correction of any combination of errors in one plane. 100 KHz maximum rotational frequency keeps power low (equal to or less than, 25 watts) and also allows asynchronous operation. Data rate is 6.4 megabits/sec, access time is 200 msec to an 800-word block and an additional 4 msec (average) to a word. The fabrication and operation are also described for a 64-bit bubble domain memory chip designed to test the concept of on-chip magnetic decoding. Access to one of the chip's four shift registers for the read, write, and clear functions is by means of bubble domain decoders utilizing the interaction between a conductor line and a bubble.

Source record↗
NASA NTRS1974

Convolutional code performance in fading channels

The performance of convolutional codes in fading channels typical of the planetary entry channel is examined in detail. Short constraint length codes are considered in conjunction with binary phase-shift-keyed (BPSK) modulation and Viterbi maximum likelihood decoding while for longer constraint length codes we consider sequential decoding utilizing both the Fano and Zigangirov-Jelinek (ZJ) algorithms. For short constraint length codes we are primarily interested in the bit error probability performance parameterized by the fading channel parameters. For longer constraint length codes interest will center on the effect of the fading channel parameters on the computational requirements of both the Fano and ZJ algorithms. In either case the effects of simple block interleaving in combatting the memory of the channel is thoroughly explored. The approach is analytic where possible otherwise resort is made to digital computer simulation.

Modestino, J. W.↗
NASA NTRS1992

Full Navier-Stokes analysis of a two-dimensional mixer/ejector nozzle for noise suppression

A three-dimensional full Navier-Stokes (FNS) analysis was performed on a mixer/ejector nozzle designed to reduce the jet noise created at takeoff by a future supersonic transport. The PARC3D computational fluid dynamics (CFD) code was used to study the flow field of the nozzle. The grid that was used in the analysis consisted of approximately 900,000 node points contained in eight grid blocks. Two nozzle configurations were studied: a constant area mixing section and a diverging mixing section. Data are presented for predictions of pressure, velocity, and total temperature distributions and for evaluations of internal performance and mixing effectiveness. The analysis provided good insight into the behavior of the flow.

Debonis, James R.↗
NASA NTRS1992

Full Navier-Stokes analysis of a two-dimensional mixer/ejector nozzle for noise suppression

A three-dimensional full Navier-Stokes (FNS) analysis was performed on a mixer/ejector nozzle designed to reduce the jet noise created at takeoff by a future supersonic transport. The PARC3D computational fluid dynamics (CFD) code was used to study the flow field of the nozzle. The grid that was used in the analysis consisted of approximately 900,000 node points contained in eight grid blocks. Two nozzle configurations were studied: a constant area mixing section and a diverging mixing section. Data are presented for predictions of pressure, velocity, and total temperature distributions and for evaluations of internal performance and mixing effectiveness. The analysis provided good insight into the behavior of the flow.

Debonis, James R.↗
NASA NTRS2009

Compressor Study to Meet Large Civil Tilt Rotor Engine Requirements

A vehicle concept study has been made to meet the requirements of the Large Civil Tilt Rotorcraft vehicle mission. A vehicle concept was determined, and a notional turboshaft engine system study was conducted. The engine study defined requirements for the major engine components, including the compressor. The compressor design-point goal was to deliver a pressure ratio of 31:1 at an inlet weight flow of 28.4 lbm/sec. To perform a conceptual design of two potential compressor configurations to meet the design requirement, a mean-line compressor flow analysis and design code were used. The first configuration is an eight-stage axial compressor. Some challenges of the all-axial compressor are the small blade spans of the rear-block stages being 0.28 in., resulting in the last-stage blade tip clearance-to-span ratio of 2.4%. The second configuration is a seven-stage axial compressor, with a centrifugal stage having a 0.28-in. impeller-exit blade span. The compressors conceptual designs helped estimate the flow path dimensions, rotor leading and trailing edge blade angles, flow conditions, and velocity triangles for each stage.

Veres, Joseph P.↗
NASA NTRS2009

Compressor Study to Meet Large Civil Tilt Rotor Engine Requirements

A vehicle concept study has been made to meet the requirements of the Large Civil Tilt Rotorcraft vehicle mission. A vehicle concept was determined, and a notional turboshaft engine system study was conducted. The engine study defined requirements for the major engine components, including the compressor. The compressor design-point goal was to deliver a pressure ratio of 31:1 at an inlet weight flow of 28.4 lbm/sec. To perform a conceptual design of two potential compressor configurations to meet the design requirement, a mean-line compressor flow analysis and design code were used. The first configuration is an eight-stage axial compressor. Some challenges of the all-axial compressor are the small blade spans of the rear-block stages being 0.28 in., resulting in the last-stage blade tip clearance-to-span ratio of 2.4 percent. The second configuration is a seven-stage axial compressor, with a centrifugal stage having a 0.28-in. impeller-exit blade span. The compressors conceptual designs helped estimate the flow path dimensions, rotor leading and trailing edge blade angles, flow conditions, and velocity triangles for each stage.

Veres, Joseph P.↗
NASA NTRS1990

A hybrid M-algorithm/sequential decoder for convolutional and trellis codes

The Viterbi Algorithm (VA) is optimum in the sense of being maximum likelihood for decoding codes with a trellis structure. However, since the VA is in fact an exhaustive search of the code trellis, the complexity of the VA grows exponentially with the constraint length upsilon. This limits its application to codes with small values of upsilon and relatively modest coding gains. The M-Algorithm (MA) is a limited search scheme which carries forward M paths in the trellis, all of the same length. All successors of the M paths are extended at the next trellis depth, and all but the best M of these are dropped. Since a limited search convolutional decoder will flounder indefinitely if one of the paths in storage is not the correct one, the data are usually transmitted in blocks. It has been shown that the performance of the MA approaches the VA at high signal to noise ratios (SNR's) with an M which is far less than the 2 sup upsilon states in the full trellis. Thus the MA can be used with larger values of upsilon, making larger coding gains possible at high SNR's. However, it still requires a relatively large fixed computational effort to achieve good performance.

Wang, Fu-Quan↗
NASA NTRS1976

Performance of convolutionally encoded noncoherent MFSK modem in fading channels

The performance of a convolutionally encoded noncoherent multiple-frequency shift-keyed (MFSK) modem utilizing Viterbi maximum-likelihood decoding and operating on a fading channel is described. Both the lognormal and classical Rician fading channels are considered for both slow and time-varying channel conditions. Primary interest is in the resulting bit error rate as a function of the ratio between the energy per transmitted information bit and noise spectral density, parameterized by both the fading channel and code parameters. Fairly general upper bounds on bit error probability are provided and compared with simulation results in the two extremes of zero and infinite channel memory. The efficacy of simple block interleaving in combatting channel memory effects are thoroughly explored. Both quantized and unquantized receiver outputs are considered.

Modestino, J. W.↗
NASA NTRS1995

A seismic data compression system using subband coding

This article presents a study of seismic data compression techniques and a compression algorithm based on subband coding. The algorithm includes three stages: a decorrelation stage, a quantization stage that introduces a controlled amount of distortion to allow for high compression ratios, and a lossless entropy coding stage based on a simple but efficient arithmetic coding method. Subband coding methods are particularly suited to the decorrelation of nonstationary processes such as seismic events. Adaptivity to the nonstationary behavior of the waveform is achieved by dividing the data into separate blocks that are encoded separately with an adaptive arithmetic encoder. This is done with high efficiency due to the low overhead introduced by the arithmetic encoder in specifying its parameters. The technique could be used as a progressive transmission system, where successive refinements of the data can be requested by the user. This allows seismologists to first examine a coarse version of waveforms with minimal usage of the channel and then decide where refinements are required. Rate-distortion performance results are presented and comparisons are made with two block transform methods.

Kiely, A. B.↗
NASA NTRSDate not supplied

A Nonlinear Schur Complement Solver for CFD-Based Multidisciplinary Models

CFD-based multidisciplinary models are the fundamental building blocks of multidis- ciplinary design optimization frameworks. Linear and nonlinear solutions of these coupled models are difficult, especially when the Jacobian matrices represent a saddle point problem, where a block-diagonal corresponding to a discipline is non-invertible. These scenarios necessitate the use of a coupled solver algorithm such as the Newton’s method instead of the popular block Gauss– Seidel-based methods because of this non-invertible block. To address this challenge, we introduce a nonlinear Schur complement solver suitable for CFD-based multidisciplinary models. The solver leverages the specialized linear and nonlinear solvers of the CFD code, and therefore, does not require the solution of a large coupled linear system as the coupled Newton’s method. Further- more, because the solver primarily uses the specialized linear and nonlinear solvers of the CFD code, it does not suffer from the same robustness limitations as the coupled Newton’s method. In this work, we will implement this solver in NASA’s OpenMDAO framework and demonstrate its effectiveness using a CFD-based aeropropulsive model. The solver will contribute to the develop- ment of aeropropulsive design optimization and CFD-based design optimization methods with the ultimate goal of accelerating the design and integration of advanced propulsion systems.

Nonlinear Solvers↗
NASA NTRSDate not supplied

Initial Development of A Digital Twin Model for an Electrified Aircraft Propulsion Emulation Rig

In support of aviation fuel burn and emission reduction goals, NASA is pursing high-payoff research investments that promise to transform aviation. This includes investments in Electrified Aircraft Propulsion (EAP), which relies on the generation, storage, transmission, and use of electrical power for producing thrust and optimizing propulsion system efficiency. Multiple technology challenges must be addressed to unlock the full potential of EAP. This includes advances in propulsion controls, which will be vital for ensuring coordinated efficient operation of the complex integrated subsystems that comprise EAP architectures. To support EAP controls research, the NASA Glenn Research Center has developed the Hybrid Propulsion Emulation Rig (HyPER). The HyPER laboratory hardware includes shaft-mounted electric machines, power converters, power supplies, power distribution cables, and an energy storage device that can be reconfigured to represent a variety of EAP architectures. It also includes an integrated real-time computer system that hosts developed EAP control software and turbomachinery simulations. This enables the electrical system and rotating shafts of EAP designs to be implemented in actual hardware and integrated with turbomachinery simulations and system-level EAP control logic implemented in software. In this form, the HyPER laboratory provides a partially simulated, partially hardware-in-the-loop test environment enabling the initial development and evaluation of EAP control technology. A prerequisite for the development of EAP control designs is the availability of a system model that accurately reflects the operation of the electrical system hardware. To support this need, a digital twin model of the HyPER electrical system hardware is under development. This model is being coded in the MATLAB Simulink environment and uses the NASA-developed Electrical Modeling and Thermal Analysis Toolbox (EMTAT) to construct a digital twin framework. EMTAT contains generic electrical component building blocks that are simulated at turbomachinery timescales. Associated inputs and outputs allow the blocks to be combined to model complete electrical systems. The EMTAT blocks also contain adjustable internal maps and parameters that can be set to reflect the operation of a specific electrical component. For the HyPER digital twin, the settings of these EMTAT block internal maps and parameters is determined through machine learning approaches applied to characterization run data collected from the laboratory. During characterization runs the laboratory electrical system hardware is subjected to a full range of torque, speed, and power settings. Acquired data is then used to estimate EMTAT block parameters using a variety of machine learning techniques. The resulting digital twin model is found to match the operation of actual HyPER hardware with an accuracy suitable for control development purposes. It also holds promise for other applications including modeling the performance of HyPER laboratory reconfigurations and model-based anomaly detection. Planned follow-on work to automate post-processing of acquired laboratory data to update the HyPER digital twin model will also be presented and discussed.

Electrified Aircraft Propulsion↗
NASA NTRS1976

NASA-Ames three-dimensional potential flow analysis system (POTFAN) equation solver code (SOLN) version 1

A computer program known as SOLN was developed as an independent segment of the NASA-Ames three-dimensional potential flow analysis systems of linear algebraic equations. Methods used include: LU decomposition, Householder's method, a partitioning scheme, and a block successive relaxation method. Due to the independent modular nature of the program, it may be used by itself and not necessarily in conjunction with other segments of the POTFAN system.

Davis, J. E.↗
NASA NTRS1992

A CFD validation roadmap for hypersonic flows

A roadmap for computational fluid dynamics (CFD) code validation is developed. The elements of the roadmap are consistent with air-breathing vehicle design requirements and related to the important flow path components: forebody, inlet, combustor, and nozzle. Building block and benchmark validation experiments are identified along with their test conditions and measurements. Based on an evaluation criteria, recommendations for an initial CFD validation data base are given and gaps identified where future experiments would provide the needed validation data.

Marvin, Joseph G.↗
NASA NTRS1992

CFD validation experiments for hypersonic flows

A roadmap for CFD code validation is introduced. The elements of the roadmap are consistent with air-breathing vehicle design requirements and related to the important flow path components: forebody, inlet, combustor, and nozzle. Building block and benchmark validation experiments are identified along with their test conditions and measurements. Based on an evaluation criteria, recommendations for an initial CFD validation data base are given and gaps identified where future experiments could provide new validation data.

Marvin, Joseph G.↗
NASA NTRS1993

A CFD validation roadmap for hypersonic flows

A roadmap for computational fluid dynamics (CFD) code validation is developed. The elements of the roadmap are consistent with air-breathing vehicle design requirements and related to the important flow path components: forebody, inlet, combustor, and nozzle. Building block and benchmark validation experiments are identified along with their test conditions and measurements. Based on an evaluation criteria, recommendations for an initial CFD validation data base are given and gaps identified where future experiments would provide the needed validation data.

Marvin, Joseph G.↗
NASA NTRS1995

A procedure for automating CFD simulations of an inlet-bleed problem

A procedure was developed to improve the turn-around time for computational fluid dynamics (CFD) simulations of an inlet-bleed problem involving oblique shock-wave/boundary-layer interactions on a flat plate with bleed into a plenum through one or more circular holes. This procedure is embodied in a preprocessor called AUTOMAT. With AUTOMAT, once data for the geometry and flow conditions have been specified (either interactively or via a namelist), it will automatically generate all input files needed to perform a three-dimensional Navier-Stokes simulation of the prescribed inlet-bleed problem by using the PEGASUS and OVERFLOW codes. The input files automatically generated by AUTOMAT include those for the grid system and those for the initial and boundary conditions. The grid systems automatically generated by AUTOMAT are multi-block structured grids of the overlapping type. Results obtained by using AUTOMAT are presented to illustrate its capability.

Chyu, Wei J.↗
NASA NTRS2002

NAS Parallel Benchmarks I/O Version 2.4

We describe a benchmark problem, based on the Block-Tridiagonal (BT) problem of the NAS Parallel Benchmarks (NPB), which is used to test the output capabilities of high-performance computing systems, especially parallel systems. We also present a source code implementation of the benchmark, called NPBIO2.4-MPI, based on the MPI implementation of NPB, using a variety of ways to write the computed solutions to file.

Wong, Parkson↗
NASA NTRS2013

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗