Search NASA⌕ Search

SEARCH · Search NASA

Results for “B CODES”

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 109 records · Page 6

Potential digitization/compression techniques for Shuttle video

The Space Shuttle initially will be using a field-sequential color television system but it is possible that an NTSC color TV system may be used for future missions. In addition to downlink color TV transmission via analog FM links, the Shuttle will use a high resolution slow-scan monochrome system for uplink transmission of text and graphics information. This paper discusses the characteristics of the Shuttle video systems, and evaluates digitization and/or bandwidth compression techniques for the various links. The more attractive techniques for the downlink video are based on a two-dimensional DPCM encoder that utilizes temporal and spectral as well as the spatial correlation of the color TV imagery. An appropriate technique for distortion-free coding of the uplink system utilizes two-dimensional HCK codes.

Habibi, A.↗

Results from the Orbiting Astronomical Observatory. XLI - Photometry of M31 and M33

Filter photometry observations from the Orbiting Astronomical Observatory, in six wavelength bands between 1550 and 4250 A, are reported for several positions along the major and minor axes in M31 and at some positions in M33. The spatial resolution is 10 arcmin. The colors along the major axis of M31 within about 20 arcmin of the nucleus are similar to the nucleus; at 45 arcmin the colors are much bluer, indicating a spiral arm population. This behavior is expected from other observations of H I, CO, and early-type stars, which are all concentrated in a ring of material whose inner edge is about 7 kpc (= 35 arcmin) from the nucleus. The center of M33 is bluer than the ring of M31, and the arms of M33 even bluer. There are no colors too blue to be explained (within observational error) by unreddened B stars.

Davis, J.↗

Numerical simulation of icing, deicing, and shedding

An algorithm has been developed to numerically model the concurrent phenomena of two-dimensional transient heat transfer, ice accretion, ice shedding and ice trajectory which arise from the use of electrothermal pad. The Alternating Direction Implicit method is used to simultaneously solve the heat transfer and accretion equations occurring in the multilayered body covered with ice. In order to model the phase change between ice and water, a technique was used which assumes a phase for each node. This allows the equations to be linearized such that a direct solution is possible. This technique requires an iterative procedure to find the correct phase at each node. The computer program developed to find this solution has been integrated with the NASA-Lewis flow/trajectory code LEWICE.

Wright, W. B.↗

Numerical analysis of a thermal deicer

An algorithm has been developed to numerically model the concurrent phenomena of two-dimensional transient heat transfer, ice accretion and ice shedding which arise from the use of an electrothermal pad. The Alternating Direction Implicit method is used to simultaneously solve the heat transfer and accretion equations occurring in a multilayered body covered with ice. In order to model the phase change between ice and water, a technique was used which assumes a phase for each node. This allows the equations to be linearized such that a direct solution is possible. This technique requires an iterative procedure to find the correct phase at each node. The computer program developed to find this solution has been integrated with the NASA/Lewis flow/trajectory code LEWICE.

Wright, W. B.↗

Bit-wise arithmetic coding for data compression

This article examines the problem of compressing a uniformly quantized independent and identically distributed (IID) source. We present a new compression technique, bit-wise arithmetic coding, that assigns fixed-length codewords to the quantizer output and uses arithmetic coding to compress the codewords, treating the codeword bits as independent. We examine the performance of this method and evaluate the overhead required when used block-adaptively. Simulation results are presented for Gaussian and Laplacian sources. This new technique could be used as the entropy coder in a transform or subband coding system.

Kiely, A. B.↗

Three Dimensional Viscous Flow Field in an Axial Flow Turbine Nozzle Passage

The objective of this investigation is experimental and computational study of three dimensional viscous flow field in the nozzle passage of an axial flow turbine stage. The nozzle passage flow field has been measured using a two sensor hot-wire probe at various axial and radial stations. In addition, two component LDV measurements at one axial station (x/c(sum m) = 0.56) were performed to measure the velocity field. Static pressure measurements and flow visualization, using a fluorescent oil technique, were also performed to obtain the location of transition and the endwall limiting streamlines. A three dimensional boundary layer code, with a simple intermittency transition model, was used to predict the viscous layers along the blade and endwall surfaces. The boundary layers on the blade surface were found to be very thin and mostly laminar, except on the suction surface downstream of 70% axial chord. Strong radial pressure gradient, especially close to the suction surface, induces strong cross flow components in the trailing edge regions of the blade. On the end-walls the boundary layers were much thicker, especially near the suction corner of the casing surface, caused by secondary flow. The secondary flow region near the suction-casing surface corner indicates the presence of the passage vortex detached from the blade surface. The corner vortex is found to be very weak. The presence of a closely spaced rotor downstream (20% of the nozzle vane chord) introduces unsteadiness in the blade passage. The measured instantaneous velocity signal was filtered using FFT square window to remove the periodic unsteadiness introduced by the downstream rotor and fans. The filtering decreased the free stream turbulence level from 2.1% to 0.9% but had no influence on the computed turbulence length scale. The computation of the three dimensional boundary layers is found to be accurate on the nozzle passage blade surfaces, away from the end-walls and the secondary flow region. On the nozzle passage endwall surfaces the presence of strong pressure gradients and secondary flow limit the validity of the boundary layer code.

Ristic, D.↗

Development of Computer Models for the Assessment of Foreign Body Impact Events on Composite Structures

The objective of this project was to model the 5-3/4 inch pressure vessels used on the NASA RTOP program in an attempt to learn more about how impact damage forms and what are the residual effects of the resulting damage. A global-local finite element model was developed for the bottle and the states of stress in the bottles were determined down to the constituent level. The experimental data that was generated on the NASA RTOP program was not in a form that enabled the model developed under this grant to be correlated with the experimental data. As a result of this exercise it is recommended that an experimental program be designed using statistical design of experiment techniques to generate data that can be used to isolate the phenomenon that control the formation of impact damage. This data should include residual property determinations so that models for post impact structural integrity can be developed. It is also recommended that the global-local methodology be integrated directly into the finite element code. This will require considerable code development.

Bucinell, Ronald B.↗

Computing Aerodynamic Performance of a 2D Iced Airfoil: Blocking Topology and Grid Generation

The ice accrued on airfoils can have enormously complicated shapes with multiple protruded horns and feathers. In this paper, several blocking topologies are proposed and evaluated on their ability to produce high-quality structured multi-block grid systems. A transition layer grid is introduced to ensure that jaggedness on the ice-surface geometry do not to propagate into the domain. This is important for grid-generation methods based on hyperbolic PDEs (Partial Differential Equations) and algebraic transfinite interpolation. A 'thick' wrap-around grid is introduced to ensure that grid lines clustered next to solid walls do not propagate as streaks of tightly packed grid lines into the interior of the domain along block boundaries. For ice shapes that are not too complicated, a method is presented for generating high-quality single-block grids. To demonstrate the usefulness of the methods developed, grids and CFD solutions were generated for two iced airfoils: the NLF0414 airfoil with and without the 623-ice shape and the B575/767 airfoil with and without the 145m-ice shape. To validate the computations, the computed lift coefficients as a function of angle of attack were compared with available experimental data. The ice shapes and the blocking topologies were prepared by NASA Glenn's SmaggIce software. The grid systems were generated by using a four-boundary method based on Hermite interpolation with controls on clustering, orthogonality next to walls, and C continuity across block boundaries. The flow was modeled by the ensemble-averaged compressible Navier-Stokes equations, closed by the shear-stress transport turbulence model in which the integration is to the wall. All solutions were generated by using the NPARC WIND code.

Chi, X.↗

Surface Modeling and Grid Generation for Iced Airfoils (SmaggIce)

Many of the troubles associated with problem solving are alleviated when there is a model that can be used to represent the problem. Through the Advanced Graphics and Visualization (G-VIS) Laboratory and other facilities located within the Research Analysis Center, the Computer Services Division (CSD) is able to develop and maintain programs and software that allow for the modeling of various situations. For example, the Icing Research Branch is devoted to investigating the effect of ice that forms on the wings and other airfoils of airplanes while in flight. While running tests that physically generate ice and wind on airfoils within the laboratories and wind tunnels on site are done, it would be beneficial if most of the preliminary work could be done outside of the lab. Therefore, individuals from within CSD have collaborated with Icing Research in order to create SmaggIce. This software allows users to create ice patterns on clean airfoils or open files containing a variety of icing situations, manipulate and measure these forms, generate, divide, and merge grids around these elements for more explicit analysis, and specify and rediscretize subcurves. With the projected completion date of Summer 2005, the majority of the focus of the Smagglce team is user-functionality and error handling. My primary responsibility is to test the Graphical User Interface (GUI) in SmaggIce in order to ensure the usability and verify the expected results of the events (buttons, menus, etc.) within the program. However, there is no standardized, systematic way in which to test all the possible combinations or permutations of events, not to mention unsolicited events such as errors. Moreover, scripting tests, if not done properly and with a view towards inevitable revision, can result in more apparent errors within the software and in effect become useless whenever the developers of the program make a slight change in the way a specific process is executed. My task therefore requires a brief yet intense study into GUI coverage criteria and creating algorithms for GUI implementation. Nevertheless, there are still heavily graphical features of SmaggIceSmaggIce that must be either corrected or redesigned before its release. A particular feature of SmaggIce is the ability to smooth out curves created by control points that form an arbitrary shape into something more acquiescent to gridding (while maintaining the integrity of the data). This is done by a mathematical model known as Non-Uniform Rational B-Spline (NURBS) curves. Existing NURBS code is written in FORTRAN-77 with static arrays for holding information. My new assignment is to allow for dynamic memory allocation within the code and to make it possible for the developers to call out functions from the NURBS code using C.

Hammond, Brandy M.↗

Error Control Techniques for Satellite and Space Communications

In this report, we present the results of our recent work on turbo coding in two formats. Appendix A includes the overheads of a talk that has been given at four different locations over the last eight months. This presentation has received much favorable comment from the research community and has resulted in the full-length paper included as Appendix B, 'A Distance Spectrum Interpretation of Turbo Codes'. Turbo codes use a parallel concatenation of rate 1/2 convolutional encoders combined with iterative maximum a posteriori probability (MAP) decoding to achieve a bit error rate (BER) of 10(exp -5) at a signal-to-noise ratio (SNR) of only 0.7 dB. The channel capacity for a rate 1/2 code with binary phase shift-keyed modulation on the AWGN (additive white Gaussian noise) channel is 0 dB, and thus the Turbo coding scheme comes within 0.7 DB of capacity at a BER of 10(exp -5).

Costello, Daniel J., Jr.↗

Enhancement of surface definition and gridding in the Eagle code

A method for locally fairing uniform cubic B-spline curves and surfaces is presented. The algorithm uses an automated technique which detects undesirable geometric characteristics by using a local fairness criterion. The geometric entity is then smoothed using a method based on the repeated removal and insertion of the spline knots in the vicinity of the geometric irregularity.

Source record↗

Constrained coding for the deep-spaced optical channel

In this paper, we demonstrate a class of low-complexity modulation codes satisfying the (d,k) constraint that offer throughput gains over M-PPM on the order of 10-15%, which translate into SNR gains of .4 - .6 dB.

constrained coding optical communications error-co↗

NAS Experiences of Porting CM Fortran Codes to HPF on IBM SP2 and SGI Power Challenge

Current Connection Machine (CM) Fortran codes developed for the CM-2 and the CM-5 represent an important class of parallel applications. Several users have employed CM Fortran codes in production mode on the CM-2 and the CM-5 for the last five to six years, constituting a heavy investment in terms of cost and time. With Thinking Machines Corporation's decision to withdraw from the hardware business and with the decommissioning of many CM-2 and CM-5 machines, the best way to protect the substantial investment in CM Fortran codes is to port the codes to High Performance Fortran (HPF) on highly parallel systems. HPF is very similar to CM Fortran and thus represents a natural transition. Conversion issues involved in porting CM Fortran codes on the CM-5 to HPF are presented. In particular, the differences between data distribution directives and the CM Fortran Utility Routines Library, as well as the equivalent functionality in the HPF Library are discussed. Several CM Fortran codes (Cannon algorithm for matrix-matrix multiplication, Linear solver Ax=b, 1-D convolution for 2-D datasets, Laplace's Equation solver, and Direct Simulation Monte Carlo (DSMC) codes have been ported to Subset HPF on the IBM SP2 and the SGI Power Challenge. Speedup ratios versus number of processors for the Linear solver and DSMC code are presented.

Saini, Subhash↗

Deep Space Network turbo decoder implementation

A new decoder is being developed by the Jet Propulsion Laboratory for NASA's Deep Space Network. This unit will decode the new turbo codes, which have recently been approved by the Consultative Committee for Space Data Systems (CCSDS). Turbo codes provide up to 0.8 dB improvement in Eb/No over the current best codes used by deep space missions.

turbo codes↗

Exploration of Near-Term Potential Routes and Procedures for Urban Air Mobility

Urban air mobility is gaining interest as the need for On Demand Mobility in today's congested traffic is becoming high in metropolitan areas. Urban Air Mobility (UAM) is envisioned as a concept to transport passengers and cargo safely and efficiently using innovative aircraft in the urban areas. It is expected to improve mobility for the general public, decongest road traffic, reduce transport time and reduce the strain on existing public transport networks. There exist several challenges to Urban Air Mobility (UAM) such as integration of procedures with airspace and the airport, noise levels that are acceptable to the general public, public safety, public acceptance, vehicle certification, and more. Most of the research in the United States and European skies (DLR - German Aerospace Center) related to urban areas has focused on small UAS (Unmanned Aircraft Systems) flights (NASA's UTM (UAS Traffic Management) research) and their integration with the airspace and building safe operations in densely populated areas. Previous studies on UAM have focused on fast time simulations of the routes that are separated via a separation service and network of routes. Similarly, research in Europe has focused on the approach profile for these innovative aircraft, vertiports and battery life among others. UAM as a part of the On-Demand Mobility effort has provided some guidelines for operations as shown below: Does not require additional ATC (Air Traffic Control) infrastructure; Does not impose additional workload on ATC; Does not restrict operations of traditional airspace users; Will meet appropriate safety thresholds and requirements; Will prioritize operational scalability; Will allow flexibility where possible and structure where necessary. This paper explores potential routes and procedures in a Human-In-The-Loop (HITL) experiment that could be applied in the near-term to allow integration of UAM flights into the airspace as well as a large airport. The airspace that was explored was Dallas Fort Worth (DFW) airspace managed by the DFW East Tower in South Flow only. In addition, Dallas Love Field (DAL) and Addison (ADS) airspace were also part of the testbed. The initial set of routes investigated in this study were published helicopter routes in the DFW area. Figure 1 shows class B airspace in DFW area and the origin/destination city pairs where UAM flights flew along with helicopter routes shown in blue. The research focused on exploring procedures for integrating UAM flights into Class Bravo and Class Delta airspace. Three different communication procedures, evaluated with three different levels of UAM traffic, are shown in Table 1. The current day routes were evaluated with current day communication procedures were explored as the first condition. The current day routes were also evaluated in the second condition with reduced communications, which was assumed due to the presence of a Letter Of Agreement (LOA). The purpose of the LOA was to reduce the verbiage associated with pilots getting clearance to Class B airspace from the controllers, pre-assigning beacons codes to the UAM flights, separate routes by assigning altitudes and speeds to flights going in any one direction. Flights were expected to automatically change frequency when exiting Class B airspace, thus transition points for entry and exit points were also specified in the LOA.

Urban Air Mobility↗

Constrained coding for the deep-space optical channel

We investigate methods of coding for a channel subject to a large dead-time constraint, i.e. a constraint on the minimum spacing between transmitted pulses, with the deep-space optical channel as the motivating example.

codes concatenated codes pulse position modulation↗

Burst decoding of binary block codes on Q-ary output channels.

The burst-b distance between two binary vectors is defined and shown to be a metric. This definition is applied to a binary-input, Q-ary output channel where errors occur in bursts. A decoding algorithm is presented for such a channel that is an extension of Weldon's (1971) weighted erasure decoding. Examples are presented illustrating the techniques.

Wainberg, S.↗