SEARCH · Engineering Papers
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.
Using stiffness matrix and lumped-mass representation specified number of natural frequencies are obtained using inverse iteration method. Mode shapes for each frequency are also obtained. These frequencies and mode shapes can be found in reasonable periods of computer time utilizing this code.
A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.
A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.
System can transmit range-indicating pseudonoise (PN) codes and simultaneously transmit auxiliary information as binary data at a rate at least on order of pseudonoise chipping rate. PN code is modulated by data stream with relatively low bit rate. Data stream with high bit rate can be transmitted in same frequency band as PN ranging code.
A general technique, called decoding with multipliers, is presented that can be used to decode any linear code. The technique is applied to the (48,24) quadratic residue code and yields the first known practical decoding algorithm for this powerful code.
It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform algorithm over finite fields GF(F sub n) where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.
The performance of certain block codes on a Gaussian channel is evaluated. The BCH codes are markedly superior to convolutional codes currently used for deep space missions. The algorithm is used to derive results, which provides a basis for a simple, almost optimum procedure for decoding these codes.
Experimental measurements of the velocity components in the blade to blade (axial tangential) plane were obtained with an axial flow turbine stator passage and were compared with calculations from three turbomachinery computer programs. The theoretical results were calculated from a quasi three dimensional inviscid code, a three dimensional inviscid code, and a three dimensional viscous code. Parameter estimation techniques and a particle dynamics calculation were used to assess the accuracy of the laser measurements, which allow a rational basis for comparison of the experimenal and theoretical results. The general agreement of the experimental data with the results from the two inviscid computer codes indicates the usefulness of these calculation procedures for turbomachinery blading. The comparison with the viscous code, while generally reasonable, was not as good as for the inviscid codes.
The theory of Reed-Solomon code shortening in general was developed and the degradation due to shortening in the context of concatenated coding was qualified. It is shown that in the NASA/ESA concatenated system, significant degradations occur only when N 180. A Reed-Solomon code was concatenated with an inner (7, 1/2) convolutional code. Under some circumstances, it would be desirable to use a shorter outer code word length. For example, the format of the data coming from science instruments on board a spacecraft may lend itself naturally to a word length of 200 symbols rather than 223. To accommodate such code word lengths, the Reed-Solomon code can be shortened to an (N, N-32) code where N can be any integer between 33 and 255. Shortening the code, however, changes its performance. On one hand, the amount of redundancy per information symbol increases. Because of this increased redundancy, the amount of energy per information symbol is decreased by code shortening. The overall effect is to degrade the performance of the code.
The Weight Analysis of Turbine Engines (WATE) computer code was developed by Boeing under contract to NASA Lewis. It was designed to function as an adjunct to the Navy/NASA Engine Program (NNEP). NNEP calculates the design and off-design thrust and sfc performance of User defined engine cycles. The thermodynamic parameters throughout the engine as generated by NNEP are then combined with input parameters defining the component characteristics in WATE to calculate the bare engine weight of this User defined engine. Preprocessor programs for NNEP were previously developed to simplify the task of creating input datasets. This report describes a similar preprocessor for the WATE code.
The aerodynamic performance of a solid uncooled version of a cooled radial turbine was evaluated in the Small Engine Components Test Facility Turbine rig at the NASA Lewis Research Center. Specifically, an experiment was conducted to rotor surface static pressures. This was the first time surface static pressures had been measured on a radial turbine at NASA Lewis. These pressures were measured by a modified Rotating Data Package (RDP), a standard product manufactured by Scanivalve, Inc. Described here are the RDP, and the modifications that were made, as well as the checkout, installation, and testing procedures. The data presented are compared to analytical results obtained from NASA's MERIDL TSONIC BLAYER (MTSB) code.
The aerodynamic performance of a solid uncooled version of a cooled radial turbine was evaluated in the Small Engine Components Test Facility Turbine rig at the NASA Lewis Research Center. Specifically, an experiment was conducted to rotor surface static pressures. This was the first time surface static pressures had been measured on a radial turbine at NASA Lewis. These pressures were measured by a modified Rotating Data Package (RDP), a standard product manufactured by Scanivalve, Inc. Described here are the RDP, and the modifications that were made, as well as the checkout, installation, and testing procedures. The data presented are compared to analytical results obtained from NASA's MERIDL TSONIC BLAYER (MTSB) code.
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.
An accurate description of the aerothermal environment is required to minimize the weight of the Thermal Protection System required on the leeside of winged reentry vehicles. The inability of ground-test facilities to reproduce the high enthalpy, separated flow present during reentry flight conditions, coupled with the prohibitive expense of flight tests, leads to the use of an analytical method - namely Computational Fluid Dynamics (CFD) - to describe the flow. While the ultimate goal of this work is to accurately predict the leeside flow and its associated thermal environment, an essential and reasonable first step towards that goal is a comparison of pressure predictions by a code with wind-tunnel data. Until such CFD pressure predictions agree with wind-tunnel test cases, there is little hope of accurately predicting the thermal environment at flight conditions. Thus, the objective of this study is to compare the pressure distributions predicted by inviscid, perfect gas CFD to Shuttle Orbiter wind-tunnel data and to address any significant issues encountered during the computation. While flight data is available for the Shuttle Orbiter, a wind-tunnel case is chosen for this study to allow a tractable problem for preliminary investigation. A wind-tunnel case allows the perfect gas assumption for the flow chemistry. This provides a significant computational savings over a several species finite-rate chemistry model which would be necessary if high-temperature effects present at flight conditions were to be included. In addition, by concentrating on the surface pressures, the analysis need only consider inviscid flow for general evaluation of the code capability. This further reduces the computational expense due to the absence of viscous terms and the associated decrease in the number of points required for the computational grid. Previous computational efforts (such as STEIN and HALIS) have been directed toward the windward surface quantities, primarily due to restrictions in treating either the winged geometry or its associated subsonic regions at high angle of attack. The code used for this study, the LAURA (Langley Aerothermodynamic Upwind Relaxation Algorithm) code of Gnoffo, represents a state-of-the-art code for computing the flow over complex configurations at hypersonic speeds. In the study, the LAURA code is applied to a wind-tunnel condition to initiate the assessment of the code's ability to predict the flow over a relatively complex hypersonic vehicle at high angles of attack. This presentation is used to highlight the pertinent results of a more detailed investigation of the inviscid calculation over the Shuttle Orbiter with the LAURA code.
We present maximum-likelihood (ML) coherent and noncoherent classifiers for discriminating between NRZ and Manchester coded (biphase-L) data formats for binary phase-shift-keying (BPSK) modulation. Such classification of the data format is an essential element of so-called autonomous software defined radio (SDR) receivers (similar to so-called cognitive SDR receivers in the military application) where it is desired that the receiver perform each of its functions by extracting the appropriate knowledge from the received signal and, if possible, with as little information of the other signal parameters as possible. Small and large SNR approximations to the ML classifiers are also proposed that lead to simpler implementation with comparable performance in their respective SNR regions. Numerical performance results obtained by a combination of computer simulation and, wherever possible, theoretical analyses, are presented and comparisons are made among the various configurations based on the probability of misclassification as a performance criterion. Extensions to other modulations such as QPSK are readily accomplished using the same methods described in the paper.
We plan to perform the following sets of computations on unadapted (fixed) grids: 1) Structured RANS set 1 (Code: CFL3D, Grid: Str-OnetoOne-A-v1 (supplied by HiLiftPW-1 committee), Turbulence model: Spalart-Allmaras), 2) Structured RANS set 2 (Code: CFL3D, Grid: Str-OnetoOne-A-v1 (supplied by HiLiftPW-1 committee), Turbulence model: Menter SST), 3) Structured RANS set 3 (time permitting) (Code: CFL3D, Grid: Str-OnetoOne-B-v1 (supplied by HiLiftPW-1 committee), Turbulence model: Menter SST), 4) Unstructured RANS set 1 (Code: FUN3D, Grid: Unst-Mixed-FromTet-Nodecentered-A-v1 (supplied by HiLiftPW-1 committee), Turbulence model: Spalart-Allmaras), and 5) Unstructured RANS set 2 (time permitting) (Code: FUN3D, Grid: Unst-Hex-FromOnetoOne-A-v1 (supplied by HiLiftPW-1 committee), Turbulence model: Spalart-Allmaras),. Optional case 3 is not being computed. CFL3D is a structured upwind-biased cell-centered RANS code,1 and FUN3D is an unstructured upwind-biased node-centered RANS code
This paper proposes an implementation of AFF that borrows technology from the Global Positioning System (GPS), using measurements of both r-f carrier phase and a ranging code.
An upper bound on the average probability of error for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n with distinction between memory length and tail length is given. It is shown that the bound is independent of the length L of the information sequence if the memory length exceeds the tail length by a specified amount that depends on L. Sequential decoding simulations using the stack algorithm were conducted to test the dependence of the undetected error probability on tail length and memory length, and the results corroborated the theory.