Prosecution Insights
Last updated: November 04, 2026
Application No. 19/635,277

SPREAD SPECTRUM SIGNAL DETECTION USING MULTIPLE SPREADING CODE CHIPS FOR DELAY COMPENSATION

Final Rejection §103
Filed
Mar 31, 2026
Priority
Jan 10, 2022 — provisional 63/298,091 +2 more
Examiner
FOTAKIS, ARISTOCRATIS
Art Unit
2633
Tech Center
2600 — Communications
Assignee
Higher Ground LLC
OA Round
2 (Final)
72%
Grant Probability
Favorable
3-4
OA Rounds
2y 4m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 72% — above average
72%
Career Allowance Rate
552 granted / 770 resolved
+9.7% vs TC avg
Strong +31% interview lift
Without
With
+30.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
32 currently pending
Career history
811
Total Applications
across all art units

Statute-Specific Performance

§101
4.5%
-35.5% vs TC avg
§103
53.9%
+13.9% vs TC avg
§102
18.5%
-21.5% vs TC avg
§112
17.3%
-22.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 770 resolved cases

Office Action

§103
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 amendment, filed September 29, 2026, with respect to the rejections of claims have been fully considered. Applicant's amendment necessitated the new grounds of rejection presented below by introducing the new reference of Pickering et al (US 6,408,019). 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. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. This application currently names joint inventors. In considering patentability of the claims the examiner presumes that the subject matter of the various claims was commonly owned as of the effective filing date of the claimed invention(s) absent any evidence to the contrary. Applicant is advised of the obligation under 37 CFR 1.56 to point out the inventor and effective filing dates of each claim that was not commonly owned as of the effective filing date of the later invention in order for the examiner to consider the applicability of 35 U.S.C. 102(b)(2)(C) for any potential 35 U.S.C. 102(a)(2) prior art against the later invention. Claims 1 – 5, 7, 11 – 15, 17 and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Giallorenzi et al (US 9,130,689) in view of Pickering et al (US 6,408,019). Re claim 1, Giallorenzi teaches of a method, comprising: receiving, by a particular device (#102, Fig.1), a random number seed (PN code seed in a beacon channel, Figures 3 – 4) transmitted from a beaconing device (#101, Fig.1) to synchronize the particular device with the beaconing device (Col 1, Lines 8 – 15); generating, by the particular device, one or more random numbers based on the random number seed (PN code, where a PN code (Pseudo-Random Noise or Pseudo-Noise code) is defined as a sequence of binary numbers that appears completely random, Col 3, Lines 39 – 45); determining, by the particular device, a spreading code associated with the one or more random numbers (PN code generator, #320, Fig.3); de-spreading, by the particular device, a received signal using the spreading code (#310, #311, Fig.3). However, Giallorenzi does not specifically teach of generating, by the particular device, a plurality of random numbers based on the random number seed; determining, by the particular device, a plurality of spreading code chips associated with the one or more random numbers, the plurality of spreading code chips including a current spreading code chip and a previous spreading code chip. Giallorenzi does not specifically teach of examining, by the particular device, the received signal as de-spread to determine whether the received signal contains symbols associated with a message. Pickering teaches of generating, by a particular device, a plurality of random numbers based on the random number seed (receive a seed 253 from which a string of random numbers or samples are generated, Col 13, Lines 23 – 40, Fig.5); determining, by the particular device, a plurality of spreading code chips (noise segments, #226, Fig.3), each spreading code chip being a spreading code associated with a respective random number of the plurality of random numbers (single noise segment, Col 13, Lines 23 – 40, Fig.5), the plurality of spreading code chips including a current spreading code chip and a previous spreading code chip (as shown in Fig.3); de-spreading, by the particular device, a received signal using the current spreading code chip and the previous spreading code chip (noise demodulator, Fig.2); and examining, by the particular device, the received signal as de-spread to determine whether the received signal contains symbols associated with a message (The correlation function reveals whether a received noise segment matches a current noise segment in the correlator 213 at any given time, Col 11, Lines 35 – 50). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have determined a plurality of spreading code chips associated with a plurality random numbers that are based on the random number seed for interference resistance, secure communications, and multiple-user access. It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have detected the despread symbols for maximized processing gain. Re claim 11, Giallorenzi teaches of an apparatus configured to: receive, by a particular device (#102, Fig.1), a random number seed (PN code seed in a beacon channel, Figures 3 – 4) transmitted from a beaconing device (#101, Fig.1); generating, by the particular device, one or more random numbers based on the random number seed (PN code, where a PN code (Pseudo-Random Noise or Pseudo-Noise code) is defined as a sequence of binary numbers that appears completely random, Col 3, Lines 39 – 45); determining, by the particular device, a spreading code associated with the one or more random numbers (PN code generator, #320, Fig.3); de-spreading, by the particular device, a received signal using the spreading code (#310, #311, Fig.3). However, Giallorenzi does not specifically teach of generating, by the particular device, a plurality of random numbers based on the random number seed; determining, by the particular device, a plurality of spreading code chips associated with the one or more random numbers, the plurality of spreading code chips including a current spreading code chip and a previous spreading code chip. Giallorenzi does not specifically teach of examining, by the particular device, the received signal as de-spread to determine whether the received signal contains symbols associated with a message. Giallorenzi does not specifically teach of the apparatus, comprising: a processor configured to execute one or more processes; a communication interface; and a memory configured to store a process executable by the processor that when executed is configured to perform the method. Pickering teaches of an apparatus, comprising: a processor configured to execute one or more processes (#153, Fig.1); a communication interface (from #143, Fig.1); and a memory configured to store a process executable by the processor that when executed (#156, Fig.1) is configured to: generate, by a particular device, a plurality of random numbers based on the random number seed (receive a seed 253 from which a string of random numbers or samples are generated, Col 13, Lines 23 – 40, Fig.5); determine, by the particular device, a plurality of spreading code chips (noise segments, #226, Fig.3), each spreading code chip being a spreading code associated with a respective random number of the plurality of random numbers (single noise segment, Col 13, Lines 23 – 40, Fig.5), the plurality of spreading code chips including a current spreading code chip and a previous spreading code chip (as shown in Fig.3); de-spread, by the particular device, a received signal using the current spreading code chip and the previous spreading code chip (noise demodulator, Fig.2); and examine, by the particular device, the received signal as de-spread to determine whether the received signal contains symbols associated with a message (The correlation function reveals whether a received noise segment matches a current noise segment in the correlator 213 at any given time, Col 11, Lines 35 – 50). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have determined a plurality of spreading code chips associated with a plurality random numbers that are based on the random number seed for interference resistance, secure communications, and multiple-user access. It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have detected the despread symbols for maximized processing gain. It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have the device comprise a processor and a memory configured to store program instructions to be executed by the processor for advanced signal processing. Re claims 2 and 12, Giallorenzi and Pickering teach all the limitations of claims 1 and 11, as well as Pickering teaches of wherein the previous spreading code chip is associated with a previous random number (each spreading code chip is associated with a corresponding random number, Fig.5). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have the previous spreading code chip be associated with a previous random number for efficient spectrum spreading. Re claims 3 and 13, Giallorenzi and Pickering teach all the limitations of claims 1 and 11, as well as Pickering teaches of wherein de-spreading comprises: attempting to decode the received signal using each of the plurality of spreading code chips (#213, Fig.2). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have decoded the received signal using each of the plurality of spreading code chips so as to recover signal data. Re claims 4 and 14, Giallorenzi and Pickering teach all the limitations of claims 1 and 11, as well as Pickering teaches of wherein the plurality of spreading code chips further includes one or more additional previous spreading code chips (a number of subsequent chips of the PN code, #216, Fig.3). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have the plurality of spreading code chips further include one or more additional previous spreading code chips so as to form the PN code sequence. Re claims 5 and 15, Giallorenzi and Pickering teach all the limitations of claims 1 and 11, as well as Pickering teaches of wherein determining the plurality of spreading code chips comprises using each random number of the plurality of random numbers as an entry into a chip table that associates each of a plurality of random numbers with a respective spreading code chip, thereby selecting the respective spreading code chip associated with that random number (Record indexer, Fig.2 and Col 13, Lines 23 – 67). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have determined the plurality of spreading code chips comprises using each random number of the plurality of random numbers as an entry into a chip table for reduced processing and faster acquisition. Re claims 7 and 17, Giallorenzi and Pickering teach all the limitations of claims 1 and 11, as well as Pickering further teaches of comprising: detecting a symbol in the received signal as de-spread (a peak output when the segments match, Abstract and Col 11, Lines 35 – 65). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have detected a symbol in the received signal as de-spread for efficient receiver performance. Re claim 20, Giallorenzi teaches of a method, comprising: receiving, by a particular device (#102, Fig.1), a random number seed (PN code seed in a beacon channel, Figures 3 – 4) transmitted from a beaconing device (#101, Fig.1) to synchronize the particular device with the beaconing device (Col 1, Lines 8 – 15); generating, by the particular device, one or more random numbers based on the random number seed (PN code, where a PN code (Pseudo-Random Noise or Pseudo-Noise code) is defined as a sequence of binary numbers that appears completely random, Col 3, Lines 39 – 45); determining, by the particular device, a spreading code associated with the one or more random numbers (PN code generator, #320, Fig.3); de-spreading, by the particular device, a received signal using the spreading code (#310, #311, Fig.3). However, Giallorenzi does not specifically teach of generating a plurality of random numbers based on the random number seed; determining a plurality of spreading code chips associated with the one or more random numbers, the plurality of spreading code chips including a current spreading code chip and a previous spreading code chip. Giallorenzi does not specifically teach of examining the received signal as de-spread to determine whether the received signal contains symbols associated with a message. Giallorenzi does not specifically teach of a tangible, non-transitory, computer-readable medium storing program instructions that cause a computer of a particular device to execute the method. Pickering teaches of a tangible, non-transitory, computer-readable medium storing program instructions that cause a computer of a particular device to execute a method (Col 7, Lines 40 – 55) comprising: generating, by a particular device, a plurality of random numbers based on the random number seed (receive a seed 253 from which a string of random numbers or samples are generated, Col 13, Lines 23 – 40, Fig.5); determining, by the particular device, a plurality of spreading code chips (noise segments, #226, Fig.3), each spreading code chip being a spreading code associated with a respective random number of the plurality of random numbers (single noise segment, Col 13, Lines 23 – 40, Fig.5), the plurality of spreading code chips including a current spreading code chip and a previous spreading code chip (as shown in Fig.3); de-spreading, by the particular device, a received signal using the current spreading code chip and the previous spreading code chip (noise demodulator, Fig.2); and examining, by the particular device, the received signal as de-spread to determine whether the received signal contains symbols associated with a message (The correlation function reveals whether a received noise segment matches a current noise segment in the correlator 213 at any given time, Col 11, Lines 35 – 50). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have determined a plurality of spreading code chips associated with a plurality random numbers that are based on the random number seed for interference resistance, secure communications, and multiple-user access. It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have detected the despread symbols for maximized processing gain. It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have a non-transitory computer-readable medium storing computer-executable instructions for its storage capacity, portability, where data cannot be changed and for preventing accidental erasure of programs or files. Claims 6 and 16 are rejected under 35 U.S.C. 103 as being unpatentable over Giallorenzi and Pickering in view of Kalkunte et al (US 2017/0366219). Re claims 6 and 16, Giallorenzi and Pickering teach all the limitations of claims 1 and 11, except of wherein the received signal is transmitted from a remote device via a satellite. Kalkunte teaches of wherein the received signal is transmitted from a remote device via a satellite (Paragraph 0079). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have the received signal transmitted from a remote device via a satellite to perform satellite communication. Claim 8 is rejected under 35 U.S.C. 103 as being unpatentable over Giallorenzi and Pickering in view of Fay (US 2016/0218829). Re claim 8, Giallorenzi and Pickering teach all the limitations of claim 7, except of further comprising: determining whether the symbol signifies an end of a communication. Fay teaches of determining whether the symbol signifies an end of a communication. It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have determined whether the symbol signifies an end of a communication so as to successfully decode the next communication frame. Claims 9 and 18 are rejected under 35 U.S.C. 103 as being unpatentable over Giallorenzi and Pickering in view of Rose et al (US 2008/0263117). Re claims 9 and 18, Giallorenzi and Pickering teach all the limitations of claims 1 and 11, as well as Pickering teaches of wherein the random number seed is dynamically updated (Col 13, Lines 64 – 67). Giallorenzi and Pickering do not specifically mention of wherein the random number seed is periodically updated. Rose teaches of a random number seed is periodically updated (periodically reseed, Paragraph 0046). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have the random number seed be periodically updated to guarantee reliable communication. Claims 10 and 19 are rejected under 35 U.S.C. 103 as being unpatentable over Giallorenzi and Pickering in view of Shaffer et al (US 2019/0068239). Re claims 10 and 19, Giallorenzi and Pickering teach all the limitations of claims 1 and 11, except of wherein the particular device is a ground station. Shaffer teaches of having a particular device be a ground station (Figures 1 and 3, Paragraph 0097). It would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have the particular device be a ground station to communicate with satellites. 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 ARISTOCRATIS FOTAKIS whose telephone number is (571)270-1206. The examiner can normally be reached M-F 8:30am-5:00pm. 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, Sam K Ahn can be reached at (571) 272-3044. 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. /ARISTOCRATIS FOTAKIS/ Primary Examiner, Art Unit 2633
Read full office action

Prosecution Timeline

Mar 31, 2026
Application Filed
Jun 29, 2026
Non-Final Rejection mailed — §103
Sep 29, 2026
Response Filed
Oct 20, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12785750
TRANSMISSION SYSTEM AND TRANSMISSION METHOD FOR TRANSMITTING DATA AND ENERGY VIA A TWO-WIRE LINE
2y 8m to grant Granted Nov 03, 2026
Patent 12786030
DISCRETE FOURIER TRANSFORM PRE-CODED PHYSICAL DOWNLINK CONTROL CHANNEL WITH CODE DOMAIN MULTIPLEXING
1y 8m to grant Granted Nov 03, 2026
Patent 12756448
MULTI-BEAM COMMUNICATIONS USING RECEIVER ASSISTANCE INFORMATION
2y 5m to grant Granted Oct 06, 2026
Patent 12726960
CARRIER AGGREGATION GROUPING BASED ON USER LOCATION IN 5G NR MASSIVE MIMO BEAMFORMING NETWORK
2y 8m to grant Granted Sep 01, 2026
Patent 12719548
LOCALIZATION SYSTEM AND OPERATING METHOD
3y 8m to grant Granted Aug 25, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

3-4
Expected OA Rounds
72%
Grant Probability
99%
With Interview (+30.8%)
2y 11m (~2y 4m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 770 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month