DETAILED ACTION
Status of Claims
Claims 1, 11, 20, are amended.
Claims 1-20 are pending.
Continued Examination Under 37 CFR 1.114
A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on 02/04/2026 has been entered.
Priority
Applicant’s claim for the benefit of a prior-filed application filed in PRO 63/327664 on 04/05/2022 under 35 U.S.C. 119(e) or under 35 U.S.C. 120, 121, 365(c), or 386(c) is acknowledged.
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-20 are rejected under 35 U.S.C. 103 as being unpatentable over Huang (US 20050254560) in view of Neugebauer (US 20090290660).
Regarding Claim 1, Huang teaches the following limitations:
A system, comprising: a correlation engine; and (Huang – [0012] the correlation engine for accumulating a plurality of in-phase correlations to produce an in-phase coherent integration,)
a first input sample memory operatively coupled to the correlation engine, (Huang – [Claim 1] a correlation engine comprised of a plurality of partial correlation modules connected to the first memory)
the correlation engine comprising a channel selection controller and (Huang – [Fig. 1], [Fig. 4] C/A code selection, [0036] The decimator 206 is driven by the NCO 204 through a timing controller 208 to generate an in-phase signal I2 and a quadrature signal Q2, and I2 and Q2 have a lower data rate than I1 and Q1. For example, I1 and Q1 have a nominal data rate of 8 samples/chip, while the data rate of I2 and Q2 can be 2 (or 4) samples/chip. In addition, the decimator 206 also takes Doppler shift compensation into consideration. [0043] FIG. 4 illustrates the architecture of the correlation engine 300 according to the present invention. As show in FIG. 4, the correlation engine 300 comprises serial-to-parallel (S/P) converters 302A, 302B connected to the decimator 206 for grouping a plurality of samples into a word, RAM buffers 304A, 304B with a data width capable of storing the word, a plurality of partial correlation (ParCor) modules 330 for calculating a partial correlation between the word and a PN code segment, and an PN code LUT ROM 306 for storing the PN codes.)
being configured, under the control of the channel selection controller: to calculate, during a first execution interval, a correlation corresponding to a first channel, the first channel having a first context length defining a first amount of data processed during the calculation corresponding to the first channel; and (Huang – [0036], [0005] The PN code used in the spread-spectrum signal of the GPS has a length of 1023 chips with the period of 1 msec. [0032] The present invention will be described in detail below as being applied to the GPS, and one skilled in the art shall appreciate that the application of the present invention is not limited to the GPS system. [0033] an acquisition apparatus 200 for acquiring the GPS signal and a plurality of tracking modules 500 for tracking the GPS signal. The digitized IF output from the RF front-end 104 may be 1 to 4 bits per sample; 1 bit output is used in paragraphs below for illustration purposes.)
to calculate, during the first execution interval, a correlation corresponding to a second channel, the second channel having a second context length, different from the first context length, (Huang – [0036], [0044] The 16-bit words are to be written to the 128 word-by-16-bit RAM buffers 304A, 304B (or a single 128 word-by-32-bit RAM buffer), which serves the purpose of the sample delay line in FIG. 3.) Huang does not explicitly teach “different context lengths”.)
the second context length defining a second amount of data, different from the first amount of data, processed during the calculation of the correlation corresponding to the second channel. (Huang – [0005], [0032], [0033], [0036], [0044])
Huang does not explicitly teach the following limitations, however Neugebauer, in the same field of endeavor, teaches:
different context length (Neugebauer – [0060] alternative PN sequence of similar or dissimilar length that indicates a frame timing boundary.)
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to have modified the correlation engine of Huang with the different frame lengths of Neugebauer in order to perform frame synchronization. (Neugebauer – [0006]).
Regarding Claims 2, 12, Huang further teaches:
further comprising a second input sample memory operatively coupled to the correlation engine. (Huang – [Fig. 4], [0043])
Regarding Claims 3, 13, Huang further teaches:
wherein the first channel is configured to process samples from the first input sample memory and (Huang – [Fig. 4], [0043])
the second channel is configured to process samples from the second input sample memory. (Huang – [Fig. 4], [0043])
Regarding Claims 4, 14, Huang further teaches:
further comprising a Global Navigation Satellite System front end processor, configured to store samples in the first input sample memory and in the second input sample memory. (Huang – [Fig. 4], [0043] a plurality of partial correlation (ParCor) modules 330 for calculating a partial correlation between the word and a PN code segment, and an PN code LUT ROM 306 for storing the PN codes.)
Regarding Claims 5, 15, Huang further teaches:
wherein the channel selection controller is configured to select a third channel, to be executed after the second channel, the selecting being based on a code phase of the third channel. (Huang – [Fig. 4], [0043], [0032] The process of position measurement in a GPS receiver involves a two-dimensional search of finding the exact code phase of the incoming PN code and carrier frequency residual of the signal. A GPS receiver steps through each possible frequency and checks each possible code phase by correlating the incoming carrier de-rotated signal with a self-generated PN code (also referred to as C/A code) phase delayed in half-chip increments, for a duration of one PN code period of one millisecond. If the value of the correlation result is larger than a programmed threshold, the signal is detected and the amount of delay introduced in the PN code corresponds to the arrival time of the GPS signal.)
Regarding Claims 6, 16, Huang further teaches:
wherein the selecting is further based on a size of an input sample memory, of the first input sample memory and the second input sample memory, associated with the third channel. (Huang – [0044] I2 and Q2 with 2.046E6-samples/sec (2 Fo) from the decimator 206 are grouped into 16-bit words by the S/P converters 302A, 302B, respectively, with data rate lowered to Fo/8, or one output every 8-chip period. The 16-bit words are to be written to the 128 word-by-16-bit RAM buffers 304A, 304B (or a single 128 word-by-32-bit RAM buffer), which serves the purpose of the sample delay line in FIG. 3.)
Regarding Claim 7, 17, Huang further teaches:
wherein the selecting is further based on a context length of the third channel. (Huang – [Fig. 4], [0043] Huang does not explicitly teach “different context lengths”.)
Huang does not explicitly teach the following limitations, however Neugebauer, in the same field of endeavor, teaches:
different context length (Neugebauer – [0060] alternative PN sequence of similar or dissimilar length that indicates a frame timing boundary.)
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to have modified the correlation engine of Huang with the different frame lengths of Neugebauer in order to perform frame synchronization. (Neugebauer – [0006]).
Regarding Claim 8, Huang further teaches:
the correlation engine further comprises a sequencer; and (Huang – [Fig. 4], [0044] The 16-bit words are to be written to the 128 word-by-16-bit RAM buffers 304A, 304B (or a single 128 word-by-32-bit RAM buffer), which serves the purpose of the sample delay line in FIG. 3. An address generation unit (AGU) 308 generates address pointers for the RAM buffers 304A, 304B and the LUT ROM 306.)
the channel selection controller is further configured to forward information for the third channel to the sequencer. (Huang – [Fig. 4], [0044])
Regarding Claims 9, 18, Huang further teaches:
wherein the channel selection controller is configured to select, during the execution of the third channel, a fourth channel to be executed after the third channel. (Huang – [Fig. 4], [0032], [0042] I3 and Q3 outputs… A conventional 12-channel, 48 serial-correlator design generates 24 half-chip-spaced correlation points every millisecond.)
Regarding Claim 10, 19, Huang further teaches:
wherein the correlation engine is further configured to execute, during the first execution interval, a third channel, (Huang – [Fig. 4], [0042], [0043])
the third channel having a third context length, different from the first context length and different from the second context length. (Huang – [Fig. 4], [0042], [0043] Huang does not explicitly teach “different context lengths”.)
Huang does not explicitly teach the following limitations, however Neugebauer, in the same field of endeavor, teaches:
different context length (Neugebauer – [0060] alternative PN sequence of similar or dissimilar length that indicates a frame timing boundary.)
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to have modified the correlation engine of Huang with the different frame lengths of Neugebauer in order to perform frame synchronization. (Neugebauer – [0006]).
Regarding Claim 11, Huang teaches the following limitations:
A method, comprising: (Huang – [0004])
calculating, by a correlation engine operatively coupled to a first input sample memory, (Huang – [Claim 1])
during a first execution interval, a correlation corresponding to a first channel, the first channel having a first context length defining a first amount of data processed during the calculation of the correlation corresponding to the first channel; and (Huang – [0005], [0032], [0033], [0036])
calculating, by the correlation engine, during the first execution interval, a correlation corresponding to a second channel, the second channel having a second context length, different from the first context length, (Huang – [0036], [0044]) Huang does not explicitly teach “different context lengths”.)
the second context length defining a second amount of data, different from the first amount of data, processed during the calculation of the corresponding to the second channel. (Huang – [0005], [0032], [0033], [0036], [0044])
Huang does not explicitly teach the following limitations, however Neugebauer, in the same field of endeavor, teaches:
different context length (Neugebauer – [0060] alternative PN sequence of similar or dissimilar length that indicates a frame timing boundary.)
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to have modified the correlation engine of Huang with the different frame lengths of Neugebauer in order to perform frame synchronization. (Neugebauer – [0006]).
Regarding Claim 20, Huang teaches the following limitations:
A system, comprising: (Huang – [0012])
means for correlating; and a first input sample memory operatively coupled to the means for correlating, the means for correlating being configured: (Huang – [Claim 1])
to calculate, during a first execution interval, a correlation corresponding to a first channel, the first channel having a first context length defining a first amount of data processed during the calculation of the corresponding to the first channel; and (Huang – [0005], [0032], [0033], [0036])
to calculate, during the first execution interval, a correlation corresponding to a second channel, the second channel having a second context length, different from the first context length, (Huang – [0036], [0044] Huang does not explicitly teach “different context lengths”.)
the second context length defining a second amount of data, different from the first amount of data, processed during the calculation of the correlation corresponding to the second channel. (Huang – [0005], [0032], [0033], [0036], [0044])
Huang does not explicitly teach the following limitations, however Neugebauer, in the same field of endeavor, teaches:
different context length (Neugebauer – [0060] alternative PN sequence of similar or dissimilar length that indicates a frame timing boundary.)
Therefore, it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to have modified the correlation engine of Huang with the different frame lengths of Neugebauer in order to perform frame synchronization. (Neugebauer – [0006]).
Response to Arguments
Applicant’s arguments, see Page 7, filed 02/24/2026, with respect to the rejection under 35 U.S.C. § 112(b) have been fully considered and are persuasive. The rejection under 35 U.S.C. § 112(b) has been withdrawn.
Applicant’s arguments, see Pages 7-9, filed 02/24/2026, with respect to the rejection under 35 U.S.C. § 103 regarding Claims 1, 11, 20 have been fully considered and are not persuasive. The applicant argues that “Huang and Neugebauer references have not been shown to teach, suggest, or render obvious the combination of features of amended claim 1”. The examiner disagrees, the scope of the claims has not been changed. The examiner referenced the applicant’s instant specification when mapping the limitations to the prior art. The instant specifications states “The calculating of a correlation corresponding to (e.g., defined by the parameters of) a channel may be referred to herein as "executing" the channel (by a correlation engine or by a correlation logic circuit of the correlation engine)”. Therefor changing “executing” to “calculating of a correlation corresponding to” does not change the scope of the claim and the mapping described in the previous Office Action still requires “a writing which distinctly and specifically points out the supposed errors in the examiner’s action and must reply to every ground of objection and rejection in the prior Office action” under 37 CFR 1.111(b). The applicant merely argues for a simplified interpretation of the combination of Huang and Neugebauer without addressing the citations teaching the calculation/processing of the plurality of tracking modules and the IQ channels.
Applicant’s arguments, see Page 9, filed 02/24/2026, with respect to the rejection under 35 U.S.C. § 103 have been fully considered and are not persuasive. Applicant argues that the dependent claims are allowable due to the dependency on the independent claims. As noted above, the examiner maintains Huang in view of Neugebauer teaches the independent claims and therefore the dependent claims remain rejected.
Applicant's remaining arguments amount to a general allegation that the claims define a patentable invention without specifically pointing out how the language of the claims is understandable and distinguishable from other inventions.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to BRANDON JAMES HENSON whose telephone number is (703)756-1841. The examiner can normally be reached Monday-Friday 9:00 am - 5:00 pm.
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, Resha H. Desai can be reached at (571) 270-7792. 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.
/BRANDON JAMES HENSON/Examiner, Art Unit 3648
/RESHA DESAI/Supervisory Patent Examiner, Art Unit 3648
Prosecution Insights