||||l|IlllllillllIllll|||l||ll|||l||||l|l|||I|||||||llllllillllllllllllllll
`US0053]!Sl6A
`_
`5,311,516
`[11] Patent Number:
`[19]
`Ulllted States Patent
`Kuznicki et al.
`-
`[45] Date of Patent: May 10, 1994
`
`
`.
`
`[75]
`
`NM‘ 23' 1992
`Related U.s. Application Data
`Continuation-in-part of Ser. No. '89':‘,503, May 29.
`1992.
`
`[53]
`
`[56]
`
`5?-4-1015A 3/1982 Japan .
`[54] PAGING SYSTEM USING MESSAGE
`38-05248 T/1988 World Int. Prop. 0.
`FR_A(;M}§'_N'rA'1‘10N To R};D1s'1'R]_3u']'E
`OTHER PUBLICATIONS
`Tmmc
`T]
`-
`-
`5
`d d E-1-5 3m 133
`B
`Inventors: Wi1ll1mJ.Kuz|1icki,Coral Springs;
`D"id F‘ wm"'d' P1am”i°“’ both of J ‘?l‘::Igrii1ngur;:z:i:irI11s t(;;);aE|iropear1 Radio
`Fla‘
`Message System (ERMES} Part 4: Aie interface specifi-
`[73] Assignee: Motorola, Inc, Schaurnburg, Ill.
`Cflfiofl”. reference: DE/P5-3001-200$
`[2l] Appl. No.: 980,084
`Primary E.xam:‘rter——Douglas W. Olrns
`.
`.
`Assistant Exam£ner—Alpus H. Hsu
`[221 Fdcd‘
`Attorney, Agent, or Fr‘rm—~Philip P. Macnak; Thomas G.
`B
`; D '
`1 R. Coll
`5:” am
`my
`[
`1
`ABSTRACT
`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-
`d
`d
`clu es an a dress (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-
`terrnined addresses. After a successful correlation
`(2908),
`the selective call receiver (106) decodes the
`saedat
`1610
`f
`11
`kt.
`dth
`Etigzegivelyasfores g2g2;a29321?;:§§tlaiiecdgcodgd 111::
`sa
`d
`1610
`’
`g h f
`d
`ge ata(
`)to reconstruct! e ragrnente message.
`The selective call receiver (106) determines that the
`fragmented message is completely reconstructed after
`detection (2918) in the decoded message data (1610) an
`indication (1702) that no more message packets are to be
`received for the fragmented message.
`
`_
`"""""" H0” 3/24’ HMQ 7/00
`Int‘ Cl‘:
`[51]
`[52] US. CL ................................ .. 370/94.1; 370/911;
`370/now 340/825_m_ 340/825 44‘ 319/57
`[58] Field of Sarah _'___________________ ’3.’,0/79, 3'2 ’84 “J
`370/9&2 9i] 95 2 95 3 no I_ 340’,825_06
`‘
`82507’ 82544’ 825'4;’88%§4§§_8fi§5?3:83;r9’;§:7§
`References Cited
`U_s_ PATENT DOCUMENTS
`4»5‘‘2-532
`2/1937 0hY38l 3‘ 31-
`4,663.94”
`5/1987 Altahori et al.
`.
`.
`gfgiliiiueflaair
`_ 3_,o/32544
`4,335”? 12,1939 Nczson
`..
`4.965.569 10/I990 Bennett et al.
`3“)/32544
`......... 319,67
`...........
`5,212,121 M1993 DeLuca et al.
`FORE1GN PATENT DOCUMENTS
`
`3”/325'“
`340/825.4?
`
`
`
`'
`
`S7-I104-4A 3/1932 Japan .
`
`22 Claims, 22 Drawing Sheets
`
`343
`302
`BA1'rERY
`
`
`
`
`
`64X
`-— BWC‘!600.F.'3200
`1)! SYMBOL
`
`
`M 4_LEVEL
`LEVEL
`Exrmcriou [5 DECODER
`
`4-LEVEL T0
`@ sinner
`convemen
`
`
`
`ELML
`CONT ROL LEFI
`
`
`
`
`
`
`
`
`SYNC
`
`COHFIELATOR H
`
`PATTERNS
`AD DR E55
`ADDFI
`
`
`
`
`824
`
`BLOCK
`
`—
`
`
`DE-INTERLEAVEI CORRELATOFI I
`PATTEFI NS
`ass
`F 3:32
`DATA
`
`
`350
`DECODEF1
`
`
`
`MESWE
`T 3”‘ W”
`0 SELECT
`MEMORY
`CENTER
`
`
`
`SAMPLE
`128x
`or :32 as c4
`1): SYMBOL CLK
`646
`PHASE TIMING
`2X SYMBOL CLK
`G EN EFMTO Fl
`2L .n'4L
` 5“
`
`
`195
`
`344
`
`cewiaasfiron
`
`
`
`
`
`
`
`1
`
`GOOGLE 1007
`
`GOOGLE 1007
`
`1
`
`

`
`U.S. Patent
`
`May 10,1994
`
`Sheet 1 of 22
`
`5,311,516
`
`\\QQQQQQQQQQQ5QQQQQQQVQQQQQQQ_QQ.QQQQQQ
`
`P
`
`>
`
`
`
`::s:\u:::u-KIJ
`
`mmt_2mz<E
`
`._m>m_._-v
`
`mo»<._:oo_22....
`
`mam
`
`
`
`ZO_._.<O_ZD_2S_OO¢._.<D
`
`mm>_wowm
`
`r..mom
`
`Q.Q
`
`Q\QQQQQQQQ\QQQQQQQQQQQQQQQQQ.5
`
`\\\§\\\\\\I\||\\|\\\\\\\III\\II|I|L\|\\\\\|\\§|\\|\t|\\|\|\|\\i\\\\\\t|\\\\\\\\\\\\\\§\\\\\\\\II\~65%
`
`25¢O...
`
`2.5;0»
`
`
`
`momEmzo.._n_m._mFmomown
`
`
`
`m>_5<:..:n.._I|.._.IuII_.
`
`
`
` m_w<In_mwxwwmgm_2<EQmmooozm
`
`
`m__o<mwm__2ms_<EQ
`
`
`02¢OZ_S__...
`
`._oEzoo
`
`
`
`._.¢On_._<:o
`
`mmnaam
`
`
`
`\““.““I\“.“.Ia
`
`zo_Sm_E.m_o
`
`._.n._ZZ<ID
`
`mmt__aw2<m+
`
`mm1_._oE,zoo
`
`1QQV
`
`mum
`
`oz>ww_2<mu.
`
`mobqmmzmo
`
`
`
`<._.<QEmwm
`
`mmo_._n_m
`
`mmxm.E:.._:_2
`
`ws.<E
`
`mmxobqm
`
`mm_>.qm._mm:z_
`
`iQ
`
`Aw.m<:aE5.mmmaowmamem3:mos...
`
`¢w.:oEzoo
`
`mu<..Em»z_
`mm<m<§d
` QQQQQQQQ.QQQ.QQQQQQQ\Q“QQQQQQ5QQ“VV590“92:._<m_m.QEm“QQQQQQQQQ\Q\\QQQQQQ.Q5QQ.\RM
`
`2
`
`
`
`
`
`
`
`
`
`
`
`
`

`
`t
`
`WmV.
`
`22£102mhS
`
`M
`
`6M.
`
`
`
`mz§_.|_m_2<mu_ms_<Em_2<Em2<Em_2<EU..
`mmEmPR.8.mm_oR.S.ws_<mu_
`_m _.
`
`%a.
`
`2mmN_ooz>w.WMN9:
`
`3
`
`L,«mm«mm
`
`5.._oz>m:mR.U~.W~
`
`3
`
`
`

`
`US. Patent
`
`May 10, 1994
`
`Sheet 3 of 22
`
`5,311,516
`
`><._aw_omm>_mo
`
`><.Ew_n_
`
`NEown
`
`mamZmmzmo.
`
`._.Iw..<
`
`mamEm
`
`on.
`
`man
`
`«mm
`
`own
`
`_0D._n_mnoo
`
`>mo2m_2
`
`mum:
`
`»:n_z_
`
`_.xmfi%>¢o_2ms_
`
`mwqmmms
`
`1%ova
`
`mmo_>_n_
`
`Emjom._.ZOO
`
`$.75
`
`oz>m
`
`mzmmE<n_
`
`mzm_m_t.<a
`
`mmpzwo
`
`mdzqm
`
`_.om._m_mG
`
`comm..89
`03mll
`Xww._oms_>m
`
`4om_2>mxv
`
`I:'xmfl
`
`mom
`
`EooomoEism:
`fi>m_._+gm._o:wmE_.:
`
`zo_5qE.x.n_
`
`mm>_momE1N8
`
`m.w<:n_
`
`¢o5m._mm
`
`Iimm><m._mm=.z_.mo xoo,_m
`
`vmmcum
`
`4om_2>m5xwwmo.Emmzmo
`
`V30
`
`
`
`v_._o._om_2>mxm
`
`.3.1._m
`
`
`
`
`
`OZ_5__._.mm<:n_
`
`V38NQ5
`
`4
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 4 of 22
`
`5,311,516
`
`1x
`
`128X SYMBOL RECOVERED
`CLK _
`DATA
`
`(‘I'll IIIIIIIIJ llllltdtzaljallrlt:::::::::::::::::::::::::41:1;
`5
`902
`5
`E
`PEAK LEVEL
`5
`5
`DETECTOR
`5
`
`
`
`g
`
`'
`
`H‘
`
`" AVG
`
`L0
`
`
`CLOCKRATE H 5
`SELECTOR F g
`
`VALLEY LEVEL
`
`5
`
`
`
`
`:
`DETECTOR
`:
`ElfIIIllJII II IIIIII IIIIJIIrIIr II IIIllto I IJ IIJ ll-091914:1:1:J1: ::4-IE
`K 808
`—
`
`CENTER
`SAMPLE
`
`FIG 9
`
`E
`
`" 1340
`
`"""
`
`DATA ——E
`J
`
`5
`f--5-—MSB
`
`
`
`
`§
`:
`Z
`
`AVG
`
`LO
`
`,
`
`SYMBOL
`DECODER
`
`E
`;
`3
`
`I
`:
`
`LSB
`
`\ 5 \ N \ \ \ \ \ \ \ I V \ \ \ \ \ \ \ \ \ | \ \ \ \ \ N \ \ I \ \ \ \ \ \ \ \ \ I \ \ I \
`
`a
`
`/:
`
`CD|_.C3
`
`5
`
`

`
`U.S. Patent
`
`May 10,1994
`
`Sheet 5 of 22
`
`5,311,516
`
`0
`
`‘\\\\\\\\\\\\\\\\\\\\‘\\\§\I
`
`................................ -JC.........-.,,,..........---....
`
`DATA EDGE J1
`115°
`DETECTOR .
`
`
`
`DIVJDE BY 15 I 32
`
`32x DATA
`OVERSAMPLEFI
`
`
`
`
`
`32><_ RATE
`SELECTOR
`
`RECOVERED
`DATA
`
`_L O’) CG ‘a 03[UGC)
`
` \s\x\\\\\s\\\1\n\
`
`
`\\\\\\\\\L
`
`
`
`1x
`
`2x
`
`54>: CLOCK
`
`BWC SYMBOL SYMBOL
`cu<
`cu<
`
`F]G. 11
`
`. — . - . . —
`
`. . . . . . .
`
`- — — . — . . . . . - ¢ ¢ ¢ . - - . . . . . . . --
`
`INPUT DATA
`SELECTOR
`
`
`I 122°
`OUTPUT 2L/4L
`
`SERIAL DATA
`
`‘IX
`SYMBOL
`CLK
`
`2X
`SYMBOL
`CLK
`
`FIG. 12
`
`6
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 6 of 22
`
`5,311,516
`
`822
`
`CODE PLUG MEMORY
`
`
`
`
`CONTROL
`MEANS
`
`"A" WORD SYNC
`PATTERNS
`
`"C" WORD SYNC
`PATTERNS
`
`2L/4L
`
`1 X
`
`2X
`
`SYMBOL
`CLK
`
`SYMBOL
`CLK
`
`FIG. 14
`
`7
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 7 of 22
`
`5,311,516
`
`TURN RECEIVER ON
`
`1
`
`502
`
`1504
`
`1508
`
`BATTER
`3,o,VE
`
`1506
`
`DATA
`
`PRESENT ?
`
`
`Y
`
`
`
`1510
`
`N
`
`Y
`DECODE
`
`IIAII 9
`
`1512
`N
`
`o
`
`¢
`
`IDENTIFY DATA
`TRANSMISSION RATE
`
`
`
`151
`
`6
`
`1532
`
`1518
`
`1520
`
`1522
`
`IDENTIFY DATA
`TRANSMISSION RATE
`
`LOCATE FRAME
`ID @ T2
`
`DECODE FRAME ID
`
`
`
`LOCATE FRAME
`ID @ T1
`
`I
`
`1526
`
`1540
`
`
`
`
`
`DECODE
`MESSAGES
`
`
`
`FIG. 15
`
`8
`
`

`
`
`
`.xoo._mxoogmxoo._mxoo._m_xoo._m50.5S_.U.
`
`
`
`
`
`
`P3mmNro02>m
`
`4..
`
`9
`
`fl
`
`22
`
`I
`
`6..u
`
`
`f._mom:com...m \
`/Ix.<._.<o_n_o_.om_>mmmmoo<on_z_v_oo._m%N..Q~.%\N3:
`
`
`
`
`
`
`
`
`
`
`
`
`.\.\uMo._m_n_o._m_Eo._m_n_omoa.
`
`
`
`
`mom;8?32mom:W.ASm:.8289mWI):
`
`
`
`
`
`mn.n_mn_n_n_n_n_n_n_n_mwwwwww_2>>xxxxxxxxxx
`
`.....‘.mmvmmrRNUFWN
`zo:.<§mouz_.
`
`Moutout8:.32Not22
`
`609.5SE8SE8Z.
`1.,Em.Hxwe:
`
`.\.mmwmN_.%Nmvhm‘
`
`M—O_.
`
`1[|9
`
`9
`
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 9 of 22
`
`5,311,516
`
`x5s\\.1\\\.1\\s\\s.1
`
`©:m_.
`
`\1\V\__\x\\5\\\\\x\\\11x\\\M\\1\5
`
`VIkfil:\\\.I|.\I|\!|.1|.mI\\\\\|\|\
`
`N2:
`
`
`
`>mo2m=2mo...mmm_2
`
`Sal
`
`
`
`xoo._m_m_o<wwms_
`
`.-sx\..\\M.1_.Q\\s\_...x\\..
`
`.1\\\5s\55_.\\\\5
`
`¢.._.<n_ow:
`
`m:m<zm_
`
`82
`
`mm._._o:.:,.oo
`
`omoz.Er
`
`m._m<zm
`
`omoz,BE”.
`
`mmooomo
`
`IOIEN
`
`mohommmoo
`
`<55mo<mmm__2
`
`
`
`mmaoowoomoa.
`
`
`
`
`
`\\|\\\\\\I.1\\\\\\\\\\\\.\\u.\|\|§\\i|\|\§\\t\$
`
`\\-us-us-us-as-\~uusus5us\.~u\\\\\\\\\-n\s.s\\sxI.\-\\u
`
`10
`
`«um
`
`xoo._m
`
`mm_>¢m#_m»z_-mo
`
`.\\\\.u.\\\\h.\\\\t\\Uh|NI\\|\\|II\\\
`
`\x.15\\V\‘\x\\.1.
`
`E.U~r_~
`
`\Itl1\\I\!I|\I\\\|\\\\|\\I\||\\\I\OI\\Qh\\\\\\\\
`
`10
`
`
`
`
`
`
`
`
`
`
`
`
`

`
`SmU
`
`M.waD...
`
`May 10, 1994
`
`Sheet 10 of 22
`
`5,311,516
`
`o_.N
`
`h."....h||_
`
`
`m.__u_.1mos".w>_._.0<
`
`mm_u_u_:m_
`
`gl|___
`
`<mmms_w$_<_n_...__.
`
`\\\\\L\h\$\\\\\un\\§
`
`..
`
`\gg_..
`
`‘\\\\\\\|\|\\sQ\I\i\\I\\\\\\\l\\\s\\\\\\\IK\\\\\\\I\\\|\\I\\\\\\\\\I\\|I5\||Iii\§|\\O\\\| oEN
`
`moémwz>33
`
`mmninm
`
`wz_xoEm
`
`mmdogzoo
`
`88
`
`\\\\\tn\i\\\5\\ish!K\\!I\I\\|\\|\\Qti\I\\\\\\\\q\\\\\\\\\5I\\IiI\I|i|\|\\\\\\\I\\\\\\\\\
`
`.5\g\x\sQ\\5\..\.xx\Q\sQ.5Au\g\x\g\hs555\5sx\.5\\\\\\\n\\\\\.\
`
`\\\55.\u.\ss.x\5x\\\\\5.
`
`11
`
`11
`
`
`
`
`
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 11 of 22
`
`5,311,516
`
`31-
`
`3D
`
`J
`
`NF”
`'l—
`OJ
`
`(D
`D‘I-
`C\|
`
`N:
`
`-
`C:
`h.
`
`CT.
`
`O0
`
`.!
`
`Q
`
`:9
`3
`38°‘
`O
`
`N L;
`
`0
`Y‘:
`C\|
`
`rx
`Go
`
`21%
`
`87
`
`100
`
`12
`
`O OQ
`
`]
`
`is
`“'0CH
`
`12
`
`

`
` U.S.Patent
`
`oEm
`
`May 10, 1994
`
`Sheet 12 of 22
`
`5,311,516
`
`mm.©~m~
`
`13
`
`13
`
`

`
`Ll3PIS
`
`mm
`
`\\mmm.m.Rue3FN
`
`ERE
`
`m.2.4M0M1%mm88mm2%3333%Ma:331.2229.229.2Tu
`
`6115I11113,5
`
`£1
`
`.2
`
`0K3H
`
`all032
`
`4P.
`
`HF1
`
`E
`
`M...B3232317.3123239.3BM2&U.NG
`
`14
`
`

`
`U.S. Patent
`
`May 10,1994
`
`Sheet 14 of 22
`
`5,311,516
`
`V
`
`404
`
`2406
`
`2410
`
`2412
`
`240
`
`240
`
`241
`
`AME
`
`N
`
`BER
`
`PHASE NUMBER
`
`
`
`1Hanan:nnnmnnmnnmnn
`
`
`
`2Enngnnannmnnmnnmnn
`
`3_m@.mEfla-anmnuminnnn
`
`
`
`4mayumnmnnmnamanmnn
`
`15
`
`15
`
`

`
`tHE3PCS.
`
`V.3M
`
`1..
`
`0.,
`
`mm
`
`mm
`
`22f0511
`
`1...I3..5
`
`615,
`
`mmum22%2
`
`IP
`
`4S
`
`wmH
`m5U2NonoEG1
`
`16
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 16 of 22
`
`5,311,516
`
`
`
`TELEPHONE
`SERVICING
`ROUTINE
`
`2602
`
`
`
`ANSWER CALL
`
`IDENTIFY PAGER ADDRESS
`
`2612
`
`ACCESS DATA BASE
`2608 AND EXTRACT PAGER
`PARAMETERS
`
`CANNED VOICE
`MESSAGE
`STATUS
`
`261
`
`0
`
`
`
`
`YES
`
`2614
`
`FOR MESSAGE
`
`261
`
`6
`
`NO
`
`2618
`
`vs-:
`
`2622
`
`YES
`
`2520
`
`STORE IN POCSAG
`ACTIVE PAGE FILE
`
`2624
`
`STORE IN GSC
`ACTIVE PAGE FILE
`
`N0
`® N
`
`2626
`
`I
`
`Yes
`
`2628
`
`ERROR
`
`2630
`
`IDENTIFY FRAME. PHASE,
`PAGER COLLAPSE MASK, AND OTHER
`TRANSMISSION PARAMETERS
`
`FILE BY ASSIGNED PHASEI
`
`2532
`
`17
`
`17
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 17 of 22
`
`5,311,516
`
`
`
` FRAME BATCHING
`
`ROUTJNE FOR
`
`
`PHASE X
`
`
`2701
`
`2702
`
`NO
`
`FIG. 27
`
`YES
`
`2704
`
`BEGIN SORT TO BUILD OUEUE
`FOR "NEXT FRAME" = FN
`
`2706
`
`ADD TO "NEXT FRAME OUEUE":
`
`
`ALL MESSAGES IN THE TPS "ACTIVE PAGE FILE" WITH
`
`
`FRAME#( MODULO COLLAPSE# ) = FN(MODCOLLAPSE#)
`
`
`
`
`
`
`ADD TO “NEXT FRAME QUEUE":
`ALL MESSAGES IN THE CARRY ON OUEUE"
`
`2708
`
`SET N = 0
`
`2710
`
`MOVE FRAGMENT T
`"CARRY ON" QUEUE
`AND DECREMENT
`
`"CARRY ON" VALUE.
`
`712
`
`YES ENCODE NEXT
`FRAME
`
` 2714
`
`2733
`
`2742
`
`
`
`ANY
`
`2716
`
`2718
`
`
`
`M0OVFE£‘:S~§:'ggE
`MESSAGES oR
`No
`SET FRAME FN
`
`
`“Nu To THE
`FRAGMENTS
`~CAp[|:qY ON“
`
`
`.CARm, ON"
`WITH > 10
`VALUE TO 3
`2720
`WORDS
`
`
`QUEUE
`_
`
`MOVE LONGEST
`5WD RESET.
`YES
`2723
`
`
`MESSAGE WITH
`Vfffigigg”,
`
`
`
`
`
`
`
`
`
`
`
`
`
`0 To THE .CARRY ON.
`QUEUE AND SET THE
`‘MESSAGE CARRY
`
`
`
`
`
`
`
`
`
` ON" VALUE = 2
`
`TO TEMPORARY BUFFER
`
`18
`
`18
`
`

`
`U.S. Patent
`
`May 10,1994
`
`Sheet 13 of 22
`
`5,311,516
`
`YES
`
`2740
`
`
`
`YES
`
`MESSAGE A
`CONTINUED
`FRAGMENT
`
`
`
`
`
`
`"CARRY ON"
`VALUE >0
`
`
`
`2736
`
`
`
`RETRIEVE
`CONSTRUCT LAST MESSAGE
`FRAGMENT TO FILL REMAINDER OF
`LAST MESSAGE
`
`FRAME IE. LENGTH OF FRAGMENT
`FRAGMENT "N"
`
`"N" = (87 WDS - "TOTAL WDS" )
`
`
`NO
`
`2738
`
`CONSTRUCT MINIMUM
`4 WORD MESSAGE
`
`FRAGMENT
`
`2731
`
`
`
`ADD
`
`CURRENT
`FRAGMENT
`TO "NEXT
`FRAME“
`QUEUE
`
`
`
`
`
`FIG. 28
`
`19
`
`19
`
`

`
`U.S. Patent
`
`May 10, 1994
`
`Sheet 19 of 22
`
`5,311,516
`
`
`
` FRAME
`BATCHING
`
`ROUTINE FOR
`PHASE x
`
`2301
`
`
`
`2302
`
`
`
`FIG. 29
`
`2306
`
`ADD TO ‘NEXT FRAME QUEUE':
`ALL MESSAGES IN THE TPS
`‘ACTIVE PAGE FILE“ WITH
`FRAME#( MODULO
`COLLAPSEAI ) =
`FN(MODCOLLAPSE#)
`
`2809
`
`2808
`
`2304
`BEGIN SORT TO BUILD
`OUEUE FOR "NEXT
`
`FRAME" .—. FN
`
`
`
`3BgJg,_ “EXT FRWE
`
`-
`CAg';:;,“gEN5g3§E:,'” THE
`
`
`
`
`
`DEOREMENT MESSAGE “CARRY ON VALUE"
`BY 1 AND MOvE BACK TO"CAF1FIY ON
`OUEUE“ ALL MESSAGES FOR WHICH:
`A) CARRY ON FFlAME# (MODULO CARRY
`ON COLLAPSE#) at
`FN (MODULO CARRY ON
`COLLAPSE #)
`B) PERSONAL MESSAGE FRAME#(
`MODULO COLLAPSE# ) =
`FN(MODCOLLAPSE#)
`PHASE IS NOT EOUAL
`TO THE PERSONAL MESSAGE
`ASSIGNED PHASE.
`
`IF THIS
`
` MOVE FRAGMENT TO
`
`
`MESSAGES FIT IN
`"NEXT FRAM "
`
`‘?
`
`VALUE >0
`
`“CARRY ON" OUEUE
`AND DECREMENT
`“CARRY ON" VALUE.
`
`‘CARRY ON"
`
`
`
`
`
`2812
`
`2814
`
`"55
`
`ENCODE NEX
`FRAME
`
`N0
`
`SET FRAME FN
`‘CARRY ON‘
`VALUE TO 3
`
`
`
`
`
`NO
`
`ANY
`
`MESSAGES OR
`FRAGMENTS WITH >
`10 WORDS
`7
`
`MOVE NEWEST MESSAGE
`TO TEMPORARY BUFFER
`
` YES
`
`20
`
`20
`
`

`
`U.S. Patent
`
`May 10,1994
`
`Sheet 20 of 22
`
`5,311,516
`
`
`MOVE LONGEST
`MESSAGE WITH
`“CARRY ON VALUE" at
`0 TO THE “CARRY ON“
`QUEUE AND SET THE
`‘MESSAGE CARRY
`ON" VALUE = 2
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`“NEXT FRAME“
`g 87 wos
`
`'2
`
`V53
`
`YES
`
`0
`
`RETRIEVE LAST
`MESSAGE
`EFIAGMENT “N”
`
`
`
`“NEXT FRAME‘
`S 87 WDS
`?
`
` MESSAGE
`A CONTINUED
`FRAGMENT
`
`NO
`
`2827
`
`2838
`CONSTRUCT
`MINIMUM 4 WORD
`MESSAGE
`
`
`
`FRAGMENT
`
`CONSTRUCT LAST MESSAGE
`FRAGMENT TO FILL
`REMAENDER OF FRAME IE.
`LENGTH OF FRAGMENT "N" =
`
`
`
`
`
`
`(37 was - ‘TOTAL was" I
`
`2333
`
`MOVE REMAINDEFI OF MESSAGE
`"N“ TO THE ‘CAFIFIY ON‘ QUEUE
`AND RESET "CARRY ON’ VALUE TO 31.
`
`YES
`
`2837
`
` SAME
`ASSIGNED
`
`
`
`2331
`
`
`
`2339
`MOVE REMAINDEH OF MESSAGE
`‘N’ TO ‘CARRY ON‘ QUEUE OF
`SPECIFIED PHASE AND SET
`‘CARRY ON" VALUE TO 31
`
`NO
`
`2835
`
`PHASE ?
`
`ADD CURRENT
`FRAGMENT T0 "NEXT
`FRAME‘ OUEUE
`
`829
`
`
`
`
`ASSIGN RECEPTION
`PATTERN AND PHASE.
`
`AND SPECIFY IN
`CONTROL wono IN
`
`FIRST FRAGMENT
`
` FIFIST
`
`FRAGMENT
`?
`
`
`
`
`21
`
`

`
`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, 8n
`ADDRESS FIELD IN
`
`
`ASSIGNED FRAME
`
`NO
`
`
` DETECTED
`IN ADDRESS
`
`
`FIELD?
`
`YES
`
`910
`
`DECODE VECTOR ECR
`MESSAGE POINTEFIS
`-
`
`2912
`
`DECODE MESSAGE WORDS USING 2 BITS
`GENERALIZED ERROR CORRECTION.
`
`CALCULATE CHECK SUM AND
`COMPARE TO VALUE TRANSMITTED. 2914
`
`2
`
`916
`
`
`
`
`
`
`
`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
`
`
`
`
`
`
`
`291 B
`
` IS
`MESSAGE
`
`
`NO
`CONTINUE
`BIT SET?
`
`
`
`
`
`YES
`
`
`
`
`FIG, 3]
`
`YES
`
`22
`
`2920
`DOES
`
`FRAGMENT
`
`NUMBER =
`
`
`
`2922
`11?
`
`NO
`
`2924
`
`RESET PACKET
`TIMER TO 60 SEC
`
`N0
`
`IFIST PACKET IN
`FFIAGMENTED MESSAGE
`CREATE NEW TIMER FOR
`SIGNATURE RECEIVED
`
`22
`
`

`
`US. Patent
`
`May 16, 1994
`
`Sheet 22 of 22
`
`5,311,516
`
`SHORT NEW MESSAGE
`
`2942
`
`2940
`
`TRANSFER MESSAGE TO
`MEMORY MANAGEMENT
`FOR IMMEDIATE DISPLAY
`
`ALERT U532; 0|:
`RECEWED
`MESSAGE
`
`2902
`
`2933
`
`LAST PACKET IN FFIAGMENTED MESSAGE
`
`
`
`TRANSFER
`TRANSFER
`
`
`
`SIGNATURE AND
`MESSAGE TO
`
`PACKET NUMBER
`MEMORY
`
`
`
`
`TO MEMORY
`MANAGEMENT
`
`
`MANAGEMENT.
`FOR IMMEDIATE
`
`
`
`
` DISPLAY
`
`
`
`
`
`
`
`
`
`
`
`
`
`MM MATCHES
`PACKET TO
`PARTIAL MESSAGE
`IN MEMORY WITH
`SAME SIGNATURE
`AND ENDING WITH
`
`2934
`
`PACKET NUMBER
`
`
`MINUS ONE.
`
`
`2936
`
`2930
`
`
`
`
`
`MM MATCHES
`PACKET TO PARTIAL
`MESSAGE IN MEMORY
`
`
`WITH SAME
`SIGNATURE AND
`
`
`ENDING WITH PACKET
`
`
`
`2928 NUMBER MINUS ONE.
`
`
`
`MIDDLE PACKET IN FRAGMENTED MESSAGE
`
`
`
`TRANSFER
`SIGNATURE
`
`AND PACKET
`
`NUMBER TO
`MEMORY
`
`MANAGEMENT_
`
`
`
`
`
`
`
`
`
`
`2926
`
`TRANSFER
`MESSAGE TO
`MEMORY
`MANAGEMENT
`
`FIG. 32
`
`23
`
`23
`
`

`
`1
`
`5,311,516
`
`PAGING SYSTEM USING MESSAGE
`FRAGMENTATION T0 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
`
`A related, copending application is U.S. patent appli-
`cation Ser. No. 07/89l,363filed May 29, 1992 by
`Schwendeman et al., and assigned to the assignee
`hereof, entitled "Data Communication Receiver Hav-
`ing Variable Length Message Carry-On".
`1. Field of the Invention
`
`The present invention relates generally to the field of
`addressed messaging communication systems, and more
`particularly to a message segmentation method for re-
`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.
`
`SUMMARY OF THE INVENTION
`
`ID
`
`15
`
`20
`
`25
`
`3!}
`
`35
`
`40
`
`45
`
`50
`
`55
`
`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
`
`24
`
`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 ofa 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 infonnation 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.
`
`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.
`
`24
`
`

`
`5,311,516
`
`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 the present 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 alph_anumeric 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 modern 206 using any of a number of well known
`modem transmission protocols.
`When a call to place a message, ie. a paging request,
`is received, a controller 204 handles the processing of
`the message. The controller 204 is preferably a mi-
`crocomputer, such_as 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 handshakin g protocol to enable recep-
`tion of messages from a data entry device. When a call
`is received, the controller 204 references information
`
`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
`infonnation 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 (frarne 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
`
`5
`
`IO
`
`15
`
`25
`
`30
`
`35
`
`45
`
`50
`
`55
`
`60
`
`65
`
`25
`
`25
`
`

`
`5
`
`5,311,516
`
`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 may be any of a number of well known distribu-
`tion channel types, such as wire line, an RF or micro-
`wave distribution channel, or a satellite distribution
`link. The distributed message stream is transferred to
`one or more transmitter stations 104, depending upon
`the size of the communication system 100.
`The message stream is first transferred into a dual
`port buffer 230 which temporarily stores the message
`stream prior to transmission. At an appropriate time
`determined by timing and control circuit 232, the mes-
`sage stream is recovered from the dual port buffer 230
`and coupled to the input of preferably a 4-level FSK
`modulator 234. The modulated message stream is then
`coupled to the transmitter 236 for transmission via an-
`tenna 238.
`
`ID
`
`15
`
`20
`
`25
`
`30
`
`35
`
`FIGS. 3, 4 and 5 are timing diagrams illustrating the
`transmission format of the signaling protocol utilized in
`accordance with the preferred embodiment of the pres-
`ent invention. As shown in FIG. 3, the signaling proto-
`col enables message transmission to data communica-
`tion receivers, such as pagers, assigned to one or more
`of 128 frames which are labeled frame I] through frame
`127. It then will be appreciated that the actual number
`of frames provided within the signaling protocol can be
`greater or less than described above. The greater the
`number of frames utilized, the greater the battery life
`that may be provided to the data communication receiv-
`ers operating within the system. The fewer the number
`of frames utilized,
`the more often messages can be
`queued and delivered to the data communication re-
`ceivers assigned to any particular frame, thereby reduc-
`ing the latency, or time required to deliver messages.
`As shown in FIG. 4. the frames comprise a synchro-
`nization code (sync) followed preferably by eleven
`blocks of message information which are labeled block
`0 through block 10. As shown in FIG. 5. Each block of
`message information comprises preferably eight ad-
`dress, control or data code words which are labeled
`word 0 through word 7 for each phase. Consequently,
`each phase in a frame allows the transmission of up to
`eighty-eight address. control and data code words. The
`address, control and data code words are preferably
`31,21 BCH code words with an added thirty-second
`
`45
`
`50
`
`55
`
`60
`
`65
`
`26
`
`6
`even parity bit which provides an extra bit of distance
`to the code word set. It will be appreciated that other
`code words, such as a 23.12 Golay code word could be
`utilized as well. Unlike the well known POCSAG sig-
`naling protocol which provides address and data code
`words which utilize the first code word bit to define the
`code word type, as either address or data, no such dis-
`tinction is provided for the address and data code words
`in the signaling protocol utilized with the preferred
`embodiment of the present invention. Rather, address
`and data code words are defined by their position
`within the individual frames, as will be more fully dis-
`cussed below.
`
`FIGS. 6 and 7 are timing diagrams illustrating the
`synchronization code utilized in accordance with the
`preferred embodiment of the present invention. In par-
`ticular, as shown in FIG. 6, the synchronization code
`comprises preferably three parts. a first synchronization
`code (sync 1), a frame information code word (frame
`info) and a second