WO2009149051A2

WO2009149051A2 - Adaptive correlation

Info

Publication number: WO2009149051A2
Application number: PCT/US2009/045916
Authority: WO
Inventors: David B. Chester; Alan J. Michaels
Original assignee: Harris Corporation
Priority date: 2008-06-02
Filing date: 2009-06-02
Publication date: 2009-12-10
Also published as: WO2009149051A3; EP2294518A2; KR20110028321A; JP2011525729A; US20090296860A1; EP2294518B1; US8064552B2; CA2726448A1; KR101253870B1

Abstract

A method is provided for correlating samples of a received signal and samples of an internally generated/stored sample sequence ("IGSSS"). The method involves performing a first iteration of a first-resolution correlation state. The first-resolution correlation state involves: selecting a first N sets of samples from the received signal; selecting a first set of samples from the IGSSS; and concurrently comparing each of the N sets of samples with the first set of samples to determine if a correlation exists between the same. If it is determined that a correlation does not exist between one of the N sets of samples and the first set of samples, then a second iteration of the first-resolution correlation state is performed. If it is determined that a correlation exists between one of the N sets of samples and the first set of samples, then a first iteration of a second-resolution correlation state is performed.

Description

ADAPTIVE CORRELATION

The invention concerns correlation techniques for use in communications systems and systems for implementing the same. More particularly, the invention concerns an accurate and efficient correlation technique for communications applications, such as synchronizing communications transmitted from transmitters to a receiver, correcting signal transmission delays, and detecting certain channel impairments (such as multipath).

In communications systems, correlation techniques are implemented in correlation devices of receivers. The correlation techniques are employed to obtain timing and phase information of a signal being transmitted from a transmitter and a signal being received at a receiver. This timing and phase information is used to correct for transmission time delays, carrier phase offsets occurring in a signal transmission process, and multiple channel paths occurring in a signal transmission process. More particularly, the timing information is used to correct for propagation time delays occurring in transmission paths. The phrase "transmission path" as used herein refers to a path between a transmitter and a receiver of a communications system that a data communications follows. The path can include, but is not limited to, a communications link existing between the transmitter and receiver. The phase information is used to correct carrier phase offsets in the transmission process.

There are many devices known in the art that implement a variety of correlation techniques. One such device is a pipelined correlator such as that shown in FIG. 1. The pipelined correlator is configured to correlate received signals in real time and at a plurality of time delays. In this regard, it should be understood that the pipelined correlator can be comprised of a plurality of delay devices, a plurality of multipliers, and a plurality of adders forming a summer. As shown in FIG. 1, samples of a received signal are communicated to the delay devices. The term "sample" as used herein refers to a quadrature digital value obtained from a continuous signal in a preceeding digital signal processing. The delay devices are configured to delay the samples in time by a pre-determined amount. Stored samples are communicated to the complex multipliers. The stored samples 1, . . ., N can be digital values obtained from a digital signal processing of a received signal or a pseudo-random number sequence.

The multipliers are configured to statically multiply a stored sample 1 , . . ., N by a real-time receive signal. In this regard, it should be understood that each multiplier is configured to compute a product utilizing complex multiply arithmetic. For example, a first multiplier is configured to multiply a stored sample N by a time delayed sample S_N of a received signal. A second multiplier is configured to multiply a stored sample N-I by a time delayed sample S_N-1, and so on. The multipliers are also configured to communicate the products of the complex multiply arithmetic to the summer. Upon receipt of the products, the summer adds the same together to obtain a correlation value. If the correlation value magnitude is less than a pre-defined threshold value, then the relative delay is deemed incorrect (i.e., the desired signal is not considered located). If the correlation value magnitude is greater than a pre-defined threshold value, then the relative delay is deemed correct (i.e., the desired signal or correlation peak has been located).

Despite the advantages of this pipelined correlation technique, it suffers from certain drawbacks. For example, this pipelined configuration is a real time process which prevents post-processing verification of the correlation index values. Once the incoming signal passes the ideal correlation peak with the stored or internally generated values, the signal can't be re-correlated. More particularly, the pipelined configuration is absent of dynamic abilities, such as an ability to change samples and an ability to double-check a suspected correlation peak. This pipelined configuration is also hardware intensive and computationally inefficient since all possible values use full length correlations. The expected number of arithmetic operations required to obtain the correlation peak increases linearly with both the uncertainty window and the correlation length. The phrase "uncertainty window" as used herein refers to the bounded temporal range that includes the minimum and maximum possible signal delay. Correlating over the entire uncertainty window is required to be certain of acquiring the signal. This pipelined configuration is further hardware intensive by requiring N dedicated or re-used multipliers. In this regard, it should be appreciated that the pipelined structure can only generate one correlation value per clock cycle. The correlation value represents the sum of all products, where the number of hardware products is the length of the correlation. In view of the forgoing, there is a need for a method and system implementing an improved efficiency correlation technique. There is also a need in the improved correlation technique to allow for verification of the correlation index values by relaxing the size of the correlation. The improved correlation technique also needs to be less hardware intensive than conventional correlation techniques. The improved correlation technique further needs to be more computationally efficient than conventional correlation techniques.

A method is provided for correlating samples of a received signal and samples of an internally generated or stored sample sequence. The method includes the step of performing a first iteration of a low-resolution correlation. The Io w- resolution correlation includes the step of selecting a first N sets of received signal samples from a received signal. The low-resolution correlation also includes the step of selecting a first set of reference samples from an internally generated or stored sample sequence. The low-resolution correlation further includes the step of concurrently correlating each of the first N sets of received signal samples with the first set of reference samples to determine if a sufficient correlation exists between the same. It should be understood that the first N sets of received signal samples and the first set of reference samples comprise the same number of samples.

If it is determined in the low-resolution correlation that a sufficient correlation exists between at least one of the first N sets of received signal samples and the first set of reference samples, then a higher-resolution correlation is performed. The higher-resolution correlation comprises the steps of: (a) selecting a second N independent sets of received signal samples from a received signal; and (b) selecting a second set of independent reference samples from the internally generated or stored sample sequence. The second N sets of received signal samples and the second set of reference samples comprise the same number of samples. The second N sets of received signal samples comprise a larger number of samples than the first N sets of received signal samples. The second N sets of received signal samples comprise samples that are of an equal relative delay in time as compared to samples contained in the second set of reference samples. The higher-resolution correlation also comprises the step of concurrently comparing each of the second N sets of received signal samples with the second set of reference samples to determine if a sufficient correlation exists between the same. If it is determined that a sufficient correlation exists between at least one of the second N sets of received signal samples and the second set of reference samples, then a correlation index value is computed.

If it is determined that a sufficient correlation does not exist between at least one of the first N sets of received signal samples and the first set of reference samples, then a next iteration of the low-resolution correlation is performed. The next iteration of the low-resolution correlation comprises the steps of: (a) selecting a second N sets of received signal samples from a received signal; and (b) a second set of reference samples from the internally generated or stored sample sequence. The second N sets of received signal samples and the second set of reference samples comprise the same number of samples. The second N sets of received signal samples comprise the same number of samples as the first N sets of received signal samples. The second N sets of received signal samples comprise samples that are delayed in time as compared to samples contained in the first N sets of received signal samples.

Embodiments will be described with reference to the following drawing figures, in which like numbers represent like items throughout the figures, and in which: FIG. 1 is a block diagram of a conventional pipelined correlator.

FIG. 2 is a block diagram of an adaptive correlation device that is useful for understanding the invention.

FIG. 3 is a conceptual diagram of a correlation process performed by the adaptive correlation device of FIG. 2. FIG. 4 is a conceptual diagram of a correlation process employing parallel processing that is performed by the adaptive correlation device of FIG. 2.

FIG. 5 is a conceptual diagram of a state based correlation process performed by the adaptive correlation device of FIG. 2. FIG. 6 is a more detailed block diagram of the adaptive correlation device implementing the correlation processes of FIG. 3 through FIG. 5.

FIG. 7 is a diagram of an exemplary embodiment of a state machine that is useful for understanding the invention.

FIG. 8 is an illustration of a correlation process performed by the adaptive correlation device of FIG. 6 during iteration I₁ of state S₁.

Referring now to FIG. 2, there is provided a diagram of an adaptive correlation device 200. The adaptive correlation device 200 can be implemented in a receiver configured to synchronize a received signal with an internally generated or stored sample sequence. The term "sample" as used herein refers to a digital value obtained from a continuous signal. It should be understood that the adaptive correlation device 200 performs actions to obtain time delay and phase shift information of the received signal relative to an internally generated or stored signal. This time delay and phase shift information is hereinafter referred to as a correlation value. The phrase "correlation peak value" as used herein refers to a relative time delay and phase shift providing a maximum correlation between a received signal and an internally generated or stored sample sequence. The phrase "correlation index value" as used herein refers to a relative delay, often measured in samples, between a received signal and an internally generated or stored sample sequence.

As should be understood, the correlation peak value and correlation index value can be communicated from the adaptive correlation device 200 to a sampling device (not shown). The sampling device (not shown) can be configured to utilize the correlation peak value and correlation index value to correct for transmission time delays occurring in a signal transmission process. More particularly, the correlation index value can be used to correct for propagation time delays occurring in a transmission path. A sequence of correlation peak values can also be used to correct for carrier frequency phase shifts occurring during transmission. The phrase "transmission path" as used herein refers to a path between a transmitter and a receiver of a communications system that a data communication follows. The path can include, but is not limited to, a communications link existing between the transmitter and the receiver.

Referring now to FIG. 3, there is provided a conceptual diagram of a correlation process that can be performed by the adaptive correlation device 200. Two (2) sufficiently large sequences of signal samples are depicted in FIG. 3. A first sequence of signal samples is from an externally received signal. A second sequence of signal samples is from an internally generated or stored signal. The first and second sequences of signal samples may be stored in internal memory, may be stored in internal buffers, and/or obtained in real-time. The correlation process includes a low-resolution correlation, a medium-resolution correlation, and a fine-resolution correlation. The phrase "low-resolution correlation" as used herein refers to a correlation between Nl samples of the received signal and Nl samples of the internally generated or stored sample sequence. The phrase "medium-resolution correlation" as used herein refers to a correlation between N2 samples of the received signal and N2 samples of the internally generated or stored sample sequence. The phrase "fine-resolution correlation" as used herein refers to a correlation between N3 samples of the received signal and N3 samples of the internally generated or stored sample sequence. The values of Nl , N2, and N3 are all integers, with N3 > N2 > Nl . The low-resolution correlation involves selecting a first set of samples A from the received signal and a first set of samples D from the internally generated or stored sample sequence. It should be noted that the sets of samples A, D contain the same number of samples. The low-resolution correlation also involves comparing the first set of samples A from the received signal with the first set of samples D from the internally generated or stored sample sequence.

If a sufficient correlation exists between the sets of samples A and D, then the medium-resolution correlation is performed. In this context, "sufficient" correlation is defined by the user as a threshold value that is compared to the correlation value obtained from sample sets A and D. It should be noted that correspondingly larger threshold values are chosen for larger sized sample sets. The medium-resolution correlation involves selecting a second set of samples B from the received signal and a second set of samples E from the internally generated or stored sample sequence. It should be noted that the second sets of samples B, E contain the same number of samples. However, the sets of samples B, E contain a larger number of samples than the first sets of samples A, D. It should also be noted that the second sets of samples B, E contain samples that are independent to the first sets of samples A, D. Upon selecting the second sets of samples B, E, the medium-resolution correlation continues with a comparison of the sets of samples B, E to determine if a sufficient correlation exists between the same.

If a sufficient correlation exists between the sets of samples B, E, then the fine-resolution correlation is performed. The fine-resolution correlation involves selecting a third set of samples C from the received signal and a third set of samples F from the internally generated or stored sample sequence. It should be noted that the third set of samples C, F contain the same number of samples. However, the sets of samples C, F contain a larger number of samples than the second sets of samples B, E. It should also be noted that the third sets of samples C, F contain samples that are independent to both the first sets of samples A, D and the second sets of samples B, E. Upon selecting the third sets of samples C, F, the fine-resolution correlation continues with a comparison of the sets of samples C, F to determine if a sufficient correlation exists between the same. If a sufficient correlation exists between the sets of samples C, F, then a correlation lock is achieved and a correlation index value is computed. It should be noted that any number of intermediate correlation steps may be utilized during this adaptive correlation process. The present invention is not limited to a coarse, medium, and fine resolution correlation. A next correlation process may begin after communicating this correlation index value to the receiver.

Whenever a correlation peak value is computed between sample sets A/D, B/E, or C/F and the correlation peak value does not exceed a pre-defined threshold value, the correlation process ends with the decision that no sufficient correlation exists. The correlation process resumes after stepping sample sets A, B, and C an integer number of samples in time and repeating the process until a sufficient correlation is found. If no correlation is determined to be sufficient, then the correlation process does not achieve a "lock". In this context, a "correlation lock" refers to proper determination of the relative delay between two (2) signals with a high degree of certainty. The correlation lock can be a false positive. Reduction of false positives is one of the benefits of adaptive correlation. The phrase "high degree of certainty" as used herein means that the likelihood of a lock being declared when the received signal timing is not approximate to that of the reference or when the received signal is not present is low and the likelihood of a correlation peak not being detected when the received signal timing is approximately equal to the reference signal is likewise low.

A person skilled in the art can appreciate that the correlation process described above in relation to FIG. 3 can still require a substantial amount of processing if serially performed for N sets of samples at different time delays.

However, a parallel processing architecture can be utilized to improve the processing time. A conceptual diagram of a correlation process implementing a parallel processing architecture is provided in FIG. 4. In the example shown, N is equal to eight (8). However, the invention is not limited in this regard. Referring now to FIG. 4, the correlation process includes a low- resolution correlation, a medium-resolution correlation, and fine -resolution correlation. The low-resolution correlation involves selecting N sets of samples from the received signal and a first set of samples from the internally generated or stored sample sequence. It should be noted that the sets of samples 1, . . ., 8, 25 contain the same number of samples. The low-resolution correlation also involves concurrently comparing each of the sets of samples 1, . . ., 8 from the received signal with the first set of samples 25 from the internally generated or stored sample sequence to determine if a correlation exists between the same. The low-resolution correlation can be provided using a total of N=8 complex multipliers. If a sufficient correlation exists between at least one of the sets of samples 1, . . ., 8 and the set of samples 25, then the medium-resolution correlation is performed. The medium-resolution correlation involves selecting the next N sets of samples from the received signal and a second set of samples from the internally generated or stored sample sequence. It should be noted that the sets of samples 9, . . ., 16, 26 contain the same number of samples. However, the sets of samples 9, . . ., 16, 26 contain a larger number of samples than the sets of samples 1, . . ., 8, 25. It should also be noted that the sets of samples 9, . . ., 16, 26 are advantageously chosen to contain samples that are independent to the samples contained in the sets of samples 1, . . ., 8, 25. Upon selecting the sets of samples 9, . . ., 16, 26, the medium- resolution correlation continues with a comparison step. This comparison step involves concurrently comparing each of the sets of samples 9, . . ., 16 with the set of samples 26 to determine if a sufficient correlation exists between the same.

If a sufficient correlation exists between at least one of the sets of samples 9, . . ., 16 and the set of samples 26, then the fine -resolution correlation is performed. The fine-resolution correlation involves selecting the next N sets of samples from the received signal and a third set of samples from the internally generated or stored sample sequence. It should be noted that the sets of samples 17, . . ., 24, 27 contain the same number of samples. However, the sets of samples 17, . . ., 24, 27 contain a larger number of samples than the sets of samples 9, . . ., 16, 26. It should also be noted that the sets of samples 17, . . ., 24, 27 are advantageously chosen to contain samples that are independent to the samples contained in the sets of samples 9, . . ., 16, 26. Upon selecting the sets of samples 17, . . ., 24, 27, the fine- resolution correlation continues with a comparison step. This comparison step involves concurrently comparing each of the sets of samples 17, . . ., 24 with the set of samples 27 to determine if a sufficient correlation exists between the same. If a sufficient correlation exists between a set of samples 17, . . ., 24 and the set of samples 27, then a correlation peak value and correlation index value are computed and a next process begins. A person skilled in the art can appreciate that the correlation process described above in relation to FIG. 4 does not illustrate an ability to verify correlation index values. In this regard, it should be appreciated that FIG. 4 illustrates the ability to transition from a low-resolution correlation to a medium-resolution correlation and from the medium-resolution correlation to a fine-resolution correlation. FIG. 4 does not illustrate the ability to transition from the medium-resolution correlation to the low-resolution correlation or from the fine -resolution correlation to the low-resolution correlation. However, a state-based correlation process can be employed for enabling a verification of correlation index values. A conceptual diagram of a state based correlation process is provided in FIG. 5.

Referring now to FIG. 5, the state -based correlation process begins with the performance of a first iteration Ii of a low-resolution correlation state S₀. In this low-resolution correlation state S₀, N sets of samples are selected from the received signal. A first set of samples is also selected from the internally generated or stored sample sequence. It should be noted that the sets of samples a, . . ., h, y contain the same number of samples. The state based correlation process also involves concurrently comparing each of the sets of samples a, . . ., h from the received signal with the first set of samples y from the internally generated or stored sample sequence to determine if a sufficient correlation exists between the same. If a sufficient correlation exists between at least one of the sets of samples a, . . ., h and the set of samples y, then the state is transitioned from the low- resolution correlation state S₀ to a medium-resolution correlation state S₁. During a first iteration Ii of the medium-resolution correlation state S₁, the next N sets of samples are selected from the received signal. A second set of samples is also selected from the internally generated or stored sample sequence. It should be noted that the sets of samples i, . . ., p, z contain the same number of samples. However, the sets of samples i, . . ., p, z contain a larger number of samples than the sets of samples a, . . ., h, y. It should also be noted that the sets of samples i, . . ., p, z contain samples that are advantageously chosen to contain samples independent to the sets of samples a, . . ., h, y. Upon selecting the sets of samples i, . . ., p, z, each of the sets of samples i, . . ., p is concurrently compared with the set of samples z to determine if a sufficient correlation exists between the same.

If a sufficient correlation does not exist between at least one of the sets of samples i, . . ., p and the set of samples z, then the state is transitioned from the medium-resolution correlation state S₁ to the low-resolution correlation state S₀.

During a second iteration I₂ of the low-resolution correlation state S₀, a next N sets of samples q-x are selected from the received signal. A third set of samples zz is also selected from the internally generated or stored sample sequence. It should be noted that the sets of samples q, . . ., x, zz contain the same number of samples. It should also be noted that the sets of samples q, . . ., x, zz contain samples having different relative time delays as compared to the samples contained in the sets of samples a, . . ., h, y. Upon selecting the sets of samples q, . . ., x, zz, the correlation process continues with a comparison step. This comparison step involves concurrently comparing each of the sets of samples q, . . ., x with the set of samples zz to determine if a correlation exists between the same. If a correlation exists between at least one of the sets of samples q, . . ., x and the set of samples zz, then (1) the state is transitioned from the low-resolution correlation state S₀ to the medium-resolution correlation state Si and (2) a second iteration I₂ of the medium-resolution correlation state S₁ is performed. Referring now to FIG. 6, there is provided an exemplary architecture of the adaptive correlation device 200 implementing the correlation processes described above in relation to FIGS. 3-5. As shown in FIG. 6, the adaptive correlation device 200 is comprised of a state machine 602, a counter device 604, buffer memories 606, 608, a complex multiplier-accumulator (CMACC) device 610, a threshold device 614, and an adder 616. Each of the listed components is well known to persons skilled in the art, and therefore will not be described in great detail herein. However, a brief discussion of the adaptive correlation device 200 is provided to assist a reader in understanding the present invention.

Referring again to FIG. 6, the state machine 602 is configured to transition between a plurality of states S₀, S₁, S₂. More particularly, the state machine 602 is configured to change the state S₀, S₁, S₂ of the adaptive correlation device 200 in response to a control signal communicated from the threshold device 614. It should be noted that such a state configuration allows for verification of correlation index values. This verification feature will become evident as the discussion of the adaptive correlation device 200 progresses. The state machine 602 will be described in greater detail below in relation to FIG. 7.

A state diagram of an exemplary embodiment of the state machine 602 is provided in FIG. 7. Referring now to FIG. 7, the state machine is configured to change the state S₀, S₁, S₂ of the adaptive correlation device 200 in response to a control signal communicated from the threshold device 614. The state machine 602 can change the state of the adaptive correlation device 200 from a low-resolution correlation state So to a medium-resolution correlation state S₁ or from the medium- resolution correlation state S₁ to a fine-resolution correlation state S₂. Similarly, in response to the control signal, the state machine 602 can return the state of the adaptive correlation device 200 to the low-resolution correlation state S₀.

Alternatively, the state machine 602 can change the state of the adaptive correlation device 200 from the medium-resolution correlation state S₁ to the low-resolution correlation state So or from the fine-resolution correlation state S₂ to the low-resolution correlation state S₀. Still, the invention is not limited in this regard. A person skilled in the art can also appreciate that the correlation process described above in relation to FIG. 7 can be implemented using any number of intermediate or verification correlation steps, and therefore any number of correlation states S₁, before achieving a correlation lock.

Referring again to FIG. 6, the counter device 604 is configured to specify memory addresses for reading sets of samples from the buffer memory 606 in a pre-defined order. The counter device 604 is also configured to specify memory addresses for reading samples from the buffer memory 608 in a pre-defined order. In this regard, it should be appreciated that the counter device 604 can be comprised of a plurality of counters 604_ls 604₂, . . ., 604,. The counters 604_ls 604₂, . . ., 604, can be up counters configured to increment by one or more integer value in response to a clock signal. Each of the counters 604i, 604₂, . . ., 604; is provided to specify memory addresses for reading sets of samples from the buffer memory 606 and samples from the buffer memory 608 in a pre-defined order during a particular state S₀, S₁, . . ., S₁. In this regard, it should be appreciated that the counter 604₁ can be utilized when the adaptive correlation device 200 is in its initial state S₀. The counter 6041 can be configured to increment from a base index value to an integer value ni. The phrase "base index value" as used herein refers to an integer value representing an initial address of the buffer memories and/or an initial sample of a received signal. The base index value can be selected in accordance with the number of times the adaptive correlation device 200 has been transitioned into its initial state S₀. For example, if the adaptive correlation device 200 is in a first iteration Ii of the initial state So, then the base index value is equal to zero (0). If the adaptive correlation device 200 is in a second iteration I₂ of the initial state S₀, then the base index value is equal to a first non-zero integer value, such as eight (8). If the adaptive correlation device 200 is in a third iteration I3 of the initial state S₀, then the base index value is equal to a second non-zero integer value, such as sixteen (16). Still, the invention is not limited in this regard.

Referring again to FIG. 6, the counter 604₂ can be utilized when the adaptive correlation device 200 is in its second state S₁. The counter 604₂ can be configured to increment from an integer value (ni+1) to an integer value n₂.

Similarly, the counter 604₃ can be utilized when the adaptive correlation device 200 is in its third state S₂. The counter 604₃ can be configured to increment from an integer value (n₂+l) to an integer value n₃, and so on.

The buffer memory 606 is configured to receive a plurality of received signal samples and store the same in storage locations with sequential addresses. The buffer memory 606 is also configured to communicate a set of samples to the CMACC device 610 every clock cycle and in an order defined by the counter device 604. The buffer memory 608 is configured to store samples of an internally generated or previously stored sample sequence in storage locations with sequential addresses. The buffer memory 608 is also configured to communicate a single sample to the CMACC device 610 every clock cycle and in an order defined by the counter device 604.

The CMACC device 610 is configured to receive a set of samples from the buffer memory 606 per clock cycle. The CMACC device 610 is also configured to receive a sample from the buffer memory 608 per clock cycle. The CMACC device 610 is further configured to perform a plurality of complex multiplies and accumulations. In this regard, it should be appreciated that the CMACC device 610 can be comprised of a plurality of complex multiply-accumulators (CMACCs) 612i, . . ., 612_N. Each CMACC 612_ls . . ., 612_N is configured to perform a complex multiply- accumulation process. In this regard, it should be understood that each CMACC 612i, . . ., 612_N can be comprised of a complex multiplier 618I, . . ., 618N and a complex accumulator 6201, . . ., 62O_N. Each complex multiplier 618i, . . ., 618_N can be configured to compute a product during each clock cycle by multiplying a sample from the buffer memory 606 by a sample from a buffer memory 608. Each complex multiplier 618i, . . ., 618N can also be configured to communicate computed products to a respective complex accumulator 620₁, . . ., 62O_N for use in an accumulation process. The accumulation process involves adding the computed products together to obtain an accumulation value. Each CMACC 612i, . . ., 612_N can also be configured to compute the magnitude of the accumulated value via multiplication of the accumulated value with its complex conjugate. Each complex accumulator 620i, . . ., 62O_N can be configured to communicate accumulation values to the threshold device 614.

The threshold device 614 is configured to receive a value from each of the CMACCs 612i, . . ., 612N. The threshold device 614 is also configured to compare each received value to a specific threshold value thr₀, . . ., trnv Each threshold value thr₀, . . ., HiT₁ is selected in accordance with the state S₀, S₁, . . ., S₁ of the adaptive correlation device 200. For example, if the adaptive correlation device 200 is in its initial state S₀, then the threshold value used in the comparison process is thr₀. Similarly, if the adaptive correlation device 200 is in its second state S₁, then the threshold value used in the comparison process is thri, and so on. Still, the invention is not limited in this regard.

The threshold device 614 is also configured to communicate a control signal to the state machine 602 based on the outcome of the comparison process. For example, if all accumulation values are less than a given threshold value, then the threshold device 614 communicates a control signal to the state machine 602 indicating that the state machine should revert to the state So and proceed to the next base correlation index. If at least one of the accumulation values is greater than or equal to a given threshold value, then the threshold device 614 communicates a control signal to the state machine 602 indicating that it should proceed to the next subsequent state for a more precise correlation calculation. The threshold device 614 is further configured to perform an arithmetic process to estimate the relative delay between the two (2) sequences within the CMACC correlation window. The output value provides an indication of which CMACC(s) 612i, . . ., 612_N produced an accumulation value greater than or equal to the threshold value. The output delay value can be an integer number or a decimal number. For example, if CMACCs 612i, 6122 both produce accumulation values greater than or equal to the threshold value, then the calculated delay will most likely equal a decimal, non-integer delay value. The decimal value is determined by some pre-defined arithmetic process, such as an arithmetic process based on center-of-mass or L_p norm. Still, the invention is not limited in this regard.

Upon determining an output delay value, the threshold device 614 communicates the same to the adder 616. The adder 616 is configured to receive the output value from the threshold device and a base index value from the counter device 604. Upon receipt of these values, the adder 616 adds the same together to obtain a correlation index value. The adder 616 is also configured to communicate the correlation index value to a sampling device (not shown).

The operation of the adaptive correlation device 200 will now be described in relation to FIG. 8. It should be noted that FIG. 8 provides an illustration of a process performed by the adaptive correlation device 200 during an iteration I₁ of a state S₁. It should also be noted that the adaptive correlation device 200 performs sample processing on nl sets of samples from a received signal per iteration I₁, . . ., I₁ of a state S₀, S₁, . . ., S₁. It should further be noted that each set of samples from a received signal is comprised of N samples. The variable "N" is an integer value representing the number of CMACCs 612i, . . ., 612_N comprising the CMACC device 610.

As shown in FIG. 8, sets of samples from the buffer memory 606 are communicated to the CMACC device 610 every clock cycle. For example, the CMACC device 610 receives a first set of samples {Sβoβ⁰, • • .,

from the buffer memory 606 during a first clock cycle. The CMACC device 610 receives a second set of samples {Sβoβ¹, • • ., S606^N} from the buffer memory 606 during a second clock cycle. The CMACC device 610 receives a third set of samples {S₆o6², • • •, S606^N+1} from the buffer memory 606 during a third clock cycle, and so on. Still, the invention is not limited in this regard. Upon receipt of a set of samples, the CMACC device 610 forwards a sample from the received set of samples to each CMACC 612₁, . . ., 612_N. For example, a sample Sβoβ⁰ from the first set of samples is forwarded to the CMACC 612i. A sample Sβoβ¹ from the first set of samples is forwarded to the CMACC 612₂. A sample Sβoβ² from the first set of samples is forwarded to the CMACC 6123, and so on. Still, the invention is not limited in this regard.

The CMACC device 610 also receives a sample from the buffer memory 608 every clock cycle. For example, the CMACC device 610 receives a first sample Sβos⁰ from the buffer memory 608 during a first clock cycle. The CMACC device 610 receives a second sample Sβos¹ from the buffer memory 608 during a second clock cycle, and so on. Upon receipt of a sample S₆Os⁰, • • •, S6os^{N 1} from the buffer memory 608, the CMACC device 610 forwards the same to each CMACC

Each CMACC 612_ls . . ., 612N performs actions to complex multiply the received samples to obtain a product P₀, . . ., P_nl. For example, each CMACC 612i, . . ., 612N complex multiplies a respective sample Sβoβ⁰, • • ., S606^{N 1} by a sample S608° to obtain a product P₀. Thereafter, each CMACC 612_ls . . ., 612_N complex multiplies a respective sample Sβoβ¹, • • ., S606^N by a sample Sβos¹ to obtain a product P₁, and so on. Still, the invention is not limited in this regard.

Subsequent to computing a product P₀, . . ., P_nl, each CMACC 612_ls . . ., 612_N performs actions to accumulate the same. More particularly, each complex accumulator 620i, . . ., 62O_N adds the computed products Po, . . ., P_ni together to obtain an accumulation value. Each complex accumulator 620i, . . ., 62O_N forwards a respective accumulation value to the threshold device 614. The threshold device 614 determines whether at least one of the accumulation values is equal to or greater than a threshold value thr^

If all of the accumulation values are less than the threshold value thr^ then the threshold device 614 communicates a low control signal to the state machine 602. As a result, the state of the adaptive correlation device 200 is either (a) maintained in its initial state So or (b) transitioned from a state S₁, . . ., S₁ to the initial state S₀. The base index value is also incremented by a pre-defined value N. A next iteration I₁₊₁ of the CMACC process for the initial state So is then performed.

If at least one of the accumulation values is equal to or greater than the threshold value thr_l5 then the threshold device 614 communicates a high control signal to the state machine 602. As a result, the state of the adaptive correlation device 200 is transitioned from a state S₁ to a next state Si₊₁. The base index value is also incremented by a pre-defined value. A CMACC process for the next state s₁₊i is then performed or the delay is computed if the state machine is in the highest state. In light of the forgoing description of the invention, it should be recognized that the present invention can be realized in hardware, software, or a combination of hardware and software. Any kind of computer system, or other apparatus adapted for carrying out the methods described herein, is suited. A typical combination of hardware and software could be a general purpose computer processor, with a computer program that, when being loaded and executed, controls the computer processor such that it carries out the methods described herein. Of course, an application specific integrated circuit (ASIC), and/or a field programmable gate array (FPGA) could also be used to achieve a similar result.

The present invention can also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which, when loaded in a computer system, is able to carry out these methods. Computer program or application in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: (a) conversion to another language, code or notation; (b) reproduction in a different material form. Additionally, the description above is intended by way of example only and is not intended to limit the present invention in any way, except as set forth in the following claims.

Claims

1. A method for correlating samples of a received signal and samples of an internally generated or stored sample sequence, comprising: performing a first iteration of a low-resolution correlation, said low-resolution correlation including the steps of: selecting a first N sets of received signal samples from a received signal; selecting a first set of reference samples from an internally generated or stored sample sequence; concurrently comparing each of said first N sets of received signal samples with said first set of reference samples to determine if a sufficient correlation exists between the same; and wherein said first N sets of received signal samples and said first set of reference samples comprise the same number of samples.

2. The method according to claim 1, further comprising performing a higher- resolution correlation if it is determined in said low-resolution correlation that a sufficient correlation exists between at least one of said first N sets of received signal samples and said first set of reference samples.

3. The method according to claim 2, wherein said higher-resolution correlation comprises the steps of (a) selecting a second N sets of received signal samples from a received signal and (b) selecting a second set of reference samples from said internally generated or stored sample sequence, wherein said second N sets of received signal samples and said second set of reference samples comprise the same number of samples.

4. The method according to claim 3, wherein said second N sets of received signal samples comprise a number of samples which can be larger than said first N sets of received signal samples.

5. The method according to claim 3, wherein said second N sets of received signal samples comprise samples that are delayed in time as compared to samples contained in said first N sets of received signal samples.

6. The method according to claim 3, wherein said second set of reference samples comprises samples that are delayed in time as compared to samples contained in said first set of reference samples.

7. The method according to claim 3, wherein said higher-resolution correlation further comprises the step of concurrently comparing each of said second N sets of received signal samples with said second set of reference samples to determine if a sufficient correlation exists between the same.

8. The method according to claim 7, further comprising computing a correlation index value if it is determined that a sufficient correlation exists between at least one of said second N sets of received signal samples and said second set of reference samples.

9. The method according to claim 3, wherein said higher-resolution correlation operates on independent sets of samples with the same relative delays as said low- resolution reference samples with a correlation peak to compute a correlation verification or an independent correlation measure.

10. The method according to claim 1, further comprising performing a next iteration of said low-resolution correlation if it is determined that a sufficient correlation does not exist between at least one of said first N sets of received signal samples and said first set of reference samples.

11. The method according to claim 10, wherein said next iteration of said low- resolution correlation comprises the step of selecting a second N sets of received signal samples from a received signal and a second set of reference samples from said internally generated or stored sample sequence, wherein said second N sets of received signal samples and said second set of reference samples comprise the same number of samples.

12. The method according to claim 11, wherein said second N sets of received signal samples comprise the same number of samples as said first N sets of received signal samples.

13. The method according to claim 11 , wherein said second N sets of received signal samples comprise samples that are delayed in time as compared to samples contained in said first N sets of received signal samples.