Search NASA⌕ Search

SEARCH · Search NASA

Results for “serialization”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Expanded serial communication capability for the transport systems research vehicle laptop computers

A recent upgrade of the Transport Systems Research Vehicle (TSRV) operated by the Advanced Transport Operating Systems Program Office at the NASA Langley Research Center included installation of a number of Grid 1500 series laptop computers. Each unit is a 80386-based IBM PC clone. RS-232 data busses are needed for TSRV flight research programs, and it has been advantageous to extend the application of the Grids in this area. Use was made of the expansion features of the Grid internal bus to add a user programmable serial communication channel. Software to allow use of the Grid bus expansion has been written and placed in a Turbo C library for incorporation into applications programs in a transparent manner via function calls. Port setup; interrupt-driven, two-way data transfer; and software flow control are built into the library functions.

Easley, Wesley C.↗
NASA NTRS1990

Dynamic model and cooperative control of a serially linked manipulator system

The use of a redundant manipulator to execute multiple tasks specified at different points on the manipulator is demonstrated. This is accomplished by decomposing a redundant arm at an intermediate arm location called the 'elbow' into two nonredundant local arms referred as the 'basearm' and the 'forearm'. This decomposition transforms a redundant arm into a serially linked dual-arm system, where the cooperation between the basearm and the forearm is carried out through the task distribution and the elbow control. The kinematics of a decomposed redundant manipulator are discussed, and a Cartesian space dynamic model and dynamic equation of a decomposed redundant manipulator are presented. The capability of generating Cartesian force, the local efficiency of generating Cartesian acceleration, and dynamic task distribution are discussed.

Lee, Sukhan↗
NASA NTRS1991

Efficient control with an order (n) recursive inversion of the Jacobian for an n-link serial manipulator

A method is presented to order (n) recursively invert the Jacobian matrix for a serial n-link manipulator. By realizing that the Jacobian relationship involving accelerations is a special case for the forward dynamics problem, it is possible to obtain the Jacobian inverse by directly applying Rodriguez's (1987) recursive forward dynamics algorithm. In this technique, the n-link robot equation is formulated as a spatially recursive algorithm in the form of a filtering and smoothing problem. To compute the Jacobian inverse via this algorithm, the n-link manipulator is modeled with only a unit end-point mass and zero applied torques.

Meldrum, D. R.↗
NASA NTRS1991

Smoothed perturbation analysis algorithms for estimating the derivatives of occupancy-related functions in serial queueing networks

The authors present smoothed perturbation analysis (SPA) estimators for the derivative of a number of occupancy-related functions in serial queuing networks with finite buffer spaces. The functions are the average number of customers at a network as seen by an arrival, the probability that a customer is blocked at a particular queue, and the probability that a customer leaves a queue empty. In all three cases, the variable is a parameter of the distribution of service times at one of the queues. The derivative estimators considered are very simple and flexible, and they easily lend themselves to analysis of unbiasedness. Unlike most of the established SPA estimators, the present ones are not based on the computation of hazard rates.

Wardi, Y.↗
NASA NTRS1938

Calculation of the chordwise load distribution over airfoil sections with plain, split, or serially hinged trailing-edge flaps

A method is presented for the rapid calculation of the incremental chordwise normal-force distribution over an airfoil section due to the deflection of a plain flap or tab, a split flap, or a serially hinged flap. This report is intended as a supplement to NACA Report no. 631, wherein a method is presented for the calculation of the chordwise normal-force distribution over an airfoil without a flap or, as it may be considered, an airfoil with flap (or flaps) neutral. The method enables the determination of the form and magnitude of the incremental normal-force distribution to be made for an airfoil-flap combination for which the section characteristics have been determined. A method is included for the calculation of the flap normal-force and hinge-moment coefficients without necessitating a determination of the normal-force distribution.

Allen, H Julian↗
NASA NTRS1990

Application specific serial arithmetic arrays

High performance systolic arrays of serial-parallel multiplier elements may be rapidly constructed for specific applications by applying hardware description language techniques to a library of full-custom CMOS building blocks. Single clock pre-charged circuits have been implemented for these arrays at clock rates in excess of 100 Mhz using economical 2-micron (minimum feature size) CMOS processes, which may be quickly configured for a variety of applications. A number of application-specific arrays are presented, including a 2-D convolver for image processing, an integer polynomial solver, and a finite-field polynomial solver.

Winters, K.↗
NASA NTRS1991

Direct kinematics solution architectures for industrial robot manipulators: Bit-serial versus parallel

A Very Large Scale Integration (VLSI) architecture for robot direct kinematic computation suitable for industrial robot manipulators was investigated. The Denavit-Hartenberg transformations are reviewed to exploit a proper processing element, namely an augmented CORDIC. Specifically, two distinct implementations are elaborated on, such as the bit-serial and parallel. Performance of each scheme is analyzed with respect to the time to compute one location of the end-effector of a 6-links manipulator, and the number of transistors required.

Lee, J.↗
NASA NTRS1995

Design of a massively parallel computer using bit serial processing elements

A 1-bit serial processor designed for a parallel computer architecture is described. This processor is used to develop a massively parallel computational engine, with a single instruction-multiple data (SIMD) architecture. The computer is simulated and tested to verify its operation and to measure its performance for further development.

Aburdene, Maurice F.↗
NASA NTRS1995

Serial and parallel power equipment with high-temperature superconducting elements

One of the prospective, practical applications of high-temperature superconductors is the fault-current limitation in electrical energy networks. The development and testing of experimental HTSC serial current limiters have been reported in the literature. A Hungarian electric power company has proposed the development of a parallel equipment for arc suppressing both in the industrial and customers' networks. On the basis of the company's proposal the authors have outlined the scheme of a compound circuit that can be applied both for current limitation and arc suppressing. In this paper the design principles and methods of the shunt equipment are presented. These principles involve the electrical, mechanical and cryogenic aspects with the special view on the electrical and mechanical connection between the HTSC material and the current lead. Preliminary experiments and tests have been carried out to demonstrate the validity of the design principles developed. The results of the experiments and of the technological investigations are presented.

Bencze, Laszlo↗
NASA NTRS2000

Self-Scheduling Parallel Methods for Multiple Serial Codes with Application to WOPWOP

This paper presents a scheme for efficiently running a large number of serial jobs on parallel computers. Two examples are given of computer programs that run relatively quickly, but often they must be run numerous times to obtain all the results needed. It is very common in science and engineering to have codes that are not massive computing challenges in themselves, but due to the number of instances that must be run, they do become large-scale computing problems. The two examples given here represent common problems in aerospace engineering: aerodynamic panel methods and aeroacoustic integral methods. The first example simply solves many systems of linear equations. This is representative of an aerodynamic panel code where someone would like to solve for numerous angles of attack. The complete code for this first example is included in the appendix so that it can be readily used by others as a template. The second example is an aeroacoustics code (WOPWOP) that solves the Ffowcs Williams Hawkings equation to predict the far-field sound due to rotating blades. In this example, one quite often needs to compute the sound at numerous observer locations, hence parallelization is utilized to automate the noise computation for a large number of observers.

Long, Lyle N.↗
NASA NTRS1989

Does the identification of simple features require serial processing?

Several recent studies have shown performance decrements with increasing display size when background texture elements are present in a same-different feature discrimination task--a result that challenges the traditional notion that the identities of simple visual features are processed in parallel, preattentively. Four experiments are reported that explore the implications of these results. Experiment 1 replicates the recent studies but limits the generalizability of the results to small target numbers. Experiments 2 and 3 show that the observed performance decrements are not due to a serial or even limited-capacity, parallel process. Experiment 4 suggests that decision factors idiosyncratic to the use of texture elements in a same-different task are responsible for the effect. It is concluded that the identification of simple visual features proceeds in parallel, with unlimited capacity (i.e., preattentively).

Pattern Recognition, Visual↗
NASA NTRS1948

Measurements in Flight of the Longitudinal-Stability Characteristics of a Republic YF-84A Airplane (Army Serial No. 45-59488) at High Subsonic Mach Numbers

A brief investigation was made of the longitudinal-stability characteristics of a YF-84A airplane (Army Serial No. 45-79488). The airplane developed a pitching-up tendency at approximately 0.80 Mach number which necessitated large push forces and down-elevator deflections for further increases in speed. In steady turns at 35,000 feet with the center of gravity at 28.3 percent mean aerodynamic chord for normal accelerations up to the maximum test value, the control-force gradients were excessive at Mach numbers over 0.78. Airplane buffeting did not present a serious problem in accelerated or unaccelerated flight at 15,000 and 35,000 feet up to the maximum test Mach number of 0.84. It is believed that excessive control force would be the limiting factor in attaining speeds in excess of 0.84 Mach number, especially at altitudes below 35,000 feet.

Turner, Howard L.↗
NASA NTRS1997

Design of Serially Concatenated Interleaved Codes

A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, and an inner encoder whose input words are the permuted outer codewords.

Interleaved Codes Concatenation↗
NASA NTRS1997

Serial and Hybrid Concatenated Codes with Applications

Analytical bounds on the performance of concatenated codes on a tree structure are obtained. Analytical results are applied to examples of parallel concatenation of two codes (turbo codes), serial concatenation of two codes, hybrid concatenation of three codes, and self concatenated codes, over AWGN and fading channels.

AWGN MPSK modulations Rayleigh fading channels↗