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 08/08/2025 have been considered for examination. Claims 1-5, 7-14, and 16-22 are pending in the instant application.
With regard to the 102/103 rejections, Applicant’s arguments filed 08/08/2025 (see pages 7-9 of Remarks) in view of the amendments have been fully considered but are not persuasive at least in view of the reasons set forth below. Further, Examiner notes that Applicant’s amendments necessitated the new ground(s) of rejection presented in the instant Office Action.
Regarding claims 1, 10, and 19, Applicant argued:
In the argument, Applicant argue that the original claim 1 is amended with the original claim 6. The rejection for the original claim 6 is failed since the prior art “Bioglio”, in Page 33, Col 2, section IV, Lines 28-38, discloses that a maximum mother code length of 512 for downlink or 1024 for uplink communications, but Bioglio does not specify a maximum mother code length of 128 or 256 as described in the original claim 6: Bioglio, page 33, col. 2, Lines 28-38 (emphasis added). As shown above, Bioglio discloses, in 5G NR applications, the maximum allowable mother code length is 512 for downlink or 1024 for uplink. However, Bioglio does not specify a maximum mother code length of 128 or 256. As such, Bioglio fails to perform, based on a mother code length of at least one code block, channel coding on the at least one code block, wherein a maximum mother code length is 128 or 256, as claimed. For at least these reasons, the Applicant submits that the rejection of claims 1-5, 7-14, and 16-20 under 35 U.S. C. § 103 as being rendered obvious by the combination of Noh, Jeong, and Bioglio is improper. The Applicant respectfully requests to withdraw the rejections (see, pages 7-9 of Remarks).
In response to Applicant’s argument, Examiner respectfully disagrees.
In the argument, Applicant provides the amended claims 1 by combining the original claim 6 and argued that Bioglio disclose the maximum mother code length of 512 for downlink or 1024 for uplink communications, but Bioglio does not specify a maximum mother code length of 128 or 256 as described in the original claim 6. Examiner respectfully disagrees.
Regarding the mother code length, as mentioned in the argument, Bioglio, in Page 33, Col. 2, Lines 28-38, “to accommodate polar codes to this requirement, …, imposed by the minimal accepeted code rate of 1/8” discloses the range of the mother code length (Nmin = 32, Nmax = 512 for the downlink, or Nmax = 1024 for the uplink) and the minima accepted code rate of 1/8. Therefore, since the maximum mother code length of 128 or 256 is in the range mentioned by Bioglio and the mother code length is defined as N = 2n, where the length 128 and 256 is corresponding to the cases, n= 7 and 8, respectively, Bioglio discloses this maximum mother code length of 128 or 256, although the range of the mother code length is mentioned, instead of showing the exact number of the mother code length 128 or 256.
However, since the scope of the amended claim 1, similarly, the scopes of the amended claims 10 and 19, has been changed the scope of the original claims, the new ground(s) of rejection is presented in the instant Office Action as set forth below.
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-10, 14, and 16-22 are rejected under U.S.C. 103 as being unpatentable over Kwangseok Noh and et. al. (USPub. No.: US 20210075538 A1, hereinafter “Noh”) in a view of Valerio Bioglio and et. al. (IEEE Communications Surveys & Tutorials, Vol. 23, Issue 1, Pages 29 – 40, First quarter 2021, hereinafter “Bioglio”)
Regarding claim 1, Noh teaches that a communication method implemented by a first node, (Noh, in Paragraph [0043], teaches that a cell refers to a prescribed geographical area to which one or more nodes provide a communication service. Accordingly, communicating with a specific cell may mean communicating with a BS or a node which provides a communication service to the specific cell. In addition, a DL/UL signal of a specific cell refers to a DL/UL signal from/to a BS or a node which provides a communication service to the specific cell. A node providing UL/DL communication services to a UE is called a serving node and a cell to which UL/DL communication services are provided by the serving node is especially called a serving cell. Therefore, it is clear that the communication service is performed between nodes.) wherein the communication method comprises: performing channel coding on the at least one code block of a first service to obtain at least one channel-coded code block; (Noh, in Fig. 1 and in Paragraphs [0043], [0052]-[0059], teaches that the communication method is performed at the node that provide a service, as explained in Paragraph [0043]. In the node, the channel coding is performed as shown in the steps of Fig. 1. As explained in Paragraphs [0054]-[0059], Data arrives at a coding block in the form of a maximum of two transport blocks every transmission time interval (TTI) in each DL/UL cell. The following channel coding steps may be applied to each transport block of the DL/UL cell: cyclic redundancy check (CRC) attachment to a transport block; code block segmentation and CRC attachment to a code block; channel coding; rate matching; and code block concatenation (channel coded block concatenation). Therefore, it is clear that channel coding may be performed on code blocks of a service provided by the node to obtain channel-coded code blocks.) and sending, to a second node, the at least one channel-coded code block (Noh, in Paragraphs [0053] and [0060], teaches that error correction coding (channel coding) is performed on each code block of a predetermined inter-leaver size and then interleaving is performed to reduce burst errors during transmission over a radio channel. The error-corrected and interleaved code block is transmitted by being mapped to an actual radio resource based on rate-matching with puncturing or repetition. Then, the receiving side demodulates a received signal and decodes the error correction code to thereby recover the information transmitted by the transmitting side. Further detail block diagram and explanation can be also found in Fig. 11 and in Paragraphs [0118]-[0119]. Therefore, it is clear that channel-coded (error-corrected) code blocks may be transmitted to the receiver (a second node)).
However, Noh does not explicitly teach that based on a mother code length of at least one code block, wherein a maximum mother code length is 128 or 256.
Bioglio teaches that based on a mother code length of at least one code block, wherein a maximum mother code length is 128 or 256 (Bioglio, in Page 33, Col 2, Lines 17-38, teaches that the channel coding mentioned in the above can be a polar code. Polar codes are used to encode the uplink control information (UCI) over the physical uplink control channel (PUCCH) and the physical uplink shared channel (PUSCH). In the downlink, polar codes are used to encode the downlink control information (DCI) over the physical downlink control channel (PDCCH), and the payload in the physical broadcast channel (PBCH) chain parameters and bounds. In 5G application, 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 or 256 when n= 7 or 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 Noh and Bioglio to include the technique of based on a mother code length of at least one code block, wherein a maximum mother code length is 128 or 256 of Bioglio in the system of Noh 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 Noh 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 Noh 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 Noh 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 Noh 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 Noh, Jeong, and Bioglio to include the technique of wherein the minimum mother code length is 32 of Bioglio in the system of Noh 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 Noh 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 Noh and Bioglio to include the technique of wherein the minimum mother code rate is 1/8 of Bioglio in the system of Noh 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 9, combination of Noh and Bioglio teaches the features defined in the claims 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.).
Regarding claim 10, Noh teaches that a communication method, comprising: (Noh, in Paragraph [0043], teaches that a cell refers to a prescribed geographical area to which one or more nodes provide a communication service. Accordingly, communicating with a specific cell may mean communicating with a BS or a node which provides a communication service to the specific cell. In addition, a DL/UL signal of a specific cell refers to a DL/UL signal from/to a BS or a node which provides a communication service to the specific cell. A node providing UL/DL communication services to a UE is called a serving node and a cell to which UL/DL communication services are provided by the serving node is especially called a serving cell. Therefore, it is clear that the communication service is performed between nodes.) receiving, from a first node, a first service comprising at least one channel-coded code block; and performing channel decoding on the at least one channel-coded code block to obtain at least one code block (Noh, in Fig. 11 (a) and (b) and in Paragraphs [0118]-[0119], teaches that in Fig. 11 (a), a transmitting device inserts a CRC code into a transport block or a code block (S1101a) and scrambles obtained input bits using a scrambling sequence (S1103a). The transmitting device channel encodes the scrambled input bits (S1105a) to generate coded bits and channel-interleaves the coded bits (S1107a). Then, in FIG. 11(b), a receiving device obtains coded bits from received bits based on a channel interleaving pattern applied in the encoding procedure or a channel interleaving pattern corresponding thereto (S1107b) and channel-decodes the coded bits (S1105b) to obtain scrambled bits. The receiving device descrambles the scrambled bits using a scrambling sequence (S1103b) to obtain a sequence of decoded bits (hereinafter, a decoded bit sequence). The receiving device checks whether errors occur in the decoded bit sequence using CRC bits in the decoded bit sequence (S1101b). If CRC for the decoded bit sequence is successful, the receiving device determines that the channel decoding procedure has succeeded and may obtain the transport block or the code block by eliminating the CRC bits from the decoded bit sequence. Therefore, it is clear that channel-coded code blocks for the service may be received from the transmitter side (the first node) and channel decoding on the received channel-coded code block may be performed by the receiver side (the 2nd node) to obtain the code block).
However, Noh does not explicitly teach that based on a mother code length of at least one code block, wherein a maximum mother code length is 128 or 256.
Bioglio teaches that based on a mother code length of at least one code block, wherein a maximum mother code length is 128 or 256 (Bioglio, in Page 33, Col 2, Lines 17-38, teaches that the channel coding mentioned in the above can be a polar code. Polar codes are used to encode the uplink control information (UCI) over the physical uplink control channel (PUCCH) and the physical uplink shared channel (PUSCH). In the downlink, polar codes are used to encode the downlink control information (DCI) over the physical downlink control channel (PDCCH), and the payload in the physical broadcast channel (PBCH) chain parameters and bounds. In 5G application, 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 or 256 when n= 7 or 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 Noh and Bioglio to include the technique of based on a mother code length of at least one code block, wherein a maximum mother code length is 128 or 256 of Bioglio in the system of Noh 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 Noh 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 Noh 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 Noh 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 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 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 Noh, Bioglio and Jeong to include the technique of wherein the minimum mother code length is 32 of Bioglio in the system of Noh 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 Noh 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 Noh and Bioglio to include the technique of wherein the minimum mother code rate is 1/8 of Bioglio in the system of Noh 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 18, combination of Noh and Bioglio teaches the features defined in the claims 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.).
Regarding claim 19, Noh teaches that a communication apparatus, comprising: a transmitter; at least one processor coupled to the transmitter and configured to cause the communication; apparatus to: (Noh, in Fig. 14 and in Paragraph [0043], teaches that Fig. 14 is a block diagram illustrating elements of a transmitting device 10 and a receiving device 20. The transmitting device 10 and the receiving device 20 respectively include transceivers 13 and 23 capable of transmitting and receiving radio signals carrying information, data, signals, and/or messages, memories 12 and 22 for storing information related to communication in a wireless communication system, and processors 11 and 21 operationally connected to elements such as the transceivers 13 and 23 and the memories 12 and 22 to control the elements and configured to control the memories 12 and 22 and/or the transceivers 13 and 23. Therefore, it is clear the communication apparatus to communicate may include a transmitter coupled with a processor. ) perform channel coding on at least one code block of a first service to obtain at least one channel-coded code block; (Noh, in Fig. 1 and in Paragraphs [0043], [0052]-[0059], teaches that the communication method is performed at the node that provide a service, as explained in Paragraph [0043]. In the node, the channel coding is performed as shown in the steps of Fig. 1. As explained in Paragraphs [0054]-[0059], Data arrives at a coding block in the form of a maximum of two transport blocks every transmission time interval (TTI) in each DL/UL cell. The following channel coding steps may be applied to each transport block of the DL/UL cell: cyclic redundancy check (CRC) attachment to a transport block; code block segmentation and CRC attachment to a code block; channel coding; rate matching; and code block concatenation (channel coded block concatenation). Therefore, it is clear that channel coding may be performed on code blocks of a service provided by the node to obtain channel-coded code blocks.) and send, using the transmitter and to a node, the at least one channel- coded code block (Noh, in Paragraphs [0053] and [0060], teaches that error correction coding (channel coding) is performed on each code block of a predetermined inter-leaver size and then interleaving is performed to reduce burst errors during transmission over a radio channel. The error-corrected and interleaved code block is transmitted by being mapped to an actual radio resource based on rate-matching with puncturing or repetition. Then, the receiving side demodulates a received signal and decodes the error correction code to thereby recover the information transmitted by the transmitting side. Further detail block diagram and explanation can be also found in Fig. 11 and in Paragraphs [0118]-[0119]. Therefore, it is clear that channel-coded (error-corrected) code blocks may be transmitted by the transmitter to the receiver (a second node)).
However, Noh does not explicitly teach that based on a mother code length of at least one code block, wherein a maximum mother code length is 128 or 256.
Bioglio teaches that based on a mother code length of at least one code block, wherein a maximum mother code length is 128 or 256 (Bioglio, in Page 33, Col 2, Lines 17-38, teaches that the channel coding mentioned in the above can be a polar code. Polar codes are used to encode the uplink control information (UCI) over the physical uplink control channel (PUCCH) and the physical uplink shared channel (PUSCH). In the downlink, polar codes are used to encode the downlink control information (DCI) over the physical downlink control channel (PDCCH), and the payload in the physical broadcast channel (PBCH) chain parameters and bounds. In 5G application, 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 or 256 when n= 7 or 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 Noh and Bioglio to include the technique of based on a mother code length of at least one code block, wherein a maximum mother code length is 128 or 256 of Bioglio in the system of Noh 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 Noh and Bioglio teaches the features defined in the claims 19, -refer to the indicated claim for reference(s).
Bioglio futher 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 Noh 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 Noh 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 Noh 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 Noh, Bioglio and Jeong to include the technique of wherein the minimum mother code length is 32 of Bioglio in the system of Noh 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 Noh 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 Noh and Bioglio to include the technique of wherein the minimum mother code rate is 1/8 of Bioglio in the system of Noh 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, 4, 11, and 13 are rejected under U.S.C. 103 as being unpatentable over Kwangseok Noh and et. al. (USPub. No.: US 20210075538 A1, hereinafter “Noh”) in a view of Valerio Bioglio and 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 and et. al. (USPub. No.: US 20090199066 A1, hereinafter “Seo”)
Regarding claim 2, combination of Noh and Bioglio teaches the features defined in the claims 1, -refer to the indicated claim for reference(s).
However, combination of Noh and Bioglio does not explicitly teach that wherein the communication method further comprising: obtaining at least one of a size of a code block size corresponding to the first service or a quantity of code blocks corresponding to the first service; and obtaining the at least one code block by using at least one transport block of the first service and by using the at least one of the size of the code block or the quantity.
Seo teaches that wherein the communication method further comprising: obtaining at least one of a size of a code block size corresponding to the first service or a quantity of code blocks corresponding to the first service; (Seo, in Fig. 3 and 4 and in Paragraphs [0012] and [0013], teaches that although a variety of transport block sizes may be defined according to service categories of an upper layer, it is preferable that the transport block sizes may be quantized to effectively perform the signaling of various transport block sizes. During the quantization process, in order to adjust a source data block transferred from an upper layer to the size of a data block of a physical layer, a dummy bit is added to the source data block. During this quantization process, it is preferable to minimize the amount of added dummy bits. Determining the number of code blocks to be used for transmitting a transport block with a specific size, and mapping the transport block to the code blocks corresponding to the determined number; attaching a cyclic redundancy check (CRC) to each of the code blocks; encoding each of the CRC-attached code blocks by a turbo-encoder including an internal interleaver; and transmitting the encoded code blocks, wherein the specific size of the transport block corresponds to any transport block size in predetermined transport block size combinations, and wherein any transport block size in the predetermined transport block size combinations is predetermined. Therefore, it is clear that since the transport block size may be obtained and determined based on the service categories of the upper layer and the size of a code block size or the quantity of code blocks may be determined based on predetermined transport block, the size of a code block size or the quantity of code blocks may depend on the service categories.) and obtaining the at least one code block by using at least one transport block of the first service and by using the at least one of the size of the code block or the quantity (Seo, in Fig. 3 and 4 and in Paragraphs [0012] and [0013], teaches that Fig. 3 and 4 show the code blocks can be obtained from the transport block, the size of the code block or the quantity. Since the transport block and its size may be depending on the service categories of the upper layer and the size of the code block or the quantity may be defined based on the transport block, it is clear that code blocks may be obtained from the transport blocks, the size of the code block or the quantity based on the transport 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 Noh, Bioglio, and Seo to include the technique of wherein the communication method further comprising: obtaining at least one of a size of a code block size corresponding to the first service or a quantity of code blocks corresponding to the first service; (and obtaining the at least one code block by using at least one transport block of the first service and by using the at least one of the size of the code block or the quantity of Seo in the system of combination of Noh 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 4, combination of Noh and Bioglio teaches the features defined in the claims 1, -refer to the indicated claim for reference(s).
However, combination of Noh 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 Noh, 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 Noh 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 11, combination of Noh and Bioglio teaches the features defined in the claims 10, -refer to the indicated claim for reference(s).
However, combination of Noh and Bioglio does not explicitly teach that wherein the communication method further comprising: obtaining at least one of a size of a code block corresponding to the first service or a quantity of code blocks corresponding to the first service; and obtaining at least one transport block of the first service based on the at least one of the size of the code block or the quantity of code blocks.
Seo teaches that wherein the communication method further comprising: obtaining at least one of a size of a code block corresponding to the first service or a quantity of code blocks corresponding to the first service; (Seo, in Fig. 3 and 4 and in Paragraphs [0012] and [0013], teaches that although a variety of transport block sizes may be defined according to service categories of an upper layer, it is preferable that the transport block sizes may be quantized to effectively perform the signaling of various transport block sizes. During the quantization process, in order to adjust a source data block transferred from an upper layer to the size of a data block of a physical layer, a dummy bit is added to the source data block. During this quantization process, it is preferable to minimize the amount of added dummy bits. Determining the number of code blocks to be used for transmitting a transport block with a specific size, and mapping the transport block to the code blocks corresponding to the determined number; attaching a cyclic redundancy check (CRC) to each of the code blocks; encoding each of the CRC-attached code blocks by a turbo-encoder including an internal interleaver; and transmitting the encoded code blocks, wherein the specific size of the transport block corresponds to any transport block size in predetermined transport block size combinations, and wherein any transport block size in the predetermined transport block size combinations is predetermined. Therefore, it is clear that since the transport block size may be obtained and determined based on the service categories of the upper layer and the size of a code block size or the quantity of code blocks may be determined based on predetermined transport block, the size of a code block size or the quantity of code blocks may depend on the service categories.) and obtaining at least one transport block of the first service based on the at least one of the size of the code block or the quantity of code blocks (Seo, in Fig. 3 and 4 and in Paragraphs [0012] and [0013], teaches that Fig. 3 and 4 show the code blocks can be obtained from the transport block, the size of the code block or the quantity. Although a variety of transport block sizes may be defined according to service categories of an upper layer, it is preferable that the transport block sizes may be quantized to effectively perform the signaling of various transport block sizes. During the quantization process, in order to adjust a source data block transferred from an upper layer to the size of a data block of a physical layer, a dummy bit is added to the source data block. During this quantization process, it is preferable to minimize the amount of added dummy bits. Determining the number of code blocks to be used for transmitting a transport block with a specific size, and mapping the transport block to the code blocks corresponding to the determined number. Since the transport block and its size may be depending on the service categories of the upper layer and the size of the code block or the quant