SEARCH · Search NASA
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.
For binary digit array of N bits, use N noise sources to feed N nonlinear operators; each flip-flop in digit array is set by nonlinear operator to reflect whether amplitude of generator which feeds it is above or below mean value of generated noise. Fixed-point uniform distribution random number generation method can also be used to generate random numbers with other than uniform distribution.
Several turbulent and nonturbulent solutions of the Navier-Stokes equations are obtained. The unaveraged equations are used numerically in conjunction with tools and concepts from nonlinear dynamics, including time series, phase portraits, Poincare sections, largest Liapunov exponents, power spectra, and strange attractors. Initially neighboring solutions for a low Reynolds number fully developed turbulence are compared. Several flows are noted: fully chaotic, complex periodic, weakly chaotic, simple periodic, and fixed-point. Of these, only fully chaotic is classified as turbulent. Besides the sustained flows, a flow which decays as it becomes turbulent is examined. For the finest grid, 128(exp 3) points, the spatial resolution appears to be quite good. As a final note, the variation of the velocity derivatives skewness of a Navier-Stokes flow as the Reynolds number goes to zero is calculated numerically. The value of the skewness is shown to become small at low Reynolds numbers, in agreement with intuitive arguments that nonlinear terms should be negligible.
There exist a number of mathematical procedures for designing discrete-time compensators. However, the digital implementation of these designs, with a microprocessor, for example, has not received nearly as thorough an investigation. The finite-precision nature of the digital hardware makes it necessary to choose a computational structure that will perform adequately with regard to the initial objectives of the design. This paper describes a procedure for estimating the required fixed-point coefficient wordlength for any given computational structure for the implementation of a single-input single-output LQG design. The results are compared to the actual number of bits necessary to achieve a specified performance index.
Several turbulent and nonturbulent solutions of the Navier-Stokes equations are obtained. The unaveraged equations are used numerically in conjunction with tools and concepts from nonlinear dynamics, including time series, phase portraits, Poincare sections, largest Liapunov exponents, power spectra, and strange attractors. Initially neighboring solutions for a low-Reynolds-number fully developed turbulence are compared. The solutions, separate exponentially with time, having a positive Liapunov exponent. Thus the turbulence is characterized as chaotic. In a search for solutions which contrast with the turbulent ones, the Reynolds number is reduced. Several qualitatively different flows are noted. These are, fully chaotic, complex period, weakly chaotic, simple periodic, and fixed-point. Of these, only the fully chaotic flows are classified as turbulent. Those flows have both a positive Liapunov exponent and Poincare sections without pattern. By contrast, the weakly chaotic flows have some pattern in their Poincare sections. The fixed-point and periodic flows are nonturbulent, since turbulence, is both time-dependent and aperiodic. Turbulent solutions are obtained in which energy cascades from large to small-scale motions. In general, the spectral energy transfer takes place between wavenumber bands that are considerably separated. The special transfer can occur either as a result of nonlinear turbulence self-interaction or by interaction of turbulence with mean gradients. Turbulent systems are compared with those studied in kinetic theory. The two types of systems are fundamentally different (continuous and dissipative as opposed to discrete and conservative), but there are similarities. For instance, both are nonlinear and show sensitive dependence on initial conditions. Also, the turbulent and molecular stress tensors are identical if the macroscopic velocities for the turbulent stress are replaced by molecular velocities.
There exists a number of mathematical procedures for designing discrete-time compensators. However, the digital implementation of these designs, with a microprocessor for example, has not received nearly as thorough an investigation. The finite-precision nature of the digital hardware makes it necessary to choose an algorithm (computational structure) that will perform 'well-enough' with regard to the initial objectives of the design. This paper describes a procedure for estimating the required fixed-point coefficient wordlength for any given computational structure for the implementation of a single-input single-output LOG design. The results are compared to the actual number of bits necessary to achieve a specified performance index.
The topics considered are: (1) the base of the number system, (2) precision control, (3) number representation, (4) arithmetic operations, (5) other basic operations, (6) elementary functions, and (7) exception handling. The possibility of doing without fixed-point arithmetic is also mentioned. The specifications are intended to be entirely at the level of a programming language such as FORTRAN. The emphasis is on convenience and simplicity from the user's point of view. Conforming to such specifications would have obvious beneficial implications for the portability of numerical software, and for proving programs correct, as well as attempting to provide facilities which are most suitable for the user. The specifications are not complete in every detail, but it is intended that they be complete in spirit - some further details, especially syntatic details, would have to be provided, but the proposals are otherwise relatively complete.
Several turbulent and nonturbulent solutions of the Navier-Stokes equations are obtained. The unaveraged equations are used numerically in conjunction with tools and concepts from nonlinear dynamics, including time series, phase portraits, Poincare sections, Liapunov exponents, power spectra, and strange attractors. Initially neighboring solutions for a low-Reynolds-number fully developed turbulence are compared. The turbulence is sustained by a nonrandom time-independent external force. The solutions, on the average, separate exponentially with time, having a positive Liapunov exponent. Thus, the turbulence is characterized as chaotic. In a search for solutions which contrast with the turbulent ones, the Reynolds number (or strength of the forcing) is reduced. Several qualitatively different flows are noted. These are, respectively, fully chaotic, complex periodic, weakly chaotic, simple periodic, and fixed-point. Of these, we classify only the fully chaotic flows as turbulent. Those flows have both a positive Liapunov exponent and Poincare sections without pattern. By contrast, the weakly chaotic flows, although having positive Liapunov exponents, have some pattern in their Poincare sections. The fixed-point and periodic flows are nonturbulent, since turbulence, as generally understood, is both time-dependent and aperiodic.
Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) < x }. Utilizing the fixed-point semantics (denotational semantics), extended to probabilistic computations, we investigate the distribution functions of probabilistic automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.
Multirate (decimation/interpolation) filters are among the essential signal processing components in spaceborne instruments where Finite Impulse Response (FIR) filters are often used to minimize nonlinear group delay and finite-precision effects. Cascaded (multi-stage) designs of Multi-Rate FIR (MRFIR) filters are further used for large rate change ratio, in order to lower the required throughput while simultaneously achieving comparable or better performance than single-stage designs. Traditional representation and implementation of MRFIR employ polyphase decomposition of the original filter structure, whose main purpose is to compute only the needed output at the lowest possible sampling rate. In this paper, an alternative representation and implementation technique, called TD-MRFIR (Thread Decomposition MRFIR), is presented. The basic idea is to decompose MRFIR into output computational threads, in contrast to a structural decomposition of the original filter as done in the polyphase decomposition. Each thread represents an instance of the finite convolution required to produce a single output of the MRFIR. The filter is thus viewed as a finite collection of concurrent threads. The technical details of TD-MRFIR will be explained, first showing its applicability to the implementation of downsampling, upsampling, and resampling FIR filters, and then describing a general strategy to optimally allocate the number of filter taps. A particular FPGA design of multi-stage TD-MRFIR for the L-band radar of NASA's SMAP (Soil Moisture Active Passive) instrument is demonstrated; and its implementation results in several targeted FPGA devices are summarized in terms of the functional (bit width, fixed-point error) and performance (time closure, resource usage, and power estimation) parameters.
A prototype decoder for a serially concatenated pulse position modulation (SCPPM) code has been implemented in a field-programmable gate array (FPGA). At the time of this reporting, this is the first known hardware SCPPM decoder. The SCPPM coding scheme, conceived for free-space optical communications with both deep-space and terrestrial applications in mind, is an improvement of several dB over the conventional Reed-Solomon PPM scheme. The design of the FPGA SCPPM decoder is based on a turbo decoding algorithm that requires relatively low computational complexity while delivering error-rate performance within approximately 1 dB of channel capacity. The SCPPM encoder consists of an outer convolutional encoder, an interleaver, an accumulator, and an inner modulation encoder (more precisely, a mapping of bits to PPM symbols). Each code is describable by a trellis (a finite directed graph). The SCPPM decoder consists of an inner soft-in-soft-out (SISO) module, a de-interleaver, an outer SISO module, and an interleaver connected in a loop (see figure). Each SISO module applies the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm to compute a-posteriori bit log-likelihood ratios (LLRs) from apriori LLRs by traversing the code trellis in forward and backward directions. The SISO modules iteratively refine the LLRs by passing the estimates between one another much like the working of a turbine engine. Extrinsic information (the difference between the a-posteriori and a-priori LLRs) is exchanged rather than the a-posteriori LLRs to minimize undesired feedback. All computations are performed in the logarithmic domain, wherein multiplications are translated into additions, thereby reducing complexity and sensitivity to fixed-point implementation roundoff errors. To lower the required memory for storing channel likelihood data and the amounts of data transfer between the decoder and the receiver, one can discard the majority of channel likelihoods, using only the remainder in operation of the decoder. This is accomplished in the receiver by transmitting only a subset consisting of the likelihoods that correspond to time slots containing the largest numbers of observed photons during each PPM symbol period. The assumed number of observed photons in the remaining time slots is set to the mean of a noise slot. In low background noise, the selection of a small subset in this manner results in only negligible loss. Other features of the decoder design to reduce complexity and increase speed include (1) quantization of metrics in an efficient procedure chosen to incur no more than a small performance loss and (2) the use of the max-star function that allows sum of exponentials to be computed by simple operations that involve only an addition, a subtraction, and a table lookup. Another prominent feature of the design is a provision for access to interleaver and de-interleaver memory in a single clock cycle, eliminating the multiple clock-cycle latency characteristic of prior interleaver and de-interleaver designs.
There is considerable interest at this time in developing small satellites for quick-turnaround missions to investigate near-earth phenomena from space. One problem to be solved in mission planning is the means of communication between the control infrastructure in the ground segment and the satellite in the space segment. A nominal small-satellite mission design often includes an omni-directional or similar wide-pattern antenna on the satellite and a dedicated ground station for telemetry, tracking, and command support. These terminals typically provide up to 15 minutes of coverage during an orbit that is within the visibility of the ground station; however, not all orbits will pass over the ground station so that coverage gaps will exist in the data flow. To overcome this general limitation on data transmission for low-earth orbiting satellites, the Space Network (SN), operated by the National Aeronautics and Space Administration, (NASA) has been designed to transmit data to and from user satellites through the Tracking and Data Relay Satellites (TDRS) in geostationary orbit and interfacing to the White Sands Complex (WSC) in New Mexico for the data's ground entry point. The advantage of the SN over a fixed ground station is that all low-earth-satellite orbits will be within the visibility area of at least one TDRS within the SN for a large part of the orbit and the potential exists to establish a communications link if the user satellite can point an antenna in the direction of any one of the relay satellites. Within NASA, there is considerable interest in seeing that small satellite developers are aware of the advantages to the SN and that designs to include the SN are part of the satellite design. Small satellite users have not often considered using the SN because of: (1) The 26-dB link penalty differential between direct broadcast to a ground station and transmission through a TDRS to the ground; (2) The class of satellite is too small to support high-gain antennas and associated attitude control and drive electronics; (3) The class of satellites is severely weight and power limited; (4) There are perceived problems in scheduling communications for this class of user on the SN. This report addresses the potential for SN access using non-gimbaled, i.e. fixed-pointed, antennas in the design of the small satellite using modest transmission power to achieve the necessary space-to-ground transmissions. The advantage of using the SN is in the reduction of mission costs arising from using the SN infrastructure instead of a dedicated, proprietary ground station using a similar type of communications package. From the simulations and analysis presented, we will show that a modest satellite configuration can be used with the space network to achieve the data transmission goals of a number of users and thereby rival the performance achieved with proprietary ground stations. In this study, we will concentrate on the return data link (from the user satellite through a TDRS to the ground data entry point). The forward command link (from the ground data entry point through a TDRS to the user satellite) will usually be a lower data rate service and the data volume will also be considerably lower than the return link's requirement. Therefore, we assume that if the return link requirements are satisfied, then the forward link requirements can also be satisfied.