PATENT NUMBER
`
`62471 58
`
`il ililt il|il lllil il|il illll ililllilllll
`624?158
`
`U.S. UTILIrr PATENT APPLICATION
`
`.fuN 1 2 ?[mr
`
`ART UNtT.-t ./" '-'
`
`n/
`
`zo
`
`Fot
`
`ahos()
`II:
`
`at)
`
`l.
`@a
`5o
`oog
`lu:)o
`@N
`o
`
`N
`
`o
`]r#;.
`'H\O
`
`:!!=
`!!r!=
`*
`
`.;53 =3
`:s =;H=$g-
`
`r:l
`
`:iG
`
`=-
`
`"7.
`
`./
`
`SECTOR CLASS
`
`J
`
`*,d:;:^u
`Q'7/7 EXAMINER I
`IG4w SUBCLASS .-l [ .
`' Lhtt?1r
`4
`F|LED wrTH: I DrsK (cRF) [ rrcHe
`
`(Anached in pocket on right insida llap)
`
`PREPARED AND APPROVED FOR ISSUE
`
`ISSUI NG CLASSIFICATION
`cBoss REFERENCE(S)
`suBclAss (oNE suBcLAss PER BLOCK)
`
`.G
`
`t-l TERMTNAL
`I lDtsctArMER
`
`(dare)
`
`I a) The term of this patent
`subsequent lo
`has been disclaimed.
`E U) fne lerm ol this patent shall
`not extend beyond the expiration date,
`ot U.S Patent. No.
`
`E c) The terminal months of
`this patent have been disclaimed.
`
`DRAWINGS
`
`Sheets Dnrvg.
`
`Y'
`U
`
`Figs. Dmrg. ,
`./
`
`1D i
`
`Print Fig.
`
`5
`
`(Assisrant Examiie4
`
`(Dat€)
`
`PT'UNRU,CHUNG
`PRfIilMY D(AITINER
`
`(Pti.".!, E
`
`".i"€4
`
`(Oato)
`
`/Fl
`-re{-
`
`Continued on lssue Slip Inside File Jacket
`
`{ -e - c7{}
`
`CLAIMS ALLOWED
`
`TotalClaims
`1't
`
`.JA-
`
`I
`
`Print Claim for O.G.
`I
`
`NOTICE OF ALLOWANCE MAILED
`
`llttlrr
`-
`rssuE FEH{ia>\
`fl€t4bV + late e{o-
`l1 lct
`
`Amounl Due
`
`ISSUE BATCH NI,IIBER
`AEt
`
`WARNING:
`The inlormation disclosed herein may be restrict€d. Unaulho.ized disclosure may be prohibited by the United States Code Tiile 35, Sections 122, 191 and 968.
`Possession outside the U.S. Patent & Tradema* Ottico is restdcted to authorlzed employees and contraclors only.
`
`Form PTO-136A
`(Bev.6i/98)
`
`lesue Fss i'' i ; :li'
`
`(LABEL AREA)
`-,*rt Onmril0d-sl*Blsd*
`
`ttrarrE\
`
`Fraunhofer Ex 2055-p 1
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`ttot'r
`'^lfiffiilff
`0922U836 :
`
`ffiiilliijilfilihriififfi
`
`JC585 U.S, PTO
`0e 1222836
`
`.N#nuleee
`
`CONTENTS
`Date received
`(lncl. C. of M.)
`or
`Date Mailed
`
`It[
`LI
`
`.-/ ,/t
`
`42.
`
`43.
`
`44.
`
`45.
`
`//4 0D
`l//1/bl
`
`50.
`
`51.
`
`52.
`
`53.
`
`54.
`
`55.
`
`56.
`
`57.
`
`58.
`
`59.
`
`60.
`
`61.
`
`62.
`
`63.
`
`64.
`
`65.
`
`66.
`
`67.
`
`68.
`
`69..
`
`70..
`
`71..
`
`72.
`
`73.
`
`74,
`
`76.
`
`77.
`
`78.
`
`79.
`
`80.
`
`81.
`
`ll trtr'r r1l r.l.crnE\
`
`.,l
`.'t,...
`
`,i'
`, .,tt1
`
`a
`
`t'{f
`
`.l
`
`15.
`
`16.
`
`17.
`
`18.
`
`19.
`
`20.
`
`21.
`
`22.
`
`23.
`
`24.
`
`25.
`
`26.
`
`27.
`
`28.
`
`29.
`
`30.
`
`31.
`
`32.
`
`33.
`
`34.
`
`35.
`
`36.
`
`37..
`
`38..
`
`39..
`
`40..
`
`41.
`
`Fraunhofer Ex 2055-p 2
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`SEARCHED
`
`SEARCH NOTES
`(TNCLUDTNG SEARCH STRATEGY)
`
`ItN u"^J,-
`llt
`,4i- N;-,1t-";l
`\
`> i lv ,fi,A/u'/k
`t
`-i-
`k<-a
`VZF-L/I
`
`r'.--^
`
`t
`
`(t
`
`-
`
`|
`
`Date
`
`Exmr.
`
`l, l- 3nct-
`
`,f ,, f",
`
`?it<
`
`Class
`
`Sub.
`
`Date
`
`Exmr.
`
`ti
`
`7t4
`IJ
`----n
`tqP'n o"
`"
`3?o
`I.L
`
`14, C
`
`74b'ltb
`
`LNnt c
`?'q',/
`
`)
`
`rh ld\'l'
`It/
`hA. {<a
`6, frcfo,
`
`KTW:
`v ,.1
`.r" I
`
`/l I
`
`.b
`
`*\--,
`fmc
`
`r//
`
`INTEF FERFi|CE SEARCHED
`Class
`Date
`Exmr.
`'7t+
`tfrufor
`l'4('
`
`,s6u.
`
`1qo
`'7?L
`78b
`
`I I
`
`,', l-u
`
`,/
`'Q
`
`J
`
`(RTGHT OUTSTDE)
`
`Fraunhofer Ex 2055-p 3
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`ISSLIE SLIP STAPLE AREA (for additional'cross references)
`
`.;
`
`POSmON
`
`rNrTrALs
`
`ID NO.
`
`DATE
`
`//7
`t-,ihQ
`
`Non-elected
`lnterference
`Appeal
`0biected
`
`FEE DETERIIINATION
`o.r.P.E. cLASStFtER
`FORIIALITY REVIEW
`
`^]r\
`_L/-+\
`
`|,)ola
`
`,ryq
`
`INDEX OF CLAIMS
`Rejected
`N
`Allowed
`I
`(Through numeral)... Canceled A
`Restricted 0
`
`t -
`
`i-
`
`Date
`
`Clalm
`6c
`C'
`'go
`
`Gc
`t.|.
`
`51
`52
`53
`
`54
`55
`56
`57
`58
`59
`60
`51
`t2
`63
`
`64
`65
`
`D6
`
`67
`68
`
`69
`70
`
`71
`72
`73
`74
`75
`76
`77
`78
`79
`80
`81
`
`82
`83
`84
`85
`86
`87
`88
`89
`
`9C
`
`91
`
`92
`93
`
`94
`95
`96
`97
`90
`99
`t0(
`
`Date
`
`6\t16 t$\
`v\
`.--, t
`il=
`
`NNt
`
`\
`
`Claim
`
`r!
`.E
`Ec
`C'
`.Eo
`IL
`( d
`2
`G
`
`l/
`q
`
`4 5 6
`
`t+
`
`3 7
`
`I 9
`
`10
`
`12
`
`14
`15
`
`t,
`
`1 17
`( 18
`t61 19
`
`L
`
`27
`
`31
`32
`
`35
`
`37
`
`39
`
`41
`
`45
`46
`47
`
`49
`t0
`
`lf more than 150 claims or 10 actions
`staple additional sheet here
`
`(LEFT tNStDE)
`
`Fraunhofer Ex 2055-p 4
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`RIAL NUMBER
`
`09 /222 t835
`
`FILING DATE
`
`L2 / 30 /e8
`
`ATTORNFV 3OI]KET NO.
`
`29L9-Z
`
`t--z
`(J
`=o,
`<i
`
`'t't CC,NTINUING DOMESTIC
`VEJR,IFIED PROVISIONAL
`
`DATAT( t{ tr rt t! !t tr t( tr Jr * tr tl * * )t * r( * tr 1
`ApplrcArroN No. 60/LLO,258 Lt/'3Oi9'
`
`**371 (NAT'L STAGE)
`VERITIED
`
`K lr'n.-r. ?iiv-(--/
`
`DATAtT ,r :t * tt Jr ,( tt * ,r Jr * * tr */r'* tr * tt *
`
`t'
`
`,t'
`
`'T*FOREIGN APPLICATI
`
`D, FOREIGN FILING LICENSE
`
`GRANTED oL/25/93
`
`5g'ffit''1"j'ififilfi$,,,"",n",", EV:3fri3 nu", arter Auowance
`Verified and Acknowledged
`
`:___L
`
`JIM ZEGEER
`801 NORTH PITT
`surrE L08
`ALEXANDRIA VA
`
`STREET
`
`22314
`
`analrl
`TEoo
`
`DIGITAL BROADCASTING SYSTEM AND METHOD
`
`INDEPENDEIIT
`CLAIMS
`6
`
`FILING FEE
`BECEIVED
`
`$r,232
`
`FEES: Authority has been given in Paper
`to charge/credit DEPOSIT ACCOUN-'
`No.
`NO.
`--
`for the following:
`
`:j Feis (Filingi
`.'. Iees {Processing Ext. of t.ir;re}
`', -': $ ,'jees (lssue)
`Cther"_*.-
`Credi'i
`
`\1.
`L-t
`
`t-J
`
`Fraunhofer Ex 2055-p 5
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`:::::= Ar
`
`oFA
`
`ro
`.ft
`,^@':(\r
`nGtr
`-GI
`\o\.-
`@o1
`toct
`)
`
`UF
`
`Llw Orrtces or
`JIM ZEGEER
`SUITE 1OB
`801 NORTH PITT STREET
`ALEXANDRIA. VIRGINIA 22314
`
`TELEPHoNE (703) 684-8333
`FAcSTMILE (703) 549-8411
`
`UTILITY PATENT APPLICATION TRANSMITTAL
`(Only for new nonprovisional applications under 37 C'F'R' $1'53(b)
`
`AttY. Docket No.: 2919-Z
`
`\>
`^)
`=.
`c,p
`
`-Ll.
`i-
`
`-6-ul-(^)
`27a:.:ra
`=6:-
`iEo
`
`Ul
`
`-l
`
`BOx PATENT APPLICATION
`Assistant Commissioner for Patents
`Washington, D.C.2023I
`
`Sir:
`
`Transmitted herewith for filing is the patent application of:
`
`INVENTOR: JOSEPH SMALLCOMB
`FOR: DIGITAL BROADCASTING SYSTEM AND METHOD
`
`Specification of 22 pages.
`Claims, 26 innumber.
`txl
`txl
`Abstract.
`Drawings. [ ] Formal [X] Informal 5 sheets'
`Declaration.
`a.
`t I
`Newly executed (original or copy)
`b.
`tl
`Copy from a prior application (37 CFR 1.63(d)
`(For continuationldivisional with Box 5 completed)
`[Note Box 4 below]
`Incorporation by Reference (useable if Box 3.b, is checked)'
`The entire disclosure of the prior application, from which a copy of the oath or declaration is
`supplied under Box 3.b., is ionsidered as being part of the disclosure of the accompanying
`application and is hereby incorporated by reference therein.
`Ii a CONTINUING APPLICATION, check appropriate box and supply the requisite
`information:
`[] Continuation [] Divisional [] Continuation-in-part (CIP):
`of prior application Serial No':
`lXjNonprovisional application based on Provisional Application Seriai No. 6011-70'258
`filed Novembet 30, 1998
`Small-entity Statement
`Enclosed.
`tl
`[]
`Statement filed in prior application,
`Status still proper and desired
`An assignment of the invention to:
`application No.-
`A certified copy of
`which is hereby claimed.
`Preliminary Amendment
`The Declaration and Power of Attomey willbe filed subsequently under Rule 1.53(d)
`-,
`
`the priority of
`
`filed
`
`Page L of 2
`
`txl
`
`txl
`tl
`
`txl
`
`It
`
`l It
`
`xl
`
`1.
`
`2.
`3.
`
`+.
`
`5.
`
`6.
`
`1 8
`
`.
`
`9.
`10.
`
`Fraunhofer Ex 2055-p 6
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`Information Disclosure Statement (IDS) PTO-1449
`tl
`Copies of IDS Citations.
`Other:
`
`Filing Fee (not enclosed). The filing fee has been calculated as shown below:
`
`u r
`
`ltl
`
`txl
`
`11.
`
`12.
`
`For
`
`No. Filed
`
`Basic
`
`No. Extra
`
`Rate $
`
`Total Ciaims
`
`Indep. Claims
`
`26
`
`o
`
`[ ] Multiple Dependent Claims
`
`20
`
`J
`
`6
`
`J
`
`$ 18.00
`
`$ 78.00
`
`$260.00
`
`TOTAI OF ABOVE CALCUI-ATIONS
`
`BASIC FEE
`
`[ ] Reduction by 712 For Filing By Small Entity
`TOTAL RLING FEE
`
`Calculations
`$ 108.00
`$ 234.00
`
`q
`
`$ 760.00
`
`$1,102.00
`
`$
`
`$1,102.00
`
`14.
`
`txl
`
`It is requested that the attached application
`coffespondence conceming this application
`
`be given a serial number and filing date and that
`be forwarded to applicants' undersigned counsel.
`
`Respectfully submitted,
`
`W{
`
`o. 18,957
`
`Page 2 of.2
`
`Suite 108
`801 North Pitt Street
`Alexandria, VA 223L4
`Telephone : 703-684-8333
`
`Date: December 30, 1998
`
`Fraunhofer Ex 2055-p 7
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`DIGITAI, BROADCASTING SYSTEM A}ID METHOD
`
`29L9-Z
`
`REFERENCE lro RELATED APPIJICAIION
`This application includes
`provisional application SeriaI
`November 30, L998 and entitled
`
`the subject matter of
`No. 60 / 110,258 filed
`DUAL CHANNEL DIVERSITY
`
`SYSEEM.
`
`The present invention relates to digital broadcasting
`systems and methods which achieve multi-channel code
`diversity by way of decomposition of a single forward error
`corrected code (FEC).
`
`BACKGROUND OF TIIE IN\IENTION
`Introduction
`A general strategy for sending digital data reliably
`through a communications channel of varying quality is to
`send redundant information so that a stream of transmitted
`source bits can be recovered wit,hout error at a receiver
`even though the communications channel may be erratic.'
`This is particularly important for one-way broadcasts of
`audio and multimedia that must be received in real-time
`with a low error rate. In such cases, a IOw error rate is
`
`i
`
`Fraunhofer Ex 2055-p 8
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`achieved partly through the use of forward error correction
`(rEC) code.
`The mobile saterlite broadcast channer is such an
`erratic channel since, particurarly at lower elevations
`angre, the line-.of-sight (Los) between a rnobire vehicle and
`the sateLlite is often obst,ructed by trees, buildings,
`signs, utility poles and wires.
`Such obstructions
`at'tenuate and distort a communications waveform, thereby
`causing high error rates for brief and ronger periods of
`time. A conmon approach to reriable satelrite broadcasting
`is to inprenent spatiaL diversit,y by broadcasting duplicate
`signars from saterrites at two different orbital locations.
`rn addition, temporal diversity may also be used by
`deraying one signar by a fixed amount of time.
`rndeed,
`some saterrite systems also rery upon terrestrial repeating
`of the satellite signar which is yet another source of
`diversity. Figure 1 illustrates a saterlit.e broadcasting
`system that has duar diversity from 2 sat,elrites (10L and
`102 ) and is augmented by terrestrial repeating ( r04 ),
`thereby providing 3-fold diversity. The origin of the
`satellit,e broadcasts is the hub station ( 103 ) . Both of the
`sat'errites and the terrestrial repeaters broadcast the same
`source data, but the channers that the data travels over
`are different so that diversity is provided. A diversity
`radio in the vehicle ( 104 ) would in generar receive arr the .
`signals (satellite and terrestrial) and use this to
`
`rL.
`
`Fraunhofer Ex 2055-p 9
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`reconst,ruct the source data
`upon t,he recePtion from the
`
`as faithful as Possible based
`multiple sources.
`
`Current State'of the Art for Diversity
`Figure 2 illustrates a generic implement'ation of
`diversity using two channels A and B' Although the
`discussion here is limited to two channels (A and B) ' aII
`of the concePts Put forth are applicable to 3 or more
`diverse channels. For a broadcast satellite application'
`signals A and B would be sent by two different satellitest
`and the channels for those signals are denoted also denoted
`asAandB.Attheoutset,qachindividualchannelhas
`some diversity due to the fact that Encoding (201) adds
`redundancy to a single data stream so that the source bits
`can be recovered without error even t,hough limited numbers
`coded bits may be lost over the channel. AIso, additional
`diversity (spatial) is used that involves modulating (Mod
`204|duplicatestreamsofdataoverindependentchannelsA
`and B. FinaIIy, as illustrated in Figure 2' time diversit'y
`is arso used by implement,ing a fixed Time Delay (203) on
`signalBatthetransmit'ter,andcomPensatingforthiswith
`a comparable Time Delay (253) at the receiver'
`lrhe
`diversity receiver has two demodulators (Demod 254\ to
`receive the signals on channel A and B simultaneously'
`Finally, the diversity receiver implements Combining (2521
`
`Fraunhofer Ex 2055-p 10
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`of the bit,s received on Channels A and B and Decoding (251)
`of the recovered code bits.
`implementation of diversity
`Note that
`in
`the
`illustrated in Figure 2, encodes the data stream and places
`identical coded data streams on both A and B channels. In
`this case, the diversity receiver captures the same coded
`bits from each channel and then implements a combining
`scheme to come up with a "best" estimate for each received
`code bit, Such combining may involve ongoing calculation
`of a quality metric for data on channels A and B and
`selecting the coded bits that, are carried on the best
`channel at any point in time. Alternatively, combining nay
`be more sophisticated in which the quality metric is used
`to generate weights for the code bits arriving on channels
`A and B and thereby constructing a summed estimate that
`maximizes the signal to noj.se composite signal. Such an
`approach is referred to as maximum ratio combining (MRC).
`A widely used implementation of an 95tco!er is a.
`convolutional code., The typical construction of a
`convolutional code is illustrated in Figure 3. The source
`bits are input into a digital shift register from the 1eft,
`and the coded bits are constructed by a sum of the current
`and 6 most recent input source bits as weighted by a
`generator polynomial over a Galois Field.
`This
`implementation generates a rate L/2 code because it outputs
`2 code bits (x and y) for every input source bit.
`
`'1
`
`Fraunhofer Ex 2055-p 11
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`fr
`
`It is cuslomary to---ci.4^s*tggct less redundant codes from
`/'
`- - .-..--:x
`such a code {y piin"turing (deletingl }utput code bits in a
`particular patteril-lame---t-i1Til6lrates the construction
`of a rate 3/4'code from a rate L/2 code. Three source bits
`are input and the output is 6 code bits: {x(i), Y(i) , i=1,
`3). Two code bits, x(21 and y(1) are deleted, leaving 4
`output code bits for 3 input code bits, thus making a rate
`3/4 code.
`
`,rt ' ",,\r'u
`I'
`
`Table 1: Construction of a Rate 314 Code by Puncturing a Rate U2 Codre
`Code Bits
`Code Bits
`Polynomial
`Post-puncturine
`Pre.nuncturins
`x(l)
`P
`x(€\
`x(3)
`x(1)
`x(3)
`P
`vQ\
`v(1)
`v(3)
`v(3)
`v(2)
`
`el
`s2
`
`the use of this rate 3/4 code in
`Tab1e 2 illustrates
`a standard implementation in which the punct,uring for both
`A and B channels is identical. Therefore the coded bits on
`both channel A and B are also identical.
`
`r rr I
`,lr I
`
`r
`
`Table 2: Standard Implementation of a Single Rate 3/4 Code on Diverse Channels
`Code Bits
`Code Bits
`Polynomial
`Channel
`Post-puncturing
`Pre-puncturing
`x(1)
`P
`x(3)
`x(1)
`x(€')
`x(3)
`same for Channel A same for Channel A
`P
`vQ)
`v(1)
`v(3)
`v(3)
`v(2\
`same for Channel A same for Channel A
`
`A
`B
`A
`B
`
`sl
`el
`s2
`e2
`
`Fraunhofer Ex 2055-p 12
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`The standard implement,ation of a punctured
`convolutional code implemented in the context of spatial
`and temporal diversity with dual channels is illustrated in
`Figure 4. At t,he transmitter, the Convolutional Encoder
`(401) generates the code bits from input source bits. Some
`of the code bits are deleted by the Puncture element (4021
`prior to modulation by the Mod element (404).
`The
`diversity receiver again has t\^/o demodulators ( Demods
`454) to simultaneously receive the broadcasts on both
`Channel A and B. The retrieved code bits from both A and
`B are input to t,he Combinj-ng element, (452b) which aligns,
`weight,s and combines redundant information about a received
`bit on the two channels. The intent of most combining
`algorithms is to maximize the signal to noise ratio of the
`combined signal. After combining, the stream of recovered
`code bits are input to the De-puncture element (452a) which
`insert,s the erasures into the slots of the code bits that'
`the Puncture element ( 402 ) of the
`vrere deleted in
`transmitter.
`
`THE PRESENT I}IVENTION
`An object of the invention is to provide an improved
`information broadcasting system and method.
`digital
`to provide code
`the invention is
`Another object of
`diversity in a digital broadcast system. Another object of
`t,he invention is to provide an apparatus and method of
`
`r.rt:!
`
`i
`
`Fraunhofer Ex 2055-p 13
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`in reception of pluraI digital
`
`achieving diversity
`broadcast signals.
`Brief1y, according to the invention a stream of a
`complete set of code bits is generated from one or more
`sources of data bits. A first Critical Subset of code bits
`is chosen or selected for a first channel (e.g. a specified
`puncturing pattern is applied to the stream of a complete
`set of code sets ) .
`A second or alternative Critical
`Subset of code bit,s is chosen or selected for a second
`channel (e.9. a second or alternat,ive puncturing pattern is
`chosen for the second channel). Further alt,ernative
`Critical Subsets may be chosen for any additional channels.
`All the channels are transmitters, some can incorporate
`time delay to achieve temporal diversity. Moreover, the
`order of t,ransmitting the code bits on each channel can be
`different (for example, the interleaving depths can be
`different). At the receiver, the stream of Critical
`Subsets of code bits
`for aLl of the channels are
`simultaneously received and a reconstruction of a complete
`set of code bits accomplished and the reconstructed code is
`inserted into a decoder.
`
`BRTEF DESCRIPTION OF THE DRAWINGS
`The above and other objects, advantages and features
`of the invention will become more clear when considered
`with the following specj-fj.cation and accompanying drawings
`wherein:
`
`I '
`
`.,1
`
`Fraunhofer Ex 2055-p 14
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`Figure L is a pictorial illustrat,ion of diversity
`broadcasting System,
`a generic diversity
`illustrates
`Figure 2
`Implementation with current' state of the art,
`Figure 3 illustrates a typical construction of a
`constraint length 7 | rate l/2 convolution code'
`of diversity
`illustration
`is an
`Figure 4
`implementation with PuDll-ured convolutional code'
`Figu;-g 5. is an illustration of an embodiment' of the
`invention implementing diversity on dual channels by
`selecting different subset of code bits for channels A and
`B'
`
`Figure 6 is an illustration of an embodiment of the
`invention implementing diversity on dual channels by
`selecting different puncturing patterns of a single
`convolutional code for Channels A and B,
`Figure 7 illustrates a pre-Viterbi diversity combining
`receiver block diagram,
`Figure 8 illustrates weighting of bit x(1) received on
`bothAandBchannels,
`Figure 9 illustrates weighting of adjacent bits x(1)
`and x(2) received on different channels, and
`Figure 10 is a graph of simulation results of average
`distance metric vs. SNR.
`
`'
`
`;,i
`ii:;ij
`U,i
`!:t
`*tE
`v''-ii,.i
`;:,i
`ti;;
`
`1., I
`
`Fraunhofer Ex 2055-p 15
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`DETAILED DESCRTPIION OF THE INVENIION
`
`F igure 5 illustrat,es a generic example of the
`invention. 'At, the transmitter, the source bit,s ent,er a
`singre Encoder '(501) in which a set of output code bits
`are generated from a set of input source bits.
`For
`explanation purposes, t,he whole set of output code bits
`will be referred to as the comprete set. The Encoder sends
`the complete set to the code Bit Decomposition (cBD)
`functionaL element (502). Ehe cBD decomposes the complete
`set into two critical subsets A and B. The subsets are
`called criticaL, because even if the receiver faithfulry
`captures only one of the subsets, this is sufficient to
`regenerate the original source bits. The subsets A and B
`may be totarry disjoint (i.e., share no common code bits of
`the complete set) or may contain some common eLements of
`the conplete set. Note that the criticar difference
`between the transmitter system in Figure 5 vs. that, of
`Figure 2 is that the code bits sent on channers A and B are
`not identical.
`At the receiver, the each stream of code bits on both
`channels A and B are captured and input to the code Bit
`Recomposition and combining (cBRc) element (552). The cBRc
`faithfully assembres the complete set to the maximum extent
`possibre via a process of weighting and combining received'
`information. fhe cBRc then sends the recovered code bits
`to Decoding element (55r). For each transmitted code bit
`
`;r
`
`Fraunhofer Ex 2055-p 16
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`there are 3 alternative outcomes at the receiver. Eable 3
`explains the causes and receiver behavior for each
`alternative:
`The scope of the invention illustrat,ed in Figure 5
`includes the following concepts at the transmitter:
`generation of a stream of a complete set of code bits
`from source data bits
`choosing a crit,ical subset of code bits for channel A
`(e.g., specified puncturing pattern)
`choosing an alternative critical subset of code bits
`forchannelB(e.g.,alternativepuncturing
`Pattern)'andsimilarlyforadditionalchannels
`the order of transmission of the code bits on each
`(e.9., different'
`channel can be different
`interleaving dePths).
`The scope of the invention includes the following
`concepts at the receiver:
`simultaneous reception of a stream of code bits on
`channels A and B and additional channels if presentf
`reconstruction of the complete Set of code bits in
`generalaccordwiththelogicofEables3and4and
`usingspecificalgorithmsdescribedbelow,
`insertion of reconstructed code set into a single
`Viterbi decoder.
`
`lists
`Tab1e 4
`combining/depuncturing and
`
`the
`general
`their weighting
`
`types
`of
`scheme that
`
`L0
`
`'if
`
`Fraunhofer Ex 2055-p 17
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`Causes
`r code bit is transmitted in both
`A and B Subsets and is
`successfully received on both
`channels
`
`Tabte 3: Nternative Outcomes and Behavior of a Diversity neceiver
`Alternative
`Receiver Behavior
`l. the code bit
`Receiver constructs a "best" estimate of
`the code bit from A+B based upon
`is captured
`quality indicators on each channel;
`by both
`Receiver constructs new code bit by
`channel
`combining (e.g., adding) the recovered
`demodulators
`code bits from Channel A and B. The
`recovered code bits could be weighted
`based upon quality indicators from each
`Demodulator
`Receiver uses the estimate of the code
`bit fromthe single channel and weights
`is with a quality indicator for the
`channel; Receiver uses the recovered
`code bit from the single channel. The
`recovered code bits could be weighted
`based upon quality indicators from each
`Demodulator
`
`2. the code bit
`is captured
`by only one
`channel
`demodulator
`
`3, the code bit
`is captured
`by neither
`channel
`demodulator:
`
`r code bit is transmitted in both
`A and B Subsets but is
`successfully received on only
`one channel
`o code bit is in transmitted only
`one channel subset and is
`successfully received on that
`channel
`r code bit is transmitted in both
`A and B Subsets but is not
`successfully received on either
`channel
`r code bit is transmitted in only
`one channel subset and is
`successfully received on that
`channel
`r code bit is not part of either
`subset
`
`corresponds t,o the outcomes of Table 3 above. The weighting
`type is a function of the code diversity technique used and
`whether a code bit was received on multiple channels.
`
`j'i
`
`:l
`
`Receiver treats this code bit as a
`puncture
`
`11
`
`a _F'
`
`Fraunhofer Ex 2055-p 18
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`Table 4 lVeighting Approach for Alteruative Cases
`Weishted Output
`
`o*x,(n)^+ F*x(n)"
`
`a*x(n)^
`
`F* x(n)"
`
`0
`
`Weiehtine Approach
`Weight the bits received on A and B with
`a and F, respectively;each is a function of
`the SNR on both Channels A and B
`Weight the bits received on A with cr; cr is
`a function of the SNR on both Channels A
`and B
`Weight the bits received on B with F; F is
`a function of the SNR on both Channels A
`and B
`
`Treat bits as Punctures
`
`Alternative
`1. Received on
`Channels A and B
`
`2.A Received on
`Channel A Only
`
`2.8 Received on
`Channel B Only
`
`3. Received on
`neithpr Channel A
`nor B
`
`It is important to note in Alternatives 2.A and 2.B of
`Table 4 that, even though a code bit is received on only
`one channel, its weight is determined by the SNR on both
`channels. This is an important feature of the invention
`and yields a significant performance gain.
`
`ILlustration of, an Embodiment of the Invention Using a
`Convolutional Code
`invention using a
`the
`illustrates
`Figure 6
`convolutional code at the transmitter. At the transmitter,
`Figure 6 shows a single Convolutional Encoder (501) that
`generates a Complete Set of code bits from input source
`bits. At t,his point, the transmit stream is broken into
`paths A and B which undergo different processing. Path A'
`destined for Channel e is punctured with a pattern (A) in
`the Puncture element ( 502 ) and Path B is punctured with a
`different patt,ern (B) by another copy of the. Puncture
`element. The critical difference between the system in
`
`L2
`
`, '''tl
`
`Fraunhofer Ex 2055-p 19
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`Fi-gure 6 versus that of Figure 4 is that the puncture
`patterns on Channels A and B are different,.
`Tabre 5. gives an example of suitabre subsets for
`channel A and B based upon different puncturing of a conmon
`rate L/2 code that constructs a rate 3/4 code on each
`channel. Note that the code bits for both channer A and B
`are the same prior
`to puncturing. However, after
`puncturing, the Channel A code bit subset is {x(3), x(1),
`y(3) , y(2l| and the Channel B subset is tx(3), x(2) , y(2),
`y(1)). Note then that in this example L/3 of the code
`bits, x( 3 ) and y Q), are carried by both channers, while
`2/3t x(1), x(21, y(1) and y(3), are carried by only a
`single channer. Analysis has shown that the benefit of
`this type of code diversity can improve performance by up
`Eo 2 dB.
`
`Table 5: Example of rransmitting Different subsets of code Bits
`Selected for Channels A and B
`Polynomial
`Code Bits
`Code Bits
`Pre-puncturine
`Post-puncturine
`x(l)
`x(l)
`x(3)
`x(2)
`x(3)
`P
`x€)
`same as Channel A x(3)
`P
`vQ\
`v(3)
`v(1)
`v(3)
`P
`v(2\
`sarnc as Channel A
`v0)
`P
`v(2\
`
`sl
`el
`s2
`E2
`
`Channel
`
`A
`B
`A
`B
`
`while the transmitt,er creat,es dif ferent code bit
`subsets and transmits them on different channers, the
`receiver captures these bits and processes t,hem in a
`combined process. Note that since the receiver may receive
`
`13
`
`I!'j1
`aci i
`
`!, !
`
`!,#
`
`rip'i
`
`"t'r,,.1''i''
`
`Fraunhofer Ex 2055-p 20
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`x(3) on both channeL A and B' its estimate of x(3) is
`determined from x(3)o and x(3)u. Alternatively, its
`estimate of x(2) is based only on x(2), since it, is only
`received on that channel. Howeverr in both cases, the
`weighting factors for the estimates are determined by SNR
`metrics for both Channel A and B. This is described in the
`next section.
`
`*'{ ,t;' i7*
`
`'::.---'
`
`Table 6: Receiver Pnocessing of Received Code Bits on Channel A and B
`to Derive Best Composite Signal
`Code Bits Post-puncturins
`P
`x(3)
`x(1)
`v(2\
`v(3)
`vQ\
`x(3)
`P
`P
`x(.2')
`x(1)
`x(2)
`sclcct best
`sclcct best
`v(3)
`via At
`via Ar
`via B*
`or MRC*
`or MRC*
`quality
`wittr cocfficicnts determincd from both A and B
`mctncs
`
`Channel
`A
`B
`A+B
`fw
`cighted
`
`P
`v(1)
`v(l)
`via B*
`
`DESCRIPTION OF COMBINING AI,GORIEHMS
`
`General Approach
`The pre-Viterbi code diversity combining receiver is
`in Figure 7 fot QPSK waveforms that are
`illustrated
`convolutionally encoded. In general, it involves taking the
`QpsK symbols from the Demods (754\ of the different
`channels (A and B ) , calculating a quality ( e. g. , l'lRC )
`metric, weighting the symbols based on this quality metric
`and combining the two signals. fhe calculat'ion of the
`quatity metric and weighting coefficients is carried out in
`the MRC weight Calculation (MwC) elenent (752b).
`In
`general, the MWC calculates the quality metric and the
`
`T4
`
`Fraunhofer Ex 2055-p 21
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`weights {a and B} based upon the input sampled code bits {xo
`and xr) as well as signal lock indicators {L^ and Lr} for
`each demodulator. The combiner & Depuncture (c&D) element
`(752a) uses the q and B inputs and constructs an optimum
`estimate for each code bit. The function of the c&D aLso
`includes appropriate quantization of the code bit estimate
`for input of soft decj.sions into the Viterbi Decoder (751).
`This is an important factor because the weighting
`coefficient determines the distribut,ion of received code
`samples over the chosen quantization which in
`turn
`determines the influence that t,he input code bits have on
`the viterbi metric that drives t,he decision on source bits
`that are the outputs of the Viterbi Decoder. Figures 8 and
`9 show additional detail of the oiversity combiner that
`includes quantization. Figure 8 is applicable to a case in
`which a single bit, is received on both A and B channels.
`Bhe bit, stream of bot,h A and B enter the calculate eremenr
`(804) which calculates the SNR (which is the quality metric
`for each channel). The weighting coefficients are then
`carculated from the sNRs and are used to scare the current
`bit,. The two resultant terms are then summed (803) and the
`sum is input, to the Quantizer ( 802 ) . The output of the
`Quantj.zer is a soft decision variable (SDV) that is
`required by the Viterbi Decoder (801). Note that a low
`weight applied to the SDV forces most of the out put values
`of Quantizer to be in the bins closest to zero and in this
`
`15
`
`i Jj'
`
`Fraunhofer Ex 2055-p 22
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`wdyr the influence on t,he viterbi metric is felt and drives
`the decoding of source bits.
`Figure 9 is applicable to a case in which a single bit
`is received on only one channel. rn this example, x(n)o is
`received on Channel A and x(n+1)8, an adjacent bit,
`is
`received on Channel g. As in the Combiner in Figur€ 8, the
`Calculate element (904) calculates the SNR of each channe]
`The weighting
`based upon the input bit
`stream.
`coefficients are again calculated from the SNRs and are
`In contrast with the case
`used to scale the current bit.
`in Figure I, after weighting, the bits are t,hen serially
`put into a Quant,izer (902). Note that, the effect of a low
`weight is to drive the quantizer to the levels closest to
`0 so that the impact on the metric of the Viterbi Decoder
`(901) is minimized. This is the way that the weighting has
`its impact on the decoded source bits even though the
`weighting is applied to different (adjacent and nearby)
`bits rather than the same bits as in the system in Figure
`8.
`
`The detailed weighting algorithm (and its calculation)
`can be performed in several different ways. The approach
`given is described below is based on a Maximal Ratio
`Combining (MRC) algorithm. Let SIVR, and SNR" represent the
`the A and B Channels'
`Signa1 to Noise Ratio of
`the QPSK symbols are
`respectively. Assuming that
`
`!:t
`
`16
`
`l."r
`
`Fraunhofer Ex 2055-p 23
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`normaLized, the MRC weight for the earry channel, a, is the
`*--" ""f o1lowing.
`
`/:'
`''I
`
`r r l,u
`L\-
`
`4 = Si/'t,.
`.s/rnr +^t/\rn, - Gstrn;F,n;'
`It can be shown that iir this case, the MRC weight for the late channel, fl is simpry
`F =l-a
`
`d;'i
`.4.:
`
`;rr.:
`
`!,!
`
`irri
`
`iTri
`
`it,ji
`
`AJ.gorithrn Background
`
`Sott Deciaion Variable
`The epsK Dernodulator uses 2, s complement format or
`equivalent in most of calculations. the output of the QpsK
`Denodulator may be quantized to a 4 bit soft Decision
`variable (sDv) to minimize the memory requirements. The
`optimum nethod of quantizing (for the viterbi Decoder) is
`to represent it symmetricalry about the nur.1 varuer so that
`there are egual number of levels representing n ones,, and
`" zeros" . A typicarry representation for sDV is odd inreger
`which is irlustrated in Tabre 7, .rt is arso optimum to
`clip the vit,erbi Decoder input signal at the Acc lever.
`However, for proper weighting of and sDV clipping shourd be
`implenented after the MRC weight,ing. Therefore, the output
`of the QpsK Demod should be clipped at twice the AGC rever.
`
`T7
`
`r"1
`
`Fraunhofer Ex 2055-p 24
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`Distance Metric
`
`The distance metric, d, is a measurement of the
`f rom t,he n hard decision'
`( i. e. + / - AGC leveI) .
`j.llustrates lhe distance metric relationship to
`assuming it is cJ.ipped to twice the AGC level:
`Table 7l Binary Forrnats
`9
`6
`3
`-3
`2
`2
`
`-l
`3
`
`8
`I
`3
`
`l0
`5
`
`0
`
`,/';
`
`tf,
`
`,y
`
`I
`
`Binary Offset
`Sofr Dec.Vnr
`Distancc
`
`0
`.15
`3
`
`t
`.13
`2
`
`7
`
`il
`
`3
`-9
`o
`
`4
`J
`0
`
`5
`-5
`
`distance
`Table 7
`the SDV,
`
`t2
`I
`o
`
`l3
`
`I
`
`l4
`t3
`2
`
`l5
`l5
`4
`
`Let the variabler mdr be the mean dist,ance metric of a
`Soft Decision Variables (SDV). For high SNR, d j-s
`approximately a Rayleigh random variable with one degree of
`ft can be shown that under this case, the
`freedom.
`relationship between d and SNR is:
`
`:i.,I
`
`ri\
`
`.,"
`
`SNR = 2*o''
`'
`IE
`For an arbiuary value of X, let
`.SNR = Xs
`Then the relationship between g and nro for the case of high SNR is
`g = logy 12ln)-2log*(ma)
`
`The above calculation shows the basic relationship
`between g and fra, but it does not take into account the
`effects of a) clipping and quantizing of the SDV or b) non-
`Rayeigh (and non-trivial) Distribution at low SNRs.
`Therefore, for a more accurate relationship, empirical
`analysis is required over the SNR range of interest. For
`the above-mentioned algorithm and over the SNR range of -3
`
`18
`
`,j
`
`Fraunhofer Ex 2055-p 25
`Sirius v Fraunhofer
`IPR2018-00690
`
`

`

`ii!
`
`to L5 dB, the analysis shows that relationship between g
`and d is close to linear and monotonic (see Fi-gure 10).
`This implies that a simple Look Up Table (LUT) is suit,able