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
Claims 1-20 are pending. Claims 1-20 have been examined and rejected.
Claim Rejections - 35 USC § 112
The following is a quotation of 35 U.S.C. 112(b):
(b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention.
The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph:
The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention.
Claim 4, 12, and 18 rejected under 35 USC 112(b).
Claim 4 recites the limitation “the repeating of the setting” in the first limitation. There is insufficient antecedent basis for this limitation in the claim.
Claims 12 and 18 recite the same limitation. They are, hence, rejected for the same reasons.
Claim Rejections - 35 USC § 102
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)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention.
Claims 1-4, 9-12, and 15-18 are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Kasuya (US 6077304).
As per claim 1, Kasuya teaches a method comprising:
preparing, in response to a programming interface call by a testbench, a schedule of states of a signal at two or more intervals in a circuit simulation by a simulator, respectively, wherein the programming interface call specifies a sequence of the states and indicates durations of the states during the simulation (Fig. 1, col. 4 lines 39-44, col. 5 lines 10-17, lines 25-33; Kasuya teaches a testbench sending procedure calls for defining input signal waveforms to a simulator, via an API, for the simulator to prepare starting and restarting of signal waveforms; the API corresponds to a programming interface, and starting and restarting a simulation using signal waveforms read onto preparing a schedule of states of a signal at two or more intervals in a circuit simulation by a simulator as recited);
setting the signal to a first state of the sequence by the simulator during the simulation according to the schedule (col. 1 lines 25-28, col. 4 lines 39-44; Kasuya teaches a simulation engine in the simulator determines input signal waveforms received via API; this teaching means the input signal waveforms of specified inputs are set to a sequence of states, comprising at least a first state, forming waveforms); and
setting the signal to a second state of the sequence by the simulator during the simulation according to the schedule (col. 1 lines 25-28, col. 4 lines 39-44; Kasuya teaches a simulation engine in the simulator determines input signal waveforms received via API; this teaching means the input signal waveforms of specified inputs are set to a sequence of states forming waveforms, comprising at least a first state and a second states, forming waveforms).
As per claim 2, Kasuya teaches the method of claim 1, wherein the signal is a periodic signal and further comprising repeating the setting of the signal to the first state and setting of the signal to the second state (col. 6 lines 34-37; Kasuya teaches the signal is a clock, which is a periodic signal comprising repeating the setting of the signal as recited).
As per claim 3, Kasuya teaches the method of claim 2, wherein:
the programming interface call specifies a repeat-cycle time that indicates a duration between cycles of setting the signal to the first state and setting of the signal to the second state (col. 4 lines 12-24, col. 6 lines 34-37; Kasuya teaches a clock signal, which is a periodic signal with alternate logical values of 0 and 1 in a cycle, and each logical value is define at each point in time; these teachings reads onto this limitation of indication of a duration between cycles as recites); and
preparing the schedule specifies the duration between the cycles of setting the signal to the second state in one cycle and setting the signal to the first state in a next cycle (col. 4 lines 12-24, col. 6 lines 34-37; Kasuya teaches a clock signal, which is a periodic signal with alternate logical values of 0 and 1 in a cycle, and each logical value is define at each point in time, so the teaching inhere.
As per claim 4, Kasuya teaches the method of claim 1, wherein:
the programming interface call specifies a cancel time that indicates a simulation time to stop the repeating of the setting of the signal to the first state and setting of the signal to the second state (col. 10 lines 16-21; Kasuya teaches specifying simulation end to terminate the circuit simulation; this teaching means the API call specifies a cancel time indicating time to stop the repeating as recited in this limitation); and
preparing the schedule specifies the simulation time to stop the repeating of the setting of the signal to the first state and setting of the signal to the second state (col. 10 lines 16-21; Kasuya teaches specifying simulation end to terminate the circuit simulation; this teaching reads onto this limitation).
As per claim 9, Kasuya teaches a method comprising:
preparing, in response to a programming interface call by a testbench, a schedule of states of a set of signals at two or more intervals in a circuit simulation by a simulator, respectively, wherein the programming interface call specifies a sequence of values and indicates durations of the values during the simulation, and each value specifies respective states of the signals of the set of signals (Fig. 1, col. 4 lines 39-44, col. 5 lines 10-17, lines 25-33; Kasuya teaches a testbench sending procedure calls for defining input signal waveforms to a simulator, via an API, for the simulator to prepare starting and restarting of signal waveforms; the API corresponds to a programming interface, and starting and restarting a simulation using signal waveforms, corresponding to a sequence, read onto preparing a schedule of states of signals at two or more intervals in a circuit simulation by a simulator as recited);
setting the signals of the set of signals to respective first states indicated by a first value of the sequence by the simulator during the simulation according to the schedule (col. 1 lines 25-28, col. 4 lines 39-44; Kasuya teaches a simulation engine in the simulator determines input signal waveforms received via API; this teaching means the input signals’ waveforms of specified inputs are set to a sequence of states, comprising at least a first state, forming waveforms); and
setting signals of the set of signals to respective second states indicated by a second value of the sequence by the simulator during the simulation according to the schedule (col. 1 lines 25-28, col. 4 lines 39-44; Kasuya teaches a simulation engine in the simulator determines input signal waveforms received via API; this teaching means the input signal waveforms of specified inputs are set to a sequence of states forming waveforms, comprising at least a first state and a second states, forming waveforms).
As per claim 10, these limitations have already been discussed in claim 2. They are, hence, rejected for the same reasons.
As per claim 11, these limitations have already been discussed in claim 3. They are, hence, rejected for the same reasons.
As per claim 12, these limitations have already been discussed in claim 4. They are, hence, rejected for the same reasons.
As per claim 15, Kasuya teaches a system, comprising:
one or more computer processors configured to execute program code (col. 3 line 66 – col. 4 line 6); and
a memory arrangement coupled to the one or more computer processors, wherein the memory arrangement is configured with instructions that when executed by the one or more computer processors cause the one or more computer processors to perform operations (col. 3 line 66 – col. 4 line 6) including:
preparing, in response to a programming interface call by a testbench, a schedule of states of a signal at two or more intervals in a circuit simulation by a simulator, respectively, wherein the programming interface call specifies a sequence of the states and indicates durations of the states during the simulation (Fig. 1, col. 4 lines 39-44, col. 5 lines 10-17, lines 25-33; Kasuya teaches a testbench sending procedure calls for defining input signal waveforms to a simulator, via an API, for the simulator to prepare starting and restarting of signal waveforms; the API corresponds to a programming interface, and starting and restarting a simulation using signal waveforms read onto preparing a schedule of states of a signal at two or more intervals in a circuit simulation by a simulator as recited);
setting the signal to a first state of the sequence by the simulator during the simulation according to the schedule (col. 1 lines 25-28, col. 4 lines 39-44; Kasuya teaches a simulation engine in the simulator determines input signal waveforms received via API; this teaching means the input signal waveforms of specified inputs are set to a sequence of states, comprising at least a first state, forming waveforms); and
setting the signal to a second state of the sequence by the simulator during the simulation according to the schedule (col. 1 lines 25-28, col. 4 lines 39-44; Kasuya teaches a simulation engine in the simulator determines input signal waveforms received via API; this teaching means the input signal waveforms of specified inputs are set to a sequence of states forming waveforms, comprising at least a first state and a second states, forming waveforms).
As per claim 16, these limitations have already been discussed in claim 2. They are, hence, rejected for the same reasons.
As per claim 17, these limitations have already been discussed in claim 3. They are, hence, rejected for the same reasons.
As per claim 18, these limitations have already been discussed in claim 4. They are, hence, rejected for the same reasons.
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 5-8, 13-14, and 19-20 are rejected under 35 U.S.C. 103 as being unpatentable over Kasuya (US 6077304) as applied to claims 1, 9, and 15 above, and further in view of Yang et al. (US 2013/0097568).
As per claim 5, Kasuya teaches the method of claim 1,
Kasuya does not teach:
the durations of the states of the signal are specified in the programming interface call by offsets associated with the states in the sequence, respectively; and
preparing the schedule determines timing of the first state of the signal based on a current simulation time and the associated offsets, wherein the current simulation time is a simulation time at which the programming interface call made.
However, Yang teaches:
the durations of the states of the signal are specified in the programming interface call by offsets associated with the states in the sequence, respectively (¶ 0022; Yang teaches that states and durations comprising duty cycle, stop & start time of one clock are specified with offset relative to another clock signal in sequence); and
preparing the schedule determines timing of the first state of the signal based on a current simulation time and the associated offsets, wherein the current simulation time is a simulation time at which the programming interface call made (¶ 0022; Yang teaches that states and durations comprising duty cycle, stop & start time of one clock are specified with offset relative to another clock signal in sequence by API calls for simulation; this teaching indicates the preparing the schedule as recited in this limitation).
Kasuya and Yang are analogous art because they are in the same field of performing simulation of a circuit design. It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine the teachings of Kasuya and Yang. One of ordinary skill in the art would have been motivated to make such a combination because Yang’s teachings would have generated and controlled simulated clock signals in DL environment (Yang, ¶ 0002).
As per claim 6, Kasuya and Yang in combination teach the method of claim 5, further comprising:
performing the circuit simulation in response to initial input signals from the testbench (col. 9 lines 43-46; Kasuya teaches starting simulation of a circuit design using input signals);
Kasuya does not teach:
wherein preparing the schedule is in response to the programming interface call made after the simulation on the initial input signals, and the current simulation time is a simulation time at which the programming interface call made.
However, Yang teaches:
preparing the schedule is in response to the programming interface call made after the simulation on the initial input signals, and the current simulation time is a simulation time at which the programming interface call made (¶ 0022; Yang teaches that states and durations comprising duty cycle, stop & start time of one clock are specified with offset relative to another clock signal; the term “relative to” indicates that a new clock’s timing is specified with respect to an existing clock’s time, and this teaching means the current simulation time for preparing the schedule for the new clock in response to the programming interface call made after the simulation is a simulation time at which the programming interface call made).
As per claim 7, Kasuya teaches the method of claim 1,
However, Kasuya does not teach:
preparing the schedule determines timing for setting the signal to each state other than the first state in the sequence, based on the associated offset and a simulation time at which the signal is to be set to a preceding state in the sequence.
However, Yang teaches:
preparing the schedule determines timing for setting the signal to each state other than the first state in the sequence, based on the associated offset and a simulation time at which the signal is to be set to a preceding state in the sequence (¶ 0022; Yang teaches that states and durations comprising duty cycle, stop & start time of one clock are specified with offset relative to another clock signal; the term “relative to” indicates that a new clock’s timing is specified with respect to an existing clock’s time, and this teaching means the preparing the schedule for the new clock in response to the programming interface call made after the simulation is a based on time at which the programming interface call made).
Kasuya and Yang are analogous art because they are in the same field of performing simulation of a circuit design. It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine the teachings of Kasuya and Yang. One of ordinary skill in the art would have been motivated to make such a combination because Yang’s teachings would have generated and controlled simulated clock signals in DL environment (Yang, ¶ 0002).
As per claim 8, Kasuya and Yang in combination teach the method of claim 7,
Yang further teaches:
the programming interface call specifies a repeat-cycle time (¶ 0022; Yang teaches a periodic clock signal with start and stop time, corresponding to repeat -cycle time); and
preparing the schedule determines timing between setting the signal to a last state in the sequence and setting the signal to the first state in the sequence based on a simulation time of setting the signal to the last state in the sequence, offset by the repeat-cycle time (¶ 0022; Yang teaches a periodic clock signal with start and stop time and a number of cycles to run; this teaching indicates preparing the schedule determines timing between setting the signal as recited in this limitation).
As per claim 13, these limitations have already been discussed in claim 5. They are, hence, rejected for the same reasons.
As per claim 14, these limitations have already been discussed in claim 6. They are, hence, rejected for the same reasons.
As per claim 19, these limitations have already been discussed in claim 5. They are, hence, rejected for the same reasons.
As per claim 20, these limitations have already been discussed in claim 6. They are, hence, rejected for the same reasons.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to Cuong Van Luu whose telephone number is 571-272-8572. The examiner can normally be reached on Monday - Friday from 8:30 to 5:00.
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, Rehana Perveen, can be reached at telephone number (571)272-3676, 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.
/CUONG V LUU/Examiner, Art Unit 2189
/REHANA PERVEEN/Supervisory Patent Examiner, Art Unit 2189