Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “symbolic”

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 397 records · Page 22

On the probability of undetected error for the maximum distance separable codes

The performance of maximum-distance-separable codes with symbols from GF(1) when they are used for pure error detection or for simultaneous error correction and detection is investigated. These codes are good for symbol error detection. Their probability of undetected error is upper bounded by q to the -r and decreases monotonically as the symbol error probability epsilon decreases from (q-1)/q to 0, where r is the number of parity-check symbols of a code.

Kasami, T.↗

Single-Chip VLSI Reed-Solomon Encoder

Reed-Solomon (RS) encoder based on Berlekamp bit-serial multiplier algorithm. RS code standard, based on code words of 255 8-bit symbols, of which 223 symbols convey information and remaining 32 are check symbols. This code enables correction of up to 16 erroneous information symbols per word. Berlekamp algorithm based on code-generating polynomial with 32 roots that occur in reciprocal pairs. Choice of algorithm permits compact design.

Truong, T. K.↗

Erasure information for a Reed-Solomon decoder

Many Reed-Solomon decoders, including the one decoding the outer code for Voyager data from Uranus, assume that all symbols have the same chance of being correct or incorrect. Insome cases, like in a burst of incorrect symbols, this is not the case, and a Reed-Solomon decoder could make use of this. The use of information about bit quality sent to the Reed-Solomon from an (inner) Viterbi decoder is examined, as well as information about the error status of adjacent symbols in decoding interleaved Reed-Solomon encoded symbols. It is discovered that, in a region of interest, only about 0.04 dB can gained.

Pitt, G. H., III↗

SNR estimation for the baseband assembly

The expected value and the variance of the Baseband Assembly symbol signal-to-noise ratio (SNR) estimation algorithm are derived. The SNR algorithm treated here is designated as the Split Symbol Moments Estimator (SSME). It consists of averaging the first two moments of the integrated half symbols. The SSME is a biased, consistent estimator. The SNR degradation factor due to the jitter in the subcarrier demodulation and symbol synchronization loops is taken into account. Curves of the expected value of the SNR estimator versus the actual SNR are presented.

Simon, M. K.↗

STAR (Simple Tool for Automated Reasoning): Tutorial guide and reference manual

STAR is an interactive, interpreted programming language for the development and operation of Artificial Intelligence application systems. The language is intended for use primarily in the development of software application systems which rely on a combination of symbolic processing, central to the vast majority of AI algorithms, with routines and data structures defined in compiled languages such as C, FORTRAN and PASCAL. References to routines and data structures defined in compiled languages are intermixed with symbolic structures in STAR, resulting in a hybrid operating environment in which symbolic and non-symbolic processing and organization of data may interact to a high degree within the execution of particular application systems. The STAR language was developed in the course of a project involving AI techniques in the interpretation of imaging spectrometer data and is derived in part from a previous language called CLIP. The interpreter for STAR is implemented as a program defined in the language C and has been made available for distribution in source code form through NASA's Computer Software Management and Information Center (COSMIC). Contained within this report are the STAR Tutorial Guide, which introduces the language in a step-by-step manner, and the STAR Reference Manual, which provides a detailed summary of the features of STAR.

Borchardt, G. C.↗

STAR - A computer language for hybrid AI applications

Constructing Artificial Intelligence application systems which rely on both symbolic and non-symbolic processing places heavy demands on the communication of data between dissimilar languages. This paper describes STAR (Simple Tool for Automated Reasoning), a computer language for the development of AI application systems which supports the transfer of data structures between a symbolic level and a non-symbolic level defined in languages such as FORTRAN, C and PASCAL. The organization of STAR is presented, followed by the description of an application involving STAR in the interpretation of airborne imaging spectrometer data.

Borchardt, G. C.↗

On codes with multi-level error-correction capabilities

In conventional coding for error control, all the information symbols of a message are regarded equally significant, and hence codes are devised to provide equal protection for each information symbol against channel errors. However, in some occasions, some information symbols in a message are more significant than the other symbols. As a result, it is desired to devise codes with multilevel error-correcting capabilities. Another situation where codes with multi-level error-correcting capabilities are desired is in broadcast communication systems. An m-user broadcast channel has one input and m outputs. The single input and each output form a component channel. The component channels may have different noise levels, and hence the messages transmitted over the component channels require different levels of protection against errors. Block codes with multi-level error-correcting capabilities are also known as unequal error protection (UEP) codes. Structural properties of these codes are derived. Based on these structural properties, two classes of UEP codes are constructed.

Lin, Shu↗

Efficient parallel algorithms for string editing and related problems

The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol x with another symbol. This problem has a well known O((absolute value of x)(absolute value of y)) time sequential solution (25). The efficient Program Requirements Analysis Methods (PRAM) parallel algorithms for the string editing problem are given. If m = ((absolute value of x),(absolute value of y)) and n = max((absolute value of x),(absolute value of y)), then the CREW bound is O (log m log n) time with O (mn/log m) processors. In all algorithms, space is O (mn).

Apostolico, Alberto↗

Execution environment for intelligent real-time control systems

Modern telerobot control technology requires the integration of symbolic and non-symbolic programming techniques, different models of parallel computations, and various programming paradigms. The Multigraph Architecture, which has been developed for the implementation of intelligent real-time control systems is described. The layered architecture includes specific computational models, integrated execution environment and various high-level tools. A special feature of the architecture is the tight coupling between the symbolic and non-symbolic computations. It supports not only a data interface, but also the integration of the control structures in a parallel computing environment.

Sztipanovits, Janos↗

Open-loop frequency acquisition for suppressed-carrier biphase signals using one-pole arm filters

Open loop frequency acquisition performance is discussed for suppressed carrier binary phase shift keyed signals in terms of the probability of detecting the carrier frequency offset when the arms of the Costas loop detector have one pole filters. The approach, which does not require symbol timing, uses fast Fourier transforms (FFTs) to detect the carrier frequency offset. The detection probability, which depends on both the 3 dB arm filter bandwidth and the received symbol signal to noise ratio, is derived and is shown to be independent of symbol timing. It is shown that the performance of this technique is slightly better that other open loop acquisition techniques which use integrators in the arms and whose detection performance varies with symbol timing.

Shah, B.↗

Using fuzzy logic to integrate neural networks and knowledge-based systems

Outlined here is a novel hybrid architecture that uses fuzzy logic to integrate neural networks and knowledge-based systems. The author's approach offers important synergistic benefits to neural nets, approximate reasoning, and symbolic processing. Fuzzy inference rules extend symbolic systems with approximate reasoning capabilities, which are used for integrating and interpreting the outputs of neural networks. The symbolic system captures meta-level information about neural networks and defines its interaction with neural networks through a set of control tasks. Fuzzy action rules provide a robust mechanism for recognizing the situations in which neural networks require certain control actions. The neural nets, on the other hand, offer flexible classification and adaptive learning capabilities, which are crucial for dynamic and noisy environments. By combining neural nets and symbolic systems at their system levels through the use of fuzzy logic, the author's approach alleviates current difficulties in reconciling differences between low-level data processing mechanisms of neural nets and artificial intelligence systems.

Yen, John↗

Multi-layered reasoning by means of conceptual fuzzy sets

The real world consists of a very large number of instances of events and continuous numeric values. On the other hand, people represent and process their knowledge in terms of abstracted concepts derived from generalization of these instances and numeric values. Logic based paradigms for knowledge representation use symbolic processing both for concept representation and inference. Their underlying assumption is that a concept can be defined precisely. However, as this assumption hardly holds for natural concepts, it follows that symbolic processing cannot deal with such concepts. Thus symbolic processing has essential problems from a practical point of view of applications in the real world. In contrast, fuzzy set theory can be viewed as a stronger and more practical notation than formal, logic based theories because it supports both symbolic processing and numeric processing, connecting the logic based world and the real world. In this paper, we propose multi-layered reasoning by using conceptual fuzzy sets (CFS). The general characteristics of CFS are discussed along with upper layer supervision and context dependent processing.

Takagi, Tomohiro↗

Improvements in hover display dynamics for a combat helicopter

This paper describes a piloted simulation conducted on the NASA Ames Vertical Motion Simulator. The objective of the experiment was to investigate the handling qualities benefits attainable using new display law design methods for hover displays. The new display laws provide improved methods to specify the behavior of the display symbol that predicts the vehicle's ground velocity in the horizontal plane; it is the primary symbol that the pilot uses to control aircraft horizontal position. The display law design was applied to the Apache helmet-mounted display format, using the Apache vehicle dynamics to tailor the dynamics of the velocity predictor symbol. The representations of the Apache vehicle used in the display design process and in the simulation were derived from flight data. During the simulation, the new symbol dynamics were seen to improve the pilots' ability to maneuver about hover in poor visual cuing environments. The improvements were manifested in pilot handling qualities ratings and in measured task performance. The paper details the display design techniques, the experiment design and conduct, and the results.

Eshow, Michelle M.↗

Improvements in hover display dynamics for a combat helicopter

This paper describes a piloted simulation conducted on the NASA Ames Vertical Motion Simulator. The objective of the experiment was to investigate the handling qualities benefits attainable using new display law design methods for hover displays. The new display laws provide improved methods to specify the behavior of the display symbol that predicts the vehicle's ground velocity in the horizontal plane; it is the primary symbol that the pilot uses to control aircraft horizontal position. The display law design was applied to the Apache helmet-mounted display format, using the Apache vehicle dynamics to tailor the dynamics of the velocity predictor symbol. The representations of the Apache vehicle used in the display design process and in the simulation were derived from flight data. During the simulation, the new symbol dynamics were seen to improve the pilots' ability to maneuver about hover in poor visual cuing environments. The improvements were manifested in pilot handling qualities ratings and in measured task performance. The paper details the display design techniques, the experiment design and conduct, and the results.

Eshow, Michelle M.↗

Links between N-modular redundancy and the theory of error-correcting codes

N-Modular Redundancy (NMR) is one of the best known fault tolerance techniques. Replication of a module to achieve fault tolerance is in some ways analogous to the use of a repetition code where an information symbol is replicated as parity symbols in a codeword. Linear Error-Correcting Codes (ECC) use linear combinations of information symbols as parity symbols which are used to generate syndromes for error patterns. These observations indicate links between the theory of ECC and the use of hardware redundancy for fault tolerance. In this paper, we explore some of these links and show examples of NMR systems where identification of good and failed elements is accomplished in a manner similar to error correction using linear ECC's.

Bobin, V.↗

Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputers

The PARADIGM compiler project provides an automated means to parallelize programs, written in a serial programming model, for efficient execution on distributed-memory multicomputers. .A previous implementation of the compiler based on the PTD representation allowed symbolic array sizes, affine loop bounds and array subscripts, and variable number of processors, provided that arrays were single or multi-dimensionally block distributed. The techniques presented here extend the compiler to also accept multidimensional cyclic and block-cyclic distributions within a uniform symbolic framework. These extensions demand more sophisticated symbolic manipulation capabilities. A novel aspect of our approach is to meet this demand by interfacing PARADIGM with a powerful off-the-shelf symbolic package, Mathematica. This paper describes some of the Mathematica routines that performs various transformations, shows how they are invoked and used by the compiler to overcome the new challenges, and presents experimental results for code involving cyclic and block-cyclic arrays as evidence of the feasibility of the approach.

Su, Ernesto↗

An efficient software implementation of a variable rate modem

This paper describes the software implementation of the baseband portion of a variable rate modem. The modem can handle arbitrary symbol rates with a fixed input/output sample rate. This approach reduces hardware complexity related to external clock generation circuitry, offers complete flexibility in the selection of symbol rates, and conveniently accommodates symbol timing and symbol rate corrections.

Mantha, Ramesh↗

Helmet-Mounted Display Design Guide

Helmet Mounted Displays (HMDs) present flight, navigation, and weapon information in the pilot's line of sight. The HMD was developed to allow the pilot to retain aircraft and weapon information while looking off boresight. This document reviews current state of the art in HMDs and presents a design guide for the HMD engineer in identifying several critical HMD issues: symbol stabilization, inadequate definitions, undefined symbol drive laws, helmet considerations, and Field Of View (FOV) vs. resolution tradeoff requirements. In particular, display latency is a key issue for HMDs. In addition to requiring further experimental studies, it impacts the definition and control law issues. Symbol stabilization is also critical. In the case of the Apache helicopter, the lack of compensation for pilot head motion creates excessive workload during hovering and Nap Of the Earth (NOE) flight. This translates into excessive training requirements. There is no agreed upon set of definitions or descriptions for how HMD symbols are driven to compensate for pilot head motion. A set of definitions is proposed to address this. There are several specific areas where simulation and flight experiments are needed: development of hover and NOE symbologies which compensate for pilot head movement; display latency and sampling, and the tradeoff between FOV, sensor resolution and symbology.

HEAD UP DISPLAYS↗