DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
DETAILED ACTION
Claims 1-20 have been examined and are pending.
Information Disclosure Statement
An initialed and dated copy of Applicant’s IDS form 1449 submitted 08/25/2025 is attached to the instant office action. The submission is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
Claim 1, 2, 5, 8, 10, 16, 18-20 provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1, 2, 7-9, 13 of copending Application No. 18/943,944 (reference application) in view of US 2020/0059253 A1 to Chen et al. (hereinafter “Chen”) .
Instant Application 18/957,049
Reference Application 18/943,944
An encoding method, comprising:
An encoding method, comprising:
obtaining an information bit sequence, wherein a length of the information bit sequence is K;
obtaining an information bit sequence;
performing polar encoding on the information bit sequence based on a target code length E or a code rate R to determine an encoded bit sequence,
encoding the information bit sequence based on a systematic polar code, to determine an encoded bit sequence with the information bit sequence,
wherein a systematic polar code on which polar encoding is performed comprises a polarization transformation matrix and N first bit positions and N second bit positions that correspond to the polarization transformation matrix,
wherein the systematic polar code comprises a polarization transformation matrix G having a to-be-encoded side with N first bit positions and an encoding side with N second bit positions,
wherein the N second bit positions comprise a system bit position set A and a non- system bit position set MA, and
the N second bit positions comprise a systematic bit position set A and a non-systematic bit position set MA
the N first bit positions comprise a frozen bit position set B and a non-frozen bit position set MB, wherein frozen bit position set B includes a frozen bit position subset C,
the N first bit positions comprise a frozen bit position set B with a frozen bit position subset C
non-frozen bit position set MB includes a non-frozen bit position subset D,
a non- frozen bit position set MB with a non-frozen bit position subset D
wherein a frozen bit position in C and a non-frozen bit position in D are mapped to each other,
a frozen bit position in the frozen bit position subset C and a non-frozen bit position in the non-frozen bit position subset D are mapped to each other
wherein C is determined based on a bit position index intersection set of B and A,
the frozen bit position subset C is determined based on a bit position index intersection set of the frozen bit position set B and the systematic bit position set A
wherein D is determined based on a bit position index intersection set of MB and MA,
the non-frozen bit position subset D is determined based on a bit position index intersection set of the non-frozen bit position set MB and the non-systematic bit position set MA
wherein A comprises K system bit positions, B comprises N-K frozen bit positions, a length of the encoded bit sequence is N, and R is equal to K/E; and
Claim 2. the systematic bit position set A comprises last K second bit positions in the N second bit positions and/or the frozen bit position set B comprises N-K first bit positions selected from the N first bit positions based on channel reliability or codeword weights
performing rate matching on the encoded bit sequence to obtain a target encoded bit sequence,
wherein a length of the target encoded bit sequence is E and
wherein a set of bit positions in the target encoded bit sequence is a subset of MA.
wherein a length of the second intermediate encoded bit sequence X2 is equal to a quantity of second bit positions included in the non-systematic bit position set MA
Application 18/943,944 teaches performing polar encoding on the information bit sequence to determine an encoded bit sequence (see above), but does not explicitly teach performing polar encoding on the information bit sequence based on a target code length E or a code rate R, R is equal to K/E; wherein a length of the target encoded bit sequence is E; performing rate matching on the encoded bit sequence to obtain a target encoded bit sequence,
However, in a similar field of endeavor, Chen discloses in [0008] and Figure 2, determining, by the communications device, a code rate R, where R=K/M (i.e. R=K/E), K is a quantity of information bits, or K is a sum of a quantity of information bits and a quantity of check bits, M is a target code length (i.e. target code length E), and K and M are positive integers; determining, by the communications device, a to-be-used rate matching manner based on the code rate, a code rate threshold, the quantity of information bits, and an information bit threshold, or determining, by the communications device, a to-be-used rate matching manner based on the code rate, a code rate threshold, the target code length, and a target code length threshold, or determining, by the communications device, a to-be-used rate matching manner based on the code rate and two code rate thresholds, where the rate matching manner is a puncturing manner or a shortening manner; and rate matching, by the communications device based on the determined rate matching manner, a polar code of the to-be-encoded information, or rate dematching a polar code of the to-be-decoded information.
Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Application 18/943,944 to include the above limitations as suggested by Chen, in order to flexibly change a code length using rate matching to improve overall performance of a polar code as indicated in [0004] and [0006] of Chen.
Regarding Claim 2, Application 18/943,944/Chen teaches The method according to claim 1, wherein Chen further teaches the rate matching comprises shortening (shortening) and/or puncturing (puncturing). ([0008]. Discloses rate matching manner is a puncturing manner or a shortening manner) Examiner maintains same motivation to combine as indicated in Claim 1 above.
Regarding Claim 5, Application 18/943,944/Chen teaches The method according to claim 1, wherein performing the polar encoding on the information bit sequence, comprises:
Application 18/943,944further teaches determining a first intermediate encoded bit sequence based on the information bit sequence and a first polarization transformation submatrix, wherein the first polarization transformation submatrix is a polarization transformation submatrix corresponding to A in the polarization transformation matrix; (Claim 1, “determining a first intermediate encoded bit sequence Xl by multiplying an information bit sequence U corresponding to bits carried in systematic bit position set A with a first polarization transformation submatrix G1, wherein the first polarization transformation submatrix G1 is a submatrix of rows of the polarization transformation matrix that correspond to bit position indexes of second bit positions in the systematic bit position set A;”)
determining a second intermediate encoded bit sequence based on the first intermediate encoded bit sequence, a mutual mapping relationship between the frozen bit position in C and the non-frozen bit position in D, and a bit position index intersection set of B and MA, wherein a length of the second intermediate encoded bit sequence is equal to a quantity of second bit positions comprised in MA; and (Claim 1, “determining a second intermediate encoded bit sequence X2 based on the first intermediate encoded bit sequence X1, a mutual mapping relationship between the frozen bit position in the frozen bit position subset C and the non-frozen bit position in the non-frozen bit position subset D, and a bit position index intersection set of the non-frozen bit position subset B and the non- systematic bit position set MA , wherein a length of the second intermediate encoded bit sequence X2 is equal to a quantity of second bit positions included in the non-systematic bit position set MA”)
determining the encoded bit sequence based on the second intermediate encoded bit sequence, a second polarization transformation submatrix, and the information bit sequence, wherein the second polarization transformation submatrix is a polarization transformation submatrix corresponding to MA in the polarization transformation matrix. (Claim 1, “obtaining an intermediate check bit sequence C1 by multiplying the second intermediate encoded bit sequence X2 with a second polarization transformation submatrix G2, wherein the second polarization transformation submatrix G2 is a submatrix rows of the polarization transformation matrix that correspond to bit position indexes of second bit positions in the non- systematic bit position set MA; performing an exclusive OR operation on the intermediate check bit sequence Ci and the information bit sequence U corresponding to the bits carried in systematic bit position set A, to obtain a check bit sequence C; and splicing the check bit sequence C and the information bit sequence U corresponding bits carried in systematic bit position set A, to obtain the encoded bit sequence.”)
Regarding Claim 8, Application 18/943,944/Chen teaches The method according to claim 1, Application 18/943,944further teaches wherein that a frozen bit position in Cand anon-frozen bit position in D are mapped to each other comprises: the frozen bit position in C and the non-frozen bit position in D are mapped to each other based on a mapping matrix, wherein the mapping matrix is an Nc-dimensional full rank matrix or an Nc-dimensional unit matrix, and wherein Nc is equal to a quantity of frozen bit positions in C. (Claim 7, “wherein that the frozen bit position in the frozen bit position subset C and the non-frozen bit position in the non-frozen bit position subset D are mapped to each other comprises: the frozen bit position in the frozen bit position subset C and the non-frozen bit position in the non-frozen bit position subset D are mapped to each other based on a mapping matrix, wherein the mapping matrix is an Nc-dimensional full-rank matrix or an Nc- dimensional identity matrix, and Nc is equal to a quantity of frozen bit positions in the frozen bit position subset C.”)
Regarding Claim 10, Application 18/943,944 teaches A decoding method, comprising: (Claim 8, “A decoding method, comprising:”)
obtaining a to-be-decoded symbol sequence, (Claim 8, “obtaining a to-be-decoded symbol sequence;”)
determining an information bit sequence by performing polar decoding on the to-be- decoded symbol sequence based on a code rate R or a length K of the information bit sequence and a log likelihood ratio corresponding to a system bit position, (Claim 8, “decoding the to-be-decoded symbol sequence based on a systematic polar code, to determine an information bit sequence”)
wherein a systematic polar code on which polar decoding is performed comprises a polarization transformation matrix and N first bit positions and N second bit positions that correspond to the polarization transformation matrix (Claim 8, “wherein the systematic polar code comprises a polarization transformation matrix G having a to-be-encoded side with N first bit positions and an encoding side with N second bit positions,”)
wherein the N second bit positions comprise a system bit position set A and a non- system bit position set MA; and (Claim 8, “the N second bit positions comprise a systematic bit position set A and a non-systematic bit position set MA”)
wherein the N first bit positions comprise a frozen bit position set B and a non-frozen bit position set MB; wherein frozen bit position set B includes there is a frozen bit position subset C, non-frozen bit position set MB includes a non-frozen bit position subset D , and (Claim 8, “the N first bit positions comprise a frozen bit position set B with a frozen bit position subset C and a non-frozen bit position set MB with a non-frozen bit position subset D)
wherein a frozen bit position in C and a non-frozen bit position in D are mapped to each other; (Claim 8 “a frozen bit position in the frozen bit position subset C and a non- frozen bit position in the non-frozen bit position subset D are mapped to each other”)
wherein C is determined based on a bit position index intersection set of B and A, and D is determined based on a bit position index intersection set of MB and MA; and (Claim 8 “the frozen bit position subset C is determined based on a bit position index intersection set of the frozen bit position set B and the systematic bit position set A, the non-frozen bit position subset D is determined based on a bit position index intersection set of the non-frozen bit position set MB and the non-systematic bit position set MA”)
wherein A comprises K system bit positions, B comprises N-K frozen bit positions (Claim 9, “wherein the systematic bit position set A comprises last K second bit positions in the N second bit positions; and/or the frozen bit position set B comprises N-K first bit positions selected from the N first bit positions based on channel reliability or codeword weights, wherein K is greater than or equal to 1 and less than N)
Application 18/943,944teaches performing polar decoding on the to-be-decoded information bit sequence to determine an information bit sequence (see above), but does not explicitly teach performing polar decoding on the to-be-decoded information bit sequence based on a code rate R or a length K of the information bit sequence and a log likelihood ratio corresponding to a system bit position. a target code length E or a code rate R, R is equal to K/E; wherein a length of the target to-be-decoded bit sequence is E, and K is equal to ER.
However, in a similar field of endeavor, Chen discloses in [0008] and Figure 2, , a code rate R, where R=K/M (i.e. K=ER. Examiner notes that basic math properties result in transforming R=K/M into K=MR), K is a quantity of information bits, or K is a sum of a quantity of information bits and a quantity of check bits, M is a target code length (i.e. target code length E), and K and M are positive integers; [0140], further discloses For a receiving device, the receiving device demodulates received to-be-decoded information to obtain an LLR sequence (i.e. log likelihood ratio corresponding to a system bit), and the receiving device rate dematches and decodes the LLR sequence. A process of the rate dematching and decoding operations is specifically as follows: The receiving device obtains a code rate R and an encoding parameter threshold of to-be-decoded information. The encoding parameter threshold includes a code rate threshold, an information bit threshold, or a target code length threshold. The receiving device determines a to-be-used rate matching manner based on the code rate, the code rate threshold, a quantity of information bits, and the information bit threshold, or determines a to-be-used rate matching manner based on the code rate, the code rate threshold, a target code length, and the target code length threshold, or determines a to-be-used rate matching manner based on the code rate and two code rate threshold.
Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Application 18/943,944 to include the above limitations as suggested by Chen, in order to flexibly change a code length using rate matching to improve overall performance of a polar code as indicated in [0004] and [0006] of Chen.
Regarding Claim 16, Application 18/943,944/Chen The method according to claim 10, wherein the frozen bit position in C and the non-frozen bit position in D are mapped to each other based on a mapping matrix, wherein the mapping matrix is an Nc-dimensional full rank matrix or an Nc- dimensional unit matrix, and wherein Nc is equal to a quantity of frozen bit positions in C. (Claim 13, “wherein that the frozen bit position in C and the non-frozen bit position in the non-frozen bit position subset D are mapped to each other comprises: the frozen bit position in the frozen bit position subset C and the non-frozen bit position in the non-frozen bit position subset D are mapped to each other based on a mapping matrix, wherein the mapping matrix is an Nc-dimensional full-rank matrix or an Nc-dimensional identity matrix, and Nc is equal to a quantity of frozen bit positions in the frozen bit position subset C.”)
Regarding Claim 18, Application 18/943,944 teaches An apparatus, comprising (Claim 14 “a communication apparatus”)
an interface circuit configured to obtain an information bit sequence, (Claim 14 “obtaining an information bit sequence;”)
a processor; and a memory storing instructions that, when executed by the processor, cause the processor to: (Claim 14 “at least one processor and a non-transitory memory storing code instructions for execution by the at least one processor, the code instructions including instructions for:”)
perform polar encoding on the information bit sequence based on a target code length E or a code rate R; determine an encoded bit sequences; (Claim 14, “encoding the information bit sequence based on a systematic polar code, to determine an encoded bit sequence with the information bit sequence”)
wherein a systematic polar code on which polar encoding is performed comprises a polarization transformation matrix and N first bit positions and N second bit positions that correspond to the polarization transformation matrix; (Claim 14, “wherein the systematic polar code comprises a polarization transformation matrix G having a to-be-encoded side with N first bit positions and an encoding side with N second bit positions”)
wherein the N second bit positions comprise a system bit position set A and a non- system bit position set MA and the N first bit positions comprise a frozen bit position set B and a non-frozen bit position set MB; wherein frozen bit position set B includes there is a frozen bit position subset C, non-frozen bit position set MB includes a non-frozen bit position subset D, and (Claim 14, “the N second bit positions comprise a systematic bit position set A and a non-systematic bit position set MA, the N first bit positions comprise a frozen bit position set B with a frozen bit position subset C and a non- frozen bit position set MB with a non-frozen bit position subset D”)
wherein a frozen bit position in C and a non-frozen bit position in D are mapped to each other; (Claim 14 “a frozen bit position in the frozen bit position subset C and a non-frozen bit position in the non-frozen bit position subset D are mapped to each other”)
wherein C is determined based on a bit position index intersection set of B and A, and D is determined based on a bit position index intersection set of MB and MA; (Claim 14, “the frozen bit position subset C is determined based on a bit position index intersection set of the frozen bit position set B and the systematic bit position set A, the non-frozen bit position subset D is determined based on a bit position index intersection set of the non-frozen bit position set MB and the non-systematic bit position set MA”)
wherein A comprises K system bit positions, B comprises N-K frozen bit positions, a length of the encoded bit sequence is N, and R is equal to K/E; (Claim 15, “wherein the systematic bit position set A comprises last K second bit positions in the N second bit positions; and/or the frozen bit position set B comprises N-K first bit positions selected from the N first bit positions”)and
a set of bit positions in the target encoded bit sequence being a subset of MA. (Claim 14, “wherein a length of the second intermediate encoded bit sequence is equal to a quantity of second bit positions included in the non-systematic bit position set M^”)
Application 18/943,944 teaches performing polar encoding on the information bit sequence to determine an encoded bit sequence (see above), but does not explicitly teach performing polar encoding on the information bit sequence based on a target code length E or a code rate R, R is equal to K/E; wherein a length of the target encoded bit sequence is E; performing rate matching on the encoded bit sequence to obtain a target encoded bit sequence,
However, in a similar field of endeavor, Chen discloses in [0008] and Figure 2, determining, by the communications device, a code rate R, where R=K/M (i.e. R=K/E), K is a quantity of information bits, or K is a sum of a quantity of information bits and a quantity of check bits, M is a target code length (i.e. target code length E), and K and M are positive integers; determining, by the communications device, a to-be-used rate matching manner based on the code rate, a code rate threshold, the quantity of information bits, and an information bit threshold, or determining, by the communications device, a to-be-used rate matching manner based on the code rate, a code rate threshold, the target code length, and a target code length threshold, or determining, by the communications device, a to-be-used rate matching manner based on the code rate and two code rate thresholds, where the rate matching manner is a puncturing manner or a shortening manner; and rate matching, by the communications device based on the determined rate matching manner, a polar code of the to-be-encoded information, or rate dematching a polar code of the to-be-decoded information.
Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Application 18/943,944 to include the above limitations as suggested by Chen, in order to flexibly change a code length using rate matching to improve overall performance of a polar code as indicated in [0004] and [0006] of Chen.
Regarding Claim 19, Application 18/943,944/Chen teaches The apparatus according to claim 18, wherein Chen further teaches the rate matching comprises shortening and/or puncturing. ([0008]. Discloses rate matching manner is a puncturing manner or a shortening manner) Examiner maintains same motivation to combine as indicated in Claim 1 above.
Claim 6-7 is provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over copending Application No. 18/943,944 (reference application) and Chen in view of R1-164375 “Evaluation of polar codes for eMBB scenario” (hereinafter “R1-164375”)
Regarding Claim 6, Application 18/943,944/Chen teaches The method according to claim 5,
Application 18/943,944/Chen does not explicitly teach wherein a length of the information bit sequence is K is based on: a sum of the length of the information bit sequence and a length of a cyclic redundancy check (CRC) bit sequence corresponding to information bits is K.
However, in a similar field of endeavor, R1-164375 teaches in Section 2 and 3and Figure 1, polar encoder and decoder schemes, in which m CRC bits are added to information block of length k, such that the output of the CRC block results in a information block length K = k+m, prior to performing polar encoding.
Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Application Application 18/943,944/Chen to include the above limitations as suggested by R1-164375, as polar codes, equipped with cyclic redundancy checks (CRCs) under list successive cancellation (CA-SCL) decoding, yield good performance at small/medium/large block length with low/medium/high code rate as indicated in section 1 of R1-164375.
Regarding Claim 7, Application 18/943,944/Chen/R1-164375, teaches the method according to claim 6, wherein
Application 18/943,944 further teaches the first intermediate encoded bit sequence comprises a third intermediate encoded bit sequence and the CRC bit sequence, wherein the third intermediate encoded bit sequence is determined based on the information bit sequence and the first polarization transformation submatrix, and wherein the CRC bit sequence is determined based on the third intermediate encoded bit sequence. (Claim 6, wherein the first intermediate encoded bit sequence comprises a fifth intermediate encoded bit sequence and the CRC bit, the fifth intermediate encoded bit sequence is determined based on the information bit sequence and the first polarization transformation submatrix, and the CRC bit is determined based on the fifth intermediate encoded bit sequence. )
This is a provisional nonstatutory double patenting rejection because the patentably indistinct claims have not in fact been patented.
Claim Rejections - 35 USC § 112
The following is a quotation of 35 U.S.C. 112(b):
(b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention.
The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph:
The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention.
Claim 3, 4 and 11-15, 20 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention.
Claim 3 recites “…wherein S2 is equal to the larger of K-E and o…”. It is vague and unclear what “o” is, as “o” is never defined.
Claim 4 is rejected for having the same limitations as indicated in Claim 3 above.
Claim 11 recites “…S2 being equal to the larger of K-E and o…” It is vague and unclear what “o” is, as “o” is never defined.
Claims 12-15 are rejected for having the same limitations as indicated in Claim 3 above.
Claim 20 recites “…S2 being equal to the larger of K-E and o…”. It is vague and unclear what “o” is, as “o” is never defined.
Allowable Subject Matter
Claims 9, 17 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims.
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
Huawei (R1-164375) teaches receiving an information block with CRC of length K=k+m at a polar encoder, performing polar encoding to determine an encoded block, and performing rate matching to result in an encoded block with length N.
Saber (EP 3628111), teaches the use of a polar coding generator matrix for producing codewords, where an input vector of length N including K information bits and N-K frozen bits are combined with the generator matrix to form a codeword product. Saber further discloses coded bit processing such as puncturing, shortening, interleaving, zero padding, and/or repetition for rate matching.
Hong (US 2020/0092048), teaches systematic polar encoding using systematic polar codes having code rate R. A systematic polar encoder, which may be implemented by cascading two encoders, receives input information including frozen and unfrozen bits at a first non-systematic polar encoder, where frozen bits are set to zero, and then input into a second non-systematic polar encoder to output parity bits and unfrozen bits.
Bioglio (EP 3375098), teaches systematic encoding K information bits into a code word of length N' on the basis of a polar code of length N. The encoder comprises a memory storing a plurality of bit indices including a set of N frozen bit indices associated with the polar code, a set of N/2 puncturing bit indices, and a set of N/2 shortening indices. The encoder comprises a processor to retrieve a subset of the plurality of bit indices from memory to encode the K information bits using the polar code of length N for obtaining encoded data of length N and to reduce the number of bits of the encoded data to length N' using a combination of puncturing and shortening according to the plurality of bit indices.
Mediatek (R1-165165), teaches different size configurations of polar codes, and completing an encoding process based on an output bit length and a target information bit length, and rate matching based on a targeted code rate.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to JENKEY VAN whose telephone number is (571)270-7160. The examiner can normally be reached Monday - Friday 9am - 5pm.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Chirag Shah can be reached at (571)272-3144. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/JENKEY VAN/Primary Examiner, Art Unit 2477
Prosecution Insights