Cyclic codes and exponential sums
Cyclic codes for error correction noting connection with exponential sum theorems
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.
Cyclic codes for error correction noting connection with exponential sum theorems
Digital data processing and error correcting code techniques applied to Apollo unified S band communication system
Error correcting codes and data compression techniques for PCM adaptive telemetry systems - abstracts
Blizard decoding algorithm for binary linear error correcting codes
Data compression and error correcting codes applied to digital transmission of real time, standard format TV, along with voice and other data from Apollo spacecraft
A compromise optimum design for the low data rate users of the Tracking and Data Relay Satellite System (TDRSS) is presented. Design goals for the TDRSS are employed in this report to arrive at the transponder design. Multipath, R.F.I., antenna pattern anomolies, other user signals, and other definable degrading factors are included as trade-off parameters in the design. Synchronization, emergency voice, user stabilization, polarization diversity and error control coding are also considered and their impact on the transponder design is evaluated.
A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.
A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.
A study of the linear feedback shift registers corresponding to a subset of nonprimitive irreducible polynomials over GF(2) has uncovered a class of sequences with interesting structures and cyclic correlation properties. These families of sequences are made up of interleaved identical sequences which are from primitive irreducible polynomials. Furthermore, they have correlation functions which are two or three valued, being constant at zero or a small value throughout most of their length with the exception of a small number of impulses. Each interval between such impulses on the correlograms uniquely corresponds to (and thus uniquely identifies) the member sequence or sequences producing it. It is shown that these families of sequences have direct application as error-correcting codes.
The results of several studies Space Shuttle communication system are summarized. These tasks can be divided into the following categories: (1) phase multiplexing for two- and three-channel data transmission, (2) effects of phase noise on the performance of coherent communication links, (3) analysis of command system performance, (4) error correcting code tradeoffs, (5) signal detection and angular search procedure for the shuttle Ku-band communication system, and (6) false lock performance of Costas loop receivers.
Deep Space Network support of Helios mission operations is discussed. Included is information on the Helios 1, 7th aphelion, Helios 2, 5th aphelion, science experiments, 22-bit error polynomial code (EPC) testing, and other mission-related activities. Mission operations and status are summarized and specific correction commands are described. Special activities and experiments include Faraday rotation data collection and a solar wind tracks experiment.
An integrated set of FORTRAN tools that are commercially available is described. The basic purpose of various tools is summarized and their economic impact highlighted. The areas addressed by these tools include: code auditing, error detection, program portability, program instrumentation, documentation, clerical aids, and quality assurance.
The paper describes the Modular Data System concept of the NASA End-to-End Data System program. Data from a single instrument along with the necessary ancillary data will be assembled into self-contained packets and subsequently transmitted over various communications links (space telemetry channel, ground communications circuits, etc.) to the experimenter's facility in real time; reliable error control coding will be included in each link transmission to protect the integrity of the data packets. A major objective is to make the entire data acquisition and distribution process transparent to the experimenter in the sense that the output terminal of the distribution system will be physically, logically and electrically identical to that of the experiment output channel.
Time-shared interface speeds data processing in distributed computer network. Two-level high-speed scanning approach routes information to buffer, portion of which is reserved for series of "first-in, first-out" memory stacks. Buffer address structure and memory are protected from noise or failed components by error correcting code. System is applicable to any computer or processing language.
The software for selected space shuttle components are examined for potential problem areas and possible suboptimal coding techniques. Errors discovered in the procedure termination routine are discussed. The technique used to store status flags is found not to be as efficient as possible, from both the standpoints of memory usage and processing time. Self-test routines are examined with the intent of providing a more detailed description of multiplexer/demultiplexer and display and control outputs. An example of a reconfiguration is presented with a block diagram to indicate the critical paths. A cross-reference table of status flags is given to aid in tracing the functional activity of software modules.
The paper defines higher dimensional Hadamard matrices and enumerates on some of the simplest three-, four-, and five-dimensional cases and procedures for generating them. Special emphasis is given to proper matrices that have a dimensional hierarchy of orthogonalities. It is determined that this property lends itself primarily to the application of higher dimensional Hadamard matrices to error-correcting codes. A list of derived statements for n-dimensional Hadamard matrices are given, as well as a definition of Hadamard matrix families, such as minimal, Petrie polygon, antipodal (n-2)-dimensional sections, and double proximity shells.
The book presents an introductory treatment of digital and analog communication systems with emphasis on digital systems. Attention is given to the following topics: systems and signal analysis, random signal theory, information and channel capacity, baseband data transmission, analog signal transmission, noise in analog communication systems, digital carrier modulation schemes, error control coding, and the digital transmission of analog signals.
An examination is conducted of the coded bit error rate (BER) performance of a satellite communication system in which binary phase-shift-keyed (BPSK) modulation is employed, pulsed CW or pulsed noise RFI is present, and the transponder contains a nonlinearity characterized by arbitrary AM/AM and AM/PM characteristics; the RFI pulse duration is further assumed to exceed that of the information symbol. Computed performance curves consider several hypothetical RFI scenarios in which either a hard limiter or an 8 dB clipper represent the transponder amplitude nonlinearity. Results demonstrate the potential seriousness of RFI duty cycles as low as 2 percent, and the fact that CW represents the most severe form of interference.