SEARCH · Engineering Papers

Results for “block”

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.

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Reduction of blocking effects for the JPEG baseline image compression standard

Transform coding has been chosen for still image compression in the Joint Photographic Experts Group (JPEG) standard. Although transform coding performs superior to many other image compression methods and has fast algorithms for implementation, it is limited by a blocking effect at low bit rates. The blocking effect is inherent in all nonoverlapping transforms. This paper presents a technique for reducing blocking while remaining compatible with the JPEG standard. Simulations show that the system results in subjective performance improvements, sacrificing only a marginal increase in bit rate.

Zweigle, Gregary C.↗

NASA NTRS1994

Maximum-likelihood soft-decision decoding of block codes using the A* algorithm

The A* algorithm finds the path in a finite depth binary tree that optimizes a function. Here, it is applied to maximum-likelihood soft-decision decoding of block codes where the function optimized over the codewords is the likelihood function of the received sequence given each codeword. The algorithm considers codewords one bit at a time, making use of the most reliable received symbols first and pursuing only the partially expanded codewords that might be maximally likely. A version of the A* algorithm for maximum-likelihood decoding of block codes has been implemented for block codes up to 64 bits in length. The efficiency of this algorithm makes simulations of codes up to length 64 feasible. This article details the implementation currently in use, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained with this implementation of the A* algorithm for several codes.

Ekroot, L.↗

NASA NTRS1995

Algorithms for the automatic generation of 2-D structured multi-block grids

Two different approaches to the fully automatic generation of structured multi-block grids in two dimensions are presented. The work aims to simplify the user interactivity necessary for the definition of a multiple block grid topology. The first approach is based on an advancing front method commonly used for the generation of unstructured grids. The original algorithm has been modified toward the generation of large quadrilateral elements. The second method is based on the divide-and-conquer paradigm with the global domain recursively partitioned into sub-domains. For either method each of the resulting blocks is then meshed using transfinite interpolation and elliptic smoothing. The applicability of these methods to practical problems is demonstrated for typical geometries of fluid dynamics.

Schoenfeld, Thilo↗

NASA NTRS1995

Automatic multi-block grid generation for high-lift configuration wings

A new method for automatic multi-block grid generation is described. The method combines the Modified Advancing Front Method as a Predictor with an elliptic scheme as a corrector. It advances a collection of cells by one cell height in the outward direction using Modified Advancing Front Method, and then corrects newly-obtained cell positions by solving elliptic equations. This predictor-corrector type scheme is repeatedly applied until the field of interest is filled with hexahedral grid cells. Given the configuration surface grid, the scheme produces block layouts as well as grid cells with overall smoothness as its output. The present method saves human-time and reduces the burden on the user in generating grids for general 3-D configurations. It was used to generate multi-block grids for wings in their high-lift configuration.

Kim, Byoungsoo↗

NASA NTRS1995

Carbon-carbon cylinder block

A lightweight cylinder block composed of carbon-carbon is disclosed. The use of carbon-carbon over conventional materials, such as cast iron or aluminum, reduces the weight of the cylinder block and improves thermal efficiency of the internal combustion reciprocating engine. Due to the negligible coefficient of thermal expansion and unique strength at elevated temperatures of carbon-carbon, the piston-to-cylinder wall clearance can be small, especially when the carbon-carbon cylinder block is used in conjunction with a carbon-carbon piston. Use of the carbon-carbon cylinder has the effect of reducing the weight of other reciprocating engine components allowing the piston to run at higher speeds and improving specific engine performance.

Ransone, Philip O.↗

NASA NTRS1996

Soft-decision decoding techniques for linear block codes and their error performance analysis

The first paper presents a new minimum-weight trellis-based soft-decision iterative decoding algorithm for binary linear block codes. The second paper derives an upper bound on the probability of block error for multilevel concatenated codes (MLCC). The bound evaluates difference in performance for different decompositions of some codes. The third paper investigates the bit error probability code for maximum likelihood decoding of binary linear codes. The fourth and final paper included in this report is concerns itself with the construction of multilevel concatenated block modulation codes using a multilevel concatenation scheme for the frequency non-selective Rayleigh fading channel.

Lin, Shu↗

NASA NTRS1997

Improvements in Block-Krylov Ritz Vectors and the Boundary Flexibility Method of Component Synthesis

A method of dynamic substructuring is presented which utilizes a set of static Ritz vectors as a replacement for normal eigenvectors in component mode synthesis. This set of Ritz vectors is generated in a recurrence relationship, proposed by Wilson, which has the form of a block-Krylov subspace. The initial seed to the recurrence algorithm is based upon the boundary flexibility vectors of the component. Improvements have been made in the formulation of the initial seed to the Krylov sequence, through the use of block-filtering. A method to shift the Krylov sequence to create Ritz vectors that will represent the dynamic behavior of the component at target frequencies, the target frequency being determined by the applied forcing functions, has been developed. A method to terminate the Krylov sequence has also been developed. Various orthonormalization schemes have been developed and evaluated, including the Cholesky/QR method. Several auxiliary theorems and proofs which illustrate issues in component mode synthesis and loss of orthogonality in the Krylov sequence have also been presented. The resulting methodology is applicable to both fixed and free- interface boundary components, and results in a general component model appropriate for any type of dynamic analysis. The accuracy is found to be comparable to that of component synthesis based upon normal modes, using fewer generalized coordinates. In addition, the block-Krylov recurrence algorithm is a series of static solutions and so requires significantly less computation than solving the normal eigenspace problem. The requirement for less vectors to form the component, coupled with the lower computational expense of calculating these Ritz vectors, combine to create a method more efficient than traditional component mode synthesis.

Carney, Kelly Scott↗

NASA NTRS1998

A Synchronization Algorithm and Implementation for High-Speed Block Codes Applications

Block codes have trellis structures and decoders amenable to high speed CMOS VLSI implementation. For a given CMOS technology, these structures enable operating speeds higher than those achievable using convolutional codes for only modest reductions in coding gain. As a result, block codes have tremendous potential for satellite trunk and other future high-speed communication applications. This paper describes a new approach for implementation of the synchronization function for block codes. The approach utilizes the output of the Viterbi decoder and therefore employs the strength of the decoder. Its operation requires no knowledge of the signal-to-noise ratio of the received signal, has a simple implementation, adds no overhead to the transmitted data, and has been shown to be effective in simulation for received SNR greater than 2 dB.

Lin, Shu↗

NASA NTRS1998

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

Decoding algorithms based on the trellis representation of a code (block or convolutional) drastically reduce decoding complexity. The best known and most commonly used trellis-based decoding algorithm is the Viterbi algorithm. It is a maximum likelihood decoding algorithm. Convolutional codes with the Viterbi decoding have been widely used for error control in digital communications over the last two decades. This chapter is concerned with the application of the Viterbi decoding algorithm to linear block codes. First, the Viterbi algorithm is presented. Then, optimum sectionalization of a trellis to minimize the computational complexity of a Viterbi decoder is discussed and an algorithm is presented. Some design issues for IC (integrated circuit) implementation of a Viterbi decoder are considered and discussed. Finally, a new decoding algorithm based on the principle of compare-select-add is presented. This new algorithm can be applied to both block and convolutional codes and is more efficient than the conventional Viterbi algorithm based on the add-compare-select principle. This algorithm is particularly efficient for rate 1/n antipodal convolutional codes and their high-rate punctured codes. It reduces computational complexity by one-third compared with the Viterbi algorithm.

Lin, Shu↗

NASA NTRS1995

Blocked Grid Technologies as Applied to Aerodynamic Configurations

The advantages and disadvantages of the blocked grid methodology are discussed using results from ENSAERO, CNS, and CNS-FV. The first two codes are based on finite differences and the last on cell-centered finite volume formulation. Techniques that enhance the utility of the blocked (or patched) grid methodology are described. These techniques include mesh discontinuous zonal interfaces, sliding zonal interfaces, fast search procedures, and virtual zones. All of these methods are designed with two goals; namely extend the use of patched grids to unsteady aerodynamics, e.g. oscillating control flaps, and provide the user more flexibility in the grid topologies available for gridding complex aerodynamic configurations. For example, the use of virtual zones allows the user the choice of using one grid topology for surface grids, and another for the volume grids. This additional flexibility has a large impact in the amount of calendar time required to block and grid a complex aerodynamic configuration. Several examples are shown demonstrating the new features. Other issues involving grid generation are also discussed. In particular the existing problems of defining grid quality measures which are relevant are also described.

Klopfer, Goetz↗

NASA NTRS1997

A Multi-Level Parallelization Concept for High-Fidelity Multi-Block Solvers

The integration of high-fidelity Computational Fluid Dynamics (CFD) analysis tools with the industrial design process benefits greatly from the robust implementations that are transportable across a wide range of computer architectures. In the present work, a hybrid domain-decomposition and parallelization concept was developed and implemented into the widely-used NASA multi-block Computational Fluid Dynamics (CFD) packages implemented in ENSAERO and OVERFLOW. The new parallel solver concept, PENS (Parallel Euler Navier-Stokes Solver), employs both fine and coarse granularity in data partitioning as well as data coalescing to obtain the desired load-balance characteristics on the available computer platforms. This multi-level parallelism implementation itself introduces no changes to the numerical results, hence the original fidelity of the packages are identically preserved. The present implementation uses the Message Passing Interface (MPI) library for interprocessor message passing and memory accessing. By choosing an appropriate combination of the available partitioning and coalescing capabilities only during the execution stage, the PENS solver becomes adaptable to different computer architectures from shared-memory to distributed-memory platforms with varying degrees of parallelism. The PENS implementation on the IBM SP2 distributed memory environment at the NASA Ames Research Center obtains 85 percent scalable parallel performance using fine-grain partitioning of single-block CFD domains using up to 128 wide computational nodes. Multi-block CFD simulations of complete aircraft simulations achieve 75 percent perfect load-balanced executions using data coalescing and the two levels of parallelism. SGI PowerChallenge, SGI Origin 2000, and a cluster of workstations are the other platforms where the robustness of the implementation is tested. The performance behavior on the other computer platforms with a variety of realistic problems will be included as this on-going study progresses.

Hatay, Ferhat F.↗

NASA NTRS2002

Processing of IN-718 Lattice Block Castings

Recently a low cost casting method known as lattice block casting has been developed by JAM Corporation, Wilmington, Massachusetts for engineering materials such as aluminum and stainless steels that has shown to provide very high stiffness and strength with only a fraction of density of the alloy. NASA Glenn Research Center has initiated research to investigate lattice block castings of high temperature Ni-base superalloys such as the model system Inconel-718 (IN-718) for lightweight nozzle applications. Although difficulties were encountered throughout the manufacturing process , a successful investment casting procedure was eventually developed. Wax formulation and pattern assembly, shell mold processing, and counter gravity casting techniques were developed. Ten IN-718 lattice block castings (each measuring 15-cm wide by 30-cm long by 1.2-cm thick) have been successfully produced by Hitchiner Gas Turbine Division, Milford, New Hampshire, using their patented counter gravity casting techniques. Details of the processing and resulting microstructures are discussed in this paper. Post casting processing and evaluation of system specific mechanical properties of these specimens are in progress.

Hebsur, Mohan G.↗

NASA NTRS2003

Performance Analysis of a Hybrid Overset Multi-Block Application on Multiple Architectures

This paper presents a detailed performance analysis of a multi-block overset grid compu- tational fluid dynamics app!ication on multiple state-of-the-art computer architectures. The application is implemented using a hybrid MPI+OpenMP programming paradigm that exploits both coarse and fine-grain parallelism; the former via MPI message passing and the latter via OpenMP directives. The hybrid model also extends the applicability of multi-block programs to large clusters of SNIP nodes by overcoming the restriction that the number of processors be less than the number of grid blocks. A key kernel of the application, namely the LU-SGS linear solver, had to be modified to enhance the performance of the hybrid approach on the target machines. Investigations were conducted on cacheless Cray SX6 vector processors, cache-based IBM Power3 and Power4 architectures, and single system image SGI Origin3000 platforms. Overall results for complex vortex dynamics simulations demonstrate that the SX6 achieves the highest performance and outperforms the RISC-based architectures; however, the best scaling performance was achieved on the Power3.

Djomehri, M. Jahed↗

NASA NTRS2005

Utilization of the Building-Block Approach in Structural Mechanics Research

In the last 20 years NASA has worked in collaboration with industry to develop enabling technologies needed to make aircraft safer and more affordable, extend their lifetime, improve their reliability, better understand their behavior, and reduce their weight. To support these efforts, research programs starting with ideas and culminating in full-scale structural testing were conducted at the NASA Langley Research Center. Each program contained development efforts that (a) started with selecting the material system and manufacturing approach; (b) moved on to experimentation and analysis of small samples to characterize the system and quantify behavior in the presence of defects like damage and imperfections; (c) progressed on to examining larger structures to examine buckling behavior, combined loadings, and built-up structures; and (d) finally moved to complicated subcomponents and full-scale components. Each step along the way was supported by detailed analysis, including tool development, to prove that the behavior of these structures was well-understood and predictable. This approach for developing technology became known as the "building-block" approach. In the Advanced Composites Technology Program and the High Speed Research Program the building-block approach was used to develop a true understanding of the response of the structures involved through experimentation and analysis. The philosophy that if the structural response couldn't be accurately predicted, it wasn't really understood, was critical to the progression of these programs. To this end, analytical techniques including closed-form and finite elements were employed and experimentation used to verify assumptions at each step along the way. This paper presents a discussion of the utilization of the building-block approach described previously in structural mechanics research and development programs at NASA Langley Research Center. Specific examples that illustrate the use of this approach are included from recent research and development programs for both subsonic and supersonic transports.

Rouse, Marshall↗

NASA NTRS2005

Encoders for block-circulant LDPC codes

In this paper, we present two encoding methods for block-circulant LDPC codes. The first is an iterative encoding method based on the erasure decoding algorithm, and the computations required are well organized due to the block-circulant structure of the parity check matrix. The second method uses block-circulant generator matrices, and the encoders are very similar to those for recursive convolutional codes. Some encoders of the second type have been implemented in a small Field Programmable Gate Array (FPGA) and operate at 100 Msymbols/second.

encoders↗

NASA NTRS2005

Protograph based LDPC codes with minimum distance linearly growing with block size

We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that precoding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNFt performance.

minimum decoding↗

NASA NTRS2007

Use of Ionic Liquids in Rod-Coil Block Copolyimides for Improved Lithium Ion Conduction

Solvent-free, solid polymer electrolytes (SPE) have the potential to improve safety, increase design flexibility and enhance performance of rechargeable lithium batteries. Solution based electrolytes are flammable and typically incompatible with lithium metal anodes, limiting energy density. We have previously demonstrated use of polyimide rod coil block copolymers doped with lithium salts as electrolytes for lithium polymer batteries. The polyimide rod blocks provide dimensional stability while the polyethylene oxide (PEO) coil portions conduct ions. Phase separation of the rods and coils in these highly branched polymers provide channels with an order of magnitude improvement in lithium conduction over polyethylene oxide itself at room temperature. In addition, the polymers have been demonstrated in coin cells to be compatible with lithium metal. For practical use at room temperature and below, however, at least an order of magnitude improvement in ion conduction is still required. The addition of nonvolatile, room temperature ionic liquids has been shown to improve the ionic conductivity of high molecular weight PEO. Herein we describe use of these molten salts to improve ionic conductivity in the rod-coil block copolymers.

Meador, Mary Ann B.↗

NASA NTRS2007

Blocked Force and Loading Calculations for LaRC THUNDER Actuators

An analytic approach is developed to predict the performance of LaRC Thunder actuators under load and under blocked conditions. The problem is treated with the Von Karman non-linear analysis combined with a simple Raleigh-Ritz calculation. From this, shape and displacement under load combined with voltage are calculated. A method is found to calculate the blocked force vs voltage and spring force vs distance. It is found that under certain conditions, the blocked force and displacement is almost linear with voltage. It is also found that the spring force is multivalued and has at least one bifurcation point. This bifurcation point is where the device collapses under load and locks to a different bending solution. This occurs at a particular critical load. It is shown this other bending solution has a reduced amplitude and is proportional to the original amplitude times the square of the aspect ratio.

Campbell, Joel F.↗