Algorithm and computer program for telemetry programme

Hill, K. H.

Leighou, R. O.

English

NASA Technical Reports Server

MCR- 7 0- 38 
(APPENDIX A )  
APPENDIX A 
TO 
F I N A L  REPORT 
FOR 
FORMULATION 
OF A 
TEI;IEEMETRY COMPUTER PROGRAM 
CONTRACT NAS8-24017 
c 
A P R I L  1971 
Prepared For  
NATIONAL AERONAUTICS AND SPACE ADMINISTRATION 
MARSHALL SPACE FLIGHT CENTER ALABAMA 35812 
GEORGE C. MARSHALL SPACE F L I G H T  CENTER 
E l e c t r o n i c s  R e s e a r c h  D e p a r t m e n t  
Martin M a r i e t t a  C o r p o r a t i o n  
P.O. Box 179,  D e n v e r ,  C o l o r a d o  80201 
https://ntrs.nasa.gov/search.jsp?R=19700023145 2020-03-11T23:27:49+00:00Z
ERRATA 
NASA CONTRACT REPORT MCR-70-38 
FINAL REPORT 
For 
FORMULATION OF A TELEMETRY COMPUTER PROGRAM 
K e i t h  H .  H i l l  
R o b e r t  0 ,  L e i g h o u  
B y  ; 
February 1970 
R e p l a c e  the FOREWORD, Page ii w i t h  the attached 
FOREWORD, Page i i .  
ii 
FOREWORD 
This F i n a l  Report i s  presented i n  response  to paragraph 
111 .2  of Exhibit A of Contract NAS 8-24017. I t  c o n s i s t s  
of two volumes, MCR-70-38 and MCR-70-38, Appendix A,  
1 
APPENDIX A 
EXAMPLE OF 
FORMAT AND ADDRESS EQUATION GENERATION BY COMPUTER 
The purpose o,f t h i s  appendix i s  t o  g ive  a n  example of t he  ope ra t ion  of  t he  
algori thm. The data  inpu t  is shown i n  Table A-1. 
TABLE A-1: INPUT 
CLOCK - 16 WORDS PER 
8 FRAMES PER MASTER FRAME 
MODE B MODE C MODE A 
- TYPE NO. CH. S/MF NO. (33. S/MF NO. CH. 
SYNC 
RW 
A 1  
A2 
A3 
A4 
A5 
B1 
B2 
B3 
B4 
B5 
PM 
3 
1 
2 
2 
5 
2 
16 
- 
- 
- 
6 
4 
1 
8 
1 
8 
8 
4 
4 
2 
- 
- - 
1 
1 
1 
3 
1 
2 
5 
2 
2 
16 
‘ 4  
6 
4 
1 
- 
- 
8 
1 
8 
4 
4 
4 
2 
2 
1 
1 
1 
- 
- 
3 
1 
2 
5 
- 
- 
- 
16 
4 
10 
6 
1 
- 
8 
1 
8 
4 
- 
- - 
2 
2 
2 
1 
1 
- 
This  data  does n o t  have any data  groups where the  samples pe r  main frame 
changes from mode t o  mode (except  t o  0 i n  some c a s e s ) ,  but  t he  a lgor i thm 
w i l l  process  t h i s  kind of change. 
F i r s t ,  t he  inpu t  da t a  is  prepared a s  fol lows.  From t h e  c lock  inpu t  da t a ,  
t he  a lgq r i thm produces the  a l lowable  samples p e r  main frame and the  number 
of channels  t h a t  a r e  allowed p e r  card a t  each r a t e .  These are l i s t e d  i n  
Table A-2. 
2 
TABLE A-2: SAMPLE RATES AND CHANNELS PER CARD 
ALLOWABLE ALLOWABLE 
SAMPLE RATES CIWNNELS 
S/MF PER U R D  
16 1 
8 1 2  
4 1 2 4  
2 1 2 4 8  
1 1 2 4 8 1 6  
Using t h e  a l lowable  channels  pe r  card a s  shown i n  Table A-2, t h e  new se t  of 
ca rds  l i s t e d  i n  Table A-3 is  generated.  
TABLE A-3: NEW CARDS GENERATED 
MODE A MODE B MODE C 
_I TYPE
SYNC 1 
SYNC 2 
SYNC 3 
RW 
A 1  
A2 
A3a 
A3b 
A4 
A5  
Bla 
Blb 
B2 
B3a 
B3b 
B4a 
BSb 
B5 
PM 
NO. CH. S/MF 
1 
1 
1 
1 
2 
2 
4 
1 
2 
0 
8 
8 
0 
0 
0 
4 
2 
4 
1 
8 
8 
8 
1 
8 
8 
4 
4 
4 
0 
2 
2 
0 
0 
0 
1 
1 
1 
1 
NO. CH. S/MF 
1 
1 
1 
1 
2 
0 
4 
1 
2 
2 
8 
8 
4 
0 
0 
4 
2 
4 
1 
8 
8 
8 
1 
8 
0 
4 
4 
4 
4 
2 
2 
2 
0 
0 
1 
1 
1 
f 
NO. CH, S/ME' 
1 
1 
1 
1 
2 
0 
4 
1 
0 
0 
8 
8 
4 
8 
2 
4 
2 
0 
1 
8 
8 
8 
1 
8 
0 
4 
4 
0 
0 
2 
2 
2 
2 
2 
1 
1 
0 
1 
One of t h e  checks made during card  genera t ion  i e  whether the number of t i m e  
g l o t s  requi red  f o r  b ina ry  da ta  exceeds one-fourth of the t o t a l  number of 
t i m e  s l o t s  a v a i l a b l e  and, i f  so, the  message "b fna r i e s  a r e  g r e a t e r  than 1 / 4  
t o t a l  t i m e  s l o t s  b ina ry  may fo l low binary" i s  p r i n t e d .  Thie is  t r u e  f o r  the  
example e 
3 
The a lgor i thm then s o r t s  the  Mode A ca rds  wi th  RW and SYNC f i r s t ,  then i n  
descending o rde r  of S/MF, end then i n  deecending order o€ channel 
The r e s u l t s  of t h i s  s o r t  is l i s t e d  i n  Table A-4. 
TABLE A-4: MODE A SORT 
TYPE 
__L. 
SYNC 1 
SYNC 2 
SYNC 3 
RW 
A 1  
A2 
A3a 
A4 
A3b 
Bla 
Blb 
B4a 
B5 
B4b 
PM 
NO, CH. 
1 
1 
1 
1 
2 
2 
4 
2 
1 
8 
4 
4 
2 
1 
a 
SlMF 
8 
8 
1 
8 
8 
4 
4 
4 
2 
2 
1 
1 
1 
1 
a 
Figure  A-1 shows the  first a t tempt  t o  a s s i g n  Mode A. 
ass igned t h e  l a s t  t h r e e  words i n  each frame and RW i s  assigned the  f i r s t  
word i n  the  first frame. 
8 S/MF, is assigned.  
SYNC 1, 2 and 3 a r e  
Then Group A l ,  two channels of snalog data  a t  
FRAME 
0 1 2 3 4 5 6 7  
A3a - 2nd 
Blb - 2nd 
A3a - 1 s t  WORD 
Blb - 1 s t  
b A3a - 3rd 
- -_I__- 
FIGURE: A-1: MODE A ASSIGNMENT - FIRST ATTEMPT 
4 
F o r  8 S/MF t h e r e  must be one sample p e r  frame f o r  each channel,  t h e  two 
channels  should be 8 words a p a r t  and, a s  a n  ana log  channel,  should be 
ass igned  t o  a n  odd number, Thus, A 1  is  assigned t o  words 11 and 3 f o r  each 
frame. S imi l a r ly ,  A2, 2 analog channels  a t  8 S/MF, i s  assigned t o  words 9 
and 1. Assignment of A3a, 4 of  4 S/ is f i r s t  t r i e d  i n  every o t h e r  frame, 
words 7 and 15, but  15 i s  ass igned  t o  SYNC 1; then f o r  5 and 13, but  1 3  is  
ass igned  to  SYNC 3. Thus, A3a cannot be ass igned  t o  odd numbers so i t  tries 
even numbers, 1 2  and 4, which works. A4, 2 a t  4 S/W, is  assigned t o  word 
7 wi th  each channel r epea t ing  every o t h e r  frame. 
every o t h e r  frame i n  word 5. Bla, 8 b inary  channels a t  2 S/W, i s  then 
ass igned  t o  words 10 and 2 wi th  each channel repeatir 'g every f o u r t h  frame. 
Blb, 8 a t  2 SLMF, w i l l  n o t  f i t  i n  words 8 and 0 because RW i s  assigned t o  
word 0 i n  frame 1. Blb a l s o  cannot be ass igned  t o  6 and 14 because oE SYNC 
2. 
A3b, 1 a t  4 S/MF is  ass igned  
There are no o t h e r  p o s s i b i l i t i e s  BO t he  a lgo r i thm reduces the  a l lowa5le  
number of channels  p e r  card,  r egene ra t e s  t he  ca rds  and r e s o r t s  them. The 
r e s u l t  is l i s t e d  i n  Table A-5 and the  r e s u l t i n g  Mode A format assignment 
i s  made and is shown i n  F igu re  A-2. 
TABLE A- 5 ; MODE A RESORT 
SYNC 1 
SYNC 2 
SYNC 3 
RW 
A 1  
A2 
A3a 
A4 
A3b 
Bla 1 
Bla2 
Blb l  
Blb2 
B4a 
B5 
B4b 
p: : 
NO. CH. 
1 
1 
1 
1 
2 
2 
4 
2 
1 
4 
4 
4 
4 
4 
4 
2 
1 
S /MF 
8 
8 
8 
1 
8 
8 
4 
4 
4 
2 
2 
2 
2 
1 
1 
1 
1 
CI 
5 
5 
6 
W3RD 7 
8 
9 
10  
11 
12 
1 3  
14 
15 
O f 2 3 4 5 6 7  
R W 4 2 3  2 i 1 
A2-2 
Blb2 
%a B4b B4a PM B4e B4b B4a 
4 3 2 1 4 3 2  1 
A1-2 
A3a 
4 2 4 2 4 2 4 2  
B5 A3b B5 A3b B5 A3b B5 A3t  
4 3 2 1 
Blbl  
4 3 2 1 4 3 2 1  
A4 
2 1 2 1 2 1 2 1  
Bla2 
4 3 2 1 4 3 2 1  
A2-1.. 
Bla l  
4 3 2 1 4 3 2  1 
A l -  1 
A3a 
3 1 3 1 3 1 3 1  
SYNC 3 
SYNC 2 -  
SYNC 1 
FIGURE A-2: MODE A ASSIGNMENT - SECOND ATTEMPT 
As t he  r e s u l t  of t h e  assignment of B5, the  e r r o r  message " c o n f l i c t  i n  b inary  
t h e r e f o r e  a b inary  fo l lows  a binary" i s  p r in t ed .  
For Mode B assignment,  t h e  Mode B ca rds  are s o r t e d  a s  for Mode A exsept t h a t  
t he  channels  t h a t  a r e  the same f o r  Modes A and B a r e  l i s t e d  as t r a n s f e r s .  
Table 4-5 shows t h e  r e s u l t s ,  
6 
TABLE A-5: MODE B SORT 
TRANSFER 
TYPE -
SYNC 1 
SYNC 2 
SYNC 3 
RW 
A 1  
A3a 
A4 
A3b 
Bla 1 
Bla2 
Blb l  
Blb2 
B4a 
B 5  
B4b 
PM 
A5 
B2 
NO, CH* 
1 
1 
1 
1 
2 
4 
2 
1 
4 
4 
4 
4 
4 
4 
2 
1 
SORT. -
2 
4 
s lm 
8 
8 
8 
1 
8 
4 
4 
4 
2 
2 
2 
2 
1 
1 
1 
1 
4 
2 
Mode B i s  then ass igned  a s  shown i n  F igu re  A-3. 
i n  r e q u i r i n g  the  b inary  fol lows binary message. 
The assignment of B2 r e s u l t s  
Mode C i s  ass igned  i n  a s i m i l a r  manner except  t h a t  t r a n s f e r s  from B t o  C w i l l  
n o t , b e  made i f  t h e s e  i b  a c o n f l i c t  w i th  A t o  C t r a n s f e r s .  
F igure  A-4 show t h e  Mode C s o r t  and assignment r e spec t ive ly .  
Table A-6 and 
7 
0 
1 
2 
3 
4 
5 
6 
WORD 7 
8 
9 
10 
11 
1 2  
13 
14 
15 
I F W  
0 1 2 3 4 5 6 7 
ww 4 2 3 P M 2  1 1 
4 3 2 1 4 3 2 1 
4 3 2 1 4 3 2 1 
B4a B4b B4a B4a B4b B4a 
B2 
Blb2 
A1-2 
,A3a 
4 2 4 2 4 2 4 2 
B5 A3b B5 A3b B5 A3b B5 A3b 
4 3 2 1 
~ 
4 3 2 1 4 3 2 1 
2 1 2 1 2 1 2 1 
A4 - 
Bld 2 
4 3 2 1 4 3 2 1 
2 1 2 1 2 1 2 1 
A5 
Bla l  
4 3 2 1 4 3 2 1 
A l - 1  
A3a 
3 1 3 1 3 1 3 1 
- SYNC 2 
SYNC 1 
FIGURE A-3: MODE B ASSIGNMENT. 
8 
TABLE A - 6 :  MODE C SORT 
- TYPE 
SYNC 1 
SYNC 2 
SYNC 3 
RW 
A l  
A 3 a  
A 3 b  
Bla 1 
B l a 2  
B l b l  
B l b 2  
B4a 
B4b 
PM 
B 2  
B 3 a  1 
B3a2 
B 3 b  
TRANSFER A-C 
NO. CH. 
1 
1 
1 
1 
2 
4 
1 
4 
4 
4 
4 
4 
2 
1 
TRANSFER B-C 
4 
SORT 
4 
4 
2 
-
s/MF 
8 
8 
8 
1 
8 
4 
4 
2 
2 
2 
2 
1 
1 
1 
2 
2 
2 
2 
9 
0 
1 
2 
3 
4 
5 
6 
WORD 7 
a 
9 
10 
11 
12 
1 3  
14 
15 
FRAME 
0 1 2 3 4 5 6 7 
-
B4a B4b B4a B4a B4b B4a 
RW 4 2 3 PM 2 1 1 
4 3 2 1 4 3 2 1 
4 3 2 1 4 3 2 1 
B2 
Blb2 
A1-2 -- - -- - - 
nda 
2 1 2 1 
4 3 2 1 4 3 2 1 
4 3 2 I 4 3 2 1 
4 3 2 1 4 3 2 1 
4 3 2 1 4 3 2 1 
4 3 2 1 4 3 2 1 
~ 1 8 2  
B3a 1 
Bla l  - -- 
* 
c --- _-- A3a 
SYNC 3 
SYNC 2 
SYNC 1 - 
3 1 3 1 3 1 3 1 
_^ll___".._-_.l---- - __1" I
FIGURE A-4: MODE C ASSIGNMENT 
Assignment of  B3al r e s u l t s  i n  the  binary fol lows b inary  message. 
Following t h e  format genera t ion ,  the  ca rds  a r e  s o r t e d  by SYNC and then by the  
number of chaanels.  Addresses a r e  then ass igned  a s  shown i n  F i g u r e  A-5. 
F igure  A-5 a l s o  shows the  counter  s t a t e  f o r  each card.  
F igure  A-6 shows the  Mode A set equrltions generated by the a lgor i thm,  
10 
I
t
 
d
 
d
0
d
0
0
0
0
0
 
O
r
l
d
d
r
l
 
cI( 
d
r
l
O
O
d
O
r
-
i
r
l
l
 
1 
I 
0
0
d
0
d
l
1
0
0
0
0
 
m
 
d
r
(
r
l
d
O
O
r
(
0
 
O
d
O
O
d
 
o
r
l
o
o
 
0
0
0
0
 
1
1
1
 
1
1
1
 o
a
w
w
o
 
4
 
cI( 
o
o
o
o
r
l
d
o
o
d
d
o
o
d
d
o
o
d
r
c
o
o
r
l
d
 
m
 
0
0
0
0
0
0
d
?
l
r
(
 d
o
 O
O
O
d
 r
t
d
r
l
O
0
0
0
 
H
 
4
 
O
O
O
O
O
O
O
O
O
O
d
~
~
r
t
d
d
?
l
d
O
O
O
O
 
m
 
0
0
0
0
0
0
0
0
0
 o
o
o
o
o
o
o
c
o
r
c
d
d
d
 
\o
 
0
0
0
0
0
0
0
0
0
 0
0
 0
0
0
0
 0
0
0
0
0
0
0
 
c3 
m
 
o
o
o
o
o
o
o
o
o
 a
o
 0
0
0
0
 o
o
o
o
o
o
o
 
o
\
 
o
o
o
b
4
H
~
x
#
w
 
w
x
 X
b
C
O
O
 0
0
0
0
0
0
0
 
3 
00 
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
 
3 cn ca 
r-i d 
4
 
w
 
c? 
0
 
E: .. 
11 
11 
u 
8
4
 
N
 
m
 
w
 
u 
It 
It 
II 
It 
+ m W N W r( cy + CY d rl II II 
I 


Formulation of a telemetry computer program Final report

Abstract

Similar works

Full text

Available Versions

NASA Technical Reports Server