Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “block structure”

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 253 records · Page 14

Constructing LDPC Codes from Loop-Free Encoding Modules

A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to channel capacity limits can be achieved for the codes of the type in question having low maximum variable node degrees. The decoding thresholds in these examples are lower than those of the best-known unstructured irregular LDPC codes constrained to have the same maximum node degrees. Furthermore, the present method enables the construction of codes of any desired rate with thresholds that stay uniformly close to their respective channel capacity thresholds.

Divsalar, Dariush↗

Blueprinting extendable nanomaterials with standardized protein blocks

A wooden house frame consists of many different lumber pieces, but because of the regularity of these building blocks, the structure can be designed using straightforward geometrical principles. The design of multicomponent protein assemblies, in comparison, has been much more complex, largely owing to the irregular shapes of protein structures. Here we describe extendable linear, curved and angled protein building blocks, as well as inter-block interactions, that conform to specified geometric standards; assemblies designed using these blocks inherit their extendability and regular interaction surfaces, enabling them to be expanded or contracted by varying the number of modules, and reinforced with secondary struts. Using X-ray crystallography and electron microscopy, we validate nanomaterial designs ranging from simple polygonal and circular oligomers that can be concentrically nested, up to large polyhedral nanocages and unbounded straight ‘train track’ assemblies with reconfigurable sizes and geometries that can be readily blueprinted. Because of the complexity of protein structures and sequence–structure relationships, it has not previously been possible to build up large protein assemblies by deliberate placement of protein backbones onto a blank three-dimensional canvas; the simplicity and geometric regularity of our design platform now enables construction of protein nanomaterials according to ‘back of an envelope’ architectural blueprints.

36 MATERIALS SCIENCE↗

Structural Benchmark Testing of Superalloy Lattice Block Subelements Completed

Superalloy lattice block panels, which are produced directly by investment casting, are composed of thin ligaments arranged in three-dimensional triangulated trusslike structures (see the preceding figure). Optionally, solid panel face sheets can be formed integrally during casting. In either form, lattice block panels can easily be produced with weights less than 25 percent of the mass of a solid panel. Inconel 718 (IN 718) and MarM-247 superalloy lattice block panels have been developed under NASA's Ultra-Efficient Engine Technology Project and Higher Operating Temperature Propulsion Components Project to take advantage of the superalloys' high strength and elevated temperature capability with the inherent light weight and high stiffness of the lattice architecture (ref. 1). These characteristics are important in the future development of turbine engine components. Casting quality and structural efficiency were evaluated experimentally using small beam specimens machined from the cast and heat treated 140- by 300- by 11-mm panels. The matrix of specimens included samples of each superalloy in both open-celled and single-face-sheet configurations, machined from longitudinal, transverse, and diagonal panel orientations. Thirty-five beam subelements were tested in Glenn's Life Prediction Branch's material test machine at room temperature and 650 C under both static (see the following photograph) and cyclic load conditions. Surprisingly, test results exceeded initial linear elastic analytical predictions. This was likely a result of the formation of plastic hinges and redundancies inherent in lattice block geometry, which was not considered in the finite element models. The value of a single face sheet was demonstrated by increased bending moment capacity, where the face sheet simultaneously increased the gross section modulus and braced the compression ligaments against early buckling as seen in open-cell specimens. Preexisting flaws in specimens were not a discriminator in flexural, shear, or stiffness measurements, again because of redundant load paths available in the lattice block structure. Early test results are available in references 2 and 3; more complete analyses are scheduled for publication in 2004.

Source record↗

Structural development of Coprates Chasma and western Ophir Planum, Valles Marineris Rift, Mars

A portion of Valles Marineris was mapped in detail in order to clarify the dominant processes responsible for the formation of Coprates Chasma. New crater counts indicate that the caprock on western Ophir Planum plateau has a Late Hesperian crater age, whereas trough floor preserved in western Coprates Chasma has an Early to Late Hesperian crater age. Caprock on western Ophir Planum correlates in relative age with the Syria Planum Formation, and the caprock may overlie Lower Hesperian ridged plains material. Trough floor material in Coprates Chasma correlates in relative age with ridged plains material on the adjacent Lunae Planum and Coprates plateaus and represents a structurally coherent block displaced downward by normal faulting. The crater counts and detailed structural relationships demonstrate the commonly accepted view that Coprates Chasma occupies a graben. Formation of Coprates Chasma by keystone collapse of locally elevated topography is not supported by available topographic data, but a general association between the trough and volcanotectonic activity in the Tharsis region is considered to be a likely explanation for the trough forming stresses. Faulting on Ophir Planum appears related to the faulting that created the Coprates Chasma trough. The geology and structure of Coprates Chasma are comparable to those of other troughs such as Melas, Ius, and perhaps Candor chasmata, suggesting that these troughs may also have formed as grabens.

Schultz, Richard A.↗

Bgridi - Interactive three-dimensional turbomachinery grid generation system with applications

An interactive, graphics-based grid generation system for 3D turbomachinery geometries has been developed. The system consists of separate modules for geometry modeling and grid generation. The grid generation method generates a series of 2D grids in the blade-to-blade passage to build up the 3D grid. A Poisson equation with forcing functions selected to control orthogonality and spacing on all boundaries is solved to generate the grid. Interactive definition of Bezier curves and surfaces as internal boundaries is used to improve control of grid quality. A multi-block data structure simpifies the creation of structured H-grids about complex turbomachinery geometries. The multi-block strategy facilitates the creation of a grid in the tip flow region, which is an important contributor to losses within the passage. The grid generation system is applied to several complex geometries including a simple radial impeller, a conventional turbine rotor, the SSME LOX turbine rotor with and without a tip flow grid, a multi-passage inducer-impeller, and a tip-flow cascade. In addition, a calculation of the tip-flow cascade flow field is shown.

Shoemaker, J. M.↗

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↗

An experimental investigation of fault tolerant software structures in an avionics application

The objective of this experimental investigation is to compare the functional performance and software reliability of competing fault tolerant software structures utilizing software diversity. In this experiment, three versions of the redundancy management software for a skewed sensor array have been developed using three diverse failure detection and isolation algorithms and incorporated into various N-version, recovery block and hybrid software structures. The empirical results show that, for maximum functional performance improvement in the selected application domain, the results of diverse algorithms should be voted before being processed by multiple versions without enforced diversity. Results also suggest that when the reliability gain with an N-version structure is modest, recovery block structures are more feasible since higher reliability can be obtained using an acceptance check with a modest reliability.

Caglayan, Alper K.↗

Density Functional Tight-Binding Models for Band Structures of Transition-Metal Alloys and Surfaces across the d -Block

First-principles electronic structure simulations are an invaluable tool for understanding chemical bonding and reactions. While machine-learning models such as interatomic potentials significantly accelerate the exploration of potential energy surfaces, electronic structure information is generally lost. Particularly in the field of heterogeneous catalysis, simulated electron band structures provide fundamental insights into catalytic reactivity. This ab initio knowledge is preserved in semiempirical methods such as density functional tight binding (DFTB), which extend the accessible computational length and time scales beyond first-principles approaches. In this paper here we present Shell-Optimized Atomic Confinement (SOAC) DFTB electronic-part-only parametrizations for bulk and surface band structures of all d-block transition metals that enable efficient predictions of electronic descriptors for large structures or high-throughput studies on complex systems outside the computational reach of density functional theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Good trellises for IC implementation of viterbi decoders for linear block codes

This paper investigates trellis structures of linear block codes for the IC (integrated circuit) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An upper bound on the number of parallel and structurally identical (or isomorphic) subtrellises in a proper trellis for a code without exceeding the maximum state complexity of the minimal trellis of the code is first derived. Parallel structures of trellises with various section lengths for binary BCH and Reed-Muller (RM) codes of lengths 32 and 64 are analyzed. Next, the complexity of IC implementation of a Viterbi decoder based on an L-section trellis diagram for a code is investigated. A structural property of a Viterbi decoder called ACS-connectivity which is related to state connectivity is introduced. This parameter affects the complexity of wire-routing (interconnections within the IC). The effect of five parameters namely: (1) effective computational complexity; (2) complexity of the ACS-circuit; (3) traceback complexity; (4) ACS-connectivity; and (5) branch complexity of a trellis diagram on the VLSI complexity of a Viterbi decoder is investigated. It is shown that an IC implementation of a Viterbi decoder based on a non-minimal trellis requires less area and is capable of operation at higher speed than one based on the minimal trellis when the commonly used ACS-array architecture is considered.

Moorthy, H. T.↗

Good trellises for IC implementation of viterbi decoders for linear block codes

This paper investigates trellis structures of linear block codes for the IC (integrated circuit) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An upper bound on the number of parallel and structurally identical (or isomorphic) subtrellises in a proper trellis for a code without exceeding the maximum state complexity of the minimal trellis of the code is first derived. Parallel structures of trellises with various section lengths for binary BCH and Reed-Muller (RM) codes of lengths 32 and 64 are analyzed. Next, the complexity of IC implementation of a Viterbi decoder based on an L-section trellis diagram for a code is investigated. A structural property of a Viterbi decoder called ACS-connectivity which is related to state connectivity is introduced. This parameter affects the complexity of wire-routing (interconnections within the IC). The effect of five parameters namely: (1) effective computational complexity; (2) complexity of the ACS-circuit; (3) traceback complexity; (4) ACS-connectivity; and (5) branch complexity of a trellis diagram on the VLSI complexity of a Viterbi decoder is investigated. It is shown that an IC implementation of a Viterbi decoder based on a non-minimal trellis requires less area and is capable of operation at higher speed than one based on the minimal trellis when the commonly used ACS-array architecture is considered.

Lin, Shu↗

Good Trellises for IC Implementation of Viterbi Decoders for Linear Block Codes

This paper investigates trellis structures of linear block codes for the integrated circuit (IC) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An upper-bound on the number of parallel and structurally identical (or isomorphic) subtrellises in a proper trellis for a code without exceeding the maximum state complexity of the minimal trellis of the code is first derived. Parallel structures of trellises with various section lengths for binary BCH and Reed-Muller (RM) codes of lengths 32 and 64 are analyzed. Next, the complexity of IC implementation of a Viterbi decoder based on an L-section trellis diagram for a code is investigated. A structural property of a Viterbi decoder called add-compare-select (ACS)-connectivity which is related to state connectivity is introduced. This parameter affects the complexity of wire-routing (interconnections within the IC). The effect of five parameters namely: (1) effective computational complexity; (2) complexity of the ACS-circuit; (3) traceback complexity; (4) ACS-connectivity; and (5) branch complexity of a trellis diagram on the very large scale integration (VISI) complexity of a Viterbi decoder is investigated. It is shown that an IC implementation of a Viterbi decoder based on a nonminimal trellis requires less area and is capable of operation at higher speed than one based on the minimal trellis when the commonly used ACS-array architecture is considered.

Moorthy, Hari T.↗

Architecture of a distributed multimission operations system

This paper presents an architecture to develop a multimission operations systems, which we call DIOSA. In this architecture, a component used as a building block is called a functional block. Each functional block has a standard structure, and the interface between functional blocks are defined with a set of standard protocols. This paper shows the structure of the database used by functional blocks, the structure of interfaces between functional blocks, and the structure of system management. Finally, examples of typical functional blocks and an example of a system constructed with this architecture is shown.

Yamada, Takahiro↗

Transonic flow solutions on general 3D regions using composite-block grids

The construction of computational fluid dynamics (CFD) codes for complicated regions is greatly simplified by a composite-block grid structure since, with the use of a surrounding layer of points on each block, a flow code is then only required basically to operate on rectangular computational regions. The necessary correspondence of points on the surrounding layers (image points) with interior points (object points) is set up by the grid code and made available to the CFD solution code.

Thompson, Joe F.↗

Encoders for block-circulant LDPC codes

Methods and apparatus to encode message input symbols in accordance with an accumulate-repeat-accumulate code with repetition three or four are disclosed. Block circulant matrices are used. A first method and apparatus make use of the block-circulant structure of the parity check matrix. A second method and apparatus use block-circulant generator matrices.

Divsalar, Dariush↗

SOLL-E: A Module Transport and Placement Robot for Autonomous Assembly of Discrete Lattice Structures

This paper presents the design and development of a transport and placement robot that demonstrates autonomous assembly of structural building blocks. The robots are intended to serve as a critical component of automated structural assembly and maintenance systems. The Scaling Omni-directional Lattice Locomoting Explorer (SOLL-E) uses a 5-DoF bipedal inchworm locomotion architecture with locking foot and cargo grippers. The locomotion system employs large magnet gap diameter BLDC motors with moderate timing belt gearing for primary joints, and DC planetary gearmotors for turning. Foot and cargo grippers are identical, with servo-actuated locking mechanisms. Three modular controller boards are used to control these actuators in real-time, with command and telemetry data transferred between the server and each controller board via WiFi. Functionality and performance were evaluated in a ground demonstration.

robotics↗

Impact of Cubic Pin Finned Surface Structure Geometry upon Spray Cooling Heat Transfer

Experiments were conducted to study the effects of enhanced surface structures on heat flux using spray cooling. The surface enhancements consisted of cubic pin fins machined on the top surface of copper heater blocks. The structure height, pitch, and width were parametrically vaned. Each copper block had a projected cross-sectional area of 2.0 sq cm. Measurements were also obtained on a heater block with a flat surface for baseline comparison purposes. A 2 x 2 nozzle array was used with PF-5060 as the working fluid. Thermal performance data were obtained under nominally degassed (chamber pressure of 41.4 kPa) and gassy conditions (chamber with N2 gas at 100.7 kPa) with a bulk fluid temperature of 20.5 C. Results for both the degassed and gassy cases show that structure width and separation distance have a dominant effect upon the heat transfer for the size ranges used. Cubic pin fin height had little impact upon heat flux. The maximum critical heat flux (CHF) attained for any of the surfaces was 121 W/sq cm, giving an enhancement of 51% relative to the flat surface case under nominally degassed conditions. The gassy case had a maximum CHF of 149 W/sq cm, giving an enhancement of 38% relative to the flat surface case.

Silk, Eric A.↗

Block rotation by strike-slip faulting - Structural and paleomagnetic evidence

The magnitude and sense of block rotations depicted from such structural data as fault spacing and slip are noted to agree with values obtained from independent paleomagnetic determinations. The agreement between paleomagnetic rotation data and those inferred from offset and spacing data in northern Israel is excellent, suggesting that the faults and intervening blocks were rotated with progressive deformation along the levant transform. It is suggested that the rotation of blocks and the strike-slip displacement are two qualitative and quantitative contemporaneous aspects of a single deformation process.

Ron, H.↗