CA2726448A1 - Adaptive correlation - Google Patents
Adaptive correlation Download PDFInfo
- Publication number
- CA2726448A1 CA2726448A1 CA2726448A CA2726448A CA2726448A1 CA 2726448 A1 CA2726448 A1 CA 2726448A1 CA 2726448 A CA2726448 A CA 2726448A CA 2726448 A CA2726448 A CA 2726448A CA 2726448 A1 CA2726448 A1 CA 2726448A1
- Authority
- CA
- Canada
- Prior art keywords
- samples
- correlation
- sets
- received signal
- resolution
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L7/00—Arrangements for synchronising receiver with transmitter
- H04L7/04—Speed or phase control by synchronisation signals
- H04L7/041—Speed or phase control by synchronisation signals using special codes as synchronising signal
- H04L7/042—Detectors therefor, e.g. correlators, state machines
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/15—Correlation function computation including computation of convolution operations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
- H04B1/7073—Synchronisation aspects
- H04B1/7075—Synchronisation aspects with code phase acquisition
- H04B1/70751—Synchronisation aspects with code phase acquisition using partial detection
- H04B1/70752—Partial correlation
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computational Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Mobile Radio Communication Systems (AREA)
- Synchronisation In Digital Transmission Systems (AREA)
- Complex Calculations (AREA)
- Circuits Of Receivers In General (AREA)
- Radar Systems Or Details Thereof (AREA)
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-reso-lution 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 ex-ists 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 be-tween one of the N sets of samples and the first set of samples, then a first iteration of a second-resolution correlation state is per-formed
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 SN of a received signal. A second multiplier is configured to multiply a stored sample N-1 by a time delayed sample SN_i, 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 low-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
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 SN of a received signal. A second multiplier is configured to multiply a stored sample N-1 by a time delayed sample SN_i, 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 low-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.
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 Ii 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 Ni samples of the received signal and Ni 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 N1, N2, and N3 are all integers, with N3 > N2 >
Ni.
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.
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 Ii 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 Ni samples of the received signal and Ni 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 N1, N2, and N3 are all integers, with N3 > N2 >
Ni.
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.
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 I1 of a low-resolution correlation state so. In this low-resolution correlation state so, 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 so to a medium-resolution correlation state si.
During a first iteration I1 of the medium-resolution correlation state si, 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 si to the low-resolution correlation state so.
During a second iteration 12 of the low-resolution correlation state so, 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 so to the medium-resolution correlation state si and (2) a second iteration 12 of the medium-resolution correlation state si 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 so, si, s2. More particularly, the state machine 602 is configured to change the state so, s1, s2 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 so, s1, s2 of the adaptive correlation device 200 in response to a control signal communicated from the threshold device 614. The state machine can change the state of the adaptive correlation device 200 from a low-resolution correlation state so to a medium-resolution correlation state s1 or from the medium-resolution correlation state si to a fine-resolution correlation state s2.
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 so.
Alternatively, the state machine 602 can change the state of the adaptive correlation device 200 from the medium-resolution correlation state si to the low-resolution correlation state so or from the fine-resolution correlation state s2 to the low-resolution correlation state so. 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 Si, 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 6041, 6042, ..., 604;. The counters 6041, 6042, ..., 604; can be up counters configured to increment by one or more integer value in response to a clock signal. Each of the counters 6041, 6042,..., 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 so, s1, ..., s;.
In this regard, it should be appreciated that the counter 6041 can be utilized when the adaptive correlation device 200 is in its initial state so.
The counter 6041 can be configured to increment from a base index value to an integer value n1.
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 so. For example, if the adaptive correlation device 200 is in a first iteration I1 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 12 of the initial state so, 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 13 of the initial state so, 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 6042 can be utilized when the adaptive correlation device 200 is in its second state s1. The counter 6042 can be configured to increment from an integer value (n1+1) to an integer value n2.
Similarly, the counter 6043 can be utilized when the adaptive correlation device 200 is in its third state s2. The counter 6043 can be configured to increment from an integer value (n2+1) to an integer value n3, 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 can be comprised of a plurality of complex multiply-accumulators (CMACCs) 6121,.
..1612N. Each CMACC 6121,..., 612N is configured to perform a complex multiply-accumulation process. In this regard, it should be understood that each CMACC
6121, ..., 612N can be comprised of a complex multiplier 6181, ..., 618N and a complex accumulator 6201, ..., 620N. Each complex multiplier 6181, ..., 618N 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 6181, ..., 618N can also be configured to communicate computed products to a respective complex accumulator 6201, ..., 620N for use in an accumulation process. The accumulation process involves adding the computed products together to obtain an accumulation value. Each CMACC 6121, ..., 612N 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 6201, .
.., 620N 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 6121,..., 612N. The threshold device 614 is also configured to compare each received value to a specific threshold value thro, ..., thr,.
Each threshold value thro, ..., thr, is selected in accordance with the state so, s1, ..., s; of the adaptive correlation device 200. For example, if the adaptive correlation device 200 is in its initial state so, then the threshold value used in the comparison process is thro. Similarly, if the adaptive correlation device 200 is in its second state s1, then the threshold value used in the comparison process is thr1, 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) 6121,..., 612N 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 6121, 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 Lp 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 Ii 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 I1, . . ., I;
of a state so, si, . . ., 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 6121,. .., 612N 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 {S6060, ..., S606N-1} from the buffer memory 606 during a first clock cycle. The CMACC device 610 receives a second set of samples {S6061, ..., S606N} from the buffer memory 606 during a second clock cycle. The CMACC device 610 receives a third set of samples {S606, S6o6N+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 6121, ..., 612N. For example, a sample S606 from the first set of samples is forwarded to the CMACC
6121. A sample S6o61 from the first set of samples is forwarded to the CMACC
6122.
A sample 56062 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 S608 from the buffer memory 608 during a first clock cycle. The CMACC
device 610 receives a second sample S6081 from the buffer memory 608 during a second clock cycle, and so on. Upon receipt of a sample S6080, ..., S608N_1 from the buffer memory 608, the CMACC device 610 forwards the same to each CMACC
6121, ..., 612N.
Each CMACC 6121,..., 612N performs actions to complex multiply the received samples to obtain a product Po5 ..., Põ1. For example, each CMACC
6121, ..., 612N complex multiplies a respective sample S606 , ..., S606N-1 by a sample S608 to obtain a product Po. Thereafter, each CMACC 6121,. .., 612N complex multiplies a respective sample S6061, ..., S606N by a sample S6081 to obtain a product P1, and so on. Still, the invention is not limited in this regard.
Subsequent to computing a product Po, ..., Pi1, each CMACC 6121,..
., 612N performs actions to accumulate the same. More particularly, each complex accumulator 6201, ..., 620N adds the computed products Po, ..., Pi1 together to obtain an accumulation value. Each complex accumulator 6201, ..., 620N 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 s1, ..., s; to the initial state so. The base index value is also incremented by a pre-defined value N. A
next iteration I,+1 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,, 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 s,+1. The base index value is also incremented by a pre-defined value. A CMACC process for the next state s;+1 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.
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 I1 of a low-resolution correlation state so. In this low-resolution correlation state so, 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 so to a medium-resolution correlation state si.
During a first iteration I1 of the medium-resolution correlation state si, 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 si to the low-resolution correlation state so.
During a second iteration 12 of the low-resolution correlation state so, 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 so to the medium-resolution correlation state si and (2) a second iteration 12 of the medium-resolution correlation state si 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 so, si, s2. More particularly, the state machine 602 is configured to change the state so, s1, s2 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 so, s1, s2 of the adaptive correlation device 200 in response to a control signal communicated from the threshold device 614. The state machine can change the state of the adaptive correlation device 200 from a low-resolution correlation state so to a medium-resolution correlation state s1 or from the medium-resolution correlation state si to a fine-resolution correlation state s2.
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 so.
Alternatively, the state machine 602 can change the state of the adaptive correlation device 200 from the medium-resolution correlation state si to the low-resolution correlation state so or from the fine-resolution correlation state s2 to the low-resolution correlation state so. 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 Si, 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 6041, 6042, ..., 604;. The counters 6041, 6042, ..., 604; can be up counters configured to increment by one or more integer value in response to a clock signal. Each of the counters 6041, 6042,..., 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 so, s1, ..., s;.
In this regard, it should be appreciated that the counter 6041 can be utilized when the adaptive correlation device 200 is in its initial state so.
The counter 6041 can be configured to increment from a base index value to an integer value n1.
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 so. For example, if the adaptive correlation device 200 is in a first iteration I1 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 12 of the initial state so, 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 13 of the initial state so, 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 6042 can be utilized when the adaptive correlation device 200 is in its second state s1. The counter 6042 can be configured to increment from an integer value (n1+1) to an integer value n2.
Similarly, the counter 6043 can be utilized when the adaptive correlation device 200 is in its third state s2. The counter 6043 can be configured to increment from an integer value (n2+1) to an integer value n3, 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 can be comprised of a plurality of complex multiply-accumulators (CMACCs) 6121,.
..1612N. Each CMACC 6121,..., 612N is configured to perform a complex multiply-accumulation process. In this regard, it should be understood that each CMACC
6121, ..., 612N can be comprised of a complex multiplier 6181, ..., 618N and a complex accumulator 6201, ..., 620N. Each complex multiplier 6181, ..., 618N 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 6181, ..., 618N can also be configured to communicate computed products to a respective complex accumulator 6201, ..., 620N for use in an accumulation process. The accumulation process involves adding the computed products together to obtain an accumulation value. Each CMACC 6121, ..., 612N 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 6201, .
.., 620N 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 6121,..., 612N. The threshold device 614 is also configured to compare each received value to a specific threshold value thro, ..., thr,.
Each threshold value thro, ..., thr, is selected in accordance with the state so, s1, ..., s; of the adaptive correlation device 200. For example, if the adaptive correlation device 200 is in its initial state so, then the threshold value used in the comparison process is thro. Similarly, if the adaptive correlation device 200 is in its second state s1, then the threshold value used in the comparison process is thr1, 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) 6121,..., 612N 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 6121, 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 Lp 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 Ii 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 I1, . . ., I;
of a state so, si, . . ., 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 6121,. .., 612N 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 {S6060, ..., S606N-1} from the buffer memory 606 during a first clock cycle. The CMACC device 610 receives a second set of samples {S6061, ..., S606N} from the buffer memory 606 during a second clock cycle. The CMACC device 610 receives a third set of samples {S606, S6o6N+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 6121, ..., 612N. For example, a sample S606 from the first set of samples is forwarded to the CMACC
6121. A sample S6o61 from the first set of samples is forwarded to the CMACC
6122.
A sample 56062 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 S608 from the buffer memory 608 during a first clock cycle. The CMACC
device 610 receives a second sample S6081 from the buffer memory 608 during a second clock cycle, and so on. Upon receipt of a sample S6080, ..., S608N_1 from the buffer memory 608, the CMACC device 610 forwards the same to each CMACC
6121, ..., 612N.
Each CMACC 6121,..., 612N performs actions to complex multiply the received samples to obtain a product Po5 ..., Põ1. For example, each CMACC
6121, ..., 612N complex multiplies a respective sample S606 , ..., S606N-1 by a sample S608 to obtain a product Po. Thereafter, each CMACC 6121,. .., 612N complex multiplies a respective sample S6061, ..., S606N by a sample S6081 to obtain a product P1, and so on. Still, the invention is not limited in this regard.
Subsequent to computing a product Po, ..., Pi1, each CMACC 6121,..
., 612N performs actions to accumulate the same. More particularly, each complex accumulator 6201, ..., 620N adds the computed products Po, ..., Pi1 together to obtain an accumulation value. Each complex accumulator 6201, ..., 620N 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 s1, ..., s; to the initial state so. The base index value is also incremented by a pre-defined value N. A
next iteration I,+1 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,, 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 s,+1. The base index value is also incremented by a pre-defined value. A CMACC process for the next state s;+1 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 (13)
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.
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.
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.
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.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US12/131,386 | 2008-06-02 | ||
| US12/131,386 US8064552B2 (en) | 2008-06-02 | 2008-06-02 | Adaptive correlation |
| PCT/US2009/045916 WO2009149051A2 (en) | 2008-06-02 | 2009-06-02 | Adaptive correlation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2726448A1 true CA2726448A1 (en) | 2009-12-10 |
Family
ID=41379801
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2726448A Abandoned CA2726448A1 (en) | 2008-06-02 | 2009-06-02 | Adaptive correlation |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US8064552B2 (en) |
| EP (1) | EP2294518B1 (en) |
| JP (1) | JP2011525729A (en) |
| KR (1) | KR101253870B1 (en) |
| CA (1) | CA2726448A1 (en) |
| WO (1) | WO2009149051A2 (en) |
Families Citing this family (47)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8312551B2 (en) | 2007-02-15 | 2012-11-13 | Harris Corporation | Low level sequence as an anti-tamper Mechanism |
| US7937427B2 (en) * | 2007-04-19 | 2011-05-03 | Harris Corporation | Digital generation of a chaotic numerical sequence |
| US7921145B2 (en) * | 2007-05-22 | 2011-04-05 | Harris Corporation | Extending a repetition period of a random sequence |
| US8611530B2 (en) | 2007-05-22 | 2013-12-17 | Harris Corporation | Encryption via induced unweighted errors |
| US7995757B2 (en) | 2007-05-31 | 2011-08-09 | Harris Corporation | Closed galois field combination |
| US7974413B2 (en) * | 2007-06-07 | 2011-07-05 | Harris Corporation | Spread spectrum communications system and method utilizing chaotic sequence |
| US7970809B2 (en) * | 2007-06-07 | 2011-06-28 | Harris Corporation | Mixed radix conversion with a priori defined statistical artifacts |
| US7962540B2 (en) * | 2007-06-07 | 2011-06-14 | Harris Corporation | Mixed radix number generator with chosen statistical artifacts |
| US8005221B2 (en) * | 2007-08-01 | 2011-08-23 | Harris Corporation | Chaotic spread spectrum communications system receiver |
| US7995749B2 (en) * | 2007-10-30 | 2011-08-09 | Harris Corporation | Cryptographic system configured for extending a repetition period of a random sequence |
| US8180055B2 (en) | 2008-02-05 | 2012-05-15 | Harris Corporation | Cryptographic system incorporating a digitally generated chaotic numerical sequence |
| US8363830B2 (en) | 2008-02-07 | 2013-01-29 | Harris Corporation | Cryptographic system configured to perform a mixed radix conversion with a priori defined statistical artifacts |
| US8040937B2 (en) * | 2008-03-26 | 2011-10-18 | Harris Corporation | Selective noise cancellation of a spread spectrum signal |
| US8139764B2 (en) | 2008-05-06 | 2012-03-20 | Harris Corporation | Closed galois field cryptographic system |
| US8320557B2 (en) | 2008-05-08 | 2012-11-27 | Harris Corporation | Cryptographic system including a mixed radix number generator with chosen statistical artifacts |
| US8145692B2 (en) | 2008-05-29 | 2012-03-27 | Harris Corporation | Digital generation of an accelerated or decelerated chaotic numerical sequence |
| US8200728B2 (en) * | 2008-05-29 | 2012-06-12 | Harris Corporation | Sine/cosine generator |
| US8064552B2 (en) | 2008-06-02 | 2011-11-22 | Harris Corporation | Adaptive correlation |
| US8068571B2 (en) | 2008-06-12 | 2011-11-29 | Harris Corporation | Featureless coherent chaotic amplitude modulation |
| US8325702B2 (en) * | 2008-08-29 | 2012-12-04 | Harris Corporation | Multi-tier ad-hoc network in which at least two types of non-interfering waveforms are communicated during a timeslot |
| US8165065B2 (en) * | 2008-10-09 | 2012-04-24 | Harris Corporation | Ad-hoc network acquisition using chaotic sequence spread waveform |
| US8406276B2 (en) | 2008-12-29 | 2013-03-26 | Harris Corporation | Communications system employing orthogonal chaotic spreading codes |
| US8351484B2 (en) | 2008-12-29 | 2013-01-08 | Harris Corporation | Communications system employing chaotic spreading codes with static offsets |
| US8457077B2 (en) | 2009-03-03 | 2013-06-04 | Harris Corporation | Communications system employing orthogonal chaotic spreading codes |
| US8428102B2 (en) | 2009-06-08 | 2013-04-23 | Harris Corporation | Continuous time chaos dithering |
| US8509284B2 (en) | 2009-06-08 | 2013-08-13 | Harris Corporation | Symbol duration dithering for secured chaotic communications |
| US8428103B2 (en) | 2009-06-10 | 2013-04-23 | Harris Corporation | Discrete time chaos dithering |
| US8385385B2 (en) | 2009-07-01 | 2013-02-26 | Harris Corporation | Permission-based secure multiple access communication systems |
| US8406352B2 (en) | 2009-07-01 | 2013-03-26 | Harris Corporation | Symbol estimation for chaotic spread spectrum signal |
| US8340295B2 (en) * | 2009-07-01 | 2012-12-25 | Harris Corporation | High-speed cryptographic system using chaotic sequences |
| US8428104B2 (en) | 2009-07-01 | 2013-04-23 | Harris Corporation | Permission-based multiple access communications systems |
| US8379689B2 (en) | 2009-07-01 | 2013-02-19 | Harris Corporation | Anti-jam communications having selectively variable peak-to-average power ratio including a chaotic constant amplitude zero autocorrelation waveform |
| US8369376B2 (en) | 2009-07-01 | 2013-02-05 | Harris Corporation | Bit error rate reduction in chaotic communications |
| US8363700B2 (en) | 2009-07-01 | 2013-01-29 | Harris Corporation | Rake receiver for spread spectrum chaotic communications systems |
| US8848909B2 (en) | 2009-07-22 | 2014-09-30 | Harris Corporation | Permission-based TDMA chaotic communication systems |
| US8369377B2 (en) * | 2009-07-22 | 2013-02-05 | Harris Corporation | Adaptive link communications using adaptive chaotic spread waveform |
| US8345725B2 (en) | 2010-03-11 | 2013-01-01 | Harris Corporation | Hidden Markov Model detection for spread spectrum waveforms |
| GB201015729D0 (en) | 2010-09-20 | 2010-10-27 | Novelda As | Pulse generator |
| GB201015730D0 (en) | 2010-09-20 | 2010-10-27 | Novelda As | Continuous time cross-correlator |
| US8654819B2 (en) | 2011-06-22 | 2014-02-18 | Harris Corporation | Systems and methods for pulse rotation modulation encoding and decoding |
| GB2501309A (en) | 2012-04-20 | 2013-10-23 | Ibm | Using derivatives to compare event data sets. |
| WO2016102999A1 (en) * | 2014-12-24 | 2016-06-30 | Institut Mines-Telecom | Method for transient change detection with adaptive sampling, and detector implementing the method |
| US10708086B2 (en) * | 2016-01-19 | 2020-07-07 | National Instruments Corporation | Channel sounding techniques |
| EP3246824A1 (en) * | 2016-05-20 | 2017-11-22 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Apparatus for determining a similarity information, method for determining a similarity information, apparatus for determining an autocorrelation information, apparatus for determining a cross-correlation information and computer program |
| US10277269B2 (en) * | 2016-12-09 | 2019-04-30 | The Boeing Company | Phased array beam tracking using beam gain coding |
| WO2018200591A1 (en) | 2017-04-24 | 2018-11-01 | Chaos Prime, Inc. | Communication system employing chaotic sequence based frequency shift keying spreading signals |
| WO2019046823A1 (en) | 2017-08-31 | 2019-03-07 | Chaos Prime, Inc. | High-order psk signaling (hops) techniques for low-power spread spectrum communications |
Family Cites Families (128)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FR1501059A (en) | 1966-09-26 | 1967-11-10 | Csf | New key generator |
| GB1198263A (en) * | 1967-06-06 | 1970-07-08 | Nat Res Dev | Improvements in or relating to Digital Differential Analysers |
| US4646326A (en) * | 1983-10-20 | 1987-02-24 | Motorola Inc. | QAM modulator circuit |
| US4703507A (en) * | 1984-04-05 | 1987-10-27 | Holden Thomas W | Noise reduction system |
| EP0413856B1 (en) * | 1989-08-24 | 1994-12-21 | Koninklijke Philips Electronics N.V. | A decoding method and apparatus for decoding code words that are wordwise protected by a non-binary BCH code against at least one symbol error |
| US5077793A (en) * | 1989-09-29 | 1991-12-31 | The Boeing Company | Residue number encryption and decryption system |
| US5007087A (en) * | 1990-04-16 | 1991-04-09 | Loral Aerospace Corp. | Method and apparatus for generating secure random numbers using chaos |
| US5048086A (en) * | 1990-07-16 | 1991-09-10 | Hughes Aircraft Company | Encryption system based on chaos theory |
| US5319735A (en) * | 1991-12-17 | 1994-06-07 | Bolt Beranek And Newman Inc. | Embedded signalling |
| US5297206A (en) * | 1992-03-19 | 1994-03-22 | Orton Glenn A | Cryptographic method for communication and electronic signatures |
| US5276633A (en) * | 1992-08-14 | 1994-01-04 | Harris Corporation | Sine/cosine generator and method |
| US5811998A (en) * | 1993-01-28 | 1998-09-22 | Digital Equipment Corporation | State machine phase lock loop |
| US5412687A (en) * | 1993-10-15 | 1995-05-02 | Proxim Incorporated | Digital communications equipment using differential quaternary frequency shift keying |
| US6614914B1 (en) * | 1995-05-08 | 2003-09-02 | Digimarc Corporation | Watermark embedder and reader |
| JPH088780A (en) * | 1994-06-23 | 1996-01-12 | Toshiba Corp | Correlation device and spread spectrum communication system |
| JP2895399B2 (en) * | 1994-07-20 | 1999-05-24 | 沖電気工業株式会社 | Synchronous tracking method |
| JP2895398B2 (en) * | 1994-07-20 | 1999-05-24 | 沖電気工業株式会社 | Synchronous acquisition method |
| US5646997A (en) * | 1994-12-14 | 1997-07-08 | Barton; James M. | Method and apparatus for embedding authentication information within digital data |
| US6014446A (en) * | 1995-02-24 | 2000-01-11 | Motorola, Inc. | Apparatus for providing improved encryption protection in a communication system |
| US5598476A (en) * | 1995-04-20 | 1997-01-28 | United Technologies Automotive, Inc. | Random clock composition-based cryptographic authentication process and locking system |
| US5937000A (en) * | 1995-09-06 | 1999-08-10 | Solana Technology Development Corporation | Method and apparatus for embedding auxiliary data in a primary data signal |
| US5757923A (en) * | 1995-09-22 | 1998-05-26 | Ut Automotive Dearborn, Inc. | Method of generating secret identification numbers |
| JPH09148980A (en) * | 1995-11-22 | 1997-06-06 | Sony Corp | Detection of pilot signal, pilot signal detection device and moving station reception device |
| JP3992742B2 (en) * | 1996-05-20 | 2007-10-17 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Encryption method and apparatus for nonlinearly combining data blocks and keys |
| US6023612A (en) * | 1996-07-05 | 2000-02-08 | Thomcast Communications, Inc. | Modular transmission system and method |
| US7190681B1 (en) * | 1996-07-10 | 2007-03-13 | Wu William W | Error coding in asynchronous transfer mode, internet and satellites |
| US5963460A (en) | 1996-12-17 | 1999-10-05 | Metaflow Technologies, Inc. | Apparatus for computing transcendental functions quickly |
| AU8261298A (en) * | 1997-06-23 | 1999-01-04 | Regents Of The University Of California, The | Chaotic digital code-division multiple access (cdma) communication systems |
| US5852630A (en) * | 1997-07-17 | 1998-12-22 | Globespan Semiconductor, Inc. | Method and apparatus for a RADSL transceiver warm start activation procedure with precoding |
| DE19733829C2 (en) * | 1997-08-05 | 2000-02-24 | Micronas Semiconductor Holding | Method for encrypting or decrypting a data sequence |
| US6633226B1 (en) * | 1997-08-18 | 2003-10-14 | X-Cyte, Inc. | Frequency hopping spread spectrum passive acoustic wave identification device |
| US6078611A (en) * | 1997-09-16 | 2000-06-20 | Motorola, Inc. | Rake receiver and finger management method for spread spectrum communication |
| US6038317A (en) * | 1997-12-24 | 2000-03-14 | Magliveras; Spyros S. | Secret key cryptosystem and method utilizing factorizations of permutation groups of arbitrary order 2l |
| US6285761B1 (en) | 1998-03-04 | 2001-09-04 | Lucent Technologies, Inc. | Method for generating pseudo-random numbers |
| US6754251B1 (en) * | 1998-03-09 | 2004-06-22 | Texas Instruments Incorporated | Spread-spectrum telephony with accelerated code acquisition |
| US5924980A (en) * | 1998-03-11 | 1999-07-20 | Siemens Corporate Research, Inc. | Method and apparatus for adaptively reducing the level of noise in an acquired signal |
| US6141786A (en) * | 1998-06-04 | 2000-10-31 | Intenational Business Machines Corporation | Method and apparatus for performing arithmetic operations on Galois fields and their extensions |
| US5900835A (en) * | 1998-07-09 | 1999-05-04 | The United States Of America As Represented By The Secretary Of The Navy | Coherent hidden markov model |
| US6980656B1 (en) * | 1998-07-17 | 2005-12-27 | Science Applications International Corporation | Chaotic communication system and method using modulation of nonreactive circuit elements |
| US6304556B1 (en) * | 1998-08-24 | 2001-10-16 | Cornell Research Foundation, Inc. | Routing and mobility management protocols for ad-hoc networks |
| US6363104B1 (en) * | 1998-10-02 | 2002-03-26 | Ericsson Inc. | Method and apparatus for interference cancellation in a rake receiver |
| US7277540B1 (en) * | 1999-01-20 | 2007-10-02 | Kabushiki Kaisha Toshiba | Arithmetic method and apparatus and crypto processing apparatus for performing multiple types of cryptography |
| US6823068B1 (en) * | 1999-02-01 | 2004-11-23 | Gideon Samid | Denial cryptography based on graph theory |
| US6377782B1 (en) * | 1999-03-01 | 2002-04-23 | Mediacell, Inc. | Method and apparatus for communicating between a client device and a linear broadband network |
| US6304216B1 (en) * | 1999-03-30 | 2001-10-16 | Conexant Systems, Inc. | Signal detector employing correlation analysis of non-uniform and disjoint sample segments |
| FI107094B (en) * | 1999-05-10 | 2001-05-31 | Nokia Mobile Phones Ltd | The method updates the linear feedback shift register of the code generator |
| US6307878B1 (en) * | 1999-06-03 | 2001-10-23 | Dspc Technologies Ltd | Cellular telephony searcher |
| US6570909B1 (en) * | 1999-07-09 | 2003-05-27 | Nokia Mobile Phones | Interference suppression in a CDMA receiver |
| US20020099746A1 (en) * | 1999-07-26 | 2002-07-25 | Tie Teck Sing | T-sequence apparatus and method for general deterministic polynomial-time primality testing and composite factoring |
| US6744893B1 (en) * | 1999-08-25 | 2004-06-01 | Southwest Research Institute | Receiver estimation engine for a chaotic system |
| US6377615B1 (en) | 1999-09-30 | 2002-04-23 | Ericsson Inc. | Apparatus and methods for receiving information using variable length accumulation searchers |
| US7200225B1 (en) * | 1999-11-12 | 2007-04-03 | Richard Schroeppel | Elliptic curve point ambiguity resolution apparatus and method |
| US6678312B1 (en) * | 1999-12-22 | 2004-01-13 | Koninklijke Philips Electronics N.V. | Method for extending digital receiver sensitivity using analog correlation |
| US7596170B2 (en) * | 2000-02-28 | 2009-09-29 | Aeroastro, Inc. | Coherent detection without transmission preamble |
| US6993016B1 (en) * | 2000-11-16 | 2006-01-31 | Juniper Networks, Inc. | Methods and apparatus for transmission of analog channels over digital packet networks |
| US7010559B2 (en) * | 2000-11-14 | 2006-03-07 | Parkervision, Inc. | Method and apparatus for a parallel correlator and applications thereof |
| US6985516B1 (en) * | 2000-11-27 | 2006-01-10 | Qualcomm Incorporated | Method and apparatus for processing a received signal in a communications system |
| US7170997B2 (en) * | 2000-12-07 | 2007-01-30 | Cryptico A/S | Method of generating pseudo-random numbers in an electronic device, and a method of encrypting and decrypting electronic data |
| US6732127B2 (en) * | 2001-01-10 | 2004-05-04 | Hewlett-Packard Development Company, L.P. | Verifiable random number generator using chaos |
| JP4188571B2 (en) * | 2001-03-30 | 2008-11-26 | 株式会社日立製作所 | Arithmetic method of information processing apparatus and tamper resistant arithmetic disturbance implementation method |
| GB2374258B (en) * | 2001-04-05 | 2004-03-31 | Ibm | Method and apparatus for encryption of data |
| US7233970B2 (en) * | 2001-05-02 | 2007-06-19 | Cipher Corporation Limited | Computational method, system, and apparatus |
| US7218734B2 (en) | 2001-05-02 | 2007-05-15 | Nciper Corporation Limited | Ring arithmetic method, system, and apparatus |
| US7076065B2 (en) * | 2001-05-11 | 2006-07-11 | Lockheed Martin Corporation | Chaotic privacy system and method |
| US6735606B2 (en) * | 2001-05-15 | 2004-05-11 | Qualcomm Incorporated | Multi-sequence fast slewing pseudorandom noise generator |
| US7027598B1 (en) * | 2001-09-19 | 2006-04-11 | Cisco Technology, Inc. | Residue number system based pre-computation and dual-pass arithmetic modular operation approach to implement encryption protocols efficiently in electronic integrated circuits |
| US6456648B1 (en) * | 2001-10-01 | 2002-09-24 | Interdigital Technology Corporation | Code tracking loop with automatic power normalization |
| JP4112494B2 (en) * | 2001-10-25 | 2008-07-02 | 富士通株式会社 | Display control device |
| JP2003216037A (en) * | 2001-11-16 | 2003-07-30 | Yazaki Corp | Cipher key, enciphering device, enciphering/deciphering device, cipher key management device, and deciphering device |
| US7269198B1 (en) * | 2001-11-19 | 2007-09-11 | Bbn Technologies Corp. | Systems and methods for beaconing in wireless networks with low probability of detection |
| US6766345B2 (en) * | 2001-11-30 | 2004-07-20 | Analog Devices, Inc. | Galois field multiplier system |
| JP2003218835A (en) * | 2002-01-18 | 2003-07-31 | Mitsubishi Electric Corp | Spread spectrum transmitter and spread spectrum receiver |
| FR2837331B1 (en) * | 2002-03-13 | 2004-06-18 | Canon Kk | METHOD OF INTERLEAVING A BINARY SEQUENCE |
| US7010055B2 (en) * | 2002-06-27 | 2006-03-07 | Motorola, Inc. | System implementing closed loop transmit diversity and method thereof |
| FR2844891A1 (en) * | 2002-09-20 | 2004-03-26 | St Microelectronics Sa | Microprocessor handled digital data masking method involves factorizing digital data by residue number system based on finite base of numbers or polynomials prime to one another |
| EP1420542A1 (en) * | 2002-11-12 | 2004-05-19 | STMicroelectronics S.r.l. | Method and apparatus of generating a chaos-based pseudo-random sequence |
| JP4098096B2 (en) * | 2003-01-06 | 2008-06-11 | 三菱電機株式会社 | Spread spectrum receiver |
| US7292619B2 (en) | 2003-03-03 | 2007-11-06 | Mitsubishi Electric Research Laboratories | Method and system for acquiring ultra-wide-bandwidth communications signals using sequential block searches |
| JP2004279784A (en) | 2003-03-17 | 2004-10-07 | Nippon Telegr & Teleph Corp <Ntt> | Arithmetic unit on finite field and arithmetic program on finite field |
| US7272168B2 (en) * | 2003-04-01 | 2007-09-18 | Nokia Siemens Networks Oy | Determining the correlation between received samples and available replica samples |
| US7328228B2 (en) * | 2003-09-02 | 2008-02-05 | Sap Aktiengesellschaft | Mapping pseudo-random numbers to predefined number ranges |
| KR100543101B1 (en) * | 2003-10-23 | 2006-01-20 | 학교법인 배재학당 | Apparatus for converting and transmitting a code using chaos system and the method therefor |
| RU2276458C2 (en) * | 2003-11-26 | 2006-05-10 | Институт радиотехники и электроники Российской Академии Наук | Method for direct-chaotic information transfer with given spectrum mask |
| US7460583B2 (en) * | 2003-12-15 | 2008-12-02 | Telefonaktiebolaget Lm Ericsson (Publ) | Method for path searching and verification |
| US7512645B2 (en) * | 2004-03-19 | 2009-03-31 | Texas Instruments Incorporated | System and method for generating pseudorandom numbers |
| US7150399B2 (en) * | 2004-06-09 | 2006-12-19 | Ricoh Co., Ltd. | Embedding barcode data in an auxiliary field of an image file |
| US7078981B2 (en) * | 2004-07-27 | 2006-07-18 | Lucent Technologies Inc. | 16 QAM modulator and method of 16 QAM modulation |
| US7532721B2 (en) * | 2004-10-28 | 2009-05-12 | Cisco Technology, Inc. | Implementation of a switch-box using a subfield method |
| US7512647B2 (en) * | 2004-11-22 | 2009-03-31 | Analog Devices, Inc. | Condensed Galois field computing system |
| US20060209932A1 (en) * | 2005-03-18 | 2006-09-21 | Qualcomm Incorporated | Channel estimation for single-carrier systems |
| ITVA20050027A1 (en) * | 2005-05-03 | 2006-11-04 | St Microelectronics Srl | METHOD OF GENERATION OF SUCCESSIONS OF NUMBERS OR BIT PSEUDO CASUALI |
| US7830214B2 (en) * | 2005-11-29 | 2010-11-09 | Samsung Electronics Co., Ltd. | Adjustable chaotic signal generator using pulse modulation for ultra wideband (UWB) communications and chaotic signal generating method thereof |
| US8059768B2 (en) | 2005-12-07 | 2011-11-15 | Zte Corporation | Method and device for removing narrow band interference in spreading frequency system |
| KR101319115B1 (en) * | 2006-01-27 | 2013-10-17 | 톰슨 라이센싱 | Method and apparatus for multiresolution/multipath searcher |
| US7688878B2 (en) | 2006-03-16 | 2010-03-30 | The Boeing Company | Method and device of peak detection in preamble synchronization for direct sequence spread spectrum communication |
| KR100723222B1 (en) * | 2006-03-28 | 2007-05-29 | 삼성전기주식회사 | Chaotic signal transmitter using pulse shaping method |
| KR100732382B1 (en) * | 2006-04-27 | 2007-06-27 | 주식회사 팬택 | Apparatus and method of obtaining a preamble in an orthogonal frequency division multiple access mobile terminal |
| FR2903200B1 (en) * | 2006-06-29 | 2008-12-19 | Thales Sa | HYBRID STABILIZATION OF IMAGES FOR VIDEO CAMERA |
| US9203438B2 (en) * | 2006-07-12 | 2015-12-01 | Ternarylogic Llc | Error correction by symbol reconstruction in binary and multi-valued cyclic codes |
| LU91292B1 (en) | 2006-12-01 | 2008-06-02 | European Gsa | New Chaotic Spreading Codes for Galileo |
| US7643537B1 (en) * | 2007-01-23 | 2010-01-05 | L-3 Communications, Corp. | Spread spectrum signal detection with inhibiting for known sidelobe locations |
| EP2123074A2 (en) | 2007-02-15 | 2009-11-25 | Koninklijke Philips Electronics N.V. | Coordination in wireless networks having devices with different physical layer transmission schemes |
| US8312551B2 (en) * | 2007-02-15 | 2012-11-13 | Harris Corporation | Low level sequence as an anti-tamper Mechanism |
| US7937427B2 (en) * | 2007-04-19 | 2011-05-03 | Harris Corporation | Digital generation of a chaotic numerical sequence |
| US8611530B2 (en) * | 2007-05-22 | 2013-12-17 | Harris Corporation | Encryption via induced unweighted errors |
| US7921145B2 (en) * | 2007-05-22 | 2011-04-05 | Harris Corporation | Extending a repetition period of a random sequence |
| JP4917478B2 (en) * | 2007-05-25 | 2012-04-18 | 株式会社ケーヒン | Random number generator and vehicle control device |
| US7995757B2 (en) * | 2007-05-31 | 2011-08-09 | Harris Corporation | Closed galois field combination |
| US7970809B2 (en) | 2007-06-07 | 2011-06-28 | Harris Corporation | Mixed radix conversion with a priori defined statistical artifacts |
| US7974413B2 (en) | 2007-06-07 | 2011-07-05 | Harris Corporation | Spread spectrum communications system and method utilizing chaotic sequence |
| US7962540B2 (en) | 2007-06-07 | 2011-06-14 | Harris Corporation | Mixed radix number generator with chosen statistical artifacts |
| US8005221B2 (en) * | 2007-08-01 | 2011-08-23 | Harris Corporation | Chaotic spread spectrum communications system receiver |
| US7995749B2 (en) * | 2007-10-30 | 2011-08-09 | Harris Corporation | Cryptographic system configured for extending a repetition period of a random sequence |
| US20090122926A1 (en) * | 2007-11-13 | 2009-05-14 | Texas Instruments Incorporated | Data throughput in an interference-rich wireless environment |
| US8180055B2 (en) * | 2008-02-05 | 2012-05-15 | Harris Corporation | Cryptographic system incorporating a digitally generated chaotic numerical sequence |
| US8363830B2 (en) * | 2008-02-07 | 2013-01-29 | Harris Corporation | Cryptographic system configured to perform a mixed radix conversion with a priori defined statistical artifacts |
| US8040937B2 (en) * | 2008-03-26 | 2011-10-18 | Harris Corporation | Selective noise cancellation of a spread spectrum signal |
| US8139764B2 (en) * | 2008-05-06 | 2012-03-20 | Harris Corporation | Closed galois field cryptographic system |
| US8320557B2 (en) * | 2008-05-08 | 2012-11-27 | Harris Corporation | Cryptographic system including a mixed radix number generator with chosen statistical artifacts |
| US8145692B2 (en) | 2008-05-29 | 2012-03-27 | Harris Corporation | Digital generation of an accelerated or decelerated chaotic numerical sequence |
| US8200728B2 (en) | 2008-05-29 | 2012-06-12 | Harris Corporation | Sine/cosine generator |
| US8064552B2 (en) | 2008-06-02 | 2011-11-22 | Harris Corporation | Adaptive correlation |
| US8068571B2 (en) | 2008-06-12 | 2011-11-29 | Harris Corporation | Featureless coherent chaotic amplitude modulation |
| US8159938B2 (en) | 2008-06-23 | 2012-04-17 | C.H.E.S.S. Embedded Technology B.V. | Broadcast-only distributed wireless network |
| US8891756B2 (en) * | 2008-10-30 | 2014-11-18 | Certicom Corp. | Collision-resistant elliptic curve hash functions |
| US7974146B2 (en) * | 2008-12-19 | 2011-07-05 | Micron Technology, Inc. | Wordline temperature compensation |
| US8428102B2 (en) | 2009-06-08 | 2013-04-23 | Harris Corporation | Continuous time chaos dithering |
| US8428103B2 (en) | 2009-06-10 | 2013-04-23 | Harris Corporation | Discrete time chaos dithering |
-
2008
- 2008-06-02 US US12/131,386 patent/US8064552B2/en active Active
-
2009
- 2009-06-02 EP EP09759212.5A patent/EP2294518B1/en active Active
- 2009-06-02 JP JP2011512577A patent/JP2011525729A/en active Pending
- 2009-06-02 WO PCT/US2009/045916 patent/WO2009149051A2/en active Application Filing
- 2009-06-02 CA CA2726448A patent/CA2726448A1/en not_active Abandoned
- 2009-06-02 KR KR1020107029878A patent/KR101253870B1/en active IP Right Grant
Also Published As
| Publication number | Publication date |
|---|---|
| WO2009149051A3 (en) | 2011-04-28 |
| US20090296860A1 (en) | 2009-12-03 |
| KR20110028321A (en) | 2011-03-17 |
| EP2294518B1 (en) | 2017-09-06 |
| WO2009149051A2 (en) | 2009-12-10 |
| KR101253870B1 (en) | 2013-04-16 |
| US8064552B2 (en) | 2011-11-22 |
| JP2011525729A (en) | 2011-09-22 |
| EP2294518A2 (en) | 2011-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8064552B2 (en) | Adaptive correlation | |
| US20110200074A1 (en) | Method and system for spread spectrum signal acquisition | |
| EP1147617A1 (en) | Multi-clock matched filter for receiving signals with multipath | |
| KR970014304A (en) | Data segment sync detection circuit and method | |
| US3925650A (en) | Method and apparatus for detecting a repetitive signal in a noisy background | |
| EP1205764A2 (en) | Method, apparatus and system for fast acquisition of a spread spectrum signal | |
| KR100268445B1 (en) | Receiver for spread spectrum coomunication system capable of shortening an acquisition time | |
| JP3275779B2 (en) | Delay decision feedback type sequence estimation receiver | |
| CN100452670C (en) | Apparatus and method for code tracking in a communication system | |
| CN114280639A (en) | Missile-borne high-dynamic Beidou B3I signal capturing method and device based on bit traversal | |
| US7830949B2 (en) | Cross correlation circuits and methods | |
| JP2001094468A (en) | Correlator | |
| US6873664B1 (en) | Method and apparatus for detecting an interleaved code | |
| US9219600B1 (en) | Synchronization through waveform correlation | |
| Svatoň et al. | Pre-and post-correlation method for acquisition of new GNSS signals with secondary code | |
| US20080191932A1 (en) | Method and Device for Correlation Detection in Spread Spectrum Transmission Systems by Fast Fourier Transformation | |
| US6601078B1 (en) | Time-efficient real-time correlator | |
| US7317753B2 (en) | Dynamic matched filter bank and its application in multi-channel spread spectrum communication systems | |
| US6847676B1 (en) | All-lag spread-spectrum correlators with rotating references | |
| KR100655660B1 (en) | WLAN preamble detection apparatus, its preamble detection and timing detection method | |
| CN107846262B (en) | Demodulation code rate detection method based on differential correlation operation | |
| JP2011015159A (en) | Correlation calculation device | |
| US6928105B2 (en) | Vector tree correlator for variable spreading rates | |
| KR20010110351A (en) | Synchronicity detection device | |
| KR100358007B1 (en) | Synchronization acquisiting apparatus for use in a cdma system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |
Effective date: 20170515 |