SEARCH · Search NASA
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.
Concept for storage of solar heat for later use based on use of basalt, cast into blocks and stacked in inflatable gas-tight enclosure serving as heat-storage chamber. Heat flows to blocks from solar collector during day and from blocks to heat engine at night.
About five years ago, a joint development was started of a flow simulation system for engine-airframe integration studies on propeller as well as jet aircraft. The initial system was based on the Euler equations and made operational for industrial aerodynamic design work. The system consists of three major components: a domain modeller, for the graphical interactive subdivision of flow domains into an unstructured collection of blocks; a grid generator, for the graphical interactive computation of structured grids in blocks; and a flow solver, for the computation of flows on multi-block grids. The industrial partners of the collaboration and NLR have demonstrated that the domain modeller, grid generator and flow solver can be applied to simulate Euler flows around complete aircraft, including propulsion system simulation. Extension to Navier-Stokes flows is in progress. Delft Hydraulics has shown that both the domain modeller and grid generator can also be applied successfully for hydrodynamic configurations. An overview is given about the main aspects of both domain modelling and grid generation.
A grid generation procedure combining interactive and batch grid generation programs was put together to generate multi-block grids for complex aircraft configurations. The interactive section provides the tools for 3D geometry manipulation, surface grid extraction, boundary domain construction for 3D volume grid generation, and block-block relationships and boundary conditions for flow solvers. The procedure improves the flexibility and quality of grid generation to meet the design/analysis requirements.
By using coding and combinational techniques, an explicit formula is derived which enumerates the complete weight distribution of decodable words of block codes using partially known weight distributions. Also an approximation formula for nonbinary block codes is obtained. These results in turn give exact and approximate expressions for the decoder error probability PE(u) of block codes.
A multigrid diagonal implicit algorithm has been developed to solve the three-dimensional Euler equations of inviscid compressible flow on block-structured grids. An improved method of advancing the multigrid cycle has been examined with respect to convergence rates, accuracy, and efficiency. In this method, the multigrid cycle is advanced independently in each of the blocks, and the information exchange between the blocks is done using buffer arrays, allowing for the asynchronous updating of interface boundary conditions. This updating scheme is used to eliminate the convergence problems found in a previous implementation of the algorithm while retaining its potential for efficient parallel execution. Results are computed for transonic flows past wings and include pressure distributions to verify the accuracy of the scheme and convergence histories to demonstrate the efficiency of the method. Efficiencies that were obtained using a modest number of processors in parallel are also presented and discussed.
A block structured conformal transformation is presented for application to turbomachinery cascades. In comparison with the traditional single block cases that are, at best, supplemented with branch cuts, there is a richer variety of choices for the grid topology. The choice presented leads to a substantial improvement in the grid quality. This is reflected in a relatively uniform covering of the cascade region. While grid clustering is not intended or supplied with the block conformal structure, it can be injected afterwards. When viewed as a controlled experiment, the present study provides a significant example of the effect of grid topology upon the grid quality. In a larger sense, this puts some focus upon the effects of grid topology in more general situations.
The wall and centerline vapor temperatures and heat output are determined experimentally for a low-temperature copper-water heat pipe under uniform circumferential heating and block heating. The time required to reach a vapor temperature of 60 C from an initial ambient temperature of 21 C is determined for both modes of heating. The experimental capillary limit of the heat pipe is compared to the generalized capillary limits for block-heated pipes over a range of vapor temperatures. A three-dimensional numerical model is then developed for determining the temperature, pressure, and velocity distributions in the entire domain of a circumferentially heated and a block-heated pipe. The problem is formulated as a conjugate problem, without the assumption of a uniform vapor temperature. The predictions of the model are found to be in good agreement with the experimental data.
Earlier studies of blocking are extended by examining the interactions that occur between the synoptic-scale eddies and the large-scale flow during the development of wintertime blocking events over the North Atlantic Ocean. In particular, attention is given to the change of synoptic-scale eddy activity during the development of blocking and to the role of anomalous forcing by synoptic-scale eddies in the development of large-scale flow anomalies. The dynamical mechanisms accounting for the observed variations in eddy activity are identified.
Altitude-test-chamber investigation of effects of flame-holder blocked area and gutter width on performance of 28-inch diameter ram jet at simulated flight Mach number of 2.0 for altitudes from 40,000 to 55,000 feet was conducted at NACA Lewis laboratory. Ten flame holders investigated covered gutter widths from 1.00 to 2.50 inches and blocked areas from 40.5 to 62.0 percent of combustion-chamber area. Gutter width did not appreciably affect combustion efficiency. Increase in blocked area from 40 to 62 percent resulted in 5- to 10-percent increase in combustion efficiency. Increasing gutter width resulted in improvement in fuel-air-ratio operating range.
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.
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.
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.
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.
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.
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.
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.
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.
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.