METHOD FOR DATA COMPRESSION BASED ON PRESET RULE, DEVICE, AND MEDIUM

Application No. 18/667,085

• Filed: May 17, 2024
• Priority: Nov 18, 2021 — CN 202111367774.4
  • Oct 19, 2022 — continuation of PCTCN2022126267
• Examiner: WIDHALM DE RODRIG, ANGELA MARIE
• Art Unit: 2443
• Tech Center: 2400 — Computer Networks
• Assignee: Shenzhen Zhi Hui Lin Network Technology Co. Ltd.
• OA Round: 1 (Non-Final)

Office Action

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 .

Introduction
The claims 1-20 are pending in this application. This is a non-final office action in response to Application Number 18/667,085 filed on 17 May 2024; the instant application is a CON of PCT/CN2022/126267 filed on 19 October 2022 and claims foreign priority to Chinese application 202111367774.4 filed on 18 November 2021.
The applicant of record is Shenzhen Zhi Hui Lin Network Technology Col, Ltd. and the inventors of record are Behzad Moghaddam Sardroud, Hamed Kalantari, Behzad Kalantari, Xiaoduan Ding, Kun Huang, and Yan Yin.

Priority
Receipt is acknowledged of certified copies of papers required by 37 CFR 1.55.

Information Disclosure Statement
The information disclosure statement (IDS) submitted on 17 May 2024 was filed on the filing date of the instant application on 17 May 2024 and before the mailing date of the first office action on the merits. The submission is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
Claim Objections
Claims 9 and 17 are objected to because of the following informalities: Claims 9 and 17 each recite “the preset rule” in the third limitation, however there is no previous mention of a preset rule within the claims. Appropriate correction is required.

Claim Interpretation
The claims have been considered according to the latest Patent Eligibility Guidelines and are considered eligible.
Examiner notes that applicant’s specification (e.g., paragraphs 19, 55-56, 62, 68, 77, 80) describes improvements that are reflected in the claims.

Claim Rejections - 35 USC § 102
In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.

The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –

(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention.

Claims 1, 9, and 17 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Xu et al. (CN 111049861 A).

Regarding claim 1, Xu disclosed a method for data compression based on a preset rule (see [0008]: “…This method converts various transmission message texts into binary strings, treats each byte of the binary string as an unsigned integer, calculates the optimal number of segments, and uses a segmented integer compression method to compress all integers into a single large integer, represented as a binary string. The integers are then encoded, significantly reducing the length of the output string…”; examiner notes that the size of the fragment (i.e. one byte) is interpreted as being functionally equivalent to the claimed “preset rule”), comprising:
acquiring original data (see [0008]: “…This method converts various transmission message texts into binary strings…”);
performing a binary conversion on the original data to obtain binary data (see [0008]: “…This method converts various transmission message texts into binary strings…”);
scanning the binary data, matching the binary data with the preset rule, and separating binary data that is successfully matched with the preset rule into a data split (see [0008]: “…This method converts various transmission message texts into binary strings, treats each byte of the binary string as an unsigned integer, calculates the optimal number of segments, and uses a segmented integer compression method to compress all integers into a single large integer, represented as a binary string …”; [0009]: “Convert the input binary string into an integer sequence S = {a₁, a₂, ..., a_n}”; [0010]: “Divide S into m segments S₁, S₂, ..., S_m, i.e. S₁＝{a₁,a₂, ...,a_k}, S_i＝{a_(i-1)*k+1,a_(i-1)*k+2, ...,a_i*k}, S_m＝{a_(m-1)*k+1,a_(m-1)*k+2, ...,a_n}”; examiner interprets each segment as being functionally equivalent to the claimed “data split”);
abbreviating the data split to obtain an abbreviated data split (see [0008]: “…uses a segmented integer compression method to compress all integers into a single large integer, represented as a binary string. The integers are then encoded, significantly reducing the length of the output string…”; [0011]: “For each segment S_i＝{a_(i-1)*k+1,a_(i-1)*k+2,…,a_i*k}, calculate the following two variables:”; [0012]: “X_i=min{a_(i-1)*k+1,a_(i-1)*k+1,L,a_i*k}”; [0013]: “Y_i=max{a_(i-1)*k+1,a_(i-1)*k+1,L,a_i*k}-X+2”; [0014]: “Calculate the compression result R_i of segment S_i.”; [0016]: “Convert the compressed result R_i into the binary string BR_i”; examiner interprets the compressed segment as being functionally equivalent to the claimed “abbreviated data split”); and
sending abbreviated data, wherein the abbreviated data comprises the abbreviated data split (see [0018]: “Output BR₁, BR₂, ..., BR_m in order”).

Regarding claim 9, the claim contains the limitations, substantially as claimed, as described in claim 1 above. Examiner notes that claim 1 describes a method whereas claim 9 describes an electronic device. Xu disclosed, as recited in claim 9: An electronic device, comprising a processor, a memory, and a computer-executable instruction that is stored in the memory and executable on the processor (see [0007]: “…The method retransmits the Application Layer Data Units (APDUs) in the DL/T698.45-2017 interoperability data exchange communication protocol between the master station and the wide-area energy metering terminal using lossless data compression, thereby improving data transmission performance…”; examiner notes that the master station and terminal inherently include processor, memory, and instructions), wherein the computer-executable instruction, when executed, causes the electronic device to execute (see [0008]: “…This method converts various transmission message texts into binary strings, treats each byte of the binary string as an unsigned integer, calculates the optimal number of segments, and uses a segmented integer compression method to compress all integers into a single large integer, represented as a binary string. The integers are then encoded, significantly reducing the length of the output string…”):
acquiring original data (see [0008]: “…This method converts various transmission message texts into binary strings…”);
performing a binary conversion on the original data to obtain binary data (see [0008]: “…This method converts various transmission message texts into binary strings…”);
scanning the binary data, matching the binary data with the preset rule, and separating binary data that is successfully matched with the preset rule into a data split (see [0008]: “…This method converts various transmission message texts into binary strings, treats each byte of the binary string as an unsigned integer, calculates the optimal number of segments, and uses a segmented integer compression method to compress all integers into a single large integer, represented as a binary string …”; [0009]: “Convert the input binary string into an integer sequence S = {a₁, a₂, ..., a_n}”; [0010]: “Divide S into m segments S₁, S₂, ..., S_m, i.e. S₁＝{a₁,a₂, ...,a_k}, S_i＝{a_(i-1)*k+1,a_(i-1)*k+2, ...,a_i*k}, S_m＝{a_(m-1)*k+1,a_(m-1)*k+2, ...,a_n}”; examiner notes that the size of the fragment (i.e. one byte) is interpreted as being functionally equivalent to the claimed “preset rule” and that each segment is interpreted as being functionally equivalent to the claimed “data split”);
abbreviating the data split to obtain an abbreviated data split (see [0008]: “…uses a segmented integer compression method to compress all integers into a single large integer, represented as a binary string. The integers are then encoded, significantly reducing the length of the output string…”; [0011]: “For each segment S_i＝{a_(i-1)*k+1,a_(i-1)*k+2,…,a_i*k}, calculate the following two variables:”; [0012]: “X_i=min{a_(i-1)*k+1,a_(i-1)*k+1,L,a_i*k}”; [0013]: “Y_i=max{a_(i-1)*k+1,a_(i-1)*k+1,L,a_i*k}-X+2”; [0014]: “Calculate the compression result R_i of segment S_i.”; [0016]: “Convert the compressed result R_i into the binary string BR_i”; examiner interprets the compressed segment as being functionally equivalent to the claimed “abbreviated data split”); and
sending abbreviated data, wherein the abbreviated data comprises the abbreviated data split (see [0018]: “Output BR₁, BR₂, ..., BR_m in order”).

Regarding claim 17, the claim contains the limitations, substantially as claimed, as described in claim 1 above. Examiner notes that claim 1 describes a method whereas claim 17 describes a non-transitory computer-readable storage medium. Xu disclosed, as recited in claim 17: A non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores a computer instruction (see [0007]: “…The method retransmits the Application Layer Data Units (APDUs) in the DL/T698.45-2017 interoperability data exchange communication protocol between the master station and the wide-area energy metering terminal using lossless data compression, thereby improving data transmission performance…”; examiner notes that the master station and terminal inherently include processor, memory, and instructions), and the computer instruction, when executed on a communication device, causes the electronic device to execute (see [0008]: “…This method converts various transmission message texts into binary strings, treats each byte of the binary string as an unsigned integer, calculates the optimal number of segments, and uses a segmented integer compression method to compress all integers into a single large integer, represented as a binary string. The integers are then encoded, significantly reducing the length of the output string…”), comprising:
acquiring original data (see [0008]: “…This method converts various transmission message texts into binary strings…”);
performing a binary conversion on the original data to obtain binary data (see [0008]: “…This method converts various transmission message texts into binary strings…”);
scanning the binary data, matching the binary data with the preset rule, and separating binary data that is successfully matched with the preset rule into a data split (see [0008]: “…This method converts various transmission message texts into binary strings, treats each byte of the binary string as an unsigned integer, calculates the optimal number of segments, and uses a segmented integer compression method to compress all integers into a single large integer, represented as a binary string …”; [0009]: “Convert the input binary string into an integer sequence S = {a₁, a₂, ..., a_n}”; [0010]: “Divide S into m segments S₁, S₂, ..., S_m, i.e. S₁＝{a₁,a₂, ...,a_k}, S_i＝{a_(i-1)*k+1,a_(i-1)*k+2, ...,a_i*k}, S_m＝{a_(m-1)*k+1,a_(m-1)*k+2, ...,a_n}”; examiner notes that the size of the fragment (i.e. one byte) is interpreted as being functionally equivalent to the claimed “preset rule” and that each segment is interpreted as being functionally equivalent to the claimed “data split”);
abbreviating the data split to obtain an abbreviated data split (see [0008]: “…uses a segmented integer compression method to compress all integers into a single large integer, represented as a binary string. The integers are then encoded, significantly reducing the length of the output string…”; [0011]: “For each segment S_i＝{a_(i-1)*k+1,a_(i-1)*k+2,…,a_i*k}, calculate the following two variables:”; [0012]: “X_i=min{a_(i-1)*k+1,a_(i-1)*k+1,L,a_i*k}”; [0013]: “Y_i=max{a_(i-1)*k+1,a_(i-1)*k+1,L,a_i*k}-X+2”; [0014]: “Calculate the compression result R_i of segment S_i.”; [0016]: “Convert the compressed result R_i into the binary string BR_i”; examiner interprets the compressed segment as being functionally equivalent to the claimed “abbreviated data split”); and
sending abbreviated data, wherein the abbreviated data comprises the abbreviated data split (see [0018]: “Output BR₁, BR₂, ..., BR_m in order”).

Allowable Subject Matter
Claims 2-8, 10-16, and 18-20 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims.

The following is a statement of reasons for the indication of allowable subject matter:
With respect to claims 2, 10, and 18, the prior arts of record, singly or in combination, fail to teach the features of claim(s) limitations thereof. Specifically, inter alia, it fails to teach a method, an electronic device, and a non-transitory computer-readable storage medium incorporating the claimed details of the preset rule into the details of the independent claims 1, 9, and 17, such that “the preset rule is that a data split consists of identical binary symbols and a number of the identical binary symbols is greater than a preset number, and wherein matching the binary data with the preset rule, and separating the binary data that is successfully matched with the preset rule into the data split comprises: acquiring a first binary data section, wherein the first binary data section consists of a plurality of identical binary symbols, and a binary symbol is 0 or 1; determining that the first binary data section is successfully matched with the preset rule in response to a number of the identical binary symbols in the first binary data section being greater than the preset number; and determining the first binary data section as the data split”.
Claims 3-8, 11-16, and 19-20 are also objected to based on their dependency on either claim 2, 10, or 18.

Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to Angela Widhalm de Rodriguez whose telephone number is [phone]. The examiner can normally be reached M-F: 6am-2:30pm EST.
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, Nicholas Taylor can be reached at [phone]. 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.

/ANGELA WIDHALM DE RODRIGUEZ/Examiner, Art Unit 2443

Prosecution Timeline

• May 17, 2024: Application Filed
• Jun 16, 2026: Non-Final Rejection mailed — §102 (current)