DETAILED ACTION
The office action is in response to the amendment filed on June 17, 2026, after RCE non-final office action.
The RCE application was received on Jan. 5, 2026.
Claims 1-5, 7-14, and 16-22 are pending in this application.
Information Disclosure Statement
The Information Disclosure Statements (IDSs) filed on Aug. 7,2026, Feb. 13, 2025, Dec. 5, 2024, Oct. 3, 2024, and July 18, 2024 and references listed have been considered by the examiner.
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 .
Response to Arguments
Applicant’s Amendments and Arguments filed 06/17/2026 have been considered for examination. Claims 1-5, 7-14, and 16-22are pending in the instant application.
With regard to the 103 rejections, Applicant’s arguments filed 06/17/2026 (see pages 7-9 of Remarks) in view of the amendments have been fully considered and not persuasive. Further, Examiner notes that Applicant’s amendments necessitated the new ground(s) of rejection presented in the instant Office Action.
Regarding claims 1 and 10, Applicant argued:
Regarding the part of the amended claim 1, recited as “wherein a maximum mother code length corresponding to the first service is 128,” combination of Noh, Bioglio, and Li fails to disclose.
Bioglio, in the previous office action, teaches that the general polar-code range of Nmin =31 and Nmax =512/1024. However, amended claim 1 does not merely recite that the mother codelength may be 128. Instead, claim 1 requires that 128 is the maximum mother code length corresponding to the first service, where the first service comprises a first-type data service or an active noise reduction service. Bioglio s general NR polar-code range does not teach or suggest using 128 as a service-specific maximum mother code length for the claimed first service.
For at least these reasons, the Applicant submits that the combination of Noh, Bioglio, and Li fails to disclose all of the limitations set forth in claims 1, 10, and 19, and consequently does not render obvious claims 1-5, 7-14, and 16-22.
In response to Applicant’s argument, Examiner respectfully disagrees.
Regarding the part of the amended claim 1, recited as " wherein a maximum mother code length corresponding to the first service is 128,” in the argument, Applicant said Bioglio fails to disclose this part. However, Examiner respectfully disagrees.
Regarding the amended claim 1, Li, in Fig. 3-4 and 9 and in Paragraphs [0037] [0049]-[0056], teaches that in Paragraph [0037], for the channel coding (including code block segmentation, codec, rate matching, etc.), the data sent from the medium access control (MAC) layer to the physical layer is organized in the form of a transport block (TB), and one TB corresponds to data bits of one MAC PDU (Protocol Data Unit). Usually, the length of the transport block is long, generally larger than the maximum length supported by the encoder, so the transport block has to be segmented into several code blocks, and a segmented code block has to be added with a fixed length of cyclic redundancy check (CRC) and then bit-filled for channel coding. For this, as shown in Fig. 3-4 and 9 and in Paragraphs [0092], [0093] and [0098], the transport block is generated based on the first type data that is the channel state information, the interference situation, and the service characteristics and is segmented to the code blocks, where the first type data is the data of the first service (is considered as eMBB). Further, as described in Paragraphs [0104], the code block size is determined based on the channel state information, the interference situation, and/or the service characteristics such as the first-type service (eMBB) and the second -type service (URLLC).
To clearly disclose the amended part, in the new art, Saijin Xie (USPub. No.: US 20200099399 A1, hereinafter “Xie”), Xie, in Fig. 1 and in Paragraphs [0002] and [0033] to [0037], teaches for channel coding using polar codes, the transmitter node determines the maximum mother code length (maximum of the mother code block) based on the data characteristics (service characteristics) or device type for the data service, performs polar encoding for the channel coding, and sending the encoded code block to the receiving node. For example, the length is determined based on the first type data or device (the first service in the claim), where the first type data or device is eMBB service or device, as described in Paragraphs [0047] and [0060]-[0061]. Under various situations, as described through the implementation examples in Page 7 to 11, the mother code length can be determined or derived. Thus, the mother code length or the size of the mother code block is determined based on the data characteristics and preset parameters. Therefore, the mother code length with the first type service (eMBB) can be chosen as 128
Regarding the polar coding of the first service (eMBB) with the mother code length 128, Bioglio teaches. As mentioned in the introduction and the conclusion section, the art describes the encoding method of polar codes for channel coding applied for eMBB service (the first service). Further, in Page 33, Col 2, Lines 28-38, Bioglio teaches that in 5G application such as eMBB service, the number of information bits, A, is fixed and a codework of length E is created to achieve the desired rate R = A/E required by upper communication. To accommodate polar codes to this requirement, a mother polar code of length, N = 2n, is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bounded by Nmin= 32, while the value of the upper bound, Nmax, depends on the channel used, being Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Therefore, it is clear that the channel coding mentioned in the above can be a polar code and since the range of the maximum mother polar code length is Nmin 32 and Nmax = 512 for downlink and Nmax = 1024 for uplink, respectively, the maximum mother code length can be 128 when n= 7. Thus, the polar coding of the first service (eMBB service) with the mother code length 128 is clearly described by Bioglio.
Thus, combination of Li, Xie, and Bioglio clearly disclose the amended claim 1.
By the same reasoning, the amended independent claims 10 and 19 also disclosed by combination of Li, Xie, and Bioglio.
In the below, further detail rejection is provided for the amended claims.
Continued Examination Under 37 CFR 1.114
A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on 01/05/2026 has been entered.
Claim Rejections - 35 USC § 103
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.
Claims 1, 5, 7-8, 10, 14, 16-17, and 19-22 are rejected under U.S.C. 103 as being unpatentable over Jian Li et. al. (USPub. No.: US 20210288748 A1, hereinafter “Li”) in a view of Saijin Xie (USPub. No.: US 20200099399 A1, hereinafter “Xie”) and further in a view of Valerio Bioglio et. al. (IEEE Communications Surveys & Tutorials, Vol. 23, Issue 1, Pages 29 – 40, First quarter 2021, hereinafter “Bioglio”)
Regarding claim 1, Li teaches that a communication method implemented by a first node, (Xie, in Fig. 9 and in Paragraphs [0037] and [0090]-[0099], teaches that in Fig. 9, the communication procedure between transmitting node (the first node) and the receiving node for exchanging code blocks with channel coding (as described in Paragraph [0037]) is described.) wherein the communication method comprises: obtaining at least one code block using at least one transport block of a first service based on at least one of a size of the code block or a quantity of code blocks corresponding to the first service, wherein the first service comprises a first-type data service or an active noise reduction service; (Li, in Fig. 3-4 and 9 and in Paragraphs [0037] [0049]-[0056], teaches that in Paragraph [0037], in digital communication systems, channel coding (including code block segmentation, codec, rate matching, etc.) are key technologies in the entire digital communication physical layer, which ensures the effectiveness and reliability of the underlying transmission. The data sent from the medium access control (MAC) layer to the physical layer is organized in the form of a transport block (TB), and one TB corresponds to data bits of one MAC PDU (Protocol Data Unit). Usually, the length of the transport block is long, generally larger than the maximum length supported by the encoder, so the transport block has to be segmented into several code blocks, and a segmented code block has to be added with a fixed length of cyclic redundancy check (CRC) and then bit-filled for channel coding. For this, as shown in Fig. 9 and in Paragraphs [0092], in S901, the receiving node UE suggests a manner that the transmitting node segments the first-type data based on the channel state information, the interference situation, and the service characteristics. Further, in Fig. 3 and in Paragraphs [0093], when the interference condition on an overlapping resource is different from that on non-overlapping resource, based on the suggestion of receiving node, the transmitting node segments the transport block to two code block subsets and further segments the code block subset into code blocks. Rather, in Fig. 4 and in Paragraphs [0098], based on the service characteristics, when there are two types of service (such as eMBB (the first type data in the first service) and URLLC (the second type data in the second service)) in the network, the interference condition on the overlapping resource is different from that on the non-overlapping resource. Based on this configuration, the receiving node suggests the method of the segmentation and the transmitting node, according to the method, segments the transport block into two code block subsets and further segments the code block subset into code blocks. Further, as described in Paragraphs [0104], the code block size is determined based on the channel state information, the interference situation, and/or the service characteristics such as the first-type service (eMBB) and the second -type service (URLLC).)
However, Li does not explicitly teach about the mother code length of the code block on channel coding.
Xie teaches that performing, based on a mother code length of the at least one code block, channel coding on the at least one code block of the first service to obtain at least one channel-coded code block and sending, to a second node, the at least one channel-coded code block (Xie, in Fig. 1 and in Paragraphs [0002] and [0033] to [0037], teaches that in Fig. 1, in step 110, a transmitting node determines a code block length N0 for encoding an information bit sequence, according to a data characteristic for representing the information bit sequence and a preset parameter corresponding to the data characteristic. Here, N0 is the maximum value of a mother code block (maximum mother code length) for polar encoding (channel coding). In step 120, the transmitting node performs the polar encoding on the information bit sequence, according to the code block length N0. In step 130, the transmitting node transmits a code block obtained through the polar encoding to a receiving node. Further, in Paragraphs [0046]-[0047] and [0060]-[0061], the data characteristic is the device type
and the preset parameter includes the first type and the second type, where the first type is an eMBB (Enhanced Mobile Broadband) device or data and the second type is URLLC (Ultra Reliable Low Latency Communication) device/data or mMTC (massive Machine Type of Communication) device/data. Thus, the channel coding on the code block of the first service is the polar coding on the code block of the size No determined based on the first type device or data (eMBB). Further, as shown in the implementation example 1-6 described in Page 7 to 11, the mother code length No is derived based on the device type or data characteristics.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li and Xie to include the technique of performing, based on a mother code length of the at least one code block, channel coding on the at least one code block of the first service to obtain at least one channel-coded code block and sending, to a second node, the at least one channel-coded code block of Xie in the system of Li to provide a methods to determine the code block length (mother code length) for polar channel coding, according to the data characteristics, to prevent a code block from being frequently and dynamically changed and facilitate hardware implementation. (Xie, see Paragraphs [0008]-[0009] and [0018]).).
However, combination of Li and Xie does not explicitly teach about the polar coding for the first service with the mother code length 128.
Bioglio teaches that wherein a maximum mother code length corresponding to the first service is 128 (Bioglio, in the introduction and the conclusion section, teaches the art described the encoding method of polar codes for channel coding applied for eMBB service (the first service). Further, as described in Page 33, Col 2, Lines 28-38, Bioglio teaches that in 5G application such as eMBB service, the number of information bits, A, is fixed and a codework of length E is created to achieve the desired rate R = A/E required by upper communication. To accommodate polar codes to this requirement, a mother polar code of length, N = 2n, is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bounded by Nmin= 32, while the value of the upper bound, Nmax, depends on the channel used, being Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Therefore, it is clear that the channel coding mentioned in the above can be a polar code and since the range of the maximum mother polar code length is Nmin 32 and Nmax = 512 for downlink and Nmax = 1024 for uplink, respectively, the maximum mother code length can be 128 when n= 7. Thus, a maximum mother code length corresponding to the first service (eMBB) can be 128, as shown here.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, and Bioglio to include the technique of wherein a maximum mother code length corresponding to the first service is 128 of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 5, combination of Li, Xie and Bioglio teaches the features defined in the claims 1, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the mother code length is based on at least one of a maximum mother code length, a minimum mother code length, or a minimum mother code rate (Bioglio, in Page 35, Col. 1, Lines 25-47, teaches that the mother polar code length N = 2n is a crucial parameter in the encoding process. Its logarithm n is selected as n = Max (Min (n1, n2, nmax), nmin), where nmin and nmax give a lower and an upper bound on the mother code length, respectively. In particular, nmin = 5, while nmax = 9 for the downlink control channel, and nmax = 10 for the uplink. Parameter n2 gives an upper bound on the code based on the minimum code rate admitted by the encoder, i.e. 1/8; as a consequence, n2 =
⎾
l
o
g
2
(
8
K
)
⏋
. Finally, the value of n1 is bound to the selection of the rate-matching scheme. It is in fact usually calculated as n1 =
⎾
l
o
g
2
(
E
)
⏋
, so that 2n1 is the smallest power of two larger than E. However, a correction factor is introduced to avoid a too severe rate matching: if {log2(E)} < 0.17, i.e. if the smallest power of two larger than E is too far from E, the parameter is set to n1 =
⌊
l
o
g
2
E
⌋
, and an additional constraint on the code dimension is added, namely K < 16/9 E, to assure that K < N. Based on this observation, it is clear that the mother code length may be based on a maximum mother code length, a minimum mother code length, or a minimum mother code rate.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie and Bioglio to include the technique of wherein the mother code length is based on at least one of a maximum mother code length, a minimum mother code length, or a minimum mother code rate of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 7, combination of Li, Xie and Bioglio teaches the features defined in the claims 5, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the minimum mother code length is 32 (Bioglio, in Page 33, Col. 2, Lines 28-38, teaches that in 5G applications, the number of information bits, A, is fixed and a codeword of length E is created to achieve the desired rate R = A/E required by upper communication layers. To accommodate polar codes to this requirement, a mother polar code of length N = 2n is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bound by Nmin = 32 while the value of the upper bound Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Based on this observation, it is clear that the minimum mother code length can be 32.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie and Bioglio to include the technique of wherein the minimum mother code length is 32 of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 8, combination of Li, Xie and Bioglio teaches the features defined in the claims 5, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the minimum mother code rate is 1/8 (Bioglio, in Page 33, Col. 2, Lines 28-38, teaches that in 5G applications, the number of information bits, A, is fixed and a codeword of length E is created to achieve the desired rate R = A/E required by upper communication layers. To accommodate polar codes to this requirement, a mother polar code of length N = 2n is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bound by Nmin = 32 while the value of the upper bound Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Based on this observation, it is clear that wherein the minimum mother code rate is 1/8.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, and Bioglio to include the technique of wherein the minimum mother code rate is 1/8 of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 10, Li teaches that a the communication method comprises: obtaining at least one code block using at least one transport block of a first service based on at least one of a size of the code block or a quantity of code blocks corresponding to the first service, wherein the first service comprises a first-type data service or an active noise reduction service; (Li, in Fig. 3-4 and 9 and in Paragraphs [0037] [0049]-[0056], teaches that in Paragraph [0037], in digital communication systems, channel coding (including code block segmentation, codec, rate matching, etc.) are key technologies in the entire digital communication physical layer, which ensures the effectiveness and reliability of the underlying transmission. The data sent from the medium access control (MAC) layer to the physical layer is organized in the form of a transport block (TB), and one TB corresponds to data bits of one MAC PDU (Protocol Data Unit). Usually, the length of the transport block is long, generally larger than the maximum length supported by the encoder, so the transport block has to be segmented into several code blocks, and a segmented code block has to be added with a fixed length of cyclic redundancy check (CRC) and then bit-filled for channel coding. For this, as shown in Fig. 9 and in Paragraphs [0092], in S901, the receiving node UE suggests a manner that the transmitting node segments the first-type data based on the channel state information, the interference situation, and the service characteristics. Further, in Fig. 3 and in Paragraphs [0093], when the interference condition on an overlapping resource is different from that on non-overlapping resource, based on the suggestion of receiving node, the transmitting node segments the transport block to two code block subsets and further segments the code block subset into code blocks. Rather, in Fig. 4 and in Paragraphs [0098], based on the service characteristics, when there are two types of service (such as eMBB (the first type data in the first service) and URLLC (the second type data in the second service)) in the network, the interference condition on the overlapping resource is different from that on the non-overlapping resource. Based on this configuration, the receiving node suggests the method of the segmentation and the transmitting node, according to the method, segments the transport block into two code block subsets and further segments the code block subset into code blocks. Further, as described in Paragraphs [0104], the code block size is determined based on the channel state information, the interference situation, and/or the service characteristics such as the first-type service (eMBB) and the second -type service (URLLC).)
However, Li does not explicitly teach about the mother code length of the code block on channel coding.
Xie teaches that performing, based on a mother code length of the at least one code block, channel coding on the at least one code block of the first service to obtain at least one channel-coded code block (Xie, in Fig. 1 and in Paragraphs [0002] and [0033] to [0037], teaches that in Fig. 1, in step 110, a transmitting node determines a code block length N0 for encoding an information bit sequence, according to a data characteristic for representing the information bit sequence and a preset parameter corresponding to the data characteristic. Here, N0 is the maximum value of a mother code block (maximum mother code length) for polar encoding (channel coding). In step 120, the transmitting node performs the polar encoding on the information bit sequence, according to the code block length N0. In step 130, the transmitting node transmits a code block obtained through the polar encoding to a receiving node. Further, in Paragraphs [0046]-[0047] and [0060]-[0061], the data characteristic is the device type
and the preset parameter includes the first type and the second type, where the first type is an eMBB (Enhanced Mobile Broadband) device or data and the second type is URLLC (Ultra Reliable Low Latency Communication) device/data or mMTC (massive Machine Type of Communication) device/data. Thus, the channel coding on the code block of the first service is the polar coding on the code block of the size No determined based on the first type device or data (eMBB). Further, as shown in the implementation example 1-6 described in Page 7 to 11, the mother code length No is derived based on the device type or data characteristics.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li and Xie to include the technique of performing, based on a mother code length of the at least one code block, channel coding on the at least one code block of the first service to obtain at least one channel-coded code block of Xie in the system of Li to provide a methods to determine the code block length (mother code length) for polar channel coding, according to the data characteristics, to prevent a code block from being frequently and dynamically changed and facilitate hardware implementation. (Xie, see Paragraphs [0008]-[0009] and [0018]).).
However, combination of Li and Xie does not explicitly teach about the polar coding with the mother code length 128.
Bioglio teaches that wherein a maximum mother code length corresponding to the first service is 128 (Bioglio, in the introduction and the conclusion section, teaches the art described the encoding method of polar codes for channel coding applied for eMBB service (the first service). Further, as described in Page 33, Col 2, Lines 28-38, Bioglio teaches that in 5G application such as eMBB service, the number of information bits, A, is fixed and a codework of length E is created to achieve the desired rate R = A/E required by upper communication. To accommodate polar codes to this requirement, a mother polar code of length, N = 2n, is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bounded by Nmin= 32, while the value of the upper bound, Nmax, depends on the channel used, being Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Therefore, it is clear that the channel coding mentioned in the above can be a polar code and since the range of the maximum mother polar code length is Nmin 32 and Nmax = 512 for downlink and Nmax = 1024 for uplink, respectively, the maximum mother code length can be 128 when n= 7. Thus, a maximum mother code length corresponding to the first service (eMBB) can be 128, as shown here.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, and Bioglio to include the technique of wherein a maximum mother code length corresponding to the first service is 128 of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 14, combination of Li, Xie and Bioglio teaches the features defined in the claims 10, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the mother code length is based on at least one of a maximum mother code length, a minimum mother code length, or a minimum mother code rate (Bioglio, in Page 35, Col. 1, Lines 25-47, teaches that the mother polar code length N = 2n is a crucial parameter in the encoding process. Its logarithm n is selected as n = Max (Min (n1, n2, nmax), nmin), where nmin and nmax give a lower and an upper bound on the mother code length, respectively. In particular, nmin = 5, while nmax = 9 for the downlink control channel, and nmax = 10 for the uplink. Parameter n2 gives an upper bound on the code based on the minimum code rate admitted by the encoder, i.e. 1/8; as a consequence, n2 =
⎾
l
o
g
2
(
8
K
)
⏋
. Finally, the value of n1 is bound to the selection of the rate-matching scheme. It is in fact usually calculated as n1 =
⎾
l
o
g
2
(
E
)
⏋
, so that 2n1 is the smallest power of two larger than E. However, a correction factor is introduced to avoid a too severe rate matching: if {log2(E)} < 0.17, i.e. if the smallest power of two larger than E is too far from E, the parameter is set to n1 =
⌊
l
o
g
2
E
⌋
, and an additional constraint on the code dimension is added, namely K < 16/9 E, to assure that K < N. Based on this observation, it is clear that the mother code length may be based on a maximum mother code length, a minimum mother code length, or a minimum mother code rate.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie and Bioglio to include the technique of wherein the mother code length is based on at least one of a maximum mother code length, a minimum mother code length, or a minimum mother code rate of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 16, combination of Noh, Bioglio and Li teaches the features defined in the claims 14, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the minimum mother code length is 32 (Bioglio, in Page 33, Col. 2, Lines 28-38, teaches that in 5G applications, the number of information bits, A, is fixed and a codeword of length E is created to achieve the desired rate R = A/E required by upper communication layers. To accommodate polar codes to this requirement, a mother polar code of length N = 2n is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bound by Nmin = 32 while the value of the upper bound Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Based on this observation, it is clear that the minimum mother code length can be 32.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie and Bioglio to include the technique of wherein the minimum mother code length is 32 of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 17, combination of Li, Xie and Bioglio teaches the features defined in the claims 14, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the minimum mother code rate is 1/8 (Bioglio, in Page 33, Col. 2, Lines 28-38, teaches that in 5G applications, the number of information bits, A, is fixed and a codeword of length E is created to achieve the desired rate R = A/E required by upper communication layers. To accommodate polar codes to this requirement, a mother polar code of length N = 2n is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bound by Nmin = 32 while the value of the upper bound Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Based on this observation, it is clear that wherein the minimum mother code rate is 1/8.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie and Bioglio to include the technique of wherein the minimum mother code rate is 1/8 of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 19, Li teaches that a communication apparatus, comprising: a transmitter; at least one processor coupled to the transmitter and configured to cause the communication; apparatus to: (Li, in Fig 6, teaches Fig 6 shows the structure of the transmitter in the communication with a processor and a memory.) obtain at least one code block using at least one transport block of a first service based on at least one of a size of the code block or a quantity of code blocks corresponding to the first service, wherein the first service comprises a first-type data service or an active noise reduction service; (Li, in Fig. 3-4 and 9 and in Paragraphs [0037] [0049]-[0056], teaches that in Paragraph [0037], in digital communication systems, channel coding (including code block segmentation, codec, rate matching, etc.) are key technologies in the entire digital communication physical layer, which ensures the effectiveness and reliability of the underlying transmission. The data sent from the medium access control (MAC) layer to the physical layer is organized in the form of a transport block (TB), and one TB corresponds to data bits of one MAC PDU (Protocol Data Unit). Usually, the length of the transport block is long, generally larger than the maximum length supported by the encoder, so the transport block has to be segmented into several code blocks, and a segmented code block has to be added with a fixed length of cyclic redundancy check (CRC) and then bit-filled for channel coding. For this, as shown in Fig. 9 and in Paragraphs [0092], in S901, the receiving node UE suggests a manner that the transmitting node segments the first-type data based on the channel state information, the interference situation, and the service characteristics. Further, in Fig. 3 and in Paragraphs [0093], when the interference condition on an overlapping resource is different from that on non-overlapping resource, based on the suggestion of receiving node, the transmitting node segments the transport block to two code block subsets and further segments the code block subset into code blocks. Rather, in Fig. 4 and in Paragraphs [0098], based on the service characteristics, when there are two types of service (such as eMBB (the first type data in the first service) and URLLC (the second type data in the second service)) in the network, the interference condition on the overlapping resource is different from that on the non-overlapping resource. Based on this configuration, the receiving node suggests the method of the segmentation and the transmitting node, according to the method, segments the transport block into two code block subsets and further segments the code block subset into code blocks. Further, as described in Paragraphs [0104], the code block size is determined based on the channel state information, the interference situation, and/or the service characteristics such as the first-type service (eMBB) and the second -type service (URLLC).)
However, Li does not explicitly teach about the mother code length of the code block on channel coding.
Xie teaches that perform, based on a mother code length of the at least one code block, channel coding on the at least one code block of the first service to obtain at least one channel-coded code block and sending, to a second node, the at least one channel-coded code block (Xie, in Fig. 1 and in Paragraphs [0002] and [0033] to [0037], teaches that in Fig. 1, in step 110, a transmitting node determines a code block length N0 for encoding an information bit sequence, according to a data characteristic for representing the information bit sequence and a preset parameter corresponding to the data characteristic. Here, N0 is the maximum value of a mother code block (maximum mother code length) for polar encoding (channel coding). In step 120, the transmitting node performs the polar encoding on the information bit sequence, according to the code block length N0. In step 130, the transmitting node transmits a code block obtained through the polar encoding to a receiving node. Further, in Paragraphs [0046]-[0047] and [0060]-[0061], the data characteristic is the device type
and the preset parameter includes the first type and the second type, where the first type is an eMBB (Enhanced Mobile Broadband) device or data and the second type is URLLC (Ultra Reliable Low Latency Communication) device/data or mMTC (massive Machine Type of Communication) device/data. Thus, the channel coding on the code block of the first service is the polar coding on the code block of the size No determined based on the first type device or data (eMBB). Further, as shown in the implementation example 1-6 described in Page 7 to 11, the mother code length No is derived based on the device type or data characteristics.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li and Xie to include the technique of performing, based on a mother code length of the at least one code block, channel coding on the at least one code block of the first service to obtain at least one channel-coded code block and sending, to a second node, the at least one channel-coded code block of Xie in the system of Li to provide a methods to determine the code block length (mother code length) for polar channel coding, according to the data characteristics, to prevent a code block from being frequently and dynamically changed and facilitate hardware implementation. (Xie, see Paragraphs [0008]-[0009] and [0018]).).
However, combination of Li and Xie does not explicitly teach about the polar coding with the mother code length 128.
Bioglio teaches that wherein a maximum mother code length corresponding to the first service is 128 (Bioglio, in the introduction and the conclusion section, teaches the art described the encoding method of polar codes for channel coding applied for eMBB service (the first service). Further, as described in Page 33, Col 2, Lines 28-38, Bioglio teaches that in 5G application such as eMBB service, the number of information bits, A, is fixed and a codework of length E is created to achieve the desired rate R = A/E required by upper communication. To accommodate polar codes to this requirement, a mother polar code of length, N = 2n, is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bounded by Nmin= 32, while the value of the upper bound, Nmax, depends on the channel used, being Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Therefore, it is clear that the channel coding mentioned in the above can be a polar code and since the range of the maximum mother polar code length is Nmin 32 and Nmax = 512 for downlink and Nmax = 1024 for uplink, respectively, the maximum mother code length can be 128 when n= 7. Thus, a maximum mother code length corresponding to the first service (eMBB) can be 128, as shown here.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, and Bioglio to include the technique of wherein a maximum mother code length corresponding to the first service is 128 of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 20, combination of Li, Xie, and Bioglio teaches the features defined in the claim 19, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the mother code length is based on at least one of a maximum mother code length, a minimum mother code length, or a minimum mother code rate (Bioglio, in Page 35, Col. 1, Lines 25-47, teaches that the mother polar code length N = 2n is a crucial parameter in the encoding process. Its logarithm n is selected as n = Max (Min (n1, n2, nmax), nmin), where nmin and nmax give a lower and an upper bound on the mother code length, respectively. In particular, nmin = 5, while nmax = 9 for the downlink control channel, and nmax = 10 for the uplink. Parameter n2 gives an upper bound on the code based on the minimum code rate admitted by the encoder, i.e. 1/8; as a consequence, n2 =
⎾
l
o
g
2
(
8
K
)
⏋
. Finally, the value of n1 is bound to the selection of the rate-matching scheme. It is in fact usually calculated as n1 =
⎾
l
o
g
2
(
E
)
⏋
, so that 2n1 is the smallest power of two larger than E. However, a correction factor is introduced to avoid a too severe rate matching: if {log2(E)} < 0.17, i.e. if the smallest power of two larger than E is too far from E, the parameter is set to n1 =
⌊
l
o
g
2
E
⌋
, and an additional constraint on the code dimension is added, namely K < 16/9 E, to assure that K < N. Based on this observation, it is clear that the mother code length may be based on a maximum mother code length, a minimum mother code length, or a minimum mother code rate.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, and Bioglio to include the technique of wherein the mother code length is based on at least one of a maximum mother code length, a minimum mother code length, or a minimum mother code rate of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 21, combination of Li, Xie, and Bioglio teaches the features defined in the claims 20, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the minimum mother code length is 32 (Bioglio, in Page 33, Col. 2, Lines 28-38, teaches that in 5G applications, the number of information bits, A, is fixed and a codeword of length E is created to achieve the desired rate R = A/E required by upper communication layers. To accommodate polar codes to this requirement, a mother polar code of length N = 2n is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bound by Nmin = 32 while the value of the upper bound Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Based on this observation, it is clear that the minimum mother code length can be 32.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, and Bioglio to include the technique of wherein the minimum mother code length is 32 of Bioglio in the system of combination of Li and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Regarding claim 22, combination of Li, Xie, and Bioglio teaches the features defined in the claims 20, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the minimum mother code rate is 1/8 (Bioglio, in Page 33, Col. 2, Lines 28-38, teaches that in 5G applications, the number of information bits, A, is fixed and a codeword of length E is created to achieve the desired rate R = A/E required by upper communication layers. To accommodate polar codes to this requirement, a mother polar code of length N = 2n is initially constructed, and the desired code length E is matched via puncturing, shortening or repetition. The mother code length N is lower bound by Nmin = 32 while the value of the upper bound Nmax = 512 for downlink and Nmax = 1024 for uplink. An ulterior upper bound is imposed by the minimal accepted code rate of 1/8. Based on this observation, it is clear that wherein the minimum mother code rate is 1/8.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, and Bioglio to include the technique of wherein the minimum mother code rate is 1/8 of Bioglio in the system of combination of Li, and Xie to provide a methods to efficiently implement in the design of polar codes, having low description complexity, while maintain good error-correction performance over multiple code and channel parameters (Bioglio, see Page 29, Col. 1, Lines 35-38).).
Claims 2 and 11 are rejected under U.S.C. 103 as being unpatentable over Jian Li et. al. (USPub. No.: US 20210288748 A1, hereinafter “Li”) in a view of Saijin Xie (USPub. No.: US 20200099399 A1, hereinafter “Xie”) and further in a view of Valerio Bioglio et. al. (IEEE Communications Surveys & Tutorials, Vol. 23, Issue 1, Pages 29 – 40, First quarter 2021, hereinafter “Bioglio”) and further in a view of Hongsil Jeong et. al. (USPub. No.: US 20190312676 A1, hereinafter “Jeong”)
Regarding claim 2, combination of Li, Xie, and Bioglio teaches the features defined in the claims 1, -refer to the indicated claim for reference(s).
Bioglio further teaches that wherein the size of the code block corresponding to the first service is 16 bits, 24 bits, or 32 bits (Bioglio, in Page 4, Section C, teaches that to adjust the size of code block of the polar code, rate matching is applied. Based on puncturing and shortening, the length of mother code can be reduced. For example, when the mother code length is N = 32 bits, the mother code length can be reduced 16 bits, or 24 bits by puncturing and shortening. Thus, the size of code block can be 16, 24, and 32 bits.
However, combination of Li, Xie, and Bioglio does not explicitly teach that wherein the size of the code block is a size of an information bit of the code block.
Jeong teaches wherein the size of the code block is a size of an information bit of the code block (Jeong, in Fig. 4 and in Paragraph [0193], teaches that Information bits, cro, cr1, … cr(Kr-l), are delivered to the channel coding block, where "r" denotes the code block number, and Kr denotes the number of bits
contained in the code block number "r." Thus, the size of the code block is a size of an information bit of the code block.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, Bioglio, and Jeong to include the technique of wherein the size of the code block is a size of an information bit of the code block of Jeong in the system of combination of Li, Xie, and Bioglio to provide a method and an apparatus for effectively performing encoding and decoding using a polar code in a wireless communication system, resulting in improving decoding performance in case of constructing the polar code (Jeong, see Paragraphs [0008] and [0017]).).
Regarding claim 11, combination of Li, Xie, and Bioglio teaches the features defined in the claim 10, -refer to the indicated claim for reference(s).
However, combination of Li, Xie, and Bioglio does not explicitly teach that wherein the size of the code block is a size of an information bit of the code block.
Jeong teaches wherein the size of the code block is a size of an information bit of the code block (Jeong, in Fig. 4 and in Paragraph [0193], teaches that Information bits, cro, cr1, … cr(Kr-l), are delivered to the channel coding block, where "r" denotes the code block number, and Kr denotes the number of bits
contained in the code block number "r." Thus, the size of the code block is a size of an information bit of the code block.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, Bioglio, and Jeong to include the technique of wherein the size of the code block is a size of an information bit of the code block of Jeong in the system of combination of Li, Xie, and Bioglio to provide a method and an apparatus for effectively performing encoding and decoding using a polar code in a wireless communication system, resulting in improving decoding performance in case of constructing the polar code (Jeong, see Paragraphs [0008] and [0017]).).
Claims 4 and 13 are rejected under U.S.C. 103 as being unpatentable over Jian Li et. al. (USPub. No.: US 20210288748 A1, hereinafter “Li”) in a view of Saijin Xie (USPub. No.: US 20200099399 A1, hereinafter “Xie”) and further in a view of Valerio Bioglio et. al. (IEEE Communications Surveys & Tutorials, Vol. 23, Issue 1, Pages 29 – 40, First quarter 2021, hereinafter “Bioglio”) and further in a view of Dong Youn Seo et. al. (USPub. No.: US 20090199066 A1, hereinafter “Seo”)
Regarding claim 4, combination of Li, Xie, and Bioglio teaches the features defined in the claim 1, -refer to the indicated claim for reference(s).
However, combination of Li, Xie, and Bioglio does not explicitly teach that wherein no a cyclic redundancy check (CRC) is attached to at least one transport block of the first service.
Seo teaches that wherein no a cyclic redundancy check (CRC) is attached to at least one transport block of the first service (Seo, in Paragraphs [0012], teaches that a variety of transport block sizes may be defined according to service categories of an upper layer. Further, in Paragraph [0045], Seo teaches that if the length of the transport block received from the upper layer is equal to or shorter than a predetermined length capable of being constructed by one code block, i.e., a maximum length of the internal interleaver of the turbo-encoder, the segmentation of the transport block may be omitted. In this case, the process for attaching a CB CRC may also be omitted. Based on this observation, it is clear that no CRC may be attached to the transport block of the first service in some cases.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, Bioglio, and Seo to include the technique of wherein no a cyclic redundancy check (CRC) is attached to at least one transport block of the first service of Seo in the system of combination of Li, Xie, and Bioglio to provide a signal transmission method and device to prevent the addition of dummy bit due to the limitation of the block size of the turbo-encoder, resulting in increasing the system performance or throughput (Seo, see Paragraphs [0013] and [0063]).).
Regarding claim 13, combination of Li, Xie, and Bioglio teaches the features defined in the claim 10, -refer to the indicated claim for reference(s).
However, combination of Li, Xie, and Bioglio does not explicitly teach that wherein no a cyclic redundancy check (CRC) is attached to at least one transport block of the first service.
Seo teaches that wherein no a cyclic redundancy check (CRC) is attached to at least one transport block of the first service (Seo, in Paragraphs [0012], teaches that a variety of transport block sizes may be defined according to service categories of an upper layer. Further, in Paragraph [0045], Seo teaches that if the length of the transport block received from the upper layer is equal to or shorter than a predetermined length capable of being constructed by one code block, i.e., a maximum length of the internal interleaver of the turbo-encoder, the segmentation of the transport block may be omitted. In this case, the process for attaching a CB CRC may also be omitted. Based on this observation, it is clear that no CRC may be attached to the transport block of the first service in some cases.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, Bioglio, and Seo to include the technique of wherein no a cyclic redundancy check (CRC) is attached to at least one transport block of the first service of Seo in the system of combination of Li, Xie, and Bioglio to provide a signal transmission method and device to prevent the addition of dummy bit due to the limitation of the block size of the turbo-encoder, resulting in increasing the system performance or throughput (Seo, see Paragraphs [0013] and [0063]).).
Claims 3 and 12 are rejected under U.S.C. 103 as being unpatentable over Jian Li et. al. (USPub. No.: US 20210288748 A1, hereinafter “Li”) in a view of Saijin Xie (USPub. No.: US 20200099399 A1, hereinafter “Xie”) and further in a view of Valerio Bioglio et. al. (IEEE Communications Surveys & Tutorials, Vol. 23, Issue 1, Pages 29 – 40, First quarter 2021, hereinafter “Bioglio”) and further in a view of Pi, Zhouyue et. al. (Int. Pub. No.: WO 2009008682 A1, hereinafter “Pi”)
Regarding claim 3, combination of Li, Xie, and Bioglio teaches the features defined in the claim 1, -refer to the indicated claim for reference(s).
However, combination of Li, Xie and Bioglio does not explicitly teach that wherein the size of the code block is a sum of a size of an information bit of the code block and a size of a cyclic redundancy check (CRC).
Pi teaches that wherein the size of the code block is a sum of a size of an information bit of the code block and a size of a cyclic redundancy check (CRC) (Pi, in Fig. 16 and in Page 3, Lines 2-3, teaches that as shown the transport block of information bits are segmented into a plurality of code blocks In an example shown in FIG. 16, a transport block CRC is generated from a transport block and a transport block 1601 including the transport block CRC is segmented code block 0 1603, code block 1 1605, code block 2 1607. CBO _ CRC 1609 is computed based on information bits in Code Block 0 1603 but not based on information bits in Code Block 1 1605 or Code Block 2 1607. Based on this observation, it is clear that as shown in Fig. 16, the size of the code block is the sum of a size of an information bit of the code block and a size of its CRC.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, Bioglio, and Pi to include the technique of wherein the size of the code block is a sum of a size of an information bit of the code block and a size of a cyclic redundancy check (CRC) of Pi in the system of combination of Li, Xie, and Bioglio to provide methods and apparatus to compute multiple CRCs for a transmission to improve the reliability of the transmission and reduce the transmitter and receiver complexity in wireless communication (Pi, see Page 17, Lines 4-6).).
Regarding claim 12, combination of Li, Xie, and Bioglio teaches the features defined in the claim 10, -refer to the indicated claim for reference(s).
However, combination of Li, Xie, and Bioglio does not explicitly teach that wherein the size of the code block is a sum of a size of an information bit of the code block and a size of a cyclic redundancy check (CRC).
Pi teaches that wherein the size of the code block is a sum of a size of an information bit of the code block and a size of a cyclic redundancy check (CRC) (Pi, in Fig. 16 and in Page 3, Lines 2-3, teaches that as shown the transport block of information bits are segmented into a plurality of code blocks In an example shown in FIG. 16, a transport block CRC is generated from a transport block and a transport block 1601 including the transport block CRC is segmented code block 0 1603, code block 1 1605, code block 2 1607. CBO _ CRC 1609 is computed based on information bits in Code Block 0 1603 but not based on information bits in Code Block 1 1605 or Code Block 2 1607. Based on this observation, it is clear that as shown in Fig. 16, the size of the code block is the sum of a size of an information bit of the code block and a size of its CRC.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, Bioglio, and Pi to include the technique of wherein the size of the code block is a sum of a size of an information bit of the code block and a size of a cyclic redundancy check (CRC) of Pi in the system of combination of Li, Xie, and Bioglio to provide methods and apparatus to compute multiple CRCs for a transmission to improve the reliability of the transmission and reduce the transmitter and receiver complexity in wireless communication (Pi, see Page 17, Lines 4-6).).
Claims 9 and 18 are rejected under U.S.C. 103 as being unpatentable over Jian Li et. al. (USPub. No.: US 20210288748 A1, hereinafter “Li”) in a view of Saijin Xie (USPub. No.: US 20200099399 A1, hereinafter “Xie”) and further in a view of Valerio Bioglio et. al. (IEEE Communications Surveys & Tutorials, Vol. 23, Issue 1, Pages 29 – 40, First quarter 2021, hereinafter “Bioglio”) and further in a view of and further in a view of Kwangseok Noh et. al. (USPub. No.: US 20210075538 A1, hereinafter “Noh”)
Regarding claim 9, combination of Li, Xie, and Bioglio teaches the features defined in the claim 1, -refer to the indicated claim for reference(s).
Noh further teaches that wherein the first service is a noise reduction data service (Noh, in Paragraphs [0003]-[0004] and [0018]-[0021], teaches that for the application of new radio communication (5G NR) such as massive machine type communication (mMTC) or ultra-reliable and low-latency communication (URLLC), the channel coding using the polar code can be applied and this can improve the block error rate in the communication. As defined in Paragraph [0054] of Specification in the claimed Application, the first-type service is a noise reduction data service that is characterized by the relatively small data transmission, high latency requirement, using channel coding such as Reed Solomon (RS) code or Polar code. Therefore, the application of NR such as mMTC or URLLC can be a noise reduction data service and for these applications, Noh explains the channel coding with polar coding for the NR communication. The example of channel coding using the polar code in NR communication can be found in Table 3 and Table 4 for NR (New Radio) system and further the implementation of the example is described in Table 8 and in Paragraphs [0135]-[0137] such that the channel coding using polar code for BCH (Broadcasting Channel), DCI (Downlink Control Information) or UCI (Uplink Control Information) payload. In this observation, it is clear that the channel coding with polar code can be applied to the noise reduction data service to transmit small data with low latency such as mMTC or URLLC application.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, Bioglio, and Noh to include the technique of wherein the first service is a noise reduction data service of Noh in the system of combination of Li, Xie, and Bioglio to provide methods and apparatus for channel coding using polar code, to reduce delay/latency compared to the legacy system and to reduce hardware complexity. (Noh, see Paragraphs [0006]-[0007]).).
Regarding claim 18, combination of Li, Xie, and Bioglio teaches the features defined in the claim 10, -refer to the indicated claim for reference(s).
Noh further teaches that wherein the first service is a noise reduction data service (Noh, in Paragraphs [0003]-[0004] and [0018]-[0021], teaches that for the application of new radio communication (5G NR) such asmassive machine type communication (mMTC) or ultra-reliable and low-latency communication (URLLC), the channel coding using the polar code can be applied and this can improve the block error rate in the communication. As defined in Paragraph [0054] of Specification in the claimed Application, the first-type service is a noise reduction data service that is characterized by the relatively small data transmission, high latency requirement, using channel coding such as Reed Solomon (RS) code or Polar code. Therefore, the application of NR such as mMTC or URLLC can be a noise reduction data service and for these applications, Noh explains the channel coding with polar coding for the NR communication. The example of channel coding using the polar code in NR communication can be found in Table 3 and Table 4 for NR (New Radio) system and further the implementation of the example is described in Table 8 and in Paragraphs [0135]-[0137] such that the channel coding using polar code for BCH (Broadcasting Channel), DCI (Downlink Control Information) or UCI (Uplink Control Information) payload. In this observation, it is clear that the channel coding with polar code can be applied to the noise reduction data service to transmit small data with low latency such as mMTC or URLLC application.
It would have been obvious for one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine Li, Xie, Bioglio, and Noh to include the technique of wherein the first service is a noise reduction data service of Noh in the system of combination of Li, Xie, and Bioglio to provide methods and apparatus for channel coding using polar code, to reduce delay/latency compared to the legacy system and to reduce hardware complexity. (Noh, see Paragraphs [0006]-[0007]).).
Conclusion
Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a).
A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to JAEYOUNG KWAK whose telephone number is (703)756-1768. The examiner can normally be reached Monday-Friday 9 AM -5 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, Kevin Bates can be reached at 571-272-3980. 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.
/JAEYOUNG KWAK/Examiner, Art Unit 2472
/KEVIN T BATES/Supervisory Patent Examiner, Art Unit 2472
Prosecution Insights