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
This Office Action is in response to Preliminary amendment submitted on 12/30/2024. By this amendment, original claims are amended and therefore, amended claims are pending in this action.
Information Disclosure Statement
The information disclosure statement (IDS) submitted on 12/30/2024 was filed. The submission is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
Claim Rejections - 35 USC § 101
35 U.S.C. 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claims 1-15 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more.
In analyzing under step 1, is the claim to a process, machine manufacture or composition of matter? Yes.
In analyzing under step 2A Prong One, Does the claim recite an abstract idea law of nature or natural phenomenon? Yes.
The claim(s) 1, and 14 recite(s) the abstract limitations such as “…to store one or more pre-calculated reliability sequence for decoding received encoded data bits” is a process that, under its broadest reasonable interpretation, covers performance of the limitation in the mind but for the recitation of generic computer processor such as “a polar decoder (110), comprising: a core block (204) comprising a successive cancellation (SC) decoder and a list decoder; and a cyclic redundancy check (CRC) module (206), wherein the core block (204) is configured to” (see claim 1) and “a receiver (108) in a base station (BS), comprising: a polar decoder, comprising: a core block (204) comprising a successive cancellation (SCL) decoder and a list decoder; and a cyclic redundancy check (CRC) module (206), wherein the core block (204) is configured to” (see claim 14)
The claim(s) 8 and 15 recite(s) the abstract limitations such as “…to store one or more pre-calculated reliability sequence for decoding received encoded data bits…performing a CRC on the one or more code words” is a process that, under its broadest reasonable interpretation, covers performance of the limitation in the mind but for the recitation of generic computer processor such as “a non-transitory computer readable medium that comprises one or more instructions stored thereupon that when executed by a processor causes the processor to perform operations comprising: …”(see claim 15)
If a claim limitation, under its broadest reasonable interpretation, covers performance of the limitation in the mind but for the recitation of generic computer components and software module, then it falls within the “Mental Processes” grouping of abstract ideas.
The mental process can store one or more pre-calculated reliability sequence for decoding received encoded data bits…performing a CRC on the one or more code words”
Accordingly, the claim recites an abstract limitation.
In analyzing under step 2A Prong Two, Does the claim recite additional elements that integrate the judicial exception into a practical application? NO.
This judicial exception is not integrated into a practical application because the claims recite a generic processor such as “a polar decoder (110), comprising: a core block (204) comprising a successive cancellation (SC) decoder and a list decoder; and a cyclic redundancy check (CRC) module (206), wherein the core block (204) is configured to” (see claim 1) and “a receiver (108) in a base station (BS), comprising: a polar decoder, comprising: a core block (204) comprising a successive cancellation (SCL) decoder and a list decoder; and a cyclic redundancy check (CRC) module (206), wherein the core block (204) is configured to” (see claim 14), “a non-transitory computer readable medium that comprises one or more instructions stored thereupon that when executed by a processor causes the processor to perform operations comprising: …”(see claim 15) for storing data, decoding received data and perform CRC.
The claim(s) does/do not include additional elements that are sufficient to amount to significantly more than the judicial exception because a generic processor and software module which are high level of generality for storing data, decoding received data and perform CRC.
Accordingly, this additional element does not integrate the abstract idea into a practical application because it does not impose any meaningful limits on practicing the abstract idea.
In analyzing under step 2B, does the claim recite additional elements that amount to significantly more than the judicial exception? NO
Claims 1-15 do not recite any additional elements except a generic processor for storing data, decoding received data and perform CRC.
Accordingly, the additional generic elements do not amount to significantly more than the judicial exception because a generic processor and software module which are high level of generality for storing data, decoding received data and perform CRC.
The claim is directed to an abstract idea.
Claim Rejections - 35 USC § 102
In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention.
Claim(s) 1-2, 4-9, 14-15 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Rajaei et al. (US 2021/0,351,860)
As per claim 1:
Rajaei discloses:
A polar decoder (110), comprising:
(Rajaei, [0079] As shown in FIG. 7, process 700 may include receiving, from a base station, a polar encoded PDCCH payload (block 710).)
a core block (204) comprising a successive cancellation (SC) decoder and a list decoder; and
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
a cyclic redundancy check (CRC) module (206),
(Rajaei, [0081] As further shown in FIG. 7, process 700 may include performing a cyclic redundancy check on each of the candidate PDCCH payloads to determine, from the PMs, a passing PM (block 730))
wherein the core block (204) is configured to store one or more pre-calculated reliability sequence
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
for decoding received encoded data bits.
(Rajaei, [0079] As shown in FIG. 7, process 700 may include receiving, from a base station, a polar encoded PDCCH payload (block 710).)
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
As per claim 2:
Rajaei further discloses:
wherein the core block (204) is configured to select the one or more pre-calculated reliability sequence based on an input combination of encoded bits ‘E’ and actual payload bits ‘K’ for the decoding.
(Rajaei, [0079] As shown in FIG. 7, process 700 may include receiving, from a base station, a polar encoded PDCCH payload (block 710).)
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
As per claim 4:
Rajaei further discloses:
wherein the core block (204) is configured to provide an output of one or more code words to the CRC module (206) based on the decoding.
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
(Rajaei, [0081] As further shown in FIG. 7, process 700 may include performing a cyclic redundancy check on each of the candidate PDCCH payloads to determine, from the PMs, a passing PM (block 730))
(Rajaei, [0027] As shown by reference number 171, the network testing device may perform a CRC on the plurality of candidate PDCCH payloads to identify a passing PM (e.g., as described herein in relation to FIG. 1A and reference number 130). When a PM is not a passing PM, the network testing device may discard the output associated with the PM (e.g., discard the candidate PDCCH payload associated with the PM). As shown by reference number 172, when the PM is a passing PM, the network testing device may normalize the PM values of the plurality of PMs and determine a confidence value associated with the passing PM …)
As per claim 5:
Rajaei further discloses:
wherein the CRC module (206) is configured to determine whether the one or more code words pass or fail a CRC test based on a bit position.
(Rajaei, [0027] As shown by reference number 171, the network testing device may perform a CRC on the plurality of candidate PDCCH payloads to identify a passing PM (e.g., as described herein in relation to FIG. 1A and reference number 130). When a PM is not a passing PM, the network testing device may discard the output associated with the PM (e.g., discard the candidate PDCCH payload associated with the PM). As shown by reference number 172, when the PM is a passing PM, the network testing device may normalize the PM values of the plurality of PMs and determine a confidence value associated with the passing PM …)
As per claim 6:
Rajaei further discloses:
wherein the CRC module (206) is configured to generate an output of the one or more code words based on a CRC pass and a lowest path metric.
(Rajaei, [0027] As shown by reference number 171, the network testing device may perform a CRC on the plurality of candidate PDCCH payloads to identify a passing PM (e.g., as described herein in relation to FIG. 1A and reference number 130). When a PM is not a passing PM, the network testing device may discard the output associated with the PM (e.g., discard the candidate PDCCH payload associated with the PM). As shown by reference number 172, when the PM is a passing PM, the network testing device may normalize the PM values of the plurality of PMs and determine a confidence value associated with the passing PM …… When the confidence value satisfies the threshold, the network testing device may output the candidate PDCCH payload corresponding to the passing PM)
As per claim 7:
Rajaei further discloses:
wherein the CRC module (206) is configured to output a first code word of the one or more code words based on a CRC fail obtained for all of the one or more code words.
(Rajaei, [0027] As shown by reference number 171, the network testing device may perform a CRC on the plurality of candidate PDCCH payloads to identify a passing PM (e.g., as described herein in relation to FIG. 1A and reference number 130). When a PM is not a passing PM, the network testing device may discard the output associated with the PM (e.g., discard the candidate PDCCH payload associated with the PM). As shown by reference number 172, when the PM is a passing PM, the network testing device may normalize the PM values of the plurality of PMs and determine a confidence value associated with the passing PM h….may discard the output … and may start the process over again by receiving and decoding a new polar encoded PDCCH payload (e.g., as described herein in relation to reference number 170).
As per claim 8:
A method for decoding in a polar decoder (110), said method comprising:
(Rajaei, [0079] As shown in FIG. 7, process 700 may include receiving, from a base station, a polar encoded PDCCH payload (block 710).)
storing, by a core block (204), one or more pre-calculated reliability sequences;
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
decoding, by the core block (204), received encoded data bits based on the one or more pre-calculated reliability sequences to output one or more code words
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
to a cyclic redundancy check (CRC) module (206); and performing, by a cyclic redundancy check (CRC) module (206), a CRC on the one or more code words.
(Rajaei, [0081] As further shown in FIG. 7, process 700 may include performing a cyclic redundancy check on each of the candidate PDCCH payloads to determine, from the PMs, a passing PM (block 730))
As per claim 9:
Rajaei further discloses:
selecting, by the core block (204), at least one pre-calculated reliability sequence from the one or more pre-calculated reliability sequences based on an input combination of encoded bits ‘E’ and actual payload bits ‘K’ for the decoding.
(Rajaei, [0079] As shown in FIG. 7, process 700 may include receiving, from a base station, a polar encoded PDCCH payload (block 710).)
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
As per claim 14:
Rajaei discloses:
A receiver (108) in a base station (BS), comprising:
(Rajaei, [0079] As shown in FIG. 7, process 700 may include receiving, from a base station, a polar encoded PDCCH payload (block 710).)
a polar decoder, comprising: a core block (204) comprising a successive cancellation (SCL) decoder and a list decoder; and
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
a cyclic redundancy check (CRC) module (206),
(Rajaei, [0081] As further shown in FIG. 7, process 700 may include performing a cyclic redundancy check on each of the candidate PDCCH payloads to determine, from the PMs, a passing PM (block 730))
wherein the core block (204) is configured to store one or more pre-calculated reliability sequence
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
for decoding received encoded data bits.
(Rajaei, [0079] As shown in FIG. 7, process 700 may include receiving, from a base station, a polar encoded PDCCH payload (block 710).)
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
As per claim 15:
Rajaei discloses:
A non-transitory computer readable medium that comprises one or more instructions stored thereupon that when executed by a processor causes the processor to perform operations comprising:
storing one or more pre-calculated reliability sequences;
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
decoding received encoded data bits based on the one or more pre-calculated reliability sequences to output one or more code words to a cyclic redundancy check (CRC) module (206); and
(Rajaei, [0080] As further shown in FIG. 7, process 700 may include decoding, using a successive cancellation list decoding algorithm, the polar encoded PDCCH payload to obtain candidate PDCCH payloads and to generate PMs, wherein each PM of the PMs corresponds to one candidate PDCCH payload of the candidate PDCCH payloads (block 720).
to a cyclic redundancy check (CRC) module (206); and performing a CRC on the one or more code words.
(Rajaei, [0081] As further shown in FIG. 7, process 700 may include performing a cyclic redundancy check on each of the candidate PDCCH payloads to determine, from the PMs, a passing PM (block 730))
Claim Rejections - 35 USC § 103
In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claim(s) 3, 10-13 is/are rejected under 35 U.S.C. 103 as being unpatentable over Rajaei et al. (US 2021/0,351,860), in view of Luo et al. (US 2020/0,067,536)
As per claim 3:
As per claim 10:
Rajaei does not disclose:
sorting on the received encoded bits to decode one or more code words, wherein the number of steps for sorting to obtain the one or more code words is based on a list size associated with the polar decoder (110).
Luo discloses:
sorting on the received encoded bits to decode one or more code words, wherein the number of steps for sorting to obtain the one or more code words is based on a list size associated with the polar decoder (110).
(Luo, [0081] in an optional implementation, a conventional successive cancellation list (SCL)-x polar decoding manner is used as a polar decoding manner, to obtain x decoded vectors, and the x decoded vectors may be sorted in ascending order of PM absolute values to obtain û.sub.1, û.sub.2, . . . , û.sub.x)
It would have been obvious before the effective filing date of the claimed to a person having ordinary skill in the art to incorporate Luo’s optional method of sorting in the SCL of Harrington as an option for performing decoding.
(Luo, [0081] in an optional implementation, a conventional successive cancellation list (SCL)-x polar decoding manner is used as a polar decoding manner, to obtain x decoded vectors, and the x decoded vectors may be sorted in ascending order of PM absolute values to obtain û.sub.1, û.sub.2, . . . , û.sub.x)
As per claim 11:
Rajaei further discloses:
comprising determining, by the CRC module (206), whether the one or more code words pass or fail a CRC test based on a bit position.
(Rajaei, [0027] As shown by reference number 171, the network testing device may perform a CRC on the plurality of candidate PDCCH payloads to identify a passing PM (e.g., as described herein in relation to FIG. 1A and reference number 130). When a PM is not a passing PM, the network testing device may discard the output associated with the PM (e.g., discard the candidate PDCCH payload associated with the PM). As shown by reference number 172, when the PM is a passing PM, the network testing device may normalize the PM values of the plurality of PMs and determine a confidence value associated with the passing PM …)
As per claim 12:
Rajaei further discloses:
generating, by the CRC module (206), an output of the one or more code words based on a CRC pass and a lowest path metric.
(Rajaei, [0027] As shown by reference number 171, the network testing device may perform a CRC on the plurality of candidate PDCCH payloads to identify a passing PM (e.g., as described herein in relation to FIG. 1A and reference number 130). When a PM is not a passing PM, the network testing device may discard the output associated with the PM (e.g., discard the candidate PDCCH payload associated with the PM). As shown by reference number 172, when the PM is a passing PM, the network testing device may normalize the PM values of the plurality of PMs and determine a confidence value associated with the passing PM …… When the confidence value satisfies the threshold, the network testing device may output the candidate PDCCH payload corresponding to the passing PM)
As per claim 13:
Rajaei further discloses:
by the CRC module (206), an output of a first code word of the one or more code words based on a CRC fail for all the one or more code words.
(Rajaei, [0027] As shown by reference number 171, the network testing device may perform a CRC on the plurality of candidate PDCCH payloads to identify a passing PM (e.g., as described herein in relation to FIG. 1A and reference number 130). When a PM is not a passing PM, the network testing device may discard the output associated with the PM (e.g., discard the candidate PDCCH payload associated with the PM). As shown by reference number 172, when the PM is a passing PM, the network testing device may normalize the PM values of the plurality of PMs and determine a confidence value associated with the passing PM …)
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to THIEN DANG NGUYEN whose telephone number is (571)272-9189. The examiner can normally be reached Monday-Friday 7 AM - 3:30 PM.
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, Mark Featherstone can be reached at 571-270-3750. 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.
/Thien Nguyen/ Primary Examiner, Art Unit 2111
Prosecution Insights