Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
DETAILED ACTION
Allowable Subject Matter
1a. Claims 2-4 and 7-9 are objected to as dependent upon rejected claims, but would be allowable if rewritten in independent form including all the limitations of the base claim and any intervening claims.
Claim Rejections - 35 USC § 103
2. 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.
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 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.
2a. Claims 1 and 5-6 are rejected under 35 U.S.C. 103 as being unpatentable over Wu (US 20240007226 A) in view of Lee (US 20250016802 A1).
2b. Summary of the Cited Prior Art
Wu discloses a method for distributed transmission in a network.
Lee discloses a method for stream segmentation in data communication.
2c. Claim Analysis
Regarding Claim 1, Wu discloses:
An information bit stream distribution device (Fig 5, 500) comprising processing circuitry (Fig 5, Circuitries 501-520) to acquire an information bit stream (Fig 5, Information Source 501, input) having a valid bit stream including transmission data (Fig 5, Information Source 501, output, Data B(0)–B(k-1)) and an invalid bit stream including dummy data,
to extract (Fig 5, Split 502), from the transmission data (Fig 5, Information Source 501, output, Data B(0) – B(k-1)) included in the valid bit stream of the information bit stream (Fig 5, Information Source 501, input) acquired, transmission data whose number of bits is represented by sb as first transmission data (Fig 5, Split 502, output, B(0)-B(i-1); Examiner’s Note: sb = B(0)-B(i-1)), and to output (Fig 5, Split 502, output), as a first information bit stream (Fig 5, Split 502, output, B(0)-B(i-1) in which the first transmission data is transmitted at a first speed (see: [0047] In 5G NR specifications, user data may be coded using quasi-cyclic low-density parity check (LDPC) with two different base graphs: one base graph for large code blocks and/or high code rates, while the other base graph is used otherwise. Examiner’s Note: high code date rates may function as a first speed);
an information bit stream (Fig 5, Split 502, output) having a valid bit stream including the first transmission data (Fig 5, Split 502, output, B(0)-B(i-1)) and an invalid bit stream including dummy data, and
to extract (Fig 5, Split 502), from the transmission data (Fig 5, Information Source 501, output, Data B(0) – B(k-1)) included in the valid bit stream of the information bit stream (Fig 5, Information Source 501, input) acquired, transmission data, whose number of bits is represented by st (Fig 5, Split 502 output, B(i)-B(k-1); Examiner’s Note: st = B(i)-B(k-1)), other than the first transmission data as second transmission data, and to output (Fig 5, Split 502, output), as a second information bit stream (Fig 5, Split 502, output, B(i)-B(k-1) in which the second transmission data is transmitted at a second speed (see: [0047] In 5G NR specifications, user data may be coded using quasi-cyclic low-density parity check (LDPC) with two different base graphs: one base graph for large code blocks and/or high code rates, while the other base graph is used otherwise. Examiner’s Note: base code date rates may function as a second speed);
an information bit stream (Fig 5, Split 502, output) having a valid bit stream including the second transmission data (Fig 5, Split 502, output, B(i)-B(k-1)) and an invalid bit stream including dummy data;
wherein the number sb is determined according to the first speed at which the first transmission data is transmitted (see: [0047] In 5G NR specifications, user data may be coded using quasi-cyclic low-density parity check (LDPC) with two different base graphs: one base graph for large code blocks and/or high code rates, while the other base graph is used otherwise. Examiner’s Note: the number sb may be a large code blocks with high code date rates);
the number st is determined according to the second speed at which the second transmission data is transmitted (see: [0047] In 5G NR specifications, user data may be coded using quasi-cyclic low-density parity check (LDPC) with two different base graphs: one base graph for large code blocks and/or high code rates, while the other base graph is used otherwise. Examiner’s Note: the number st may be a base code blocks with base code date rates);
the number sb increases as the first speed increases (see: [0047] …. user data may be coded using quasi-cyclic low-density parity check (LDPC) with two different base graphs: one base graph for large code blocks and/or high code rates, while the other base graph is used otherwise. Examiner’s Note: the number sb increase accordingly when code date rates increase) and
the number st increases as the second speed increases (see: [0047] …. user data may be coded using quasi-cyclic low-density parity check (LDPC) with two different base graphs: one base graph for large code blocks and/or high code rates, while the other base graph is used otherwise. Examiner’s Note: the number st increase accordingly when code date rates increase).
Wu does not elaborate about an invalid bit stream including dummy data.
However, Lee discloses stream header data as an invalid bit stream including dummy data.
An information bit stream distribution device (Fig 1B) comprising processing circuitry (Fig 1B) to acquire an information bit stream (Fig 3, 320 PDCP Packet) having a valid bit stream including transmission data (Fig 3, 320 PDCP SDU Data part) and an invalid bit stream including dummy data (Fig 3, 320 PDCP HEADER Part; Examiner’s Note: a header may function as dummy data);
an information bit stream having a valid bit stream (Fig 3, RLC PDU 325) including the first transmission data (Fig 3, RLC SDU 325, Data Part may function as a first transmission data) and an invalid bit stream including dummy data (Fig 3, RLC HEADER 325, Examiner’s Note: a header may function as dummy data), and
an information bit stream having a valid bit stream (Fig 3, RLC PDU 325) including the second transmission data (Fig 3, RLC SDU 325, Data Part may function as a second transmission data) and an invalid bit stream including dummy data (Fig 3, RLC HEADER 325, Examiner’s Note: a header may function as dummy data).
Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to integrate Wu’s method for distributed transmission in a network with Lee’s method for stream segmentation in data communication with the motivation being to improve the service coverage of a device (Lee, [0004]).
Regarding Claim 5, the method claim discloses similar features as of Claim 1, and is rejected accordingly.
Regarding Claim 6, the decoding claim discloses similar features as of Claim 1, and is rejected accordingly. Further, Claim 6 discloses the same operations of Claim 1 but are performed by a decoder.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to Jung-Jen Liu whose telephone number is 571-270-7643. The examiner can normally be reached on Monday to Friday, 9:00 AM to 5:00 PM.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Kwang B. Yao can be reached on 571-272-3182. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/JUNG LIU/Primary Examiner, Art Unit 2473
Prosecution Insights