Deep Space Telecommunications Systems Engineering
03 Oct 2013-
TL;DR: A vital, often predominant function in every space mission is that of communications as mentioned in this paper, which is responsible for spending scientific data back to earth in the specified quality and quantity together with engineering data reporting the condition of the spacecraft.
Abstract: A vital, often predominant function in every space mission is that of communications. From the moment of launch, the only connection between spacecraft and earth is the communications systems. This system is responsible for spending scientific data back to earth in the specified quality and quantity together with engineering data reporting the condition of the spacecraft. The communications system also provides the capability of tracking the spacecraft and commanding it to take certain actions. Without an effective communications system a successful mission would not be possible.
Citations
More filters
01 Jul 1984
TL;DR: Characterization of (2(q + 1) + 2, 2, t, q)-min-hyper in PG(t, q) (t 3, q 5) and its applications to error-correcting codes and the theory of rank metric is transposed.
Abstract: We transpose the theory of rank metric. Gabidulin codes (8) W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes. Cambridge. Leech's construction is based on the binary Golay code of length. 24. Later on (13) V.Pless, An Introduction to the Theory of Error-Correcting Codes, Wi. Download full text in PDF Opens in a new window. R. Brualdi and V. Pless, On the length of codes with a given covering radius, Preprint. Introduction to the Theory of Functions of One VariableA. Characterization of (2(q + 1) + 2, 2, t, q)-min-hyper in PG(t, q) (t 3, q 5) and its applications to error-correcting codes. of Coding Theory. 5. 1.
148 citations
127 citations
Journal Article•
112 citations
01 Jul 1978
106 citations
TL;DR: In this article, the authors examine the commercialization of Claude Shannon's theory of communications, developed at and freely disseminated by Bell Telephone Laboratories, and compare the early paths of two MIT-related spinoffs that pursued this opportunity, including key technical and business trajectories driven by information theory.
Abstract: Recent research on the commercialization of scientific discoveries has emphasized the use of formal intellectual property rights (notably patents) as a mechanism for aligning the academic and entrepreneurial incentives for commercialization. Without such explicit intellectual property rights and licensing, how is such open science commercialized? This paper examines the commercialization of Claude Shannon's theory of communications, developed at and freely disseminated by Bell Telephone Laboratories. It analyses the first 25 years of Shannon theory, the role of MIT in developing and extending that theory, and the importance of deep space communications as the initial market for commercialization. It contrasts the early paths of two MIT-related spinoffs that pursued this opportunity, including key technical and business trajectories driven by information theory. Based on this evidence, the paper provides observations about commercializing open science, particularly for engineering-related fields.
47 citations
References
More filters
Book•
01 Jan 1977
TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Abstract: Linear Codes. Nonlinear Codes, Hadamard Matrices, Designs and the Golay Code. An Introduction to BCH Codes and Finite Fields. Finite Fields. Dual Codes and Their Weight Distribution. Codes, Designs and Perfect Codes. Cyclic Codes. Cyclic Codes: Idempotents and Mattson-Solomon Polynomials. BCH Codes. Reed-Solomon and Justesen Codes. MDS Codes. Alternant, Goppa and Other Generalized BCH Codes. Reed-Muller Codes. First-Order Reed-Muller Codes. Second-Order Reed-Muller, Kerdock and Preparata Codes. Quadratic-Residue Codes. Bounds on the Size of a Code. Methods for Combining Codes. Self-dual Codes and Invariant Theory. The Golay Codes. Association Schemes. Appendix A. Tables of the Best Codes Known. Appendix B. Finite Geometries. Bibliography. Index.
10,083 citations
Book•
01 Jan 1966
TL;DR: An introductory, graduate-level look at modern communications in general and radio communications in particular, with valuable insights into the fundamental concepts underlying today's communications systems, especially wireless communications.
Abstract: An introductory, graduate-level look at modern communications in general and radio communications in particular. This seminal presentation of the applications of communication theory to signal and receiver design brings you valuable insights into the fundamental concepts underlying today's communications systems, especially wireless communications. Coverage includes AM, FM Phase Modulation, PCM, fading, and diversity receivers.
1,415 citations
Book•
30 Jun 1981
TL;DR: This paper presents a meta-modelling architecture for Convolutional Code Structure and Viterbi Decoding, and some of the techniques used in this architecture can be applied to Group Codes and Block Codes.
Abstract: 1. Fundamental Concepts of Coding.- 2. Group Codes.- 3. Simple Nonalgebraic Decoding Techniques for Group Codes.- 4. Soft Decision Decoding of Block Codes.- 5. Algebraic Techniques for Multiple Error Correction.- 6. Convolutional Code Structure and Viterbi Decoding.- 7. Other Convolutional Decoding Techniques.- 8. System Applications.- Appendix A. Code Generators for BCH Codes.- Appendix B. Code Generators for Convolutional Codes.- B.1. Viterbi Decoding.- B.2. Table Look-up Decoding.- B.3. Threshold Decoding.- B.4. Sequential Decoding.- References.
1,208 citations
TL;DR: In a tutorial exposition, the following topics are discussed: definition of a matched filter; where matched filters arise; properties of matched filters; matched-filter synthesis and signal specification; some forms of matched filter.
Abstract: In a tutorial exposition, the following topics are discussed: definition of a matched filter; where matched filters arise; properties of matched filters; matched-filter synthesis and signal specification; some forms of matched filters.
1,138 citations
TL;DR: A new sequential decoding algorithm is introduced that uses stack storage at the receiver that is much simpler to describe and analyze than the Fano algorithm, and is about six times faster than the latter at transmission rates equal to Rcomp.
Abstract: In this paper a new sequential decoding algorithm is introduced that uses stack storage at the receiver It is much simpler to describe and analyze than the Fano algorithm, and is about six times faster than the latter at transmission rates equal to Rcomp the rate below which the average number of decoding steps is bounded by a constant Practical problems connected with implementing the stack algorithm are discussed and a scheme is described that facilitates satisfactory performance even with limited stack storage capacity Preliminary simulation results estimating the decoding effort and the needed stack siazree presented
635 citations