• Keine Ergebnisse gefunden

SPADATS CAD

N/A
N/A
Protected

Academic year: 2022

Aktie "SPADATS CAD "

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

PHILCD FACT SHEET

Number 17 A, January 1963

SPADATS CAD

COMPUTER ACCESS DEVICE

A device for linking the Philco 2000 to numerous teletype lines

SPADA TS, the Space Detection and Tracking System, maintains continuously updated records describing and locating man-made objects in space. Stations around the world transmit observations over a communications system terminating in a number of teletype lines at the USAF SPACETRACK Center in Colorado Springs. The information is processed and stored by a Philco 2000 Electronic Data Processing System. CAD arranges the data in a format acceptable to the Real-Time System of the Philco 2000.

It also organizes processed data from the Philco 2000 for transmission by teletype lines to the tracking stations.

The input portion of CAD is called CADI, the output portion CADO. Both can handle 24 teletype line s.

CADI

Input

Programming

PHILeo

ASUBSIDIARYO'~~Y!?~

The input from the tracking stations is punched on paper tape by Teletype Model 28RT sets at 100 words per minute.

CADI reads these tapes one at a time at 200 words per minute. The characters are converted from Baudot code to Philco 2000 code and assembled into 48-bit words for the Philco 2000. The most significant six bits of the word identify the teletype lines; the remainder furnish the data.

The order to read data from CADI is similar to orders for other Philco 2000 input-output devices. It specifies the number of words to be transmitted - up to 1024 - and the starting ad- dress where the data is to be stored in memory. The order can specify priority for one of the lines. That line will then be checked before any of the others. If no priority is specified, each channel is scanned until data is sensed on a line. Scanning then stops, and the message is read from the paper tape.

If the number of words requested by the input order exceeds the number of words in the message, scanning resumes and another message is read until the number of words requested has been forwarded. Scanning and transmission then cease.

COMPUTER DIVISION WILLOW GROVE, PENNSYLVANIA

(2)

CADO

Output

Prog ra m mi ng

Data to be transmitted from the computer to various teletype lines is transmitted through CAOO. The data is stored in memory, one Baudot-code data character and a line identifier per word. Data for various lines may be intermingled; the speed of transmission through CADO permits simultaneous transmission over all lines.

Data is transferred to the CADO by a standard input-output order, the program giving the starting location in memory and the number of words to be transferred.

The SPADATS CAD is an example of the multiplexers developed by the Philco Computer Division for connecting the Philco 2000 simultaneously to large numbers of communica- tions lines.

Referenzen

ÄHNLICHE DOKUMENTE

Additionally, when bureaucratic (scientific) management becomes an industry in its own right, information becomes the general name for its product, its medium. The stuff we

Cockayne, Dreyer Jr., Hedetniemi and Hedetniemi [2] as well as Chambers, Kinnersley, Prince and West [1] have given a lot of results on Roman domination.. Our purpose in this paper

We begin with a lemma that bounds the size of the new incomplete trees formed during the explore process in terms of the rope length, the distance from the start node to the root of

Simulation 1: Sequencing Effects in Number Learning Simulation 1 modeled the learning of the association of sets of 2, 4 and 6 objects – with color, shape and size dimensions – with

unfolding theorem whose proof requires some preparations about isochoric unfoldings and it requires a generalization of the classical Brieskorn module of a hypersurface singularity

Zum 01.01.2015 ist eine Anpassung der Lizenzbedingungen (Entfall der Creative Commons Lizenzbedingung „Keine Bearbeitung“) beabsichtigt, um eine Nachnutzung auch im Rahmen

We study the maximum number of minimal codewords in binary linear codes of a given length and dimension.. Improved lower and upper bounds on the maximum number

We derive a lower bound on the number of minimal codewords of a linear code using a geometric characterization of minimal (and non-minimal) codewords.. As a consequence, we obtain