SEARCH · Engineering Papers
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.
A system that includes sensors and data acquisition, wireless data-communication, and data-processing subsystems has been developed as a means of both real-time and historical tracking of information indicative of deterioration in the mechanical integrity and performance of a highgeared ball valve or a linearly actuated valve that operates at a temperature between cryogenic and ambient.
Efforts are under way to develop data-acquisition, data-processing, and data-communication systems for monitoring disasters over large geographic areas by use of uninhabited aerial systems (UAS) robotic aircraft that are typically piloted by remote control. As integral parts of advanced, comprehensive disaster- management programs, these systems would provide (1) real-time data that would be used to coordinate responses to current disasters and (2) recorded data that would be used to model disasters for the purpose of mitigating the effects of future disasters and planning responses to them. The basic idea is to equip UAS with sensors (e.g., conventional video cameras and/or multispectral imaging instruments) and to fly them over disaster areas, where they could transmit data by radio to command centers. Transmission could occur along direct line-of-sight paths and/or along over-the-horizon paths by relay via spacecraft in orbit around the Earth. The initial focus is on demonstrating systems for monitoring wildfires; other disasters to which these developments are expected to be applicable include floods, hurricanes, tornadoes, earthquakes, volcanic eruptions, leaks of toxic chemicals, and military attacks. The figure depicts a typical system for monitoring a wildfire. In this case, instruments aboard a UAS would generate calibrated thermal-infrared digital image data of terrain affected by a wildfire. The data would be sent by radio via satellite to a data-archive server and image-processing computers. In the image-processing computers, the data would be rapidly geo-rectified for processing by one or more of a large variety of geographic-information- system (GIS) and/or image-analysis software packages. After processing by this software, the data would be both stored in the archive and distributed through standard Internet connections to a disaster-mitigation center, an investigator, and/or command center at the scene of the fire. Ground assets (in this case, firefighters and/or firefighting equipment) would also be monitored in real time by use of Global Positioning System (GPS) units and radio communication links between the assets and the UAS. In this scenario, the UAS would serve as a data-relay station in the sky, sending packets of information concerning the locations of assets to the image-processing computer, wherein this information would be incorporated into the geo-rectified images and maps. Hence, the images and maps would enable command-center personnel to monitor locations of assets in real time and in relation to locations affected by the disaster. Optionally, in case of a disaster that disrupted communications, the UAS could be used as an airborne communication relay station to partly restore communications to the affected area. A prototype of a system of this type was demonstrated in a project denoted the First Response Experiment (Project FiRE). In this project, a controlled outdoor fire was observed by use of a thermal multispectral scanning imager on a UAS that delivered image data to a ground station via a satellite uplink/ downlink telemetry system. At the ground station, the image data were geo-rectified in nearly real time for distribution via the Internet to firefighting managers. Project FiRE was deemed a success in demonstrating several advances essential to the eventual success of the continuing development effort.
Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low error floors as well as low decoding thresholds. As an example, the illustration shows the protograph (which represents the blueprint for overall construction) of one proposed code family for code rates greater than or equal to 1.2. Any size LDPC code can be obtained by copying the protograph structure N times, then permuting the edges. The illustration also provides Field Programmable Gate Array (FPGA) hardware performance simulations for this code family. In addition, the illustration provides minimum signal-to-noise ratios (Eb/No) in decibels (decoding thresholds) to achieve zero error rates as the code block size goes to infinity for various code rates. In comparison with the codes mentioned in the preceding article, these codes have slightly higher decoding thresholds.
A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to channel capacity limits can be achieved for the codes of the type in question having low maximum variable node degrees. The decoding thresholds in these examples are lower than those of the best-known unstructured irregular LDPC codes constrained to have the same maximum node degrees. Furthermore, the present method enables the construction of codes of any desired rate with thresholds that stay uniformly close to their respective channel capacity thresholds.
A very-large-scale-integrated-circuit (VLSI) turbo decoder has been designed to serve as a compact, high-throughput, low-power, lightweight decoder core of a receiver in a data-communication system. In a typical contemplated application, such a decoder core would be part of a single integrated circuit that would include the rest of the receiver circuitry and possibly some or all of the transmitter circuitry, all designed and fabricated together according to an advanced communication-system-on-a-chip design concept. Turbo codes are forward-error-correction (FEC) codes. Relative to older FEC codes, turbo codes enable communication at lower signal-to-noise ratios and offer greater coding gain. In addition, turbo codes can be implemented by relatively simple hardware. Therefore, turbo codes have been adopted as standard for some advanced broadband communication systems.
An improved method has been devised for controlling the DC bias applied to an electro-optical crystal that is part of a Mach-Zehnder modulator that generates low-duty-cycle optical pulses for a pulse-position modulation (PPM) optical data-communication system. In such a system, it is desirable to minimize the transmission of light during the intervals between pulses, and for this purpose, it is necessary to maximize the extinction ratio of the modulator (the ratio between the power transmitted during an "on" period and the power transmitted during an "off" period). The present method is related to prior dither error feedback methods, but unlike in those methods, there is no need for an auxiliary modulation subsystem to generate a dithering signal. Instead, as described below, dither is effected through alternation of the polarity of the modulation signal. The upper part of Figure 1 schematically depicts a Mach-Zehnder modulator. The signal applied to the electro-optical crystal consists of a radio-frequency modulating pulse signal, VRF, superimposed on a DC bias Vbias. Maximum extinction occurs during the off (VRF = 0) period if Vbias is set at a value that makes the two optical paths differ by an odd integer multiple of a half wavelength so that the beams traveling along the two paths interfere destructively at the output beam splitter. Assuming that the modulating pulse signal VRF has a rectangular waveform, maximum transmission occurs during the "on" period if the amplitude of VRF is set to a value, V , that shifts the length of the affected optical path by a half wavelength so that now the two beams interfere constructively at the output beam splitter. The modulating pulse signal is AC-coupled from an amplifier to the electro-optical crystal. Sometimes, two successive pulses occur so close in time that the operating point of the amplifier drifts, one result being that there is not enough time for the signal level to return to ground between pulses. Also, the difference between the optical-path lengths can drift with changes in temperature and other spurious effects. The effects of both types of drift are suppressed in the present method, in which one takes advantage of the fact that when Vbias is set at the value for maximum extinction, equal-magnitude positive and negative pulses applied to the electro-optical crystal produce equal output light pulses.
Accumulate-repeat-accumulate-accumulate (ARAA) codes have been proposed, inspired by the recently proposed accumulate-repeat-accumulate (ARA) codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. ARAA codes can be regarded as serial turbolike codes or as a subclass of low-density parity-check (LDPC) codes, and, like ARA codes they have projected graph or protograph representations; these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The objective in proposing ARAA codes as a subclass of ARA codes was to enhance the error-floor performance of ARA codes while maintaining simple encoding structures and low maximum variable node degree.
Topics covered include: Magnetic-Field-Response Measurement-Acquisition System; Platform for Testing Robotic Vehicles on Simulated Terrain; Interferometer for Low-Uncertainty Vector Metrology; Rayleigh Scattering for Measuring Flow in a Nozzle Testing Facility; "Virtual Feel" Capaciflectors; FETs Based on Doped Polyaniline/Polyethylene Oxide Fibers; Miniature Housings for Electronics With Standard Interfaces; Integrated Modeling Environment; Modified Recursive Hierarchical Segmentation of Data; Sizing Structures and Predicting Weight of a Spacecraft; Stress Testing of Data-Communication Networks; Framework for Flexible Security in Group Communications; Software for Collaborative Use of Large Interactive Displays; Microsphere Insulation Panels; Single-Wall Carbon Nanotube Anodes for Lithium Cells; Tantalum-Based Ceramics for Refractory Composites; Integral Flexure Mounts for Metal Mirrors for Cryogenic Use; Templates for Fabricating Nanowire/Nanoconduit- Based Devices; Measuring Vapors To Monitor the State of Cure of a Resin; Partial-Vacuum-Gasketed Electrochemical Corrosion Cell; Theodolite Ring Lights; Integrating Terrain Maps Into a Reactive Navigation Strategy; Reducing Centroid Error Through Model-Based Noise Reduction; Adaptive Modeling Language and Its Derivatives; Stable Satellite Orbits for Global Coverage of the Moon; and Low-Cost Propellant Launch From a Tethered Balloon
Short-block low-density parity-check (LDPC) codes of a special type are intended to be especially well suited for potential applications that include transmission of command and control data, cellular telephony, data communications in wireless local area networks, and satellite data communications. [In general, LDPC codes belong to a class of error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels.] The codes of the present special type exhibit low error floors, low bit and frame error rates, and low latency (in comparison with related prior codes). These codes also achieve low maximum rate of undetected errors over all signal-to-noise ratios, without requiring the use of cyclic redundancy checks, which would significantly increase the overhead for short blocks. These codes have protograph representations; this is advantageous in that, for reasons that exceed the scope of this article, the applicability of protograph representations makes it possible to design highspeed iterative decoders that utilize belief- propagation algorithms.
A system of software has been developed to coordinate the operation of an autonomous Earth-observing sensorweb. Sensorwebs are collections of sensor units scattered over large regions to gather data on spatial and temporal patterns of physical, chemical, or biological phenomena in those regions. Each sensor unit is a node in a data-gathering/ data-communication network that spans a region of interest. In this case, the region is the entire Earth, and the sensorweb includes multiple terrestrial and spaceborne sensor units. In addition to acquiring data for scientific study, the sensorweb is required to give timely notice of volcanic eruptions, floods, and other hazardous natural events. In keeping with the inherently modular nature of the sensory, communication, and data-processing hardware, the software features a flexible, modular architecture that facilitates expansion of the network, customization of conditions that trigger alarms of hazardous natural events, and customization of responses to alarms. The soft8 NASA Tech Briefs, July 2006 ware facilitates access to multiple sources of data on an event of scientific interest, enables coordinated use of multiple sensors in rapid reaction to detection of an event, and facilitates the tracking of spacecraft operations, including tracking of the acquisition, processing, and downlinking of requested data.
Practical Simulator Network (PSimNet) is a set of data-communication protocols designed especially for use in handling messages between computers that are engaging cooperatively in real-time or nearly-real-time training simulations. In a typical application, computers that provide individualized training at widely dispersed locations would communicate, by use of PSimNet, with a central host computer that would provide a common computational- simulation environment and common data. Originally intended for use in supporting interfaces between training computers and computers that simulate the responses of spacecraft scientific payloads, PSimNet could be especially well suited for a variety of other applications -- for example, group automobile-driver training in a classroom. Another potential application might lie in networking of automobile-diagnostic computers at repair facilities to a central computer that would compile the expertise of numerous technicians and engineers and act as an expert consulting technician.
A prototype wireless data-communication and control system automatically modifies the switching of traffic lights to give priority to emergency vehicles. The system, which was reported in several NASA Tech Briefs articles at earlier stages of development, includes a transponder on each emergency vehicle, a monitoring and control unit (an intersection controller) at each intersection equipped with traffic lights, and a central monitoring subsystem. An essential component of the system is a software module executed by a microcontroller in each transponder. This module integrates and broadcasts data on the position, velocity, acceleration, and emergency status of the vehicle. The position, velocity, and acceleration data are derived partly from the Global Positioning System, partly from deductive reckoning, and partly from a diagnostic computer aboard the vehicle. The software module also monitors similar broadcasts from other vehicles and from intersection controllers, informs the driver of which intersections it controls, and generates visible and audible alerts to inform the driver of any other emergency vehicles that are close enough to create a potential hazard. The execution of the software module can be monitored remotely and the module can be upgraded remotely and, hence, automatically
A data-communication protocol has been devised to enable secure, reliable remote control of processes and equipment via a collision-based network, while using minimal bandwidth and computation. The network could be the Internet or an intranet. Control is made secure by use of both a password and a dynamic key, which is sent transparently to a remote user by the controlled computer (that is, the computer, located at the site of the equipment or process to be controlled, that exerts direct control over the process). The protocol functions in the presence of network latency, overcomes errors caused by missed dynamic keys, and defeats attempts by unauthorized remote users to gain control. The protocol is not suitable for real-time control, but is well suited for applications in which control latencies up to about 0.5 second are acceptable. The encryption scheme involves the use of both a dynamic and a private key, without any additional overhead that would degrade performance. The dynamic key is embedded in the equipment- or process-monitor data packets sent out by the controlled computer: in other words, the dynamic key is a subset of the data in each such data packet. The controlled computer maintains a history of the last 3 to 5 data packets for use in decrypting incoming control commands. In addition, the controlled computer records a private key (password) that is given to the remote computer. The encrypted incoming command is permuted by both the dynamic and private key. A person who records the command data in a given packet for hostile purposes cannot use that packet after the public key expires (typically within 3 seconds). Even a person in possession of an unauthorized copy of the command/remote-display software cannot use that software in the absence of the password. The use of a dynamic key embedded in the outgoing data makes the central-processing unit overhead very small. The use of a National Instruments DataSocket(TradeMark) (or equivalent) protocol or the User Datagram Protocol makes it possible to obtain reasonably short response times: Typical response times in event-driven control, using packets sized .300 bytes, are <0.2 second for commands issued from locations anywhere on Earth. The protocol requires that control commands represent absolute values of controlled parameters (e.g., a specified temperature), as distinguished from changes in values of controlled parameters (e.g., a specified increment of temperature). Each command is issued three or more times to ensure delivery in crowded networks. The use of absolute-value commands prevents additional (redundant) commands from causing trouble. Because a remote controlling computer receives "talkback" in the form of data packets from the controlled computer, typically within a time interval < or =1 s, the controlling computer can re-issue a command if network failure has occurred. The controlled computer, the process or equipment that it controls, and any human operator(s) at the site of the controlled equipment or process should be equipped with safety measures to prevent damage to equipment or injury to humans. These features could be a combination of software, external hardware, and intervention by the human operator(s). The protocol is not fail-safe, but by adopting these safety measures as part of the protocol, one makes the protocol a robust means of controlling remote processes and equipment by use of typical office computers via intranets and/or the Internet.
A report describes the tentative design of the avionics of the Mini-AERCam -- a proposed 7.5-in. (approximately 19-cm)-diameter spacecraft that would contain three digital video cameras to be used in visual inspection of the exterior of a larger spacecraft (a space shuttle or the International Space Station). The Mini-AERCam would maneuver by use of its own miniature thrusters under radio control by astronauts inside the larger spacecraft. The design of the Mini-AERCam avionics is subject to a number of constraints, most of which can be summarized as severely competing requirements to maximize radiation hardness and maneuvering, image-acquisition, and data-communication capabilities while minimizing cost, size, and power consumption. The report discusses the design constraints, the engineering approach to satisfying the constraints, and the resulting iterations of the design. The report places special emphasis on the design of a flight computer that would (1) acquire position and orientation data from a Global Positioning System receiver and a microelectromechanical gyroscope, respectively; (2) perform all flight-control (including thruster-control) computations in real time; and (3) control video, tracking, power, and illumination systems.
Planetary-Ohio Network Emulator (p- ONE) is a computer program for local laboratory testing of high bandwidth data-communication systems subject to long delays in propagation over interplanetary distances. p-ONE is installed on a personal computer connected to two bidirectional Ethernet interfaces, denoted A and B, that represent local-area networks at opposite ends of a long propagation path. Traffic that is to be passed between A and B is encapsulated in IP (Internet Protocol) packets (e.g., User Data Protocol, UDP). Intercepting this traffic between A and B in both directions, p-ONE time-tags each packet and stores it in memory or on the hard disk of the computer for a user-specified interval that equals the propagation delay to be synthesized. At the expiration of its storage time, each such packet is sent to its destination (that is, if it was received from A, it is sent to B, or vice versa). The accuracy of the p-ONE software is very high, with zero packet loss through the system and negligible latency. Optionally, p-ONE can be configured to delay all network traffic to and from all network addresses on each Ethernet interface or to selectively delay traffic between specific addresses or traffic of specific types. p-ONE works well with Linux and is also designed to be compatible with other operating systems.
Highly reliable, high-speed, unidirectional serial data-communication subsystems have been proposed to be installed in an upgrade of the computing systems aboard the space shuttles. The basic design concept of these serial data links is also adaptable to terrestrial use in applications in which there are requirements for highly reliable serial data communications. The hardware and software aspects of the architecture of the data links are dictated largely by a requirement, in the original space-shuttle application, for one computer to monitor the memory transactions and memory contents of other computers in real time with high reliability and without reliance on requests for retransmission. To minimize weight while affording a capability to transfer data at a required rate of 2.56 x 10(exp 8) bits per second, it was decided that the links would be serial ones of the fiber-channel type. [Fiber channel denotes a type of serial computer bus that is used to connect a computer (usually a supercomputer) with a high-speed data storage device. Depending on the specific application, the physical connection between the transmitter and receiver could be made via an optical fiber or a twisted pair of wires.] Heretofore, fiber-channel links have ordinarily been bidirectional and have operated under protocols that provide for receiving stations to detect errors and request retransmission when necessary. In the present case, the time taken by processing to request retransmission would conflict with the requirement for real-time transfer of data. To ensure reliability without retransmission, a link according to the proposal would utilize a modified version of the normal fiberchannel character set in conjunction with forward error correction by means of a Reed-Solomon code (see figure). The Reed-Solomon encoding and decoding and the translations between the normal and modified character sets would be effected by logic circuitry external to the fiber-channel transmitter and receiver, which would be commercial off-the-shelf units. The receiving end of the link could detect and correct errors at a rate as high as 4 million times per second, if necessary. The receiver detects uncorrectable double-byte errors. It has been estimated that uncorrectable-error rate would amount to one failure in about 10(exp 19) characters.
Topics covered include: Multisensor Instrument for Real-Time Biological Monitoring; Sensor for Monitoring Nanodevice-Fabrication Plasmas; Backed Bending Actuator; Compact Optoelectronic Compass; Micro Sun Sensor for Spacecraft; Passive IFF: Autonomous Nonintrusive Rapid Identification of Friendly Assets; Finned-Ladder Slow-Wave Circuit for a TWT; Directional Radio-Frequency Identification Tag Reader; Integrated Solar-Energy-Harvesting and -Storage Device; Event-Driven Random-Access-Windowing CCD Imaging System; Stroboscope Controller for Imaging Helicopter Rotors; Software for Checking State-charts; Program Predicts Broadband Noise from a Turbofan Engine; Protocol for a Delay-Tolerant Data-Communication Network; Software Implements a Space-Mission File-Transfer Protocol; Making Carbon-Nanotube Arrays Using Block Copolymers: Part 2; Modular Rake of Pitot Probes; Preloading To Accelerate Slow-Crack-Growth Testing; Miniature Blimps for Surveillance and Collection of Samples; Hybrid Automotive Engine Using Ethanol-Burning Miller Cycle; Fabricating Blazed Diffraction Gratings by X-Ray Lithography; Freeze-Tolerant Condensers; The StarLight Space Interferometer; Champagne Heat Pump; Controllable Sonar Lenses and Prisms Based on ERFs; Measuring Gravitation Using Polarization Spectroscopy; Serial-Turbo-Trellis-Coded Modulation with Rate-1 Inner Code; Enhanced Software for Scheduling Space-Shuttle Processing; Bayesian-Augmented Identification of Stars in a Narrow View; Spacecraft Orbits for Earth/Mars-Lander Radio Relay; and Self-Inflatable/Self-Rigidizable Reflectarray Antenna.
Coding schemes have been designed and investigated specifically for optical and electronic data-communication channels in which information is conveyed via pulse-position modulation (PPM) subject to dead-time constraints. These schemes involve the use of error-correcting codes concatenated with codes denoted constrained codes. These codes are decoded using an interactive method. In pulse-position modulation, time is partitioned into frames of Mslots of equal duration. Each frame contains one pulsed slot (all others are non-pulsed). For a given channel, the dead-time constraints are defined as a maximum and a minimum on the allowable time between pulses. For example, if a Q-switched laser is used to transmit the pulses, then the minimum allowable dead time is the time needed to recharge the laser for the next pulse. In the case of bits recorded on a magnetic medium, the minimum allowable time between pulses depends on the recording/playback speed and the minimum distance between pulses needed to prevent interference between adjacent bits during readout. The maximum allowable dead time for a given channel is the maximum time for which it is possible to satisfy the requirement to synchronize slots. In mathematical shorthand, the dead-time constraints for a given channel are represented by the pair of integers (d,k), where d is the minimum allowable number of zeroes between ones and k is the maximum allowable number of zeroes between ones. A system of the type to which the present schemes apply is represented by a binary- input, real-valued-output channel model illustrated in the figure. At the transmitting end, information bits are first encoded by use of an error-correcting code, then further encoded by use of a constrained code. Several constrained codes for channels subject to constraints of (d,infinity) have been investigated theoretically and computationally. The baseline codes chosen for purposes of comparison were simple PPM codes characterized by M-slot PPM frames separated by d-slot dead times.