`Subject:
`
`Proposal for Puncturing Pattern for 3/8
`code
`
`Author:
`
`Ernst Eberlein
`
`Date:
`
`11/23/98
`
`1 Scope
`The split 3/8 convolutional code is subject of analysis within WP21B. This memo includes a
`proposal for the convolutional code and the puncturing pattern.
`
`2 Problem
`The new proposal for diversity combining introduced by FhG is based on a convolutional
`code with a mother code of code rate 1/3. If both satellite signals are available the received
`pattern is equivalent to a system with code rate 1/3. If only one signal available the received
`signal is equivalent to a punctured convolutional code with a remaining code rate of ¾.
`A code rate of ¾ is typically derived from a mother code of code rate ½. For our system for
`a mother code of code rate 1/3 two puncturing patterns for the early and late signal must
`be found.
`
`3 Status/Proposals
`STEL has analyzed some puncturing patterns by simulation and made some proposals. The
`proposals are based on the polynomials
`G1 = 171 (Octal)
`G2 = 133
`G3 = 165
`This polynomials are identical to the polynomial supported by the Qualcomm chip Q1650
`[3]. The puncturing pattern for code rate ¾ is:
`1 0 1
`1 1 0
`(G3 is used for code rate 1/3 only. For codes with code rate <= ½ G3 is not used.
`
`The Eureka 147 standard uses the following polynomials:
`G1 = 133(Octal)
`
`C:\Users\kvak\Documents\Local Client Files\Fraunhofer\IPRs\IPR2018-00690(6,314,289) (Instituted)\Surreply\Swear Behind\Puncturing_patterns.doc
`
`1 Ebl 3/22/202
`
`Fraunhofer Ex 2053-p 1
`Sirius v Fraunhofer
`IPR2018-00690
`
`
`
`
`
`
`
`G2 = 171
`G3 = 145
`G4 = 133
`
`
`
`
`
`For these polynomials puncturing patterns from code rate 8/9 to ¼ are given. The details of
`the puncturing patterns can be found in [2]. The Eu-147 does not define a puncturing
`pattern for code rate ¾. Only patterns for 8/11 = 0.7272 and 8/12 = 0.8 are given. The
`puncturing pattern for 8/11 is:
`
`1 1 1 1 1 1 1 1
`
`1 0 1 0 1 0 0 0
`
`For 8/10:
`
`1 1 1 1 1 1 1 1
`
`1 0 0 0 1 0 0 0
`is specified.
`
`FhG did together with the University of Erlangen (Prof. Huber) some literature analysis. The
`paper [1] give an very good overview to different puncturing patterns. Based on this paper
`the following proposals can be derived:
`
`Generator polynomials:
`G1 = 147 (Octal)
`G2 = 135
`G3 = 163
`
`
`Puncturing pattern
`
`E E E
`
`E x L
`
`L L L
`
`This is equivalent to using a code with the polynomial 163,135 for the satellite 1 and a code
`with the polynomials 147, 135 for satellite 2 and the puncturing pattern
`1 1 1
`1 0 0
`as proposed by [1]. According to the literature both codes are "best" ¾ codes. At least the
`code with the polynomials 147 and 135 generates a good code for code rate ½ also.
`Therefore this code can be used for terrestrial also. The performance of the total 3/8 code
`is TBD (e.g. by simulation). [1] does not give results for this combination.
`
`C:\Users\kvak\Documents\Local Client Files\Fraunhofer\IPRs\IPR2018-00690(6,314,289) (Instituted)\Surreply\Swear Behind\Puncturing_patterns.doc
`
`2 Ebl 3/22/202
`
`Fraunhofer Ex 2053-p 2
`Sirius v Fraunhofer
`IPR2018-00690
`
`
`
`
`
`Please note: Using this proposal may give a slightly better
`performance then the current used polynomials.
`
`
`
` 4
`
`
`
`[2]
`
`ETS 300 400 1: Digital Audio Broadcasting (DAB) To Mobile, Portable and Fixed
`Receivers
`
`
`Q1650 K=7 Multi-Code Rate Viterbi Decoder, Data sheet QUALCOMM
`[3]
`Incorporated,
`
`VLSI Products
`
`
`C:\Users\kvak\Documents\Local Client Files\Fraunhofer\IPRs\IPR2018-00690(6,314,289) (Instituted)\Surreply\Swear Behind\Puncturing_patterns.doc
`
`3 Ebl 3/22/202
`
` Other Options
`All the given proposals are based on a constraints length of K = 7. Optional other
`constraint length (e.g. K = 8 or K = 9) can be considered providing an additional gain. A
`higher constraint length adds additional complexity to the chipset (additional cost is app.
`1$). If a significant improvement can be achieved the additional complexity is acceptable.
`
`
`
`Literature
`
`[1]
`
`
`J. BIBB CAIN, George C. Clark and John M. Geist
`Punctured Convolutional Codes of Rate (n-1)/n and Simplified Maximum Likelihood
`Decoding.
`IEEE Transactions on Information Theory, VOL. IT-25, Mo. 1, January 1979
`
`Fraunhofer Ex 2053-p 3
`Sirius v Fraunhofer
`IPR2018-00690
`
`
Accessing this document will incur an additional charge of $.
After purchase, you can access this document again without charge.
Accept $ Charge
Still Working On It
This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.
Give it another minute or two to complete, and then try the refresh button.
A few More Minutes ... Still Working
It can take up to 5 minutes for us to download a document if the court servers are running slowly.
Thank you for your continued patience.
This document could not be displayed.
We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.
Your account does not support viewing this document.
You need a Paid Account to view this document. Click here to change your account type.
Your account does not support viewing this document.
Set your membership
status to view this document.
With a Docket Alarm membership, you'll
get a whole lot more, including:
- Up-to-date information for this case.
- Email alerts whenever there is an update.
- Full text search for other cases.
- Get email alerts whenever a new case matches your search.
One Moment Please
The filing “” is large (MB) and is being downloaded.
Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.
Your document is on its way!
If you do not receive the document in five minutes, contact support at support@docketalarm.com.
Sealed Document
We are unable to display this document, it may be under a court ordered seal.
If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.
Access Government Site
