United States Patent [19]
`Kuznicki et al.
`
`[54] PAGING SYSTEM USING MESSAGE
`FRAGMENTATION To REDISTRIBUTE
`TRAFFIC
`[75] Inventors: William J. Kuznicki, Coral Springs‘
`_
`_
`,
`’
`“"14 F- W‘H‘Yd’ Plantamn, ‘,mh °f
`Fla‘
`[73] Assignee: Motorola, Inc., Schaumburg, Ill.
`[21] Appl. No.: 980,084
`.
`[22] Fllcd:
`
`Nov‘ 23’ 1992
`
`[63]
`
`Related US. Application mm
`Continuation-impart of Ser. No. ‘891,503, May 29,
`1992.
`
`[56]
`
`5
`
`"
`
`' '
`[58] Field of Search‘ ’
`370/94 2
`825 07
`'
`’
`
`44‘ £25
`'
`’
`'
`
`'
`
`.
`"" " ‘10%;’???
`379
`340/82'5
`’37O/79 8'2 234 94 1
`3 no I’_ 34’0/8’25 66’
`82'5’48
`52_ 379257’
`5’8 59‘ 6g. 45‘5/3’8 1 38 5’
`’
`’
`’
`'
`’
`'
`References Cited
`Us’ PATENT DOCUMENTS
`_
`- ' - -- 340/825'44
`416421632 2/1987 Ohyag‘ F‘ a1~ - - - - ' -
`' ' ' " 340/387295/"54;
`‘gl‘zgfon at as‘ ' ' '
`"" "570/941
`4’713’808 12/1987 6551253152? 3'
`....'.m3'4o/825A4
`4:885:577 12/1989 Nelson ......
`sale/825.44
`4,965,569 10/1990 Bennett et a1. .
`5,212,721 5/1993 DeLuca et al. ..................... .. 379/57
`FOREIGN PATENT DOCUMENTS
`
`IllllllllllllllllllllllllllIIIIIlllllIlllllllllllllllllllllllllllllllllllll
`USOO53ll5l6A
`[11] Patent Number:
`5,311,516
`[45] Date of Patent: May 10, 1994
`
`5741015A 3/ 1982 Japan -
`88-05248 7/1988 World Int. Prop. 0. .
`OTHER PUBLICATIONS
`-
`~
`Euro
`pean Telecommunlcatlon Standard, ETS 300 133
`Jul. 4, 1992, “Paging Systems (PS); European Radio
`Message System (ERMES) Part 4: Aie interface speci?
`Cation”, referenCC-I DE/P5-2001—2004
`Primary Examiner-Douglas W. Olms
`Assistant Examiner-Alpus H. Hsu
`Attorney, Agent, or Firm-Philip P. Macnak; Thomas G.
`Berr ; Daniel R. Collo
`57 y
`AIZZTRACT
`[
`]
`A selective call receiver (106) receives one or more
`message packets of a transmitted fragmented message,
`where each of the one or more message packets in
`cludes an address (1605) and message data (1610), and
`the message data (1610) includes an indication (1702) of
`whether more message packets are to be received for
`the fragmented message. The selective call receiver
`(106) receives an address of each message packet, and
`then correlates (2908) the address to one or more prede
`termined addresses. After a successful correlation
`(2908), the selective call receiver (106) decodes the
`message data (1610) of each message packet, and then
`successively stores (2928, 2936, 2942) the decoded mes
`sage data (1610) to reconstruct the fragmented message.
`The selective call receiver (106) determines that the
`fragmented message is °°mplete1y reconstructed after
`daemon (2918)in1h¢ decoded mes-Sage data (1610) 2111
`indication (1702) that no more message packets are to be
`received for the fragmented message.
`
`57-11044A 3/1982 Japan .
`
`22 Claims, 22 Drawing Sheets
`
`802
`
`Y [804
`
`RECEIVER
`
`THRESHOLD ‘ _
`
`4-LEVEL T0
`
`‘ SYMBOL "- 64X
`SYNC
`>2x
`128x
`‘—>1x SYMBOL
`ll
`CLK
`81“\ i
`Hi BTOli
`808\* i 1
`Ave 0135,25}, Ill/5B
`BINARY
`LEVEL
`EXTRACTION L°V
`CONVERTER]
`A
`‘~58
`
`84B
`\‘ BATTERY
`SAVER
`
`812\
`
`B16
`
`J
`
`842)
`
`T
`
`84°\
`DISPLAY
`BWC
`1600/3200 ‘’ DRlvER L" DISPLAY
`834\ .
`835
`—> $528 *Q
`2L/4L
`CONTROLLER
`fess
`
`7
`
`DE'MUX
`
`82° 824\
`BLOCK
`DE-iNTERLEAvER
`“
`A
`
`\ >
`818\ SYNC
`\‘
`CORRELATOR
`PATTEISNS
`ADDRE’s"s_
`—
`coRRELAToR
`‘k \ 83o
`v f- 832
`
`ADDR
`PATTERNS
`
`DATA
`
`_
`
`USER
`‘‘ INPUT
`
`/ 822
`A 1 CODE PLUG
`MEMORY
`
`M
`
`DECODER
`
`828\
`PHASE
`SELECTOR —
`826\ l 1 1 1
`‘— 1x SYMBOL CLK
`21 c2 93 04
`PHASE TIMING -<— 2x SYMBOL CLK
`GENERATOR 4—g|_/4|_
`
`BLK START
`0 SELECT
`223152
`
`fBSO
`_ MESSAGE
`MEMORY
`126x
`
`846\
`
`f- 844
`128x
`54x<— DMDER < . GENERATOR
`
`Microsoft Ex. 1006
`Page 1 of 42
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 1 of 22
`
`5,311,516
`
`\\\\\\\\\\\\\\\\Q\\\\\\\\\\\\\\\\\\\\
`
`9
`
`>
`
`,/mam
`
`\\\\:2I2.2.I..2\J
`mmEs.mz<E.
`
`._m>m._-v
`
`
`
`mo»<._:oo_2.2“.
`
`DZ<02.2....
`
`..Om._.ZOO
`
`
`
`._.m_On_._<DQ
`
`mmtnm
`
`\1\\s\5\\\5s\\\\\\\\s\\\s\\\\
`
`omm
`mom
`:tX\\\\\\\\\\\\\\\\\\\u\\\\\s\\\\\\\\ss\\\\
`
`
`
`\\\\\\\\\\\\\\\\Il\J
`
`zo_5m_Em_o
`
`._mZZ<IO
`
`N.U~k
`
`mmm
`
`\\\\\\ \\\\u\\\\\\\\\
`
`.
`
`
`
`
`
`mmE_s_mz<E
`
`mmjomwzoo
`
`Em
`
`
`
`<»<n_éimm
`
`mmozmm
`
`oz>mms_<E
`
`mobimzmo
`
`ms_<E
`
`mwzobqm
`
`~\\\\\IN\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
`
`\\
`
`Microsoft Ex. 1006
`
`Page 2 of 42
`
`mo<umm»z_
`mmm_mo.wm5mma
`mm<m<»<o
` \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\xood“ms:émm.\Em“\\\s\\\\\\\\\\\\\\\~\\\\s\
`
`~.U~r.~
`
`
`
`ZO_._.<0_ZD.2S_OO<h<D
`
`mm>_momm
`
`25m0...
`
`IIE
`
`wowwow
`
`
`
`s_moos_mzo_._nm._m+Sm
`
`
`
`m_m<_._n_awn:.
`
`
`
`Emm.__u_moim>:o<:.:nn.lIII...IlMIII..mmjompzooMIIIIIIIL
`
`ww_,fi¢mm11Q,_¢__
`mm<:n_
`1
`nIommE
`
`
`Microsoft Ex. 1006
`Page 2 of 42
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`
`U-S- Patent
`
`May 10, 1994
`
`Sheet 2 of 22
`
`5;311,516
`
`M
`
`E.o
`
`l\
`
`L’:
`
`z>m._._m
`
`Microsoft Ex. 1006
`
`Page 3 of 42
`
`
`
`
`
`
`
`xoo._mxoo._mM“V603xoofixoogmxoofioz>mUNK_
`
`
`
`
`
`mS.<En.mS_<En_wS_<Iu_wS_<In_m_2<Eum§<En_m§<Iu
`
`
`
`
`
`
`
`Microsoft Ex. 1006
`Page 3 of 42
`
`
`
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 3 of 22
`
`5,311,516
`
`><._n_m_Q
`
`>Smm_o
`
`mm>_mo
`
`mqmow
`
`ZEm_>_ID.
`
`._.Im._<
`
`
`
`omovmw
`
`0
`
`8%
`
`mam
`
`mam
`
`mmm:
`
`._.Dn_Z_
`
`
`
`03...".MQOO
`
`>mos_m_2
`
`omm
`
`mo<mmms_
`
`
`
`
`
` .xmm;M.mV~n~>mos_ms_
`
`xmm.
`
`motqmmzmo
`
`mmo_>_o
`
`Sm
`
`Sm
`
`comm\83
`
`Qsmlloz>m
`Xvm._oms_>m
`
`>mmE<m
`
`mm><m
`
`Ea
`
`mm>_momE%mom
`
`
`
`xvomoimmzmo
`
`#1._w
`
`mm..._oEzoo
`
`.=.3N
`
`oz>m
`
`mzmmtfi
`
`moo<
`
`wzmmE<n_
`
`mmfizmo
`
`m.E_2<m
`
`.Sm._mmG
`
`4om_2>mxv
`
`V30
`
`OH._w>.u:-v
`
`>m<z.m
`
`
`mmEm>zoozo:o<Exm
`IIxmm.
`IEIEEmom
`mmooomoE._m>m:
`d>m:-...gBozmmmzp
`
`
`
`v_._O._oms_>mV:
`
`vzo._oms_>wxm
`
`
`
`0Z=>=._.mm<:n_
`
`VG.m&N8PE
`
`mm<..E
`
`mopomdm
`
`026
`
`moidmmooEmown
`
`v_oo._m
`
`mw><mEm»z_.mo-x:s_-mo
`
`Microsoft Ex. 1006
`
`Page 4 of 42
`
`Microsoft Ex. 1006
`Page 4 of 42
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 4 of 22
`
`5,311,516
`
`E I I
`
`WA m ”
`EM 0 h ”
`CD , U
`E n n
`
`OK , E ” BL I lll'TR I MC ” A0 a
`
`% IJrIIIIY Ls ”
`
`Y I RT: ” ” cw , X , O E n
`
`f I I I I I I I I I I I I I I I I I I I l I I I I I I I I I I II:
`
`I I I I
`
`R n m n
`
`I 9 I
`
`R n ”
`D u P V n
`l E I
`I A L I
`“ L C Y C n I KE E I
`, ED AD ,
`I T ET I
`
`"9 HR ER 9” ? Hm Em)
`
`we 4m
`"0 l- on
`
`’ ' ' I I ' ’ ' I ' ' ’ ' I ' ’ ‘ I ' ’ I"
`I 1
`I I
`
`m 9 m
`m \ m
`
`n 2 UK
`
`O 8
`
`CENTER
`SAMPLE
`
`FIG. 9
`
`'Il’lllllllll'llll'lI’I‘Illllllllllllll'lllll'l'l
`1040
`
`l I I l I I I I I!
`
`DATA
`
`III
`
`I I I I I I I I I I I I I I!
`
`I I I I I I I i I ! i I I!
`
`I
`
`SYMBOL
`DECODER
`
`1020
`
`1030
`
`FIG. 10
`
`Microsoft Ex. 1006
`Page 5 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 5 of 22
`
`5,311,516
`
`RECOVERED
`DATA
`
`812
`
`
`
`., ,,,, .......... .. n
`
`H H n
`
`1600 / 3200
`
`_
`
`I I I I I I l I!
`
`, 0 I
`
`I I I I I I I I i I I I I I I I I l I I I I I I I I!
`
`n 1,
`
`1 I
`
`m m m
`
`n E R 3 n Y . u
`
`" / H lU
`” 1 v " R0 ” X m a $
`
`u 1. " AT
`H w n m
`
`" a 0 mm
`H R H MT
`
`P O I C n .
`
`\ v \ S n M 4 H H
`DAM ‘IRE H 0
`
`0 O 0 0 MT .
`mm W1 m X 1 m
`AL E , . R ,
`.MM MT ” O . Mm Ill.
`
`1 2 » I | . 1 1 l I I I 1 1 o a 1 1 n 1 1 a 1 1 I 1 a a l | 1 | I o a 1 1 I I
`
`“ ECMY Y “ OK "1 1 1 a
`TH E . 1W0 1 H 1 E ‘ll \ mAuD D n S 1 B . Om E n
`n m 0 ‘ill, w G . m1 Em m .
`R m F B " PE RL H E R n K EIHIYWSIYMM C ”
`1 + H B I 0 WE Mw‘ICE "
`
`o \ w n c . WITYMWIYTE mm " 3 I , U L n
`
`” AE B IIY'XBL "f f R f “
`
`I G / H S "m m o n
`
`
`
` , . XBK . 1 . . . . 1 . 1 . . 1 1 . 1 . . I 1 . . . 1 1 . I , . 1 1 , . I I I I
`
`1 I . C L K _
`
`» L -
`
`1X
`2X
`SYMBOL
`SYMBOL
`CLK
`CLK
`FIG. 12
`
`Microsoft Ex. 1006
`Page 6 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 6 of 22
`
`5,311,516
`
`BINARY
`DATA
`
`CODE PLUG MEMORY
`
`,,,,,,,,,,,,,,,,,
`
`,,,,,,,,,,,,,, H
`
`CONTROL
`
`MEANS
`
`5
`1
`E
`
`4,
`
`l
`__
`1310)
`
`"A“ WORD
`CORRELATOR
`4
`
`.
`
`1
`?
`
`: F+ I
`
`FRAME wORO
`OEOOOER
`
`J
`
`5
`--;—-> A
`_;,_> 3
`E
`"A" wORO SYNC
`5
`PA‘ITERNS
`1
`E
`
`.
`
`1320
`
`3
`5
`: +
`
`"C" wORO
`
`:
`E
`—:~> C
`
`BLOCK
`sTART
`
`E
`
`1330 J
`
`L
`
`,,,,,,,,,,
`
`,,,,,
`
`E
`
`"C" wORO SYNC
`
`PATTERNS
`
`' 1x
`
`SYMBOL
`CLK
`
`FIG. 13
`
`91 Q2 Q3 Q4
`
`§2§\
`
`Z 1410 \ 2L Li?’ CLOCK RATE _>
`;
`SELECTOR
`,4
`1
`+ 1430/
`
`<1j_BLOCK
`$ T
`GGENERATOR ; sTART
`5
`
`I ,,,,,,,,,,,,,,,, ,1], ,,,,,,,,,,,,,,,,,,,,,,,,,,,, I‘!
`
`2x
`1x
`SYMBOL SYMBOL
`CLK
`CLK
`
`FIG. 14
`
`Microsoft Ex. 1006
`Page 7 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 7 of 22
`
`5,311,516
`
`1502 TURN RECEIVER ON
`
`INITIALIZE
`
`DATA
`PRESENT ?
`
`Y
`
`Y
`
`,
`
`DECODE
`"All 07
`
`IDENTIFY DATA
`TRANSMISSION RATE
`
`IDENTIFY DATA
`TRANSMISSION RATE
`
`LOCATE FRAME
`
`LOCATE FRAME
`
`LOCATE
`MESSAGE @ T3
`
`LOCATE
`MESSAGE @ T4
`
`DECODE
`MESSAGES
`
`FIG. 15
`
`Microsoft Ex. 1006
`Page 8 of 42
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 8 of 22
`
`5,311,516
`
`..
`
`
`
`
`
`xoo._mv_oo._mxooamv_oo._mxoo._mv_oO._m__.
`
`
`
`
`
`2m0m—oOZ>m
`
`mSp4/K“
`.mom:\.com:
`
`
`
`
`
`
`
`<55mo+om>wmmmoo<ou_z_xo9mb~..mv~r_.~
`
`
`
`1..u\;Sm:mom:89828939mom:\I\I
`
`
`
`
`
`
`
`
`
`.o._mESm:o._mEomoz,
`
`n_n.n_n_n_n_n_n_n_n_a_mmmmmmw_2>>
`
`xxxxxxxxxx
`
`IKMBIF
`
`.....\.omwmm_RNUNHN
`ZO_._.<_2IO.u_Z_.
`
`Feooo..0oo
`38TT82.:
`
`NomVmN
`.E.wb~
`
`Microsoft Ex. 1006
`
`Page 9 of 42
`
`Microsoft Ex. 1006
`Page 9 of 42
`
`
`
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 9 of 22
`
`5,311,516
`
`39
`\\\\\\\\\\\\\s\\\\\\\\\\5\\\\\\\\\\\\\\\\\\\\\\
`
`..3.U~.D~
`
`us\ssssxssss..sssssssss\\\s\ss\\s\.sssss\ss\
`
`Microsoft Ex. 1006
`
`Page 10 of 42
`
`N5.
`
`
`
`\\\\\\\|I\\\\\\I\\\\\\\b\\\\\\\\\
`
`
`
`>mosm.s_mo<mmms_
`
`
`
`omoz,._.m—
`
`m:m<zm
`
`GEO;Em:
`
`mmooomo
`
`mommm
`
`mopommmoo
`
`flu
`
`mm.:oEzoo
`
`\\\\\\\\\\\\\\\\\\\\u%\\\\\\\\\\\\\\\\\\\\
`
`
`
`<._.<Qems.
`
`m:m<zm
`
`mom—
`
`<.:Bmo<mmw_2
`
`mmooomoomoz,
`
`ox:
`
`\\\\\\.\\§\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\|\\
`
`«mm
`
`V505
`
`mm><m#_m»z_-mo
`
`Microsoft Ex. 1006
`Page 10 of 42
`
`
`
`
`
`
`
`
`
`
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 10 of 22
`
`5,311,516
`
`o_.N
`
`' ms:.moi
`m>_5<__
`\~\\\\\\\\\
`
`\\\\\\\\\\\\\\\\\\
`
`\\s\\\\\\\\\
`
`‘\\\‘\\.“‘\\\‘\\\§“‘\‘§‘\‘\\“\“‘\\§\\\\\\\\\\\‘~\\‘\“‘\\\\\\\\\“\‘JU““w“““‘\\~\
`
`
`
` mmnmamoPommo<mmms_><._wQ
`
`..m.mu-~
`
`38
`
`
`
`
`
`m_o<wmm_>_ms_<m“_:1.“
`
`mmnmsm_-
`
`\\\\\\\\\\\\\\\ss\\\
`
`\\u\\
`
`\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\I\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
`
`88
`
`\\\\\\\\\\\\\\\\s\\\\\\\\\\\\\\\\\\\\\\\\\S\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
`
`Microsoft Ex. 1006
`
`Page 11 of 42
`
`Microsoft Ex. 1006
`Page 11 of 42
`
`
`
`
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 11 of 22
`
`5,311,516
`
`crow .\
`
`meow .\
`mzm
`
`crow .\
`
`NIN
`woow .\
`
`NOPN
`
`woow \
`worm
`
`mm
`
`mm
`
`mm
`
`WIN
`
`GIN
`
`hm
`
`NN NEE
`
`cor
`
`Microsoft Ex. 1006
`Page 12 of 42
`
`

`
`US. Patent
`
`May 10,1994
`
`Sheet 12 of 22
`
`5,311,516
`
`x.
`
`
`
`
`
`mwmm #mmm 0mm
`
`\. E 1/ j < j
`\ K K m \ momw \ momm
`
`
`
`mmmw mm
`
`
`
`
`
`0 row woom o Pom woom 0 wow moom \
`
`
`
`mqwm vomm N mm
`
`w <
`
`8 NNNN E 9% K
`I] No 1] 2mm
`
`No . mm m 3 2% m j
`
`8% mm 2% NEW g
`
`g E Mm
`
`*0 .] ow
`
`0
`
`om.
`
`)
`
`vrwm
`
`cm?
`
`Microsoft Ex. 1006
`Page 13 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 13 0f 22
`
`5,311,516
`
`2301
`
`PHASE NUMBER
`
`1
`
`2
`
`3
`
`4
`
`f, 1
`2302
`2
`
`3
`
`_ 1
`
`2304
`f“ 2
`14
`23
`3
`
`f“ 1
`2306
`f" 2
`
`2303
`
`FRAME 2316
`NUMBER
`
`3
`
`/- 1
`
`2308 _
`
`K" 2
`2313
`3
`
`/" 1
`2310
`
`~ 2
`
`2320
`
`3
`
`f" 1
`2312
`
`2
`
`3
`
`1
`2
`
`3
`
`1
`
`2
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`2
`
`3
`
`1
`
`2
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`2
`
`3
`
`1
`
`2
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`FIG. 23
`
`Microsoft Ex. 1006
`Page 14 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 14 of 22
`
`5,311,516
`
`PHASE NUMBER
`
`1
`
`2
`
`3
`
`4
`
`l
`
`2
`
`l
`
`2
`
`l
`
`/
`z 2
`
`3 K 3
`
`3
`2/
`,1
`
`1
`
`2 "* 2
`
`/
`
`2404
`
`2406
`
`2410
`
`2412
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`-
`K 1
`2402
`
`\, I
`
`2
`
`3
`
`' 1
`
`24g
`
`\
`
`2
`
`3
`
`3
`
`//
`
`1 "1 1
`
`2414
`
`FRAME
`NUMBER
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`f
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`FIG. 24
`
`Microsoft Ex. 1006
`Page 15 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 15 of 22
`
`5,311,516
`
`PHASE NUMBER
`
`s
`
`4
`
`1
`
`_ 1
`f/’
`2502
`
`2
`
`N
`
`2
`
`1
`
`‘
`
`l
`2
`
`2
`
`'/
`3/’ 3
`
`///
`2506
`
`3
`
`1
`2
`
`3
`
`_:| 1
`2
`
`1
`2
`
`"L.
`
`/
`a,’ 3
`
`//’
`23m
`
`1 ::E;;_
`2
`2
`
`I
`
`l
`2
`
`2504
`
`2508
`
`23m
`
`1
`
`2
`
`3
`
`1
`2
`
`3
`
`1
`2
`
`3
`
`FRAME
`NUMBER
`
`25v1
`
`3
`
`1
`
`2
`
`3// 3
`
`1
`
`2
`
`a~
`
`1
`
`2
`
`1
`/,i
`2
`
`25m
`
`3
`31/ 3
`//"'1 **’1'
`1
`23m
`2
`2
`2
`
`3
`
`1
`
`2
`
`3
`
`3
`
`1
`
`2
`
`3
`
`3
`
`1
`
`2
`
`3
`
`3
`1
`2
`
`3
`
`1
`
`2
`
`3
`
`Microsoft Ex. 1006
`Page 16 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 16 of 22
`
`5,311,516
`
`TELEPHONE
`SERVICING
`ROUTINE
`
`2602
`
`ANSWER CALL
`
`2604
`/" 2606
`IDENTIFY PAGER ADDRESS
`
`,
`
`ACCESS DATA BASE
`2608 AND EXTRACT PAGER
`PARAMETERS
`
`CANNED VOICE
`MESSAGE
`STATUS
`
`YES [2614
`VOICE PROMPT
`FOR MESSAGE
`
`2616
`
`STORE MESSAGE
`
`I STORE IN POCSAG
`ACTIVE PAGE FILE
`
`STORE IN GSC
`ACTIVE PAGE FILE
`
`IDENTIFY FRAME, PHASE,
`PAGER COLLAPSE MASK, AND OTHER
`TRANSMISSION PARAMETERS
`
`/- 2632
`STORE IN TPS ACTIVE PAGE
`FILE BY ASSIGNED PHASE
`
`FIG. 2 6
`
`Microsoft Ex. 1006
`Page 17 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 17 of 22
`
`5,311,516
`
`FRAME BATCHING
`ROUTINE FOR
`
`FIG. 27
`
`4 BEGIN SORT TO BUILD QUEUE
`FOR "NEXT FRAME" = FN
`
`7 ADD TO "NEXT FRAME QUEUE":
`ALL MESSAGES IN THE TPS "ACTIVE PAGE FILE" WITH
`FRAME#( MODULO COLLAPSE# ) = FN(MODCOLLAPSE#)
`
`r2706
`
`_ADD TO "NEXT FRAME QUEUE“:
`ALL MESSAGES IN THE CARRY ON QUEUE"
`
`MOVE FRAGMENT TO
`"CARRY ON" QUEUE
`AND DECREMENT
`"CARRY ON" VALUE.
`
`27""
`
`MOVE REMAINDE
`OF, MESSAGE
`N To THE
`"CARRY ON"
`QUEUE
`$223595;
`VALUE To 31-
`
`ANY
`MESSAGES OR
`FRAGMENTS
`WITH > 1°
`
`271s
`/
`SET FRAME FN
`“CARRY ON,
`VALUE TO 3
`2720 \
`MOVE LONGEST
`MOVE NEWEST MESSAGE ucyqEgfgiEvx'gg. #
`TO TEMPORARY BUFFER
`0 TO THE “CARRY ON'
`QUEUE AND SET THE
`‘MESSAGE CARRY
`ON" VALUE : 2
`
`Microsoft Ex. 1006
`Page 18 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 18 of 22
`
`5,311,516
`
`2734
`
`MESSAGE A
`CONTINUED
`
`A
`
`CONSTRUCT MINIMUM
`4 WORD MESSAGE
`FRAGMENT
`
`Y
`
`N=N+1
`
`2736
`
`ADD
`CURRENT
`FRAGMENT
`TO "NEXT
`FRAME"
`QUEUE
`
`{-2727
`CONSTRUCT LAST MESSAGE
`FRAGMENT TO FILL REMAINDER OF
`FRAME IE. LENGTH OF FRAGMENT
`"N" = (87 WDS - “TOTAL WDS" )
`
`RETRIEVE
`LAST MESSAGE
`FRAGMENT "N"
`
`FIG. 28
`
`Microsoft Ex. 1006
`Page 19 of 42
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 19 of 22
`
`5,311,516
`
`FRAME
`BATCHING
`ROUTINE FOR
`PHASE x
`
`2801
`
`FIG. 29
`
`K- 2806
`
`ADD TO "NEXT FRAME QUEUE“:
`ALL MESSAGES IN THE TPS
`"ACTIVE PAGE FILE" WITH
`FRAME#( MODULO
`COLLAPSE# ) =
`FN(MODCOLLAPSE#)
`
`7 BEGIN SORT TO BUILD
`QUEUE FOR "NEXT
`FRAME" = FN
`
`f- 2808
`ADD TO "NEXT FRAME
`QUEUE":
`cAg'éa?qsgcgsgu'N THE
`
`DECREMENT MESSAGE "CARRY ON VALUE"
`BY 1 AND MOVE BACK TO "CARRY ON
`QUEUE" ALL MESSAGES FOR WHICH:
`A) cARRY ON FRAME# (MODULO OARRY
`' ON COLLAPSE#) ¢
`FN (MODULO CARRY ON
`COLLAPSE #)
`B) PERSONAL MESSAGE FRAME#(
`MODULO COLLAPSE# ) =
`FN(MODCOLLAPSE#) IF THIS
`PHASE IS NOT EQUAL
`TO THE PERSONAL MESSAGE
`ASSIGNED PHASE.
`
`MOVE FRAGMENT TO
`"CARRY ON" QUEUE
`AND DECREMENT
`"CARRY 0N" VALUE.
`
`2814
`
`YES
`
`MESSAGES FIT |N
`"NEXT FRAM "
`
`ENCODE NEX
`FRAME
`
`MESSAGES OR
`FRAGMENTS WITH >
`
`NO SET FRAME FN
`‘CARRY ON"
`VALUE TO 3
`
`MOVE NEWEST MESSAGE’
`TO TEMPORARY BUFFER
`
`Microsoft Ex. 1006
`Page 20 of 42
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 20 of 22
`
`5,311,516
`
`MOVE LONGEST MESSAGE WITH
`NEXT FRAME
`5 37 ,‘,"’DS
`
`-
` ON" VALUE = 2
`
`?
`@ YES
`
`
`
`“NEXT FRAME"
`S 87 WDS
`
`YES
`
`
`
`
`
`
`
`CONSTRUCT
`MINIMUM 4 WORD
`
`MESSAGE
`
`FRAGMENT
`
`
`2827
`
`O
`
`RETRIEVE LAST
`I MESSAGE
`FRAGMENT "N"
`
`
`
`
`
`CONSTRUCT LAST MESSAGE
`FRAGMENT TO FILL
`REMAINOER OF FRAME IE.
`LENGTH OF FRAGMENT "N" =
`
`
`(37 wos - ‘TOTAL WDS" )
`
`
`
`
`
`2833
`
`MOVE REMAINOER OF MESSAGE
`"N" TO THE ‘CARRY ON" QUEUE
`AND RESET "CARRY ON‘ VALUE TO 31.
`
`2839
`MOVE REMAINDEFI OF MESSAGE
`"N" TO ‘CARRY ON“ QUEUE OF
`SPECIFIED PHASE AND SET
`"CARRY ON" VALUE TO 31
`
`NO
`
`2335
`
`2837
`
`YES
`
` SAME
`ASSIGNED
`
`
`PHASE 7
`
`
`2831
`
`
`
`
`ADD CURRENT
`ASSIGN RECEPTION
`FRAGMENT TO ‘NEXT
`PATTERN AND PHASE,
`
`FRAME" QUEUE
`AND SPECIFY IN
`
`CONTROL wORD IN
`
`FIRST FRAGMENT
`
` FIRST
`
`FRAGMENT
`?
`
`
`829
`
`
`
`FIG. 30
`
`Microsoft Ex. 1006
`
`Page 21 Of 42
`
`
`
`
`
`
`
`
`"CARRY ON VALUE“ ¢
`0 TO THE "CARRY ON"
`QUEUE AND SET THE
`‘MESSAGE CARRY
`
`
`
`
`
`
`
`
`
`_
`
`,
`
` MESSAGE
`A CONTINUED
`FRAGMENT
`
`2838
`
`NO
`
`Microsoft Ex. 1006
`Page 21 of 42
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 21 of 22
`
`5,311,516
`
`2902 0
`
`WAIT FOR
`
`FRAME
`
`2904
`
`2906
`
`
`
`
`DECODE SYNC, FRAME
`INFO, BLK INFO, &
`ADDRESS FIELD IN
`ASSIGNED FRAME
`
`
`
`
`
`2908
` ADDRESS
`DETECTED
`
`IN ADDRESS
`
`
`FIELD?
`
`
`YES
`
`
`
`NO
`
`
`
`910
`
`DECODE vECToR FOR
`MESSAGE POINTERS
`
`2912
`
`DECODE MESSAGE WORDS USING 2 BITS
`GENERALIZED ERRCR CCRRECTICN.
`
`CALCULATE CHECK SUM AND
`COMPARE TO VALUE TRANSMITTED. 2914
`
`2916
`
`
`
`
`
`FLAG MESSAGE OR WORDS WITHIN MESSAGE
`ACCORDING TO RULES WHEN CHECK SUMS DO NOT
`MATCH. (FLAGS PART OF INFORMATION STORED IN
`MEMORY ALONG WITH ASCII CHARACTERS)
`
`
`
`
`
`2932
` DOES
`FRAGMENT
`NUMBER =
`11?
`
`YES
`
`
`
`
`
`
`
`2918
`
`
` MESSAGE
`NO
`CONTINUE
`
`BIT SET?
`
`
`
`
`NO
`
`2924
`
`TIMER TO so SEC
`IRST PACKET IN
`FRAGMENTED MESSAGE
`CREATE NEW TIMER FOR
`SIGNATURE RECEIVED
`
`Microsoft Ex. 1006
`
`Page 22 of 42
`
`YES
`
`DOES
`
`
`NUMBER =
`
`
`2922
`11?
`
`
`
`
`2920
`
`YES
`
`FIG, 3]
`
`Microsoft Ex. 1006
`Page 22 of 42
`
`

`
`U.S. Patent
`
`May 19, 1994
`
`Sheet 22 of 22
`
`5,311,516
`
`SHORT NEW MESSAGE
`
`2942
`
`2940
`
`TRANSFER MESSAGE TO
`MEMORY MANAGEMENT
`FOR IMMEDIATE DISPLAY
`
`ALERT USER op
`RECEIVED
`MESSAGE
`
`2902
`
`LAST PACKET IN FRAGMENTED MESSAGE
`
`
`TRANSFER
`TRANSFER
`SIGNATURE AND
`MESSAGE TO
`
`
`
`
`PACKET NUMBER
`MEMORY
`
`
`
`
`TO MEMORY
`MANAGEMENT
`
`
`
`
`
`MANAGEMENT.
`FOR IMMEDIATE
`
`2936
`
`DISPLAY
`
`2934
`
`
`
`
`
`
`2938
`
`MM MATCHES
`PACKET TO
`
`PARTIAL MESSAGE
`
`IN MEMORY WITH
`
`
`SAME SIGNATURE
`AND ENDING WITH
`
`
`
`PACKET NUMBER
`MINUS ONE.
`
`MIDDLE PACKET IN FRAGMENTED MESSAGE
`
`
`TRANSFER
`SIGNATURE
`
`
`AND PACKET
`
`
`
`
`
`NUMBER TO
`MEMORY
`MANAGEMENT_
`
`
`
`
`
`
`
`
`
`
`2926
`
`TRANSFER
`MESSAGE TO
`MEMORY
`
`
`
`
`
`
`MANAGEMENT
`S|éI\£EIUS;.EnIIAEND
`
`
`
`2928 ENDING WITH PACKET
`
`
`NUMBER MINUS ONE.
`
`
`
`
`2930
`
`MM MATCHES
`PACKET TO PARTIAL
`MESSAGE IN MEMORY
`
`
`
`Microsoft Ex. 1006
`
`Page 23 of 42
`
`Microsoft Ex. 1006
`Page 23 of 42
`
`

`
`1
`
`5,311,516
`
`2
`one or more predetermined addresses. The selective call
`receiver decodes the message data of each message
`packet in response to a successful correlation of the
`address, and then successively stores the decoded mes-
`sage data of each message packet of the one or more
`message packets to reconstruct the fragmented mes-
`sage. The selective call receiver determines that the
`fragmented message is completely reconstructed after
`detection in the decoded message data of one of the one
`or more message packets an indication that no more
`message packets are to be received for the fragmented
`message.
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`FIG. 1 is an electrical block diagram of a data trans-
`mission system in accordance with the preferred em-
`bodiment of the present invention.
`FIG. 2 is an electrical block diagram of a terminal for
`processing and transmitting message information in
`accordance with the preferred embodiment of the pres-
`ent invention.
`
`FIGS. 3 to 5 are timing diagrams illustrating the
`transmission format of the signaling protocol utilized in
`accordance with the preferred embodiment of the pres-
`ent invention.
`
`FIGS. 6 and 7 are timing diagrams illustrating the
`synchronization signals utilized in accordance with the
`preferred embodiment of the present invention.
`FIG. 8 is an electrical block diagram of a data com-
`munication receiver in accordance with the preferred
`embodiment of the present invention.
`FIG. 9 is an electrical block diagram of a threshold
`level extraction circuit utilized in the data communica-
`tion receiver of FIG. 8.
`
`FIG. 10 is an electrical block diagram of a 4-level
`decoder utilized in the data communication receiver of
`FIG. 8.
`
`FIG. 11 is an electrical block diagram of a symbol
`synchronizer utilized in the data communication re-
`ceiver of FIG. 8.
`
`FIG. 12 is an electrical block diagram of a 4-level to
`binary converter utilized in the data communication
`receiver of FIG. 8.
`
`FIG. 13 is an electrical block diagram of a synchroni-
`zation correlator utilized in the data communication
`receiver of FIG. 8.
`
`FIG. 14 is an electrical block diagram of a phase
`timing generator utilized in the data communication
`receiver of FIG. 8.
`
`FIG. 15 is a flow chart illustrating the synchroniza-
`tion correlation sequence in accordance with the pre-
`ferred embodiment of the present invention.
`FIG. 16 is a timing diagram illustrating the organiza-
`tion of the transmission frame utilized in accordance
`with the preferred embodiment of the present inven-
`tion.
`
`PAGING SYSTEM USING MESSAGE
`FRAGMENTATION TO REDISTRIBUTE TRAFFIC
`
`This is a continuation-in-part of U.S. patent applica-
`tion Ser. No. 07/891,503, filed May 29, 1992 by Kuz-
`nicki et al., entitled “Data Communication Terminal
`Providing Variable Length Message Carry-On”.
`
`CROSS REFERENCE TO RELATED,
`COPENDING APPLICATION
`
`5
`
`10
`
`A related, copending application is U.S. patent appli-
`cation Ser. No. 07/891,363filed May 29,
`I992 by
`Schwendeman et al., and assigned to the assignee
`hereof, entitled “Data Communication Receiver Hav- 15
`ing Variable Length Message Carry-On”.
`1. Field of the Invention
`
`25
`
`30
`
`35
`
`The present invention relates generally to the field of
`addressed messaging communication systems, and more
`particularly to a message segmentation method for re- 20
`distributing traffic over time slots in a communication
`protocol.
`2. Background of the Invention
`Communication systems, such as paging systems,
`have been increasing the length of their transmitted
`messages. Further,
`the trend in the marketplace is
`toward transmitting very long messages in certain appli-
`cations, such as information distribution services. Well
`known paging signaling protocols, such as the POC-
`SAG signaling protocol, have provided a satisfactory
`level of performance for short message data transmis-
`sion. However, when messages get very long the com-
`munication channel access can be blocked for very long
`time intervals. Also, errors due to fading and other
`transmission phenomena can be more likely to occur in
`long transmitted messages. Additionally, if callers to the
`paging system do not receive a confirmation from recip-
`ients of the transmitted messages within a reasonably
`short time, then the callers tend to call again and send
`duplicate messages to the same recipients. Conse-
`quently, this adds to the overall traffic in the system and
`increases the frustration of the users of the system. This
`bottleneck can add significant time delay to all other
`communication in the system. Long time delays, i.e.,
`communication system latency, from the time a message
`is entered into the system to the time the message is
`received by a user of a communication receiver can be
`at the very least a significant inconvenience to the user.
`If an emergency message is significantly delayed, such
`as in a governmental or medical communication, the
`result may have serious consequences for a community.
`Thus, there is a need for providing a communication
`protocol which uses message fragmentation to redistrib-
`ute traffic in a communication system, such as a paging
`system.
`
`45
`
`50
`
`55
`
`SUMMARY OF THE INVENTION
`
`According to an embodiment of the present inven-
`tion, there is provided a method for decoding a trans-
`mitted fragmented message in a selective call receiver.
`The fragmented message comprises one or more mes-
`sage packets, each of the one or more message packets
`comprises an address and message data, the message
`data comprises an indication of whether more message
`packets are to be received for the fragmented message.
`The selective call receiver receives an address of each
`message packet of one or more message packets of a
`fragmented message, and then correlates the address to
`
`65
`
`FIG. 17 is a timing diagram illustrating the transmis-
`sion format of the first data code word in the data por-
`tion of a message in accordance with the preferred
`embodiment of the present invention.
`FIG. 18 is a timing diagram illustrating a sequence of
`packet numbers for a transmitted message using a mes-
`sage fragmentation method in accordance with the pre-
`ferred embodiment of the present invention.
`FIG. 19 is a more detailed block diagram of the data
`decoder of FIG. 8, according to the preferred embodi-
`ment of the present invention.
`
`Microsoft Ex. 1006
`
`'
`
`Page 24 of 42
`
`Microsoft Ex. 1006
`Page 24 of 42
`
`

`
`3
`FIG. 20 is a more detailed block diagram of the frame
`batcher of FIG. 2, in accordance with the preferred
`embodiment of the present invention.
`FIG. 21 is a first symbolic representation of messages
`being processed by the frame batcher of FIG. 20, in
`accordance with the preferred embodiment of the pres-
`ent invention.
`
`FIG. 22 is a second symbolic representation of mes-
`sages being processed by the frame batcher of FIG. 20,
`in accordance with the preferred embodiment of the
`present invention.
`FIGS. 23, 24, and 25 are three additional symbolic
`representations of messages being processed by the
`frame batcher of FIG. 20, in accordance with the pre-
`ferred embodiment of the present invention.
`FIGS. 26, 27, 28, 29 and 30, respectively, comprise
`three flow charts illustrating operational sequences for
`the terminal of FIG. 2, according to the preferred em-
`bodiment of thepresent invention.
`FIGS. 31 and 32 comprise a flow chart illustrating an
`operational sequence for the data communication re-
`ceiver of FIG. 8, in accordance with the preferred em-
`bodiment of the present invention.
`
`,
`
`DESCRIPTION OF THE PREFERRED
`EMBODIMENTS
`
`FIG. 1 is an electrical block diagram of a data trans-
`mission system 100, such as a paging system, in accor-
`dance with the preferred embodiment of the present
`invention. In such a data transmission system 100, mes-
`sages originating either from a telephone, e.g., a dual-
`tone-multi-frequency (DTMF) telephone, as in a system
`providing numeric data transmission, or from a message
`entry device, such as an alphanumeric data terminal, are
`routed through the public switched telephone network
`(PSTN) to a paging terminal 102 which processes the
`numeric or alphanumeric message information for
`transmission by one or more transmitters 104 provided
`within the system. When multiple transmitters are uti-
`lized, the transmitters 104 preferably simulcast transmit
`the message information to data communication receiv-
`ers, e.g., selective call receivers 106. Processing of the
`numeric and alphanumeric information by the paging
`terminal 102, and the protocol utilized for the transmis-
`sion of the messages is described below.
`FIG. 2 is an electrical block diagram of the paging
`terminal 102 utilized for processing and controlling the
`transmission of the message information in accordance
`with the preferred embodiment of the present inven-
`tion. Tone-only and numeric messages, which can be
`readily entered using a DTMF telephone, are coupled
`to the paging terminal 102 through a telephone interface
`202 in a manner well known in the art. Alphanumeric
`messages, which typically require the use of a data entry
`device, are coupled to the paging terminal 102 through
`a modem 206 using any of a number of well known
`modem transmission protocols.
`When a call to place a message, i.e., a paging request,
`is received, a controller 204 handles the processing of
`the message. The controller 204 is preferably a mi-
`crocomputer, suchas one based on the MC68000 fam-
`ily, which is manufactured by Motorola Inc., or the
`equivalent. The controller 204 runs various pre-pro-
`grammed routines for controlling such terminal opera-
`tions as voice prompts to direct the caller to enter the
`message, or the handshaking protocol to enable recep-
`tion of messages from a data entry device. When a call
`is received, the controller 204 references information
`
`5
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`45
`
`50
`
`55
`
`60
`
`65
`
`5,311,516
`
`4
`stored in the subscriber database 208 to determine how
`the message being received is to be processed. The
`subscriber data base 208 includes, but is not limited to
`such information as addresses assigned to the data com-
`munication receiver, message type associated with the
`address, and information related to the status of the data
`communication receiver, such as active or inactive for
`failure to pay the bill. A data entry terminal 240 is pro-
`vided which couples to the controller 204, and which is
`used for such purposes as entry, updating and deleting
`of information stored in the subscriber data base 208, for
`monitoring system performance, and for obtaining such
`information as billing information.
`The subscriber database 208 also includes such infor-
`mation as to what transmission frame and to what trans-
`mission phase the data communication receiver is as-
`signed, as will be described in further detail below. The
`received message is stored in an active page file 210
`which stores the messages in queues according to the
`transmission phase assigned to the data communication
`receiver 106. In the preferred embodiment of the pres-
`ent invention, four phase queues are provided in the
`active page file 210. The active page file 210 is prefera-
`bly a dual port, first-in-first-out random access memory,
`although it will be appreciated that other random access
`memory devices, such as hard disk drives, can be uti-
`lized as well.
`
`Periodically the message information stored in each
`of the phase queues is recovered from the active page
`file 210 under control of the controller 204 using timing
`information such as provided by a real time clock 214,
`or other suitable timing source. The recovered message
`information from each phase queue is sorted by frame
`number and is then organized by address, message infor-
`mation, and any other information required for trans-
`mission, and then batched into frames by frame batch-
`ing controller (frame batcher) 212. The selection of
`frames by the frame batching controller 212 can be
`based upon message size, and optionally based upon
`other parameters that will be discussed below.
`Because every frame is of a predetermined length,
`sometimes not all message information from the active
`page file 210 can be transmitted in the current frame,
`e.g., the current time slot. For example, if one or more
`messages are longer than can fit in the current frame,
`then the frame batcher 212 optionally can fragment the
`long messages into one or more message packets for
`transmission over one or more frames, e.g., time slots,
`which may be allocated over one or more phases, as
`will be more fully discussed below. The frame batcher
`212 can temporarily hold at least a portion of the mes-
`sages that are destined for transmission over multiple
`frames in this fashion. The process of generating frag-
`mented messages and transmitting them to a receiving
`communication receiver will be discussed below.
`Preferably, any priority addresses are located as the
`very first addresses in the batched frame information for
`sending them out first with the very next transmitted
`frame. The batched frame information for each phase
`queue is coupled to frame message buffers 216 which
`temporarily store the batched frame information until a
`time for further processing and transmission. Frames
`are batched in numeric sequence, so that while a current
`frame is being transmitted, the next frame to be trans-
`mitted is in the frame message buffer 216, and the next
`frame thereafter is being retrieved and batched. At the
`appropriate time, the batched frame information stored
`in the frame message buffer 216 is transferred to the
`
`Microsoft Ex. 1006
`
`Page 25 of 42
`
`Microsoft Ex. 1006
`Page 25 of 42
`
`

`
`5
`frame message encoder 218, again maintaining the phase
`queue relationship.
`The frame encoder 218 encodes the address and mes-
`sage information into address and message code words
`required for transmission, as will be described below.
`The encoded address and message code words are or-
`dered into blocks and then coupled to a frame message
`interleaver 220 which interleaves preferably eight code
`words at a time for transmission in a manner well
`known in the art. The interleaved code words from
`each frame message interleaver 220 are then serially
`transferred to a phase multiplexer 221, which multi-
`plexes the message information on a bit by bit basis into
`a serial data stream by transmission phase.
`The controller 204 next enables a frame sync genera-
`tor 222 which generates the synchronization code
`which is transmitted at the start of each frame transmis-
`sion. The synchronization code is multiplexed with
`address and message information under the control of
`controller 204 by serial data splicer 224, and generates
`therefrom a message stream which is properly format-
`ted for transmission. The message stream is next cou-
`pled to a transmitter controller 226, which under the
`control of controller 204 transmits the message stream
`over a distribution channel 228. The distribution chan-
`nel 228