Adaptive telemetry systems Final report, 1 May 1968 - 1 Feb. 1971
Error correcting codes and data compression techniques for PCM adaptive telemetry systems - abstracts
Wintz, P. A.↗
SEARCH · Search NASA
Results for “error correcting codes”
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.
On the Blizard decoding algorithm
Blizard decoding algorithm for binary linear error correcting codes
Welch, L. R.↗
Compression and error correction for TV
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
Blizard, R. B.↗
Families of shift-register sequences with impulsive correlation properties
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.
Lee, J.-J.↗
Integrated source and channel encoded digital communication system design study
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.
Huth, G. K.↗
Common data buffer
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.
Byrne, F.↗
Higher dimensional Hadamard matrices
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.
Schlichta, P. J.↗
Reed-Solomon Encoder
Report presents mathematical principles of Berlekamp bit serial multiplier algorithm and its application to design of very-large-scale integrated (VLSI) encoders for Reed-Solomon error-correcting codes. Structure made readily on single chip of negatively doped channel metal oxide semiconductor.
Troung, T. K.↗
Fast VLSI Viterbi Decoder
Fast Viterbi decoder with fully parallel, pipeline architecture implemented on two VLSI NMOS chips. Decoder used with constraint-length-7, rate-1/2, convolutional error-correcting code widely used by NASA for deepspace telemetry data. With this (7,1/2) code, bit stream contains 2 bits per original data bit, and information about 1 data bit distributed over 7 pairs of bits. Design principles of decoder also applicable to Viterbi codes of other lengths and rates.
Wang, C. C.↗
VLSI Architectures for Computing DFT's
Simplifications result from use of residue Fermat number systems. System of finite arithmetic over residue Fermat number systems enables calculation of discrete Fourier transform (DFT) of series of complex numbers with reduced number of multiplications. Computer architectures based on approach suitable for design of very-large-scale integrated (VLSI) circuits for computing DFT's. General approach not limited to DFT's; Applicable to decoding of error-correcting codes and other transform calculations. System readily implemented in VLSI.
Truong, T. K.↗
Improved Algorithm For Finite-Field Normal-Basis Multipliers
Improved algorithm reduces complexity of calculations that must precede design of Massey-Omura finite-field normal-basis multipliers, used in error-correcting-code equipment and cryptographic devices. Algorithm represents an extension of development reported in "Algorithm To Design Finite-Field Normal-Basis Multipliers" (NPO-17109), NASA Tech Briefs, Vol. 12, No. 5, page 82.
Wang, C. C.↗
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↗
Advanced communications payload for mobile applications
An advanced satellite payload is proposed for single hop linking of mobile terminals of all classes as well as Very Small Aperture Terminal's (VSAT's). It relies on an intensive use of communications on-board processing and beam hopping for efficient link design to maximize capacity and a large satellite antenna aperture and high satellite transmitter power to minimize the cost of the ground terminals. Intersatellite links are used to improve the link quality and for high capacity relay. Power budgets are presented for links between the satellite and mobile, VSAT, and hub terminals. Defeating the effects of shadowing and fading requires the use of differentially coherent demodulation, concatenated forward error correction coding, and interleaving, all on a single link basis.
Ames, S. A.↗
New multilevel 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↗
Design Consideration on the ACTS T1-VSAT
The Advanced Communications Technology Satellite (ACTS) was developed by NASA as an experimental platform to demonstrate to industry the high risk technologies need for the next generation of communication satellites. The ACTS contains many state-of-the-art technologies including time division multiple accessing, adaptive error correction coding, multiple electronically steerable hopping beam antennas, spectrally efficient SMSK modulation, demand assignment multiple access protocol and on-board baseband circuit switching. An integral part of this testbed is the ACTS T1-very small aperture terminal (VSAT). The requirements imposed on the T1-VSAT demanded numerous design tradeoffs; balancing risk, cost, and implementation. Some of these considerations include: the method used for determining link quality, the development of a low cost and reliable Ka-band high power amplifier, the integration and testing environment for use in development and production and the low cost signal processing solution to high rate burst data. This paper discusses the tradeoffs considered in the selected implementation and the results obtained over the past two years of operation. Recommendations for improvements are also included.
Lilley, Richard D.↗
Automated Operations for Galileo Communications
Following the deployment failure of Galileo's high gain antenna, the downlink had to be redesigned so as to effectively use the low gain antenna. The downlink was redesigned to maximize the data return and increase the reliability which required the reconfiguration of the onboard software and the deep space network. The revised downlink features: data compression; antenna arraying; the recoding and reprocessing of telemetry; suppressed carrier tracking, and error-correction coding. The deep space network Galileo telemetry (DGT) subsystem was developed and deployed at three sites in Australia, Spain and the U.S. The DGT was designed as an automated system that continuously monitors and adjusts its parameters and environment in response to either pre-loaded sequences or changes in the internal status.
Statman, Joseph I.↗
On The Computational Capabilities of Physical Systems: Relationship With Conventional Computer Science - Part 2
In the first of this pair of papers, it was proven that there cannot be a physical computer to which one can properly pose any and all computational tasks concerning the physical universe. It was then further proven that no physical computer C can correctly carry out all computational tasks that can be posed to C. As a particular example, this result means that no physical computer that can, for any physical system external to that computer, take the specification of that external system's state as input and then correctly predict its future state before that future state actually occurs; one cannot build a physical computer that can be assured of correctly "processing information faster than the universe does". These results do not rely on systems that are infinite, and/or non-classical, and/or obey chaotic dynamics. They also hold even if one uses an infinitely fast, infinitely dense computer, with computational powers greater than that of a Turing Machine. This generality is a direct consequence of the fact that a novel definition of computation - "physical computation" - is needed to address the issues considered in these papers, which concern real physical computers. While this novel definition does not fit into the traditional Chomsky hierarchy, the mathematical structure and impossibility results associated with it have parallels in the mathematics of the Chomsky hierarchy. This second paper of the pair presents a preliminary exploration of some of this mathematical structure. Analogues of Chomskian results concerning universal Turing Machines and the Halting theorem are derived, as are results concerning the (im)possibility of certain kinds of error-correcting codes. In addition, an analogue of algorithmic information complexity, "prediction complexity", is elaborated. A task-independent bound is derived on how much the prediction complexity of a computational task can differ for two different reference universal physical computers used to solve that task, a bound similar to the "encoding" bound governing how much the algorithm information complexity of a Turing machine calculation can differ for two reference universal Turing machines. Finally, it is proven that either the Hamiltonian of our universe proscribes a certain type of computation, or prediction complexity is unique (unlike algorithmic information complexity), in that there is one and only version of it that can be applicable throughout our universe.
Wolpert, David H.↗
The New Galileo Communication System
ave been developed to get as much data as possible from the Galileo spacecraft even without the high gain antenna. These methods include extensive data compression, a new packetized telemetry format, new error-correcting codes, new modulation, new ground receivers, and antenna arraying. (abstract only).
Galileo data compression spacecraft mission operat↗