Home

Representation-Independent Iteration of Sparse Data Arrays

An approach is defined that describes a method of iterating over massively large arrays containing sparse data using an approach that is implementation independent of how the contents of the sparse arrays are laid out in memory. What is unique and important here is the decoupling of the iteration over the sparse set of array elements from how they are internally represented in memory. This enables this approach to be backward compatible with existing schemes for representing sparse arrays as well as new approaches. What is novel here is a new approach for efficiently iterating over sparse arrays that is independent of the underlying memory layout representation of the array. A functional interface is defined for implementing sparse arrays in any modern programming language with a particular focus for the Chapel programming language. Examples are provided that show the translation of a loop that computes a matrix vector product into this representation for both the distributed and not-distributed cases. This work is directly applicable to NASA and its High Productivity Computing Systems (HPCS) program that JPL and our current program are engaged in. The goal of this program is to create powerful, scalable, and economically viable high-powered computer systems suitable for use in national security and industry by 2010. This is important to NASA for its computationally intensive requirements for analyzing and understanding the volumes of science data from our returned missions.

Posted in: Briefs, TSP

Read More >>

Mission Operations of the Mars Exploration Rovers

A document describes a system of processes involved in planning, commanding, and monitoring operations of the rovers Spirit and Opportunity of the Mars Exploration Rover mission. The system is designed to minimize command turnaround time, given that inherent uncertainties in terrain conditions and in successful completion of planned landed spacecraft motions preclude planning of some spacecraft activities until the results of prior activities are known by the ground-based operations team. The processes are partitioned into those (designated as tactical) that must be tied to the Martian clock and those (designated strategic) that can, without loss, be completed in a more leisurely fashion. The tactical processes include assessment of downlinked data, refinement and validation of activity plans, sequencing of commands, and integration and validation of sequences. Strategic processes include communications planning and generation of long-term activity plans. The primary benefit of this partition is to enable the tactical portion of the team to focus solely on tasks that contribute directly to meeting the deadlines for commanding the rover’s each sol (1 sol = 1 Martian day) — achieving a turnaround time of 18 hours or less, while facilitating strategic team interactions with other organizations that do not work on a Mars time schedule.

Posted in: Briefs, TSP

Read More >>

More About Software for No-Loss Computing

A document presents some additional information on the subject matter of “Integrated Hardware and Software for No-Loss Computing” (NPO-42554), which appears elsewhere in this issue of NASA Tech Briefs. To recapitulate: The hardware and software designs of a developmental parallel computing system are integrated to effectuate a concept of noloss computing (NLC). The system is designed to reconfigure an application program such that it can be monitored in real time and further reconfigured to continue a computation in the event of failure of one of the computers. The design provides for (1) a distributed class of NLC computation agents, denoted introspection agents, that effects hierarchical detection of anomalies; (2) enhancement of the compiler of the parallel computing system to cause generation of state vectors that can be used to continue a computation in the event of a failure; and (3) activation of a recovery component when an anomaly is detected.

Posted in: Briefs, TSP

Read More >>

Special Semaphore Scheme for UHF Spacecraft Communications

A semaphore scheme has been devised to satisfy a requirement to enable ultrahigh- frequency (UHF) radio communication between a spacecraft descending from orbit to a landing on Mars and a spacecraft, in orbit about Mars, that relays communications between Earth and the lander spacecraft. There are also two subsidiary requirements: (1) to use UHF transceivers, built and qualified for operation aboard the spacecraft that operate with residual-carrier binary phase-shift-keying (BPSK) modulation at a selectable data rate of 8, 32, 128, or 256 kb/s; and (2) to enable low-rate signaling even when received signals become so weak as to prevent communication at the minimum BPSK rate of 8 kHz. The scheme involves exploitation of Manchester encoding, which is used in conjunction with residual-carrier modulation to aid the carrier-tracking loop. By choosing various sequences of 1s, 0s, or 1s alternating with 0s to be fed to the residual- carrier modulator, one would cause the modulator to generate sidebands at a fundamental frequency of 4 or 8 kHz and harmonics thereof. These sidebands would constitute the desired semaphores. In reception, the semaphores would be detected by a software demodulator.

Posted in: Briefs, TSP

Read More >>

Sequence Detection for PPM Optical Communication With ISI

Inter-symbol interference could be reduced. A method of sequence detection has been proposed to mitigate the effects of inter-slot interference and inter-symbol interference (both denoted “ISI”) in the reception of M-ary pulse-position modulation (PPM) optical signals. The method would make it possible to reduce the error rate for a given slot duration, to use a shorter slot duration (and, hence, to communicate at a higher rate) without exceeding a given error rate, or to use a lower-bandwidth (and, hence, less-expensive) receiver to receive a signal of a given slot width without exceeding a given error rate.

Posted in: Briefs, TSP

Read More >>

Algorithm for Rapid Searching Among Star-Catalog Entries

Recursive algorithm utilizes precompiled search structure of spherical coverings. An algorithm searches a star catalog to identify guide stars within the field of view of a telescope or camera. The algorithm is fast: the number of computations needed to perform the search is approximately proportional to the logarithm of the number of stars in the catalog.

Posted in: Briefs, TSP

Read More >>

Expectation-Based Control of Noise and Chaos

A proposed approach to control of noise and chaos in dynamic systems would supplement conventional methods. The approach is based on fictitious forces composed of expectations governed by Fokker-Planck or Liouville equations that describe the evolution of the probability densities of the controlled parameters. These forces would be utilized as feedback control forces that would suppress the undesired diffusion of the controlled parameters. Examples of dynamic systems in which the approach is expected to prove beneficial include spacecraft, electronic systems, and coupled lasers.

Posted in: Briefs, TSP

Read More >>

The U.S. Government does not endorse any commercial product, process, or activity identified on this web site.