AN ACQUIRABLE CODE,

Abstract

The problem of range measurement for vehicles in space is usually treated within the following framework. At the ground one transmits continuously a single sequence of very long period. This is received at the vehicle and retransmitted. Thus, at the ground a corrupted and out-of-phase version of the original sequence is received. By operating on it (usually by correlation techniques) one hopes to determine the phase, and then by measuring the elapsed time to find the distance in question (without ambiquity in virtue of the long period of the sequence). Such a sequence is known as an acquirable code. An elegant (though elementary) mathematical procedure is described for selecting an acquirable code; it rests on well-known properties of maximal length shift register sequences and on the Chinese Remainder Theorem. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 09, 1962
Accession Number
AD0281751

Entities

People

  • Daniel Gorenstein
  • Edwin Weiss

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Correlation Techniques
  • Data Science
  • Information Science
  • Mathematics
  • Measurement
  • Sequences
  • Shift Registers

Readers

  • Computer Vision.
  • Operations Research
  • Radar Systems Engineering.

Technology Areas

  • Space
  • Space - Space Objects