Search NASA⌕ Search

SEARCH · Search NASA

Results for “error correction.”

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 829 records · Page 46

ACTS and OLYMPUS propagation experiments

The OLYMPUS and ACTS satellites both provide opportunities for 10 to 30 GHz propagation measurements. The spacecraft are sufficiently alike that OLYMPUS can be used to test some prototype ACTS equipment and experiments. Data are particularly needed on short term signal behavior and in support of uplink power control and adaptive forward error correction (FEC) techniques. The Virginia Tech Satellite Communications Group has proposed a set of OLYMPUS experiments including attenuation and fade rate measurements, data communications, uplink power control, rain scatter interference, and small-scale site diversity operation. A digital signal processing receiver for the OLYMPUS and ACTS beacon signals is being developed.

Bostian, Charles W.↗

Additional development of the XTRAN3S computer program

Additional developments and enhancements to the XTRAN3S computer program, a code for calculation of steady and unsteady aerodynamics, and associated aeroelastic solutions, for 3-D wings in the transonic flow regime are described. Algorithm improvements for the XTRAN3S program were provided including an implicit finite difference scheme to enhance the allowable time step and vectorization for improved computational efficiency. The code was modified to treat configurations with a fuselage, multiple stores/nacelles/pylons, and winglets. Computer program changes (updates) for error corrections and updates for version control are provided.

Borland, C. J.↗

A robust compression system for low bit rate telemetry: Test results with lunar data

A robust noiseless encoding scheme is presented for encoding the gamma ray spectroscopy data. The encoding algorithm is simple to implement and has minimal buffering requirements. The decoder contains error correcting capability in the form of a MAP receiver. While the MAP receiver adds some complexity, this is limited to the decoder. Nothing additional is needed at the encoder side for its functioning.

Sayood, Khalid↗

Phase-ambiguity resolution for QPSK modulation systems. Part 1: A review

Part 1 reviews the current phase-ambiguity resolution techniques for QPSK coherent modulation systems. Here, those known and published methods of resolving phase ambiguity for QPSK with and without Forward-Error-Correcting (FEC) are discussed. The necessary background is provided for a complete understanding of the second part where a new technique will be discussed. An appropriate technique to the Consultative Committee for Space Data Systems (CCSDS) is recommended for consideration in future standards on phase-ambiguity resolution for QPSK coherent modulation systems.

Nguyen, Tien Manh↗

dc-free coset codes

A class of block coset codes with disparity and run-length constraints are studied. They are particularly well suited for high-speed optical fiber links and similar channels, where dc-free pulse formats, channel error control, and low-complexity encoder-decoder implementations are required. The codes are derived by partitioning linear block codes. The encoder and decoder structures are the same as those of linear block codes with only slight modifications. A special class of dc-free coset block codes are derived from BCH codes with specified bounds on minimum distance, disparity, and run length. The codes have low disparity levels (a small running digital sum) and good error-correcting capabilities.

Deng, Robert H.↗

Flight software operation of the Hubble Space Telescope fine guidance sensor

The Hubble Space Telescope (HST) is to carry five major scientific instruments to collect imagery, spectrographic, and photometric astronomical data. The Pointing Control System is designed to achieve pointing accuracies and line of sight jitter levels an order of magnitude less than can be achieved with ground mounted telescopes. This paper describes the operation of the pointing control system flight software in targeting a celestial object in a science instrument aperture and in performing the coordinate transformations necessary for commanding the fine guidance sensor and determining the attitude-error corrections.

Rodden, J. J.↗

Gravity gradient measurements

It is shown that, for floated satellite gradiometers subject to very low levels of unmodeled forces and torques, dynamic estimation can dramatically reduce rotation correction errors. The filter structure is developed, and the value of factorization techniques is examined. Numerical examples are given for a few practical cases using plausible instrument ensembles. To achieve these early results, great simplifications have been made, and important error sources have been suppressed.

Sonnabend, D.↗

VLSI high speed packet processor

The Goddard Space Flight Center Mission Operations and Data Systems Directorate has developed a packet processor card utilizing semicustom very large scale integration (VLSI) devices, microprocessors, and programmable gate arrays to support the implementation of multichannel telemetry data capture systems. This card will receive synchronized error corrected telemetry transfer frames and output annotated application packets derived from this data. An adaptable format capability is provided by the programmability of three microprocessors while the throughput capability of the packet processor is achieved by a data pipeline consisting of two separate RAM systems controlled by specially designed semicustom VLSI logic.

Grebowsky, Gerald J.↗

Synchronization Technique For Reception Of Coded Data

Shortest sequence of bits likely to be filled with error bursts examined. Algorithm improves synchronization of frames of noisy binary-coded data signals after Viterbi decoding (recovery from "inner" convolutional code used in transmission channel) and before Reed-Solomon or other decoding (recovery from "outer" error-correcting block code). Based on comparisons of sequences of correct and erroneous Viterbi-decoded received bits with known marker sequence denoting beginning of frame of data. Does not require count of number of bits in received sequence disagreeing with corresponding bits in marker sequence.

Shahshahani, Mehrdad M.↗

Multiple-Trellis-Coded Modulation

Theoretical gain over simple multiple-phase-shift keying at least 2 to 3 decibels. Multiple-trellis-coded modulation scheme combined with M-ary modulation shows theoretically to yield asymptotic gains in performance over uncoded multiple-phase-shift keying, while employing symmetric multiple-phase-shift signal constellations and avoiding code catastrophe. Suitable for satellite and terrestrial-mobile/satellite communications or other communications requiring burst-error correction. Extended to such higher dimensional modulations as quadrature amplitude modulation.

Divsalar, D.↗

Finite-State Codes

New class of codes with desirable properties constructed from block codes. Finite-state encoder is machine that has finite number of internal states. Receives k parallel information symbols and transmits n parallel code symbols at each clock pulse. Finite-state codes include both block and convolutional codes. Theory of finite-state codes used to study properties of error-correcting codes in general and to design new codes to various specifications.

Pollara, F.↗

Ground-state coding in partially connected neural networks

Patterns over (-1,0,1) define, by their outer products, partially connected neural networks, consisting of internally strongly connected, externally weakly connected subnetworks. The connectivity patterns may have highly organized structures, such as lattices and fractal trees or nests. Subpatterns over (-1,1) define the subcodes stored in the subnetwork, that agree in their common bits. It is first shown that the code words are locally stable stares of the network, provided that each of the subcodes consists of mutually orthogonal words or of, at most, two words. Then it is shown that if each of the subcodes consists of two orthogonal words, the code words are the unique ground states (absolute minima) of the Hamiltonian associated with the network. The regions of attraction associated with the code words are shown to grow with the number of subnetworks sharing each of the neurons. Depending on the particular network architecture, the code sizes of partially connected networks can be vastly greater than those of fully connected ones and their error correction capabilities can be significantly greater than those of the disconnected subnetworks. The codes associated with lattice-structured and hierarchical networks are discussed in some detail.

Baram, Yoram↗

Transportation monitoring unit qualification

Transportation monitoring unit (TMU) qualification testing was performed between 3 Mar. and 14 Dec. 1989. The purpose of the testing was to qualify the TMUs to monitor and store temperature and acceleration data on redesigned solid rocket motor segments and exit cones while they are being shipped from Utah's Thiokol Corporation, Space Operations, to Kennedy Space Center. TMUs were subjected to transportation tests that concerned the structural integrity of the TMUs only, and did not involve TMU measuring capability. This testing was terminated prior to completion due to mounting plate failures, high and low temperature shutdown failures, and data collection errors. Corrective actions taken by the vendor to eliminate high temperature shutdowns were ineffective. An evaluation was performed on the TMUs to determine the TMU vibration and temperature measuring accuracy at a variety of temperatures. This test demonstrated that TMU measured shock levels are high, and that TMUs are temperature sensitive because of decreased accuracy at high and low temperatures. It was determined that modifications to the current TMU system, such that it could be qualified for use, would require a complete redesign and remanufacture. Because the cost of redesigning and remanufacturing the present TMU system exceeds the cost of procuring a new system that could be qualified without modification, it is recommended that an alternate transportation monitoring system be qualified.

Cook, M.↗

New multi-level codes over GF(q)

Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.

Wu, Jiantian↗

Ground Communication Facility (GCF) upgrade task for Deep Space Network

The GCF upgrade task for NASA's Deep Space Network (DSN) is described. The DSN is a multimission telecommunications and radiometric data facility used to support space science, exploration, and applications by communicating with spacecraft and observing other radio sources. The GCF upgrade task is a six-year project designed to increase the data rate throughout capacity from 280 kbps to 2.272 Mbps from each tracking area to JPL, and 224 kbps from JPL to each tracking area. This would be accomplished by using a selective automatic repeat request error correction scheme in all throughput data.

Hung, Chaw-Kwei↗

On-board switching and processing

Findings from NASA's space electronics division's (SED's) advanced systems studies related to future communications satellite services that will require onboard switching and processing technology are reviewed. SED's digital signal switching and processing technology program is reviewed. This program responds to specific systems technology development needs for enabling commercial development of future satellite services. The technologies include: modulators, demodulators, and forward error-correction hardware for space- and ground-based applications; onboard information switching and processing, onboard network control, and health monitoring; and cost-efficient ground terminals. The in-house systems integration, test, and evaluation (SITE) project, which includes a laboratory testbed for evaluating technology in a simulated systems environment, is reviewed.

Harrold, Joseph L.↗

On complexity of trellis structure of linear block codes

The trellis structure of linear block codes (LBCs) is discussed. The state and branch complexities of a trellis diagram (TD) for a LBC is investigated. The TD with the minimum number of states is said to be minimal. The branch complexity of a minimal TD for a LBC is expressed in terms of the dimensions of specific subcodes of the given code. Then upper and lower bounds are derived on the number of states of a minimal TD for a LBC, and it is shown that a cyclic (or shortened cyclic) code is the worst in terms of the state complexity among the LBCs of the same length and dimension. Furthermore, it is shown that the structural complexity of a minimal TD for a LBC depends on the order of its bit positions. This fact suggests that an appropriate permutation of the bit positions of a code may result in an equivalent code with a much simpler minimal TD. Boolean polynomial representation of codewords of a LBC is also considered. This representation helps in study of the trellis structure of the code. Boolean polynomial representation of a code is applied to construct its minimal TD. Particularly, the construction of minimal trellises for Reed-Muller codes and the extended and permuted binary primitive BCH codes which contain Reed-Muller as subcodes is emphasized. Finally, the structural complexity of minimal trellises for the extended and permuted, and double-error-correcting BCH codes is analyzed and presented. It is shown that these codes have relatively simple trellis structure and hence can be decoded with the Viterbi decoding algorithm.

Lin, Shu↗

Trellis coded modulation for transmission over fading mobile satellite channel

The combination of trellis coding and multiple phase-shift keyed (MPSK) signaling with asymmetry (nonuniform spacing) to the signal set is disclosed with regard to its suitability for a fading mobile satellite communication channel. For MPSK signaling, introducing nonuniformity in the phase spacing between signal points provides an improvement in performance over that achievable with trellis codes symmetric MPSK signaling, all this without increasing the average or peak power, or changing the bandwidth constraints imposed on the system. Block interleaving may be used to reduce error and pilot tone(s) may be used for improving the error correction performance of the trellis decoder in the presence of channel fading.

Simon, Marvin K.↗