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 451 records · Page 25

On the synchronizability and detectability of random PPM sequences

The problem of synchronization and detection of random pulse-position-modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based both on soft as well as hard data; these algorithms are seen to be easily implementable. Bounds were derived on the symbol error probability as well as the probability of false synchronization that indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.

Georghiades, Costas N.↗

An algebraic criterion for the onset of chaos in nonlinear dynamic systems

The correspondence between iterated integrals and a noncommutative algebra is used to recast the given dynamical system from the time domain to the Laplace-Borel transform domain. It is then shown that the following algebraic criterion has to be satisfied for the outset of chaos: the limit (as tau approaches infinity and x sub 0 approaches infinity) of ((sigma(k=0) (tau sup k) / (k* x sub 0 sup k)) G II G = 0, where G is the generating power series of the trajectories, the symbol II is the shuffle product (le melange) of the noncommutative algebra, x sub 0 is a noncommutative variable, and tau is the correlation parameter. In the given equation, symbolic forms for both G and II can be obtained by use of one of the currently available symbolic languages such as PLI, REDUCE, and MACSYMA. Hence, the criterion is a computer-algebraic one.

Unal, A.↗

Detection of signals by the digital integrate-and-dump filter with offset sampling

The Integrate and Dump Filter (IDF) is used as a matched filter for the detection of signals in additive white Gaussian noise. The performance of the digital integrate and dump filter is evaluated. The case considered is when symbol times are known and the sampling clock is free running at a constant rate, i.e., the sampling clock is not phase locked to the symbol clock. Degradations in the output signal to noise ratio of the digital implementation due to sampling rate, sampling offset, and finite bandwidth, resulting from the anti-aliasing low pass prefilter, are computed and compared with those of the analog counterpart. It is shown that the digital IDF performs within 0.6 dB of the ideal analog IDF whenever the prefilter bandwidth exceeds four times the symbol rate and when sampling is performed at the Nyquist rate. The loss can be reduced to 0.3 dB by doubling the sampling rate, where 0.2 dB loss results from finite bandwidth and 0.1 dB results from the digital IDF.

Sadr, R.↗

High data rate Reed-Solomon encoding and decoding using VLSI technology

Presented as an implementation of a Reed-Solomon encode and decoder, which is 16-symbol error correcting, each symbol is 8 bits. This Reed-Solomon (RS) code is an efficient error correcting code that the National Aeronautics and Space Administration (NASA) will use in future space communications missions. A Very Large Scale Integration (VLSI) implementation of the encoder and decoder accepts data rates up 80 Mbps. A total of seven chips are needed for the decoder (four of the seven decoding chips are customized using 3-micron Complementary Metal Oxide Semiconduction (CMOS) technology) and one chip is required for the encoder. The decoder operates with the symbol clock being the system clock for the chip set. Approximately 1.65 billion Galois Field (GF) operations per second are achieved with the decoder chip set and 640 MOPS are achieved with the encoder chip.

Miller, Warner↗

Generalized Multiple-Trellis-Coded Modulation

Generalized multiple-trellis-coded modulation technique combines multiple trellis coding (more than one channel symbol per trellis branch transmitted) with symmetrical M-ary phase-shift keying. Transmitter puts out k M-ary code symbols for every b input binary symbols. Throughout performances, b/k, of trellis-coded multiple-phase-shift-keying channels compared with computational cutoff rates, R0, of multiple-phase-shift keying. Performs better than conventional trellis-coded modulation technique, with no increase in complexity.

Divsalar, D.↗

Dypas: A dynamic payload scheduler for shuttle missions

Decision and analysis systems have had broad and very practical application areas in the human decision making process. These software systems range from the help sections in simple accounting packages, to the more complex computer configuration programs. Dypas is a decision and analysis system that aids prelaunch shutlle scheduling, and has added functionality to aid the rescheduling done in flight. Dypas is written in Common Lisp on a Symbolics Lisp machine. Dypas differs from other scheduling programs in that it can draw its knowledge from different rule bases and apply them to different rule interpretation schemes. The system has been coded with Flavors, an object oriented extension to Common Lisp on the Symbolics hardware. This allows implementation of objects (experiments) to better match the problem definition, and allows a more coherent solution space to be developed. Dypas was originally developed to test a programmer's aptitude toward Common Lisp and the Symbolics software environment. Since then the system has grown into a large software effort with several programmers and researchers thrown into the effort. Dypas is currently using two expert systems and three inferencing procedures to generate a many object schedule. The paper will review the abilities of Dypas and comment on its functionality.

Davis, Stephen↗

Doppler-corrected differential detection of MPSK

An open-loop technique is presented for estimating and correcting Doppler frequency shift in an M-ary differential phase-shift-keyed (MDPSK) receiver. The novelty of the scheme is based on the observation that whereas the change in phase of the received signal over a full symbol contains the sum of the data (phase) and the Doppler-induced phase shift, the same change in phase over half a symbol (within a given symbol interval) contains only the Doppler-induced phase shift. Thus, by proper processing, the latter can be estimated and removed from the former. Analytical and simulation results are given for the variance of the above estimator, and the error probability performance of the MDPSK receiver is evaluated in the presence of the Doppler correction. Next, the practical considerations associated with the application of this technique on bandlimited Nyquist channels are discussed and incorporated into the final design. It is shown that the receiver can, in the absence of timing jitter, be designed to allow combined Doppler correction and data detection with no penalty due to intersymbol interference (ISI). The effects of ISI due to timing jitter are assessed by computer simulation.

Simon, Marvin K.↗

On the synchronizability and detectability of random PPM sequences

The problem of synchronization and detection of random pulse-position modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum-likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based on both soft as well as hard data; these algorithms are seen to be easily implementable. Bounds were derived on the symbol error probability as well as the probability of false synchronization that indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.

Georghiades, Costas N.↗

Performance of the all-digital data-transition tracking loop in the advanced receiver

The performance of the all-digital data-transition tracking loop (DTTL) with coherent or noncoherent sampling is described. The effects of few samples per symbol and of noncommensurate sampling rates and symbol rates are addressed and analyzed. Their impacts on the loop phase-error variance and the mean time to lose lock (MTLL) are quantified through computer simulations. The analysis and preliminary simulations indicate that with three to four samples per symbol, the DTTL can track with negligible jitter because of the presence of earth Doppler rate. Furthermore, the MTLL is also expected to be large engough to maintain lock over a Deep Space Network track.

Cheng, U.↗

Advanced technology satellite demodulator development

Ford Aerospace has developed a proof-of-concept satellite 8 phase shift keying (PSK) modulation and coding system operating in the Time Division Multiple Access (TDMA) mode at a data range of 200 Mbps using rate 5/6 forward error correction coding. The 80 Msps 8 PSK modem was developed in a mostly digital form and is amenable to an ASIC realization in the next phase of development. The codec was developed as a paper design only. The power efficiency goal was to be within 2 dB of theoretical at a bit error rate (BER) of 5x10(exp 7) while the measured implementation loss was 4.5 dB. The bandwidth efficiency goal was 2 bits/sec/Hz while the realized bandwidth efficiency was 1.8 bits/sec/Hz. The burst format used a preamble of only 40 8 PSK symbol times including 32 symbols of all zeros and an eight symbol unique word. The modem and associated special test equipment (STE) were fabricated mostly on a specially designed stitch-weld board although a few of the highest rate circuits were built on printed circuit cards. All the digital circuits were ECL to support the clock rates of from 80 MHz to 360 MHz. The transmitter and receiver matched filters were square-root Nyquist bandpass filters realized at the 3.37 GHz i.f. The modem operated as a coherent system although no analog phase locked (PLL) loop was employed. Within the budgetary constraints of the program, the approach to the demodulator has been proven and is eligible to proceed to the next phase of development of a satellite demodulator engineering model. This would entail the development of an ASIC version of the digital portion of the demodulator, and MMIC version of the quadrature detector, and SAW Nyquist filters to realize the bandwidth efficiency.

Ames, Stephen A.↗

Open-Loop Acquisition Of Suppressed Carrier Signals

Three digital techniques for open-loop acquisition of suppressed carrier signals in presence of binary-phase-shift-keyed (BPSK) modulation representing non-return-to-zero (NRZ) data symbols. Based on assumption that offset, tau, between timing of symbols and clock in receiver unknown, but fixed fraction of symbol period, T. In all three, fast Fourier transforms (FFT's) performed on outputs of integrate-and-dump filters that are parts of Costas-type loops used to demodulate BPSK signals. Timing of integrate-and-dump filters constant. Outputs mixed to obtain an error signal.

Shah, Biren N.↗

Performance Of Digital Data-Transition-Tracking Loop

Report presents theoretical study of performance of all-digital data-transition-tracking loop (DTTL). Equations derived to analyze effects of few samples per symbol period and of noncommensurate sampling and symbol rates. Noise and frequency response taken into account. Effects upon variance of phase error and on mean time to lose lock quantified through computer simulations. Because of phase ambiguity, digital DTTL performs poorly when number of samples per symbol period is small.

Hinedi, Sami M.↗

Calculation of stress intensity factors in an isotropic multicracked plate: Part 2: Symbolic/numeric implementation

Analytical derivations of stress intensity factors (SIF's) of a multicracked plate can be complex and tedious. Recent advances, however, in intelligent application of symbolic computation can overcome these difficulties and provide the means to rigorously and efficiently analyze this class of problems. Here, the symbolic algorithm required to implement the methodology described in Part 1 is presented. The special problem-oriented symbolic functions to derive the fundamental kernels are described, and the associated automatically generated FORTRAN subroutines are given. As a result, a symbolic/FORTRAN package named SYMFRAC, capable of providing accurate SIF's at each crack tip, was developed and validated. Simple illustrative examples using SYMFRAC show the potential of the present approach for predicting the macrocrack propagation path due to existing microcracks in the vicinity of a macrocrack tip, when the influence of the microcrack's location, orientation, size, and interaction are taken into account.

Arnold, S. M.↗

An extended abstract: A heuristic repair method for constraint-satisfaction and scheduling problems

The work described in this paper was inspired by a surprisingly effective neural network developed for scheduling astronomical observations on the Hubble Space Telescope. Our heuristic constraint satisfaction problem (CSP) method was distilled from an analysis of the network. In the process of carrying out the analysis, we discovered that the effectiveness of the network has little to do with its connectionist implementation. Furthermore, the ideas employed in the network can be implemented very efficiently within a symbolic CSP framework. The symbolic implementation is extremely simple. It also has the advantage that several different search strategies can be employed, although we have found that hill-climbing methods are particularly well-suited for the applications that we have investigated. We begin the paper with a brief review of the neural network. Following this, we describe our symbolic method for heuristic repair.

Minton, Steven↗

Knowledge-based reasoning in the Paladin tactical decision generation system

A real-time tactical decision generation system for air combat engagements, Paladin, has been developed. A pilot's job in air combat includes tasks that are largely symbolic. These symbolic tasks are generally performed through the application of experience and training (i.e. knowledge) gathered over years of flying a fighter aircraft. Two such tasks, situation assessment and throttle control, are identified and broken out in Paladin to be handled by specialized knowledge based systems. Knowledge pertaining to these tasks is encoded into rule-bases to provide the foundation for decisions. Paladin uses a custom built inference engine and a partitioned rule-base structure to give these symbolic results in real-time. This paper provides an overview of knowledge-based reasoning systems as a subset of rule-based systems. The knowledge used by Paladin in generating results as well as the system design for real-time execution is discussed.

Chappell, Alan R.↗

Approaches to the study of intelligence

A survey and an evaluation are conducted for the Rosenbloom et al. (1991) 'SOAR' model of intelligence, both as found in humans and in prospective AI systems, which views it as a representational system for goal-oriented symbolic activity based on a physical symbol system. Attention is given to SOAR's implications for semantic and episodic memory, symbol processing, and search within a uniform problem space; also noted are the relationships of SOAR to competing AI schemes, and its potential usefulness as a theoretical tool for cognitive psychology.

Norman, Donald A.↗

Estimating the size of Huffman code preambles

Data compression via block-adaptive Huffman coding is considered. The compressor consecutively processes blocks of N data symbols, estimates source statistics by computing the relative frequencies of each source symbol in the block, and then synthesizes a Huffman code based on these estimates. In order to let the decompressor know which Huffman code is being used, the compressor must begin the transmission of each compressed block with a short preamble or header file. This file is an encoding of the list n = (n(sub 1), n(sub 2)....,n(sub m)), where n(sub i) is the length of the Hufffman codeword associated with the ith source symbol. A simple method of doing this encoding is to individually encode each n(sub i) into a fixed-length binary word of length log(sub 2)l, where l is an a priori upper bound on the codeword length. This method produces a maximum preamble length of mlog(sub 2)l bits. The object is to show that, in most cases, no substantially shorter header of any kind is possible.

Mceliece, R. J.↗

A pattern jitter free AFC scheme for mobile satellite systems

This paper describes a scheme for pattern jitter free automatic frequency control (AFC) with a wide frequency acquisition range. In this scheme, equalizing signals fed to the frequency discriminator allow pattern jitter free performance to be achieved for all roll-off factors. In order to define the acquisition range, frequency discrimination characateristics are analyzed on a newly derived frequency domain model. As a result, it is shown that a sufficiently wide acquisition range over a given system symbol rate can be achieved independent of symbol timing errors. Additionally, computer simulation demonstrates that frequency jitter performance improves in proportion to E(sub b)/N(sub 0) because pattern-dependent jitter is suppressed in the discriminator output. These results show significant promise for applciation to mobile satellite systems, which feature relatively low symbol rate transmission with an approximately 0.4-0.7 roll-off factor.

Yoshida, Shousei↗