DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Response to Arguments
Applicant’s arguments, filed 04/22/26, with respect to the rejection(s) of claim(s) 1, 3, 5 and 28-34 have been fully considered and are persuasive. Therefore, the rejection has been withdrawn. However, upon further consideration, a new ground(s) of rejection is made in view of Fu (WO 2024011423 A1) in view of Qiang (Pub No 20250097779) and Callard (Pub No 20180097722)
Regarding claim 3,
Applicant argues the prior art does not teach the amended limitation.
Examiner relies on newly cited Callard (Pub No 20180097722)
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.
Claim(s) 1, 5, 28-34 is/are rejected under 35 U.S.C. 103 as being unpatentable over Fu (WO 2024011423 A1) in view of Qiang (Pub No 20250097779) and Callard (Pub No 20180097722)
Regarding claim 1 and 29,
Fu teaches A method for wireless communications at a wireless device, comprising:
One or more processors; memory coupled with the processor; and instructions stored in the memory and executable by the one or more processors to cause the apparatus to: (see processor and memory para [0013])
Obtaining an indication of a packet data unit (PDU) set dependency pattern for at least a first PDU set and a second PDU set of a group of PDU sets, the PDU set dependency pattern indicating a relationship between the first PDU set and the second PDU set for decoding the first PDU set and the second PDU set; (interpreted as In some embodiments, different data corresponds to PDU sets with different attributes. Optionally, the attributes include at least one of the following: type, importance, relevance, priority, and dependency, see para [0068]. Also see Dependency means that a PDU set relies on one or more PDU sets to be decoded, used or worked, and the two work together as a whole, see para [0114])
wherein each PDU set of the group of PDU sets is associated with a same service flow (transmits different PDU sets (corresponding to one QoS flow), see para [0172])
decoding at least the first PDU set and the second PDU set based at least in part on the relationship between the first PDU set and the second PDU set for decoding the first PDU set and the second PDU set. (interpreted as In addition, different PDU sets may also be associated or dependent on each other. For example, the PDU set representing I frames has a dependency on the PDU set representing P frames, and the compression and decoding of P frames depends on I frames, see para [0046])
However, Fu does not teach wherein the indication of the PDU set dependency pattern comprises a bitmap associated with the first PDU set having a length equal to a quantity of PDU sets in the group of PDU sets, the bitmap indicating the relationship between the first PDU set and one or more PDU sets of the group of PDU sets;
Qiang teaches wherein the indication of the PDU set dependency pattern comprises a bitmap associated with the first PDU set having a length equal to a quantity of PDU sets in the group of PDU sets, the bitmap indicating the relationship between the first PDU set and one or more PDU sets of the group of PDU sets; (interpreted as The information indicating the association relationship between the plurality of PDU sets may be, for example, number information of the PDU sets, a bitmap indicating the number information of the PDU sets, or an identifier indicating the association relationship between the PDU sets. For example, a packet of a PDU set may carry a number of another PDU set associated with the PDU set; a packet of a PDU set may carry a bitmap (bitmap), and each bit (bit) in the bitmap corresponds to one PDU set, when a bit in the bitmap is set to 1, it indicates that a PDU set corresponding to the bit has an association relationship with the current PDU set, see para [0243])
It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the system taught by Fu with the bitmap as taught by Qiang with the motivation being as a formation for indicating configuration information (e.g. dependency) to perform the appropriate processing of the information.
However, Fu in view of Qiang do not teach control plane and user plane.
Callard teaches control plane and user plane; (interpreted as receive PDU session configuration parameters over the control plane and then GTP-U formatted PDUs, via a user plane interface, see para [0245])
It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the system taught by Fu in view of Qiang with the planes as taught by Callard with the motivation being to have control information and data separate.
Regarding claim 28 and 30,
Fu teaches A method for wireless communication at a wireless device, comprising:
One or more processors; memory coupled with the processor; and instructions stored in the memory and executable by the One or more processors to cause the apparatus to: (see processor and memory para [0013])
encoding at least a first packet data unit (PDU) set and a second PDU set of a group of PDU sets based at least in part on a PDU set dependency pattern, wherein the encoding is based at least in part on a relationship of the PDU set dependency pattern between the first PDU set and the second PDU set for the encoding, wherein each PDU set of the group of PDU sets is associated with a same service flow; (interpreted as In some embodiments, different data corresponds to PDU sets with different attributes. Optionally, the attributes include at least one of the following: type, importance, relevance, priority, and dependency, see para [0068]. Also see Dependency means that a PDU set relies on one or more PDU sets to be decoded, used or worked, and the two work together as a whole, see para [0114]. Also see transmits different PDU sets (corresponding to one QoS flow), see para [0172])
outputting, via a control plane message, an indication of the PDU set dependency pattern based at least in part on the encoding; and outputting the second PDU set, (interpreted as generates an SDAP PDU; distributes the PDU to the corresponding or correct lower layer path according to the mapping relationship configured by RRC; indicates different information of different data to the lower layer (PDCP), for example, the different information may be: importance, or relevance, or priority, or dependency, or frame type, or packet type, etc., see para [0168])
However, Fu does not teach wherein the indication of the PDU set dependency pattern comprises a bitmap associated with the first PDU set having a length equal to a quantity of PDU sets in the group of PDU sets, the bitmap indicating the relationship between the first PDU set and one or more PDU sets of the group of PDU sets;
Qiang teaches wherein the indication of the PDU set dependency pattern comprises a bitmap associated with the first PDU set having a length equal to a quantity of PDU sets in the group of PDU sets, the bitmap indicating the relationship between the first PDU set and one or more PDU sets of the group of PDU sets; (interpreted as The information indicating the association relationship between the plurality of PDU sets may be, for example, number information of the PDU sets, a bitmap indicating the number information of the PDU sets, or an identifier indicating the association relationship between the PDU sets. For example, a packet of a PDU set may carry a number of another PDU set associated with the PDU set; a packet of a PDU set may carry a bitmap (bitmap), and each bit (bit) in the bitmap corresponds to one PDU set, when a bit in the bitmap is set to 1, it indicates that a PDU set corresponding to the bit has an association relationship with the current PDU set, see para [0243])
It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the system taught by Fu with the bitmap as taught by Qiang with the motivation being as a formation for indicating configuration information (e.g. dependency) to perform the appropriate processing of the information.
However, Fu in view of Qiang do not teach control plane and user plane.
Callard teaches control plane and user plane; (interpreted as receive PDU session configuration parameters over the control plane and then GTP-U formatted PDUs, via a user plane interface, see para [0245])
It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the system taught by Fu in view of Qiang with the planes as taught by Callard with the motivation being to have control information and data separate.
Regarding claim 5,
Fu teaches The method of claim 1, however does not teach wherein:
each bit of the bitmap corresponds to a respective PDU set of the group of PDU sets, and
a value of each bit indicates whether the respective PDU set is dependent on the first PDU set.
Qiang teaches wherein:
each bit of the bitmap corresponds to a respective PDU set of the group of PDU sets, and
a value of each bit indicates whether the respective PDU set is dependent on the first PDU set. (interpreted as The information indicating the association relationship between the plurality of PDU sets may be, for example, number information of the PDU sets, a bitmap indicating the number information of the PDU sets, or an identifier indicating the association relationship between the PDU sets. For example, a packet of a PDU set may carry a number of another PDU set associated with the PDU set; a packet of a PDU set may carry a bitmap (bitmap), and each bit (bit) in the bitmap corresponds to one PDU set, when a bit in the bitmap is set to 1, it indicates that a PDU set corresponding to the bit has an association relationship with the current PDU set, see para [0243])
It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the system taught by Fu with the bitmap as taught by Qiang with the motivation being as a formation for indicating configuration information (e.g. dependency) to perform the appropriate processing of the information.
Regarding claim 31,
Fu teaches The method of claim 1, wherein the indication of the PDU set dependency pattern further comprises an indication of whether the decoding of the second PDU set relies on information included in the first PDU set, whether the decoding of the first PDU set relies on information included in the second PDU set, or both. (interpreted as In addition, different PDU sets may also be associated or dependent on each other. For example, the PDU set representing I frames has a dependency on the PDU set representing P frames, and the compression and decoding of P frames depends on I frames, see para [0046]. Also see Case 3: identify different data based on an attribute of the data, where the attribute includes at least one of the following: a type, an importance, an association, a priority, and a dependency, see para [0083])
Regarding claim 32,
Fu teaches The method of claim 1, wherein the indication of the PDU set dependency pattern further comprises an indication of a relationship between the first PDU set and the second PDU set, and an indication of a sequence number of the first PDU set, an indication of a sequence number of the second PDU set, or both. (interpreted as In some embodiments, the sender performs joint processing on different data corresponding to the same QoS stream. The joint processing includes at least one of the following: using a unified SN (Sequence Number) to number the different data; using a unified first function for the different data; and further, using the same buffer for the different data, see para [0089])
Regarding claim 33,
Fu teaches The method of claim 1, wherein an order of a
sequence number of the first PDU set and a sequence number of the second PDU set is different
than a display order of the first PDU set and the second PDU set. (interpreted as The sending end uses a unified serial number (SN) to number different data packets, meaning different data packets are jointly numbered. For example, data 1 and data 2 are different data packets. Data 1 includes data packets A, B, and C, and data 2 includes data packets D and E. With joint numbering, for example, data packet A corresponds to SN 1, data packet D to SN 2, data packet B to SN 3, data packet C to SN 4, and data packet E to SN 5. If independent numbering is used, for example, data packet A corresponds to SN 1, data packet B to SN 2, data packet C to SN 3, data packet D to SN 1, and data packet E to SN 2. The above example illustrates the difference between independent numbering and joint numbering, see para [0090])
Regarding claim 34,
Fu teaches The method of claim 1, wherein an order of a sequence number of the first PDU set and a sequence number of the second PDU set is the same as a display order of the first PDU set and the second PDU set. (interpreted as The sending end uses a unified serial number (SN) to number different data packets, meaning different data packets are jointly numbered. For example, data 1 and data 2 are different data packets. Data 1 includes data packets A, B, and C, and data 2 includes data packets D and E. With joint numbering, for example, data packet A corresponds to SN 1, data packet D to SN 2, data packet B to SN 3, data packet C to SN 4, and data packet E to SN 5. If independent numbering is used, for example, data packet A corresponds to SN 1, data packet B to SN 2, data packet C to SN 3, data packet D to SN 1, and data packet E to SN 2. The above example illustrates the difference between independent numbering and joint numbering, see para [0090])
Claim(s) 3 is/are rejected under 35 U.S.C. 103 as being unpatentable over Fu (WO 2024011423 A1) in view of Qiang (Pub No 20250097779), Callard (Pub No 20180097722), and Rao (Pub No 20240147477)
Regarding claim 3,
Fu in view of Qiang and Callard teaches The method of claim 1, however does not teach further comprising: obtaining, as part of metadata, associated with the first PDU set, an indication of a start of the PDU dependency pattern.
Mondet teaches further comprising: obtaining, as part of metadata, associated with the first PDU set, an indication of a start of the PDU dependency pattern. (The information related to the PDU set may include the size of the PDU set (e.g., total payload, number of PDUs in PDU set), an indication of start/first and/or end/last PDU of PDU set, and/or an indication of the association/dependency of the PDUs in a PDU set (e.g., ID of PDU set, importance/priority value), see [0127]. See metadata para 0089])
It would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to combine the PDU dependency as taught by Fu in view of Qiang and Callard with the indication of the start of dependency Mondet with the motivation being to indicate when the dependency is applicable.
Allowable Subject Matter
Claim 6-7, 9, 12-21, 23-25, 27 allowed.
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 BAO G NGUYEN whose telephone number is (571)272-7732. The examiner can normally be reached M-F 10pm - 6:30pm.
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, Huy Vu can be reached on 571-272-3155. 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.
/BAO G NGUYEN/Examiner, Art Unit 2461 /HUY D VU/Supervisory Patent Examiner, Art Unit 2461
Prosecution Insights