Systems (100) and methods (400) for selectively controlling access to multiple data streams which are communicated using a shared frequency spectrum and shared spreading codes. The methods involve generating a first product signal (FPS) by spreading first symbols of a first amplitude modulated (AM) signal using a first spreading code (SC). The methods also involve generating a second product signal (SPS) by spreading second symbols of a complimentary AM signal using a second SC. The FPS (124) and SPS 126 are combined to form a protected data communication signal (PDCS) including first data recoverable by a receiver (106). A global data communication signal (GDCS) is combined with PDCS (128) to form an output signal (140) having a spread spectrum format. The GDCS is generated using a digital modulation process and includes second data recoverable by a plurality of receivers (106, 108).
|
1. A method for selectively controlling access to multiple data streams which are communicated using a shared frequency spectrum and shared spreading codes, comprising:
generating a first product signal by spreading first symbols of a first amplitude modulated signal using a first spreading code;
generating a second product signal by spreading second symbols of a complimentary amplitude modulated signal using a second spreading code;
combining said first and second product signals to form a protected data communication signal including first data recoverable by at least one receiver of a plurality of receivers; and
combining a global data communication signal and said protected data communication signal to form an output signal having a spread spectrum format;
wherein said global data communication signal is generated using a digital modulation process and includes second data recoverable by all of said plurality of receivers.
11. A communication system configured for selectively controlling access to multiple data streams which are communicated using a shared frequency spectrum and shared spreading codes, comprising:
a first discrete time amplitude modulator generating a first product signal by spreading first symbols of a first amplitude modulated signal using a first spreading code;
a second discrete time amplitude modulator configured for generating a second product signal by spreading second symbols of a complimentary amplitude modulated signal using a second spreading code;
a first combiner configured for combining said first and second product signals to form a protected data communication signal including first data recoverable by at least one receiver of a plurality of receivers; and
a second combiner configured for combining a global data communication signal and said protected data communication signal to form an output signal having a spread spectrum format;
wherein said global data communication signal is generated using a digital modulation process and includes second data recoverable by all of said plurality of receivers.
2. The method according to
3. The method according to
4. The method according to
5. The method according to
6. The method according to
7. The method according to
8. The method according to
9. The method according to
10. The method according to
12. The communication system according to
13. The communication system according to
14. The communication system according to
15. The communication system according to
16. The communication system according to
17. The communication system according to
a transmitter configured for transmitting said output signal to a first receiver of said plurality of receivers;
wherein said first receiver is configured for recovering said global data communication signal by de-spreading said output signal using a sum of a third spreading code and a fourth spreading code which are respectively identical to said first spreading code and said second spreading code.
18. The communication system according to
19. The communication system according to
20. The communication system according to
a transmitter configured for transmitting said output signal to a first receiver of said plurality of receivers;
wherein said first receiver is configured for recovering said first product signal by de-spreading said output using a third spreading code that is identical to said first spreading code.
|
1. Statement of the Technical Field
The invention concerns communications systems. More particularly, the invention concerns communications systems employing permission-based chaos-based multiple access methods.
2. Description of the Related Art
Pseudorandom number generators (PRNG) generally utilize digital logic or a digital computer and one or more algorithms to generate a sequence of numbers. While the output of conventional PRNG may approximate some of the properties of random numbers, they are not truly random. For example, the output of a PRNG has cyclostationary features that can be identified by analytical processes.
Chaotic systems can generally be thought of as systems which vary unpredictably unless all of its properties are known. When measured or observed, chaotic systems do not reveal any discernible regularity or order. Chaotic systems are distinguished by a sensitive dependence on a set of initial conditions and by having an evolution through time and space that appears to be quite random. However, despite its “random” appearance, chaos is a deterministic evolution.
Practically speaking, chaotic signals are extracted from chaotic systems and have random-like, non-periodic properties that are generated deterministically and are distinguishable from pseudo-random signals generated using conventional PRNG devices. In general, a chaotic sequence is one in which the sequence is empirically indistinguishable from true randomness absent some knowledge regarding the algorithm which is generating the chaos.
Some have proposed the use of multiple pseudo-random number generators to generate a digital chaotic-like sequence. However, such systems only produce more complex pseudo-random number sequences that possess all pseudo-random artifacts and no chaotic properties. While certain polynomials can generate chaotic behavior, it is commonly held that arithmetic required to generate chaotic number sequences requires an impractical implementation due to the precisions required.
Communications systems utilizing chaotic sequences offer promise for being the basis of a next generation of low probability of intercept (LPI) waveforms, low probability of detection (LPD) waveforms, and secure waveforms. While many such communications systems have been developed for generating chaotically modulated waveforms, such communications systems suffer from low throughput. The term “throughput”, as used herein, refers to the amount of data transmitted over a data link during a specific amount of time. This throughput limitation stems from the fact that a chaotic signal is produced by means of a chaotic analog circuit subject to drift.
The throughput limitation with chaos based communication systems can be traced to the way in which chaos generators have been implemented. Chaos generators have been conventionally constructed using analog chaotic circuits. The reason for reliance on analog circuits for this task has been the widely held conventional belief that efficient digital generation of chaos is impossible. Notwithstanding the apparent necessity of using analog type chaos generators, that approach has not been without problems. For example, analog chaos generator circuits are known to drift over time. The term “drift”, as used herein, refers to a slow long term variation in one or more parameters of a circuit. The problem with such analog circuits is that the inherent drift forces the requirement that state information must be constantly transferred over a communication channel to keep a transmitter and receiver synchronized.
The transmitter and receiver in coherent chaos based communication systems are synchronized by exchanging state information over a data link. Such a synchronization process offers diminishing return because state information must be exchanged more often between the transmitter and the receiver to obtain a high data rate. This high data rate results in a faster relative drift. In effect, state information must be exchanged at an increased rate between the transmitter and receiver to counteract the faster relative drift. Although some analog chaotic communications systems employ a relatively efficient synchronization process, these chaotic communications systems still suffer from low throughput.
The alternative to date has been to implement non-coherent chaotic waveforms. However, non-coherent waveform based communication systems suffer from reduced throughput, error rate performance, and exploitability. In this context, the phrase “non-coherent waveform” means that the receiver is not required to reproduce any synchronized copy of the chaotic signals that have been generated in the transmitter. The phrase “communications using a coherent waveform” means that the receiver is required to reproduce a synchronized copy of the chaotic signals that have been generated in the transmitter.
In view of the forgoing, there is a need for a coherent chaos-based communications system having an increased throughput. There is also a need for a chaos-based communications system configured for generating a signal having chaotic properties. As such, there is further a need for a chaos-based communications system that corrects drift between a transmitter and a receiver without an extreme compromise of throughput. Further, there is a need for a secure communication system that provides permission-based segmentation of transmitted data to multiple user groups.
Embodiments of the present invention relate to methods for selectively controlling access to multiple data streams which are communicated using a shared frequency spectrum and shared spreading codes. The methods involve generating a first product signal by spreading first symbols of a first amplitude modulated signal using a first spreading code. The methods also involve generating a second product signal by spreading second symbols of a complimentary amplitude modulated signal using a second spreading code. The first and second spreading codes include pseudo-random number sequences and/or digitally generated chaotic sequences. The second spreading code is orthogonal or statistically orthogonal to the first spreading code.
The first and second product signals are combined to form a protected data communication signal. The protected data communication signal includes first data recoverable by at least one receiver of a plurality of receivers. The methods further involve combining a global data communication signal and the protected data communication signal to form an output signal having a spread spectrum format. The global data communication signal is generated using a digital modulation process. The digital modulation process can include a phase modulation process. The global data communication signal includes second data recoverable by all of the receivers.
According to an aspect of the present invention, the first and second product signals are additively combined to produce a constant power envelope protected data communication signal. The global data communication signal is recovered at a first receiver of the plurality of receivers by de-spreading the output signal using a sum of a third spreading code and a fourth spreading code which are respectively identical to the first spreading code and the second spreading code. The first and third spreading codes are synchronized in time. Also, the second and fourth spreading codes are synchronized in time. Notably, the first receiver is prevented from independently recovering the third spreading code or the fourth spreading code. The first product signal is recovered at the first or a second receiver of the plurality of receivers by de-spreading the output using a third spreading code that is identical to the first spreading code.
Embodiments of the present invention also relate to communication systems configured for selectively controlling access to multiple data streams which are communicated using a shared frequency spectrum and shared spreading codes. The communication systems comprise a first discrete time amplitude modulator, a second discrete time amplitude modulator, a first combiner, and a second combiner. The first discrete time amplitude modulator is configured for generating a first product signal by spreading first symbols of a first amplitude modulated signal using a first spreading code. The second discrete time amplitude modulator is configured for generating a second product signal by spreading second symbols of a complimentary amplitude modulated signal using a second spreading code. The first combiner is configured for combining the first and second product signals to form a protected data communication signal. The protected data signal includes first data recoverable by at least one receiver of a plurality of receivers. The second combiner is configured for combining a global data communication signal and the protected data communication signal to form an output signal having a spread spectrum format. The global data communication signal is generated using a digital modulation process. The global data communication signal includes second data recoverable by all of the receivers.
Embodiments will be described with reference to the following drawing figures, in which like numerals represent like items throughout the figures, and in which:
Embodiments of the present invention will now be described with respect to
The communications systems described herein can be utilized in a variety of different applications where access to certain types of data is selectively controlled. The use of unique configurations of the same spreading codes can be coupled with the use of multiple spreading codes to expand the number of unique access permissions. Such applications include, but are not limited to, military applications and commercial mobile/cellular telephone applications.
Permission Based Multiple Access Communications System
Referring now to
The global data communication signal 134 is formed using a quadrature phase and amplitude modulation (e.g. QAM, APSK) such that global data is encoded in both the phase and amplitude of the global data communication signal 134. In embodiments of the present invention, the global data communication signal 134 is in effect formed using phase modulation only, by selecting a constant amplitude phase-modulated complex value for the duration of a global data symbol. The phase is exclusive to global data. One embodiment of forming the global data signal is as follows. A first global data signal (not shown) is formed by combining global data symbols (e.g., quadrature amplitude shift keying symbols) of a punctured quadrature amplitude modulated (PQAM) constellation with a fixed and specific amplitude.
In contrast to the global data communication signal 134 which is formed effectively using phase modulation only, a protected data communication signal 128 is formed using a combination of pulse amplitude modulated (PAM) symbols and the amplitude complements of the symbols. A first product signal 124 is formed by combining protected data symbols (e.g., PAM symbols) of a first amplitude modulated signal 120 with a first chaotic spreading code CSC1. A second product signal 126 is formed by combining protected data symbols (e.g., PAM symbols) of a second amplitude modulated signal 122 with a second chaotic spreading code CSC2. Chaotic spreading code CSC2 is advantageously selected so that it is orthogonal or statistically orthogonal with respect to the chaotic spreading code CSC1. The second amplitude modulated signal 122 has symbol amplitudes which are the complements of the amplitude of the amplitude modulated signal 120. The chaotic spreading codes CSC1, CSC2 spread the spectrum of the respective data symbols according to a spreading ratio.
A protected data communication signal 128 is obtained by combining the first product signal 124 with the second product signal 126. The protected data communication signal 128 is then combined with the global data communication signal 134 to generate the OCS 140. The protected data communication signal acts to spread the spectrum of the respective global data symbols according to a spreading ratio.
Transmitter 102 is also configured to transmit the OCS 140 to the receivers 106, 108. OCS 140 can be transmitted from the transmitter 102 over the communications channel 104. An embodiment of transmitter 102 will be described below in relation to
Referring now to
Referring again to
Receiver 108 is generally configured for receiving signals transmitted from the transmitter 102. However, receiver 108 is a partial permission receiver. The phrase “partial permission receiver”, as used herein, means that the receiver is configured to only access global data. The global data is recovered by correlating the OCS 140 with a de-spreading code. The de-spreading code is a chaotic sequence defined by the mathematical expression DSC=CSC1′+CSC2′. In this regard, it should be understood that receiver 108 is configured to generate a replica of the sum of the first chaotic spreading code CSC1 and the second chaotic spreading code CSC2. As noted, these replica chaotic spreading codes are referred to as herein as CSC1′ and CSC2′. The replica spreading codes CSC1′, CSC2′ are synchronized in time and frequency with the respective orthogonal or statistically orthogonal chaotic spreading code CSC1, CSC2. An exemplary embodiment of the receiver 106 will be described below in relation to
Generation of Protected Data Communication Signal 128 Shown in
The generation of protected data communication signal 128 shall now be described in relation to
Note that the PAM portion of signal 120 has statistical artifacts due to the periodicity of the modulation that can be used so as to compromise the security of the protected data. As such, the data communication signals 128, 134 can be generated using a method for removing statistical artifacts from the PAM signal 120. In effect, the security of all data can be increased as compared to conventional multiple access communications systems.
Referring now to
As shown in
Referring now to
Such combining operations can be defined by the following mathematical equations (1)-(3) that represent the per symbol power of the signal by adding the symbol power and complementary symbol power. For simplicity, let the symbol voltages drive a one (1) ohm load. Since power equals voltage squared divided by resistance, setting resistance to one (1) ohm simplifies the power calculations to O(SPn)=|A(SPn)|2+|C(SPn)|2.
O(SP1)=|AV(SP1)|2/1Ω+|CV(SP1)|2/1Ω (1)
O(SP2)=|AV(SP2)|2/1Ω+|CV(SP2)|2/1Ω (2)
O(SP3)=|AV(SP3)|2/1Ω+|CV(SP3)|2/1Ω (3)
where O(SP1) is a power of the protected data communication signal 128 for a first output symbol period. O(SP2) is a power of the protected data communication signal 128 for a second output symbol period. O(SP3) is a power of the protected data communication signal 128 for a third output symbol period. AV(SP1) is an amplitude of the PAM signal 120 for a first symbol period. AV(SP2) is an amplitude of the PAM signal 120 for a second symbol period. AV(SP3) is an amplitude of the PAM signal 120 for a third symbol period. CV(SP1) is an amplitude of the complementary PAM signal 122 for a first symbol period. CV(SP2) is an amplitude of the complementary PAM signal 122 for a second symbol period. CV(SP3) is an amplitude of the complementary PAM signal 122 for a third symbol period.
Referring again to
Referring now to
If the Gaussian random number sequences 280, 282 are generated using Gaussian-distributed chaotic number generators, then the random number sequences 280, 282 are chaotic number sequences. It should be understood that a mathematically chaotic signal based on a chaotic number sequence can be made to present itself as a noise signal having a Gaussian distribution. The Gaussian distribution is well known to those having ordinary skill in the art, and therefore will not be described herein. However, it should be appreciated that the power of the chaotic signal is measured as the variance of the Gaussian noise distribution. It is desirable to have the variance of the sum of the products of the combination (or multiplication) operations 226, 228 to equal a constant variance (or power) in statistical expectation. This constant variance need not be obtained from two (2) equal variance signals. Although, both random number generators 232, 234 can be selected to have standard normal (Gaussian) distributions with zero (0) mean and unit variance.
The combination (or multiplication) operations 226, 228 can be defined by mathematical equations (4) and (5) assuming a normalized resistance of one (1) ohm.
FPS=PAMS·FOS=[sqrt[AV(SP1)]·FSRN1], [sqrt[AV(SP1)]·FSRN2], [sqrt[AV(SP1)]·FSRN3], . . . , [sqrt[AV(SP1)]·FSRNM/N], [AV(SP2)]·FSRNM/N+1],[AV(SP2)]·FSRNM/N+2], . . . , [AV(SP2)]FSRN2M/N], [AV(SP3)]·FSRN2M/N+1], (4)
SPS=CS·SOS=[sqrt[CV(SP1)]·SSRN1],[sqrt[CV(SP1)]·SSRN2],[sqrt[CV(SP1)]·SSRN3], . . . , [sqrt[CV(SP1)]·SSRNM/N], [sqrt[CV(SP2)]·SSRNM/N+1],[sqrt[CV(SP2)]·SSRNM/N+2], . . . , [sqrt[CV(SP2)]·SSRN2M/N],[sqrt[CV(SP3)]·SSRN2M/N+1], (5)
where FPS is a first product signal 124 resulting from the multiplication of the square root of an amplitude of the PAM signal 120 and a first orthogonal or statistically orthogonal signal 280. SPS is a second product signal 126 resulting from the multiplication of the square root of an amplitude of the complementary PAM signal 122 and a second orthogonal or statistically orthogonal signal 282. PAMS is the magnitude square root of PAM signal 120. CS is the magnitude square root of complementary PAM signal 122. FOS is the first orthogonal or statistically orthogonal signal 280. SOS is the second orthogonal or statistically orthogonal signal 282.
The addition operation 230 can be defined by the following mathematical equation (6).
DCS=FPS+SPS=[(sqrt[AV(SP1)]·FSRN1)+(sqrt[CV(SP1)]·SSRN1)], . . . , [(sqrt[AV(SP2)]·FSRNL+1)+(sqrt[CV(SP2)]·SSRNL+1)], (6)
where DCS is the protected data communication signal 128 resulting from the combination of the FPS 124 resulting from a first multiplication operation defined above in relation to mathematical equation (4) with the SPS 126 resulting from a first multiplication operation defined above in relation to mathematical equation (5).
Notably, the protected data communication signal 128 is a separable signal if FOS and SOS are known separately. Stated differently, the protected data communication signal 128 is comprised of separable components, namely FPS 124 and SPS 126. The signal components FPS 124 and SPS 126 can be separated utilizing correlation operations as shown in
If only the sum (FOS+SOS) is known (as is the case at a partial permission receiver 108), then the global data can be retrieved using correlation techniques while simultaneously separable protected data spread respectively by FOS and SOS cannot be retrieved.
Referring now to
Thereafter, the method continues with step 406. In step 406, a first part of the protected data communication signal 128 (FP128) is generated by replacing the amplitude of the PAM signal 120 by the square root of the magnitude values |AV(SP1)|, |AV(SP2)|, |AV(SP3)|, . . . , |AV(SPN)| of the PAM signal 120. Notably, dividing a nonzero unsigned number by the square root of its magnitude is equivalent to taking the square root of the magnitude of a that number.
In step 408, a complementary PAM signal 122 is generated for the protected data communication signal 128. The complimentary PAM signal 122 is the second part of the PAM data communication signal 128. The complementary PAM signal 122 is a signal with the same phase (and thus the same sign) as the PAM signal 120. The complementary PAM signal 122 has a magnitude that is one minus the magnitude of the PAM signal 120.
Thereafter, the method continues with step 410. In step 410, a second part of the data communication signal 128 (SP128) is generated by replacing the amplitude of the complementary PAM signal 122 by the square root of the magnitude values 1−|AV(SP1)|, 1−|AV(SP2)|, 1−|AV(SP3)|, . . . , 1−|AV(SPN)| of the PAM signal 120 where |AV(SPn)| is assumed to be normalized to be less than one (1). In such a scenario, the complementary PAM signal 122 has magnitude values defined by the following mathematical equations (7)-(9).
|CV(SP1)|=sqrt(1−|AV(SP1)|) (7)
|CV(SP2)|=sqrt(1|AV(SP2)|) (8)
|CV(SPN)|=sqrt(1−|AV(SPN)|) (9)
where |CV(SP1)| is a first magnitude value of the complementary PAM signal 122. |CV(SP2)| is a second magnitude value of the complementary PAM signal 122. |CV(SPN)| is an Nth magnitude value of the complementary PAM signal 122. Embodiments of the present invention are not limited in this regard. In particular, the amplitude (or magnitude) of the PAM signal 120 may be scaled or normalized to fit within the framework shown in
Upon completing step 410, the method 400 continues with step 412. In step 412, a first Gaussian random number sequence (FGRNS) and a second Gaussian random number sequence (SGRNS) are generated. FGRNS behaves like a first statistically orthogonal signal (FOS). FGRNS is comprised of the random number sequence FSRN1, FSRN2, FSRN3, . . . , FSRNM. The random number sequence FSRN1, FSRN2, FSRN3, . . . , FSRNM can be a true random number sequence, a pseudo-random number sequence, or a chaotic number sequence. Similarly, SGRNS behaves like a second statistically orthogonal signal (SOS). SOS is orthogonal or statistically orthogonal to the FOS. SGRNS is comprised of the random number sequence SSRN1, SSRN2, SSRN3, . . . , SSRNM. The random number sequence SSRN1, SSRN2, SSRN3, . . . , SSRNM can be a true random number sequence, a pseudo-random number sequence, or a chaotic number sequence. Notably, the stationary statistical expectation of FOS and SOS is zero (0). FOS and SOS are generated at an identical rate which is substantially greater than a symbol rate.
After generating the FGRNS and SGRNS, step 414 is performed. In step 414, a first product signal (FPS) 124 is generated by multiplying symbol values of the PAM signal 120 by respective random number values of the FGRNS. For example, if FP128 is comprised of a plurality of pulse amplitude modulated (PAM) symbol periods, then a first PAM symbol Asym(SP1) of a first PAM symbol period is multiplied by a first random number FSRN1 through the Lth random number FSRNM/N of the FGRNS, i.e. Asym(SP1)·FSRN1, Asym(SP1)·FSRN2, . . . , Asym(SP1)·FSRNM/N, where M/N=L is the system's spreading ratio. Similarly, a second PAM symbol Asym(SP2) of a second PAM symbol period is multiplied by a second sequence of random numbers FSRNM/N+1 through FSRN2M/N of the FGRNS, and so on. Embodiments of the present invention are not limited in this regard.
In step 416, a second product signal (SPS) 126 is generated by multiplying symbol values of the complementary PAM signal 122 by respective random number values of the SGRNS. For example, if SP128 is comprised of a plurality of complementary symbol periods, then a first PAM symbol Csym(SP1) of a first complementary symbol period is multiplied by a first random number SSRN1 through the Lth random number SSRNM/N of the SGRNS, i.e., Csym(SP1)·SSRN1, Csym(SP1)·SSRN2, . . . , Csym(SP1)·SSRNM/N, where M/N=L is the system's spreading ratio. Similarly, a second amplitude Csym(SP2) of a second complementary symbol period is multiplied by a second random number sequence SSRNM/N+1 through SSRN2M/N of the SGRNS, and so on. Embodiments of the present invention are not limited in this regard.
After generating the FPS 124 and SPS 126, method 400 continues with step 418. In step 418, the protected data communication signal 128 is generated by adding together each of values of the FPS 124 with respective values of the SPS 126. Subsequently, step 420 is performed where method 400 ends or other processing is resumed.
Referring now to
Referring again to
The DTBM 504 is configured to receive a serial digital data stream from an external device (e.g., a protected data generator). The DTBM 504 is also configured to modulate a serial digital data stream in accordance with any known discrete time amplitude modulation scheme with a restricted set of amplitudes. In embodiments of the present invention, such discrete time amplitude modulation schemes are limited to those with an even number of magnitudes generated by an amplitude modulation scheme whereby all magnitude pairs are symmetric about some mean value and whereby the mean value and the complement of the mean value are equal. Embodiments of the present invention are not limited in this regard. The DTBM 504 is also configured to communicate the PAM signal 120 to the computation device 520.
The GRNSG 506 is configured to generate a first Gaussian random number sequence (FGRNS) 280 and communicate the same to the computation device 520. Similarly, the GRNSG 510 is configured to generate a second Gaussian random number sequence (SGRNS) 282 and communicate the same to the computation device 520. Likewise, the DTBCM 508 is configured to generate the complementary PAM signal 122 and communicate the same to the computation device 520.
The computation device 520 is configured to process the received PAM signal 120, complementary PAM signal 122, FGRNS 280 and SGRNS 282. In this regard, it should be understood that the computation device 520 is comprised of magnitude square root operators (MSRO) 550, 552, complex multipliers 512, 514 and a complex adder 516.
The MSRO 550 is configured to determine the square root of the magnitude of each of the amplitudes values AV(SP1), . . . , AV(SPN) of the PAM signal 120. Accordingly, the magnitude square root operations are defined by the following mathematical equations (10)-(12).
S450-1=sqrt[AV(SP1)] (10)
S450-2=sqrt[AV(SP2)] (11)
S450-N=sqrt[AV(SPN)] (12)
where S450-1 is a result of a first square root operation performed by the MSRO 550. S450-2 is a result of a second square root operation performed by the MSRO 550. S450-N is a result of an Nth square root operation performed by the MSRO 550. The MSRO 550 is further configured to communicate the results S450-1, S450-2, . . . , S450-N of the square root operations to the complex multiplier 512.
The complex multiplier 512 is configured to perform multiplication operations using the results S450-1, S450-2, . . . , S450-N of the square root operations and the FGRNS 280. More particularly, the complex multiplier 512 is configured to multiply each of the results S450-1, S450-2, . . . , S450-N by a respective random number FSRN1, FSRN2, . . . , FSRNM of the FGRNS 280. These multiplication operations can be defined by the following mathematical equations (13)-(15).
R412-1=S450-1·FSRN1=sqrt|A(SP1)|·FSRN1|·angle(FSRN1) (13)
R412-N+1=S450-2·FSRNM/N+1=sqrt|A(SP2)|·|FSRNM/N+1|·angle(FSRNM/N+1) (14)
R412-M=S450-N·FSRNM=sqrt|A(SPN)|·|FSRNM|·angle(FSRNM) (15)
where R412-1 is a result of a first multiplication operation performed by the complex multiplier 512. R412-2 is a result of a second multiplication operation performed by the complex multiplier 512. R412-M is result of an Mth multiplication operation performed by the complex multiplier 512. The complex multiplier 512 is further configured to communicate a first product signal 124 including the results R412-1, R412-2, . . . , R412-M of the multiplication operations to the complex adder 516.
The DTBM 504 is configured to generate symbols with a maximum absolute magnitude less than or equal to unity. The DTBCM 508 is configured to receive the data stream 502 and generate a complementary PAM signal 122. Accordingly, the operations to produce the complementary PAM signal 122 are defined by the mathematical equations (16)-(18).
CS450-1=(1−sqrt|AV(SP1)|)=sqrt|CV(SP1)| (16)
CS450-2=(1−sqrt|AV(SP2)|)=sqrt|CV(SP2)| (17)
CS450-N=(1−sqrt|AV(SPN)|)=sqrt|CV(SPN)| (18)
The complex multiplier 514 is configured to perform multiplication operations using the SGRNS 282 and the results CS450 of the square root operations performed by the MSRO 552. More particularly, the complex multiplier 514 is configured to multiply each of the results CS450-1, CS450-2, . . . CS450-N by a respective random number SSRN1, SSRN2, . . . , SSRNM of the SGRNS 282. These multiplication operations can be defined by the following mathematical equations (19)-(21).
R414-1=CS450-1·SSRN1 (19)
R414-M/N=CS450-2·SSRNM/N (20)
R414-M=CS450-N·SSRNM (21)
where R414-1 is a result of a first multiplication operation performed by the complex multiplier 514. R414-2 is a result of a second multiplication operation performed by the complex multiplier 514. R414-M is a result of an Mth multiplication operation performed by the complex multiplier 514. The multiplier 514 is further configured to communicate a second product signal 126 including the results R414-1, R414-2, . . . , R414-M of the multiplication operations to the complex adder 516.
The complex adder 516 is configured to generate the protected data communication signal 128. More particularly, the complex adder 516 is configured to perform addition operations using the results R412-1, R412-2, . . . , R412-M, R414-1, R414-2, . . . , R414-M received from the complex multipliers 512, 514. These addition operations can be defined by the following mathematical equations (22)-(24).
Sum416-1=R412-1+R414-1 (22)
Sum416-2=R412-2+R414-2 (23)
Sum416-M=R412-M+R414-M (24)
where Sum416-1 is a sum of a first addition operation performed by the complex adder 516. Sum416-2 is a sum of a second addition operation performed by the complex adder 516. Sum416-M is a sum of an Mth addition operation performed by the complex adder 516.
The adder 516 is further configured to communicate the protected data communication signal 128 to an external device (not shown). As should be understood, the external device (not shown) can include radio frequency (RF) hardware configured to transmit a chaotic waveform. RF hardware is well known to those having ordinary skill in the art, and therefore will not be described in detail herein. However, it should be understood that the RF hardware performs actions to process the protected data communication signal 128 for placing the same in a proper form for transmission to a receiving device via a communications link. Note that the protected data communication signal 128 is of substantially similar format to a independently generated sequence of Gaussian random values (not shown) since the addition of two constant variance Gaussian random number sequences is again a constant variance Gaussian random number sequence. The digital baseband chaotic modulator will be described in relation to the transmitter architecture shown in
Referring again to
As discussed above in relation to
Embodiments of the present invention uses only constant amplitude modulated signal constellations for the global data communication signal 134. Exemplary digital modulation constellations include those produced by BPSK, QPSK and 8PSK modulation types. Choosing a constant amplitude signal constellation for the global data communication signal 134 provides the added assurance to the communication system that transmissions use a maximal entropy communication signal without any added cyclostationary signal content. An exemplary architecture to create this maximal entropy communication signal is described with respect to
Transmitter Architecture
Referring to
The transmitter 102 is generally configured for generating quadrature amplitude-and-time-discrete baseband signals. The transmitter 102 is also configured for spreading the quadrature amplitude-and-time-discrete baseband signals over a wide intermediate frequency band. This spreading consists of multiplying the quadrature amplitude-and-time-discrete baseband signals by digital chaotic sequences. The products of these arithmetic operations are hereinafter referred to as digital chaotic signals. In this regard, it should be understood that the transmitter 102 is also configured to process the digital chaotic signals to place the same in a proper analog form suitable for transmission over a communications link. The transmitter 102 is further configured to communicate analog chaotic signals to a receiver (e.g., the receiver 106 and/or 108 described above in relation to
As shown in
The data source 602 is a global data source. The data source 602 is generally an interface configured for receiving an input signal containing global data from an external device (not shown). As such, the data source 602 can be configured for receiving bits of data from the external data source (not shown). The data source 602 can further be configured for supplying bits of data to the source encoder 604 at a particular data transfer rate.
The source encoder 604 is generally configured to encode the global data received from the external device (not shown) using a forward error correction coding scheme. The bits of global data received at or generated by the source encoder 604 represent any type of information that may be of interest to a user. For example, the global data can be used to represent text, telemetry, audio, or video data. The source encoder 604 can further be configured to supply bits of global data to the symbol formatter 606 at a particular data transfer rate.
The symbol formatter 606 is generally configured to process bits of global data for forming channel encoded symbols. In embodiments of the present invention, the source encoded symbols are formatted into parallel words compatible with phase shift keyed (PSK) encoding. The symbol formatter 606 can further be configured for communicating the formatted data to the multiplexer 614.
The symbol formatter 606 is functionally similar to a serial in/parallel out shift register where the number of parallel bits out is equal to log base two (log2) of the order of the channel encoder 616. According to embodiments of the present invention, the symbol formatter 606 is selected for use with a quadrature phase shift keying (QPSK) modulator. As such, symbol formatter 606 is configured for grouping two (2) bits of global data together to form a QPSK symbol data word (i.e., a single two bit parallel word). Thereafter, symbol formatter 606 communicates the formatted symbol word data to the multiplexer 614. Embodiments of the present invention are not limited in this regard.
According to other embodiments of the present invention, symbol formatter 606 is functionally similar to a serial in/parallel out shift register where the number of parallel bits out is equal to log base two (log2) of the order of the channel encoder 616. The symbol formatter 606 is selected for use with a binary phase shift keying (BPSK) modulator. As such, the symbol formatter 606 is configured for mapping one bit of data to a BPSK symbol word. Thereafter, the symbol formatter 606 communicates the BPSK symbol word data to the multiplexer 614. Embodiments of the present invention are not limited in this regard.
According to other embodiments of the present invention, the symbol formatter 606 is selected for use with an 8-ary phase shift keying modulator. As such, the symbol formatter 606 is configured for mapping three (3) bits to an 8-ary PSK symbol word. Thereafter, the symbol formatter 606 communicates the 8-ary PSK symbol word data to the multiplexer 614. Embodiments of the present invention are not limited in this regard.
According to other embodiments of the invention, the symbol formatter 606 is selected for use with a sixteen quadrature amplitude modulator (16QAM). As such, the symbol formatter 606 is configured for mapping four (4) bits to a 16QAM symbol word. Thereafter, the symbol formatter 606 communicates the 16QAM symbol word data to the multiplexer 614. Embodiments of the present invention are not limited in this regard. Notably, when the symbol formatter 606 is selected for use with a non-constant amplitude data modulator, the output communication signal 140 tends to have detectable cyclostationary content.
Referring again to
Multiplexer 614 is configured to receive a binary word (that is to be modulated by the channel encoder 616) from the symbol formatter 606. The multiplexer 614 is also configured to receive the “known data preamble” from the acquisition data generator 608. The multiplexer 614 is coupled to the transmitter controller 610. The transmitter controller 610 is configured for controlling the multiplexer 614 so that the multiplexer 614 routes the “known data preamble” to the channel encoder 616 at the time of a new transmission.
According to alternative embodiments of the invention, the “known data preamble” is stored in a modulated form. In such a scenario, the architecture of
Referring again to
The channel encoder 616 can be configured for performing actions to represent the “known data preamble” and the symbol data in the form of a modulated quadrature amplitude-and-time-discrete digital signal. The modulated quadrature amplitude-and-time-discrete digital signal is defined by digital words which represent intermediate frequency (IF) modulated symbols comprised of bits of global data having a one (1) value or a zero (0) value. Methods for representing digital symbols by a quadrature amplitude-and-time-discrete digital signal are well known to persons having ordinary skill in the art, and therefore will not be described herein. However, it should be appreciated that the channel encoder 616 can employ any known method for representing digital symbols by a quadrature amplitude-and-time-discrete digital signal.
As shown in
According to embodiments of the present invention, the transmitter 102 is comprised of a sample rate matching device (not shown) between channel encoder 616 and complex multiplier 646. The sample rate matching device (not shown) can perform a sample rate increase on the amplitude-and-time-discrete digital signal so that a sample rate of the amplitude-and-time-discrete digital signal is the same as a digital chaotic sequence communicated to the complex multiplier 646. Embodiments of the present invention are not limited in this regard.
Complex multiplier 646 can be configured for performing a complex multiplication in the digital domain. The complex multiplier 646 is configured to receive an input from the channel encoder 616. The complex multiplier is further configured to receive an input from the complex adder 684. In the complex multiplier 646, the quadrature amplitude-and-time-discrete digital signal from the channel encoder 616 is multiplied by the sum of the two sample rate matched chaotic sequences. The sum chaotic signal is generated in the complex adder 684. The complex multiplier 646 generates the output communication signal 140 from the global data communication signal 134 and the protected data communication signal 128. The complex multiplier 646 is configured to deliver its output to an interpolator 626.
Data source 660 is a protected data source. Data source 660 is generally an interface configured for receiving an input signal containing protected data from an external device (not shown). As such, data source 660 can be configured for receiving bits of data from the external data source (not shown). Data source 660 can further be configured for supplying bits of data to source encoder 662 at a particular data transfer rate.
Source encoder 662 is generally configured to encode the protected data received from the external device (not shown) using a forward error correction coding scheme. The bits of protected data received at or generated by the source encoder 662 represent any type of information that may be of interest to a user. For example, the protected data can be used to represent text, telemetry, audio, or video data. Source encoder 662 can further be configured to supply bits of protected data to symbol formatter 664 at a particular data transfer rate.
The symbol formatter 664 is generally configured to process bits of protected data for forming channel encoded symbols. According to embodiments of the present invention, the source encoded symbols are formatted into parallel words compatible with pulse amplitude modulation (PAM) encoding. The symbol formatter 664 can further be configured for communicating the formatted data to the multiplexer 666.
Multiplexer 666 is generally configured for selecting symbol data to be routed to channel encoder 668 after a preamble period has expired. Multiplexer 666 can also be configured for communicating symbol data to channel encoder 668. In this regard, it should be appreciated that a communication of the symbol data to channel encoder 668 can be delayed by a time defined by the length of the “known data preamble.”
Channel encoder 668 is generally configured for performing actions to represent the “known data preamble” and/or the symbol data in the form of a modulated amplitude-and-time-discrete digital signal. The modulated amplitude-and-time-discrete digital signal is defined by digital words which represent intermediate frequency (IF) modulated symbols comprised of bits of protected data having a one (1) value or a zero (0) value. Methods for representing digital symbols by an amplitude-and-time-discrete digital signal are well known to persons having ordinary skill in the art, and therefore will not be described herein. However, it should be appreciated that channel encoder 668 can employ any known method for representing digital symbols by an amplitude-and-time-discrete digital signal. Accordingly, channel encoder 668 is configured for communicating amplitude data to the MSRO 686 and complement signal generator 682.
MSRO 686 is the same as or substantially similar to the MSRO 550 of
Complex multiplier 678 is generally configured for performing a complex multiplication in the digital domain. In digital complex multiplier 678, a signal including results of square root operations performed by MSRO 686 is multiplied by a chaotic spreading code CSC1. Chaotic spreading code CSC1 is a digital representation of a chaotic sequence. The chaotic sequence is generated by chaos generator 640 and real uniform to quadrature Gaussian statistics mapper (RUQG) 674. Chaos generator 640 is generally configured for generating chaotic sequences in accordance with the methods described below in relation to
RUQG 674 is generally configured for statistically transforming the chaotic spreading code (or chaotic sequence) into a transformed digital chaotic sequence with pre-determined statistical properties. The transformed digital chaotic sequence can have a characteristic form including real or quadrature. The transformed digital chaotic sequence can have different word widths and/or different statistical distributions. For example, RUQG 674 may take in two (2) uniformly distributed real inputs from the chaos generator 640 and convert those via a complex-valued bivariate Gaussian transformation to a quadrature output having statistical characteristics of a Guassian distribution. Such conversion techniques are well understood by those having ordinary skill in the art, and therefore will not be described in herein. However, it should be understood that such conversion techniques may use nonlinear processors, look-up tables, iterative processing (CORDIC functions), or other similar mathematical processes. RUQG 674 is also configured for communicating transformed chaotic sequences to the complex multiplier 678.
According to embodiments of the present invention, RUQG 674 statistically transforms the chaotic spreading code into a quadrature Gaussian form of the digital chaotic sequence. This statistical transformation is achieved via a nonlinear processor that combines lookup tables and embedded computational logic to implement the conversion of two (2) independent uniformly distributed random variables into a quadrature pair of Gaussian distributed variables. One such structure for this conversion is as shown in the mathematical equations (25) and (26).
G1=√{square root over (−2 log(u1))}·cos(2πu2) (25)
G2=√{square root over (−2 log(u1))}·sin(2πu2) (26)
where {u1, u2} are uniformly distributed independent input random variables and {G1, G2} are Gaussian distributed output random variables. Embodiments of the present invention are not limited in this regard. The output of the RUGQ 674 is the first chaotic spreading code CSC1.
Referring again to
Complement signal generator (CSG) 682 is the same as or substantially similar to the compliment signal generator 508 of
Complex multiplier 680 is generally configured for performing a complex multiplication in the digital domain. In complex multiplier 680, the compliment signal from the CSG 682 is multiplied by a chaotic sequence. The chaotic sequence is generated by chaos generator 618. Chaos generator 618 is the same as or substantially similar to chaos generator 640. As such, the description of chaos generator 640 is sufficient for understanding chaos generator 618. However, is should be noted that chaos generator 618 is generally configured for generating chaotic sequences in accordance with the methods described below in relation to
RUQG 670 is generally configured for statistically transforming chaotic sequences into transformed digital chaotic sequences with pre-determined statistical properties. The transformed digital chaotic sequences can have characteristic forms including real or quadrature. The transformed digital chaotic sequences can have different word widths and/or different statistical distributions. For example, RUQG 670 may take in two (2) uniformly distributed real inputs from chaos generator 618 and convert those via a complex-valued bivariate Gaussian transformation to a quadrature output having statistical characteristics of a Guassian distribution. Such conversion techniques are well understood by those having ordinary skill in the art, and therefore will not be described in herein. However, it should be understood that such conversion techniques may use nonlinear processors, look-up tables, iterative processing (CORDIC functions), or other similar mathematical processes. RUQG 670 is also configured for communicating transformed chaotic sequences to the complex multiplier 680.
According to embodiments of the present invention, RUQG 670 statistically transforms the chaotic sequence into a quadrature Gaussian form of the digital chaotic sequence. This statistical transformation is achieved via a nonlinear processor that combines lookup tables and embedded computational logic to implement the conversion of two (2) independent uniformly distributed random variables into a quadrature pair of Gaussian distributed variables. One such structure for this conversion is as shown in the above provided mathematical equations (25) and (26). Embodiments of the present invention are not limited in this regard. The output of the RUGQ 670 is the second chaotic spreading code CSC2.
Referring again to
Complex adder 684 is configured for generating the protected data communication signal 128 shown in
Interpolator 626, real part of complex multiplier 628, and quadrature digital local oscillator 630 form at least one intermediate frequency (IF) translator. IF translators are well known to persons having ordinary skill in the art, and therefore will not be described herein. However, it should be understood that components 626, 628, 630 can be collectively configured for frequency modulating a signal received from complex multiplier 646 to a sampled spread spectrum digital chaotic signal. The IF translator (i.e., component 628) is configured for communicating the sampled spread spectrum digital chaotic signal to the DAC 632, wherein the sampled spread spectrum digital chaotic signal has an increased sampling rate and a non-zero intermediate frequency. DAC 632 can be configured for converting the sampled spread spectrum digital chaotic signal to an analog signal. DAC 632 can also be configured for communicating the analog signal to anti-image filter 634.
Anti-image filter 634 is configured for removing spectral images from the analog signal to form a smooth time domain signal. Anti-image filter 634 is also configured for communicating a smooth time domain signal to the RF conversion device 636. RF conversion device 636 can be a wide bandwidth analog IF-to-RF up converter. RF conversion device 636 is configured for forming an RF signal by centering a smooth time domain signal at an RF for transmission. RF conversion device 636 is also configured for communicating RF signals to a power amplifier (not shown). The power amplifier (not shown) is configured for amplifying a received RF signal. The power amplifier (not shown) is also configured for communicating amplified RF signals to an antenna element 638 for communication to a receiver (e.g., receiver 106 and/or 108 described above in relation to
It should be understood that the digital generation of the digital chaotic sequences at transmitter 102 and receivers (e.g., receiver 106 and/or 108 described above in relation to FIG. 1A) is kept closely coordinated under the control of a precision real time reference 612 clock. If the precision of the clock 612 is relatively high, then the synchronization of the chaos generators 618, 640 of transmitter 102 and the chaos generators (described below in relation to
Receiver Architectures
Referring now to
Antenna element 702 is generally configured for receiving an analog input signal communicated from a transmitter (e.g., transmitter 102 described above in relation to
RF-to-IF conversion device 710 is generally configured for mixing an analog input signal to a particular IF. RF-to-IF conversion device 710 is also configured for communicating mixed analog input signals to anti-alias filter 712. Anti-alias filter 712 is configured for restricting a bandwidth of a mixed analog input signal. Anti-alias filter 712 is also configured for communicating filtered, analog input signals to A/D converter 714. A/D converter 714 is configured for converting received analog input signals to digital signals. A/D converter 714 is also configured for communicating digital input signals to multipliers 716, 718.
Receiver 106 further includes a quadrature digital local oscillator (QDLO) 722, frequency control word 782, phase control word 784, and lowpass filters 790, 792.
Receiver 106 can also be configured for obtaining protected data encoded in the first product signal 124 from the transmitted analog chaotic signal by correlating it with a replica of the chaotic sequences generated by chaos generator 640 of the transmitter (e.g., transmitter 102 described above in relation to
Notably, receiver 106 of
As shown in
QDLO 722 shown in
Complex multiplier 716 is configured for receiving digital words from the A/D converter 714 and digital words from the in-phase component of the QDLO 722. Complex multiplier 716 is also configured for generating digital output words by multiplying digital words from A/D converter 714 by digital words from the QDLO 722. Complex multiplier 716 is further configured for communicating real data represented as digital output words to lowpass filter 790.
Complex multiplier 718 is configured for receiving digital words from A/D converter 714 and digital words from the quadrature-phase component of the QDLO 722. Complex multiplier 718 is also configured for generating digital output words by multiplying the digital words from A/D converter 714 by the digital words from QDLO 722. Complex multiplier 718 is further configured for communicating imaginary data represented as digital output words to lowpass filter 792.
Lowpass filter 790 is configured to receive the real digital data from multiplier 716 and lowpass filter the real data to generate the in-phase digital data component of the quadrature baseband form of the received signal. Lowpass filter 790 is further configured to communicate the in-phase digital output words to acquisition correlator 754 and correlators 770, 772, 728. Lowpass filter 792 is configured to receive the imaginary digital data from multiplier 718 and lowpass filter the imaginary data to generate the quadrature-phase digital data component of the quadrature baseband form of the received signal. Lowpass filter 792 is further configured to communicate the in-phase digital output words to acquisition correlator 754 and correlators 770, 772, 728.
It should be noted that the functional blocks hereinafter described in
Complex correlators 728, 770, 772 are configured for performing complex correlations in the digital domain. Each of the complex correlators can generally involve multiplying digital words received from multipliers 716, 718 (filtered by lowpass filters 790, 792) by digital words representing a chaotic sequence and computing a complex sum of products with staggered temporal offsets. The chaotic sequences are generated by chaos generators 740, 760, RUQGs 742, 762, or the sum of the two sequences. A first one of the chaotic sequences CSC1′ is a replica of a chaotic sequence CSC, generated by chaos generator 640 and RUQG 674 of the transmitter (e.g., transmitter 102 described above in relation to
The first and second chaotic sequences CSC1′, CSC2′ are generally generated in accordance with the methods described below in relation to
Chaos generator 740 is configured for communicating its chaotic sequence to the RUQG 742. Chaos generator 760 is configured for communicating its chaotic sequence to the RUQG 762. In this regard, it should be appreciated that chaos generators 740, 760 are coupled to receiver controller 738. Receiver controller 738 is configured to control chaos generators 740, 760 so that chaos generators 740, 760 generate chaotic sequences with the correct initial state when receiver 106 is in an acquisition mode and a tracking mode.
RUQGs 742, 762 are configured for statistically transforming digital chaotic sequences into transformed digital chaotic sequences. Each of the transformed digital chaotic sequences has a characteristic form. The characteristic form can include, but is not limited to, real, complex, quadrature, and combinations thereof. Each of the transformed digital chaotic sequences can have different word widths and/or different statistical distributions. RUQGs 742, 762 are also configured for communicating transformed chaotic sequences to re-sampling filters 744, 764.
According to the embodiment of the invention, RUQGs 742, 762 are configured for statistically transforming digital chaotic sequences into quadrature Gaussian forms of the digital chaotic sequences. RUQGs 742, 762 are also configured for communicating quadrature Gaussian form of the digital chaotic sequences to the re-sampling filters 744, 764. More particularly, RUQGs 742, 762 communicate in-phase (“I”) data and quadrature phase (“Q”) data to the re-sampling filters 744, 764. Embodiments of the present invention are not limited in this regard.
Referring again to
It should be noted that if a sampled form of a chaotic sequence is thought of as discrete samples of a continuous band limited chaos then re-sampling filters 744, 764 are effectively tracking the discrete time samples, computing continuous representations of the chaotic sequences, and re-sampling the chaotic sequences at the discrete time points required to match the discrete time points sampled by the A/D converter 714. In effect, input values and output values of each re-sampling filter 744, 764 are not exactly the same because the values are samples of the same waveform taken at slightly offset times. However, the values are samples of the same waveform so the values have the same power spectral density.
Referring again to
Referring again to
Correlators 770, 772, 728 are configured to correlate locally generated chaotic signals with the received chaotic spread signals to recover the protected and local data. When properly aligned with symbol timing, correlator 770 recovers protected data by correlating the received spread signal with the chaotic sequence CSC1′. Correlator 772 recovers complement protected data by correlating the received spread signal with the chaotic sequence CSC2′. Correlator 728 is configured for recovering global data by correlating the received spread signal with the global chaotic sequence CSC1′+CSC2′. In this regard, it should be understood that the sense of the real and imaginary components of the correlations is directly related to the values of the real and imaginary components of the symbols of a digital input signal. It should also be understood that the magnitudes relative to a reference magnitude of the real and imaginary components of the correlation can be directly related to the magnitude values of the real and imaginary components of the amplitude modulated symbols of a digital input signal. The reference value is dependent on the processing gain of the correlator, the gain control value, and the overall gain of the receiver signal processing chain. Methods for calculating a reference magnitude are known to those having ordinary skill in the art and shall not be discussed in detail herein. Thus, the data recovery correlators include both phase and magnitude components of symbol soft decisions. The phrase “soft decisions”, as used herein, refers to soft-values (which are represented by soft-decision bits) that comprise information about the bits contained in a sequence. Soft-values are values that represent the probability that a particular symbol is an allowable symbol. For example, a soft-value for a particular binary symbol can indicate that a probability of a bit being a one (1) is p(1)=0.3. Conversely, the same bit can have a probability of being a zero (0) which is p(0)=0.7.
Similarly, at least one of the correlators is configured to facilitate symbol timing tracking. Correlator 728 is configured for correlating a chaotic sequence CSC1′+CSC2′ with a digital input signal on the assumed symbol boundaries, advanced symbol boundaries, and retarded symbol boundaries. In this regard, it should be understood that, the sense and magnitude of the real and imaginary components of the correlation is directly related to the time offsets of the real and imaginary components of the symbols relative to actual boundaries. This symbol tracking technique is well known to those having ordinary skill in the art and shall not be discussed in detail herein. It should also be understood that this symbol time tracking method is only one of a number of methods known to those skilled in the art and does not limit the scope of the invention in any way. The symbol time tracking correlator is also configured to communicate advanced, on time, and retarded correlation information to the symbol timing recovery block 726.
Each of the correlators 770, 772, are also configured for communicating soft decisions to a protected data hard decision device 774 for final symbol decision making. The protected data hard decision device 774 is configured for communicating symbol decisions to a protected data source decoder 776. The protected data source decoder 776 is configured for converting symbols to a binary form and decoding any FEC applied at a transmitter (e.g., transmitter 102 described above in relation to
Acquisition Mode:
The acquisition correlator 754 is generally configured for acquiring initial timing information associated with a chaotic sequence and initial timing associated with a data sequence. The acquisition correlator 754 is further configured for acquiring initial phase and frequency offset information between a chaotic sequence and a digital input signal. Methods for acquiring initial timing information are well known to persons having ordinary skill in the art, and therefore will not be described herein. Similarly, methods for acquiring initial phase/frequency offset information are well known to persons having ordinary skill in the art, and therefore will not be described herein. However, it should be appreciated that any such method for acquiring initial timing information and/or for tracking phase/frequency offset information can be used without limitation.
The acquisition correlator 754 is configured for communicating magnitude and phase information as a function of time to the loop control circuit 720. Loop control circuit 720 is configured for using magnitude and phase information to calculate a deviation of an input signal magnitude from a nominal range and to calculate timing, phase, and frequency offset information. The calculated information can be used to synchronize a chaotic sequence with a digital input signal. Loop control circuit 720 is also configured for communicating phase/frequency offset information to the QDLO 722 and for communicating gain deviation compensation information to the AGC amplifier 708. Loop control circuit 720 is further configured for communicating retiming control signals to re-sampling filters 744, 764 and chaos generators 740, 760.
Precision real time reference 736 is the same as or substantially similar to the precision real time reference 612 of
The operation of receiver 106 will now be briefly described with regard to an acquisition mode and a steady state demodulation mode. In acquisition mode, re-sampling filters 744, 764 perform a rational rate change and forwards a transformed chaotic sequences to a complex adder 746. The complex adder forms the global chaotic sequence CSC1′+CSC2′ and outputs it to digital complex multiplier 752. CEADG 750 generates a modulated acquisition sequence and forwards the same to a particular digital complex multiplier 752. The complex multiplier 752 performs a complex multiplication in the digital domain. In the complex multiplier 752, a modulated acquisition sequence from the CEADG 750 is multiplied by a digital representation of a chaotic sequence to yield a reference for a digital input signal that was generated at a transmitter (e.g., transmitter 102 described above in relation to
Steady State Demodulation Mode:
In the embodiment shown in
Loop control circuit 720 monitors the output of the global correlator 728. When loop control circuit 720 detects fixed correlation phase offsets, the phase control of QDLO 722 is modified to remove the phase offset. When loop control circuit 720 detects phase offsets that change as a function of time, it adjusts re-sampling filters 744, 764 which act as incommensurate re-samplers when receiver 106 is in steady state demodulation mode or the frequency control of QDLO 722 is modified to remove frequency or timing offsets.
When the correlator's 728 output indicates that the received digital input signal timing has “drifted” more than plus or minus a half (½) of a sample time relative to a locally generated chaotic sequence, loop control circuit 720 (1) adjusts a correlation window in an appropriate temporal direction by one sample time, (2) advances or retards a state of the local chaos generators 740, 760 by one iteration state, and (3) adjusts re-sampling filters 744, 764 to compensate for the time discontinuity. This loop control circuit 720 process keeps the chaos generators 618, 640 of the transmitter (e.g., transmitter 102 described above in relation to
If a more precise temporal synchronization is required to enhance performance, a re-sampling filter can be implemented as a member of the class of polyphase fractional time delay filters. This class of filters is well known to persons having ordinary skill in the art, and therefore will not be described herein.
As described above, a number of chaotic samples are combined with an information symbol at the transmitter 102. Since the transmitter 102 and receiver 106 timing are referenced to two (2) different precision real time reference clock 612, 736 oscillators, symbol timing must be recovered at receiver 106 to facilitate robust demodulation. In another embodiment, symbol timing recovery can include (1) multiplying a received input signal by a complex conjugate of a locally generated chaotic sequence using a complex multiplier, (2) computing an N point running average of the product where N is a number of chaotic samples per symbol time, (3) storing the values, the maximum absolute values of the running averages, and the time of occurrence, and (4) statistically combining the values at the symbol timing recovery circuit 726 to recover symbol timing.
In this steady state demodulation mode, symbol timing recovery circuit 726 communicates symbol onset timing to correlators 770, 772, 728 for controlling an initiation of a symbol correlation. The correlators 770, 772, 728 correlates a locally generated chaotic sequence with a received digital input signal during symbol duration. The sense and magnitude of real and imaginary components of the correlation are directly related to the values of the real and imaginary components of symbols of a digital input signal. Accordingly, the correlators 770, 772, 728 generates symbol soft decisions.
Referring now to
As shown in
As shown in
Components 850, 826, 838, 836, 828, 854, 866, 868, 852, 840, 860, 842, 862, 844, 864, 846 of the receiver 108 are the same as or substantially similar to the respective components 750, 726, 738, 736, 728, 754, 766, 768, 752, 740, 760, 742, 762, 744, 764, 746 of
In some embodiments of the present invention, the intermediate calculation results and other related values used to generate the despreading sequence DSC of
Chaos Generators and Digital Chaotic Sequence Generation
Referring now to
Each of the polynomial equations f0(x(nT)), . . . , fN−1(x(nT)) can be solved independently to obtain a respective solution. Each solution can be expressed as a residue number system (RNS) residue value using RNS arithmetic operations, i.e., modulo operations. Modulo operations are well known to persons having ordinary skill in the art, and therefore will not be described herein. However, it should be appreciated that an RNS residue representation for some weighted value “a” can be defined by mathematical equation (27).
R={a modulo m0,a modulo m1, . . . , a modulo mN−1} (27)
where R is an RNS residue N-tuple value representing a weighted value “a” and m0, m1, . . . , mN−1 respectively are the moduli for RNS arithmetic operations applicable to each polynomial equation f0(x(nT)), . . . , fN−1(x(nT)). R(nT) can be a representation of the RNS solution of a polynomial equation f(x(nT)) defined as R(nT){f0(x(nT)) modulo m0, f1(x(nT)) modulo m1, . . . , fN−1(x(nT)) modulo mN−1}.
From the foregoing, it will be appreciated that the RNS employed for solving each of the polynomial equations f0(x(nT)), . . . , fN−1(x(nT)) respectively has a selected modulus value m0, m1, . . . , mN−1. The modulus value chosen for each RNS moduli is preferably selected to be relatively prime numbers p0, p1, . . . , pN−1. The phrase “relatively prime numbers”, as used herein, refers to a collection of natural numbers having no common divisors except one (1). Consequently, each RNS arithmetic operation employed for expressing a solution as an RNS residue value uses a different prime number p0, p1, . . . , pN−1 as a moduli m0, m1, . . . , mN−1.
The RNS residue value calculated as a solution to each one of the polynomial equations f0(x(nT)), . . . , fN−1(x(nT)) will vary depending on the choice of prime numbers p0, p1, . . . , pN−1 selected as a moduli m0, m1, . . . , mN−1. Moreover, the range of values will depend on the choice of relatively prime numbers p0, p1, . . . , pN−1 selected as a moduli m0, m1, . . . , mN−1. For example, if the prime number five hundred three (503) is selected as modulus m0, then an RNS solution for a first polynomial equation f0(x(nT)) will have an integer value between zero (0) and five hundred two (502). Similarly, if the prime number four hundred ninety-one (491) is selected as modulus m1, then the RNS solution for a second polynomial equation f1(x(nT)) has an integer value between zero (0) and four hundred ninety (490).
According to an embodiment of the invention, each of the polynomial equations f0(x(nT)), . . . , fN−1(x(nT)) is selected as an irreducible cubic polynomial equation having chaotic properties in Galois field arithmetic. Each of the polynomial equations f0(x(nT)), . . . , fN−1(x(nT)) can also be selected to be a constant or varying function of time. The irreducible cubic polynomial equation is defined by a mathematical equation (28).
f(x(nT))=Q(k)x3(nT)+R(k)x2(nT)+S(k)x(nT)+C(k,L) (28)
where:
In embodiments of the present invention, a value of C is selected which empirically is determined to produce an irreducible form of the stated polynomial equation f(x(nT)) for a particular prime modulus. For a given polynomial with fixed values for Q, R, and S more than one value of C can exist, each providing a unique iterative sequence. Embodiments of the present invention are not limited in this regard.
According to another embodiment of the invention, the polynomial equations f0(x(nT)), . . . , fN−1(x(nT)) are identical exclusive of a constant value C. For example, a first polynomial equation f0(x(nT)) is selected as f0(x(nT))=3x3(nT)+3x2(nT)+x(nT)+C0. A second polynomial equation f1(x(nT)) is selected as f1(x(nT))=3x3(nT)+3x2(nT)+x(nT)+C1. A third polynomial equation f2(x(nT)) is selected as f2(x(nT))=3x3(nT)+3x2(nT)+x(nT)+C2, and so on. Each of the constant values C0, C1, . . . , CN−1 is selected to produce an irreducible form in a residue ring of the stated polynomial equation f(x(nT))=3x3(nT)+3x2(nT)+x(nT)+C. In this regard, it should be appreciated that each of the constant values C0, C1, . . . , CN−1 is associated with a particular modulus m0, m1, . . . , mN−1 value to be used for RNS arithmetic operations when solving the polynomial equation f(x(nT)). Such constant values C0, C1, . . . , CN−1 and associated modulus m0, m1, . . . , mN−1 values which produce an irreducible form of the stated polynomial equation f(x(nT)) are listed in the following Table (1).
TABLE 1
Sets of constant values
Moduli values m0, m1, . . . , mN−1:
C0, C1, . . . , CN−1:
3
{1, 2}
5
{1, 3}
11
{4, 9}
29
{16, 19}
47
{26, 31}
59
{18, 34}
71
{10, 19, 20, 29}
83
{22, 26, 75, 79}
101
{27, 38, 85, 96}
131
{26, 39, 77, 90}
137
{50, 117}
149
{17, 115, 136, 145}
167
{16, 32, 116, 132}
173
{72, 139}
197
{13, 96, 127, 179}
233
{52, 77}
251
{39, 100, 147, 243}
257
{110, 118}
269
{69, 80}
281
{95, 248}
293
{37, 223}
311
{107, 169}
317
{15, 55}
347
{89, 219}
443
{135, 247, 294, 406}
461
{240, 323}
467
{15, 244, 301, 425}
479
{233, 352}
491
{202, 234}
503
{8, 271}
Embodiments of the present invention are not limited in this regard.
The number of discrete magnitude states (dynamic range) that can be generated with the system shown in
Referring again to
According to an embodiment of the invention, each binary sequence representing a residue value has a bit length (BL) defined by a mathematical equation (29).
BL=Ceiling[Log 2(m)] (29)
where m is selected as one of moduli m0, m1, . . . , mN−1. Ceiling[u] refers to a next highest whole integer with respect to an argument u.
In order to better understand the foregoing concepts, an example is useful. In this example, six (6) relatively prime moduli are used to solve six (6) irreducible polynomial equations f0(x(nT)), . . . , f5(x(nT)). A prime number p0 associated with a first modulus m0 is selected as five hundred three (503). A prime number p1 associated with a second modulus m1 is selected as four hundred ninety one (491). A prime number p2 associated with a third modulus m2 is selected as four hundred seventy-nine (479). A prime number p3 associated with a fourth modulus m3 is selected as four hundred sixty-seven (467). A prime number p4 associated with a fifth modulus m4 is selected as two hundred fifty-seven (257). A prime number p5 associated with a sixth modulus m5 is selected as two hundred fifty-one (251). Possible solutions for f0(x(nT)) are in the range of zero (0) and five hundred two (502) which can be represented in nine (9) binary digits. Possible solutions for f1(x(nT)) are in the range of zero (0) and four hundred ninety (490) which can be represented in nine (9) binary digits. Possible solutions for f2(x(nT)) are in the range of zero (0) and four hundred seventy eight (478) which can be represented in nine (9) binary digits. Possible solutions for f3(x(nT)) are in the range of zero (0) and four hundred sixty six (466) which can be represented in nine (9) binary digits. Possible solutions for f4(x(nT)) are in the range of zero (0) and two hundred fifty six (256) which can be represented in nine (9) binary digits. Possible solutions for f5(x(nT)) are in the range of zero (0) and two hundred fifty (250) which can be represented in eight (8) binary digits. Arithmetic for calculating the recursive solutions for polynomial equations f0(x(nT)), . . . , f4(x(nT)) requires nine (9) bit modulo arithmetic operations. The arithmetic for calculating the recursive solutions for polynomial equation f5(x(nT)) requires eight (8) bit modulo arithmetic operations. In aggregate, the recursive results f0(x(nT)), . . . , f5(x(nT)) represent values in the range from zero (0) to M−1. The value of M is calculated as follows: p0·p1·p2·p3·p4·p5=503·491·479·467·257·251=3,563,762,191,059,523. The binary number system representation of each RNS solution can be computed using Ceiling[Log 2(3,563,762,191,059,523)]=Ceiling[51.66]=52 bits. Because each polynomial is irreducible, all 3,563,762,191,059,523 possible values are computed resulting in a sequence repetition time of every M times T seconds, i.e., a sequence repetition times an interval of time between exact replication of a sequence of generated values. Embodiments of the present invention are not limited in this regard.
Referring again to
According to an aspect of the invention, the RNS solutions No. 1, . . . , No. N are mapped to a weighted number system representation by determining a series of digits in the weighted number system based on the RNS solutions No. 1, . . . , No. N. The term “digit”, as used herein, refers to a symbol of a combination of symbols to represent a number. For example, a digit can be a particular bit of a binary sequence. According to another aspect of the invention, the RNS solutions No. 1, . . . , No. N are mapped to a weighted number system representation by identifying a number in the weighted number system that is defined by the RNS solutions No. 1, . . . , No. N. According to yet another aspect of the invention, the RNS solutions No. 1, . . . , No. N are mapped to a weighted number system representation by identifying a truncated portion of a number in the weighted number system that is defined by the RNS solutions No. 1, . . . , No. N. The truncated portion can include any serially arranged set of digits of the number in the weighted number system. The truncated portion can also be exclusive of a most significant digit of the number in the weighted number system. The truncated portion can be a chaotic sequence with one or more digits removed from its beginning and/or ending. The truncated portion can also be a segment including a defined number of digits extracted from a chaotic sequence. The truncated portion can further be a result of a partial mapping of the RNS solutions No. 1, . . . , No. N to a weighted number system representation.
According to an embodiment of the invention, a mixed-radix conversion method is used for mapping RNS solutions No. 1, . . . , No. N to a weighted number system representation. “The mixed-radix conversion procedure to be described here can be implemented in” [modulo moduli only and not modulo the product of moduli.] See Residue Arithmetic and Its Applications To Computer Technology, written by Nicholas S. Szabo & Richard I. Tanaka, McGraw-Hill Book Co., New York, 1967. To be consistent with said reference, the following discussion of mixed radix conversion utilizes one (1) based variable indexing instead of zero (0) based indexing used elsewhere herein. In a mixed-radix number system, “a number x may be expressed in a mixed-radix form:
where the Ri are the radices, the ai are the mixed-radix digits, and 0≦ai<Ri. For a given set of radices, the mixed-radix representation of x is denoted by (an, aN−1, . . . , a1) where the digits are listed in order of decreasing significance.” See Id. “The multipliers of the digits ai are the mixed-radix weights where the weight of ai is
For conversion from the RNS to a mixed-radix system, a set of moduli are chosen so that mi=Ri. A set of moduli are also chosen so that a mixed-radix system and a RNS are said to be associated. “In this case, the associated systems have the same range of values, that is
The mixed-radix conversion process described here may then be used to convert from the [RNS] to the mixed-radix system.” See Id.
“If mi=Ri, then the mixed-radix expression is of the form:
where ai are the mixed-radix coefficients. The ai are determined sequentially in the following manner, starting with a1.” See Id.
is first taken modulo m1. “Since all terms except the last are multiples of m1, we have <x>m
“To obtain a2, one first forms x-a1 in its residue code. The quantity x-a1 is obviously divisible by m1. Furthermore, m1 is relatively prime to all other moduli, by definition. Hence, the division remainder zero procedure [Division where the dividend is known to be an integer multiple of the divisor and the divisor is known to be relatively prime to M] can be used to find the residue digits of order 2 through N of
Inspection of
shows then that x is a2. In this way, by successive subtracting and dividing in residue notation, all of the mixed-radix digits may be obtained.” See Id.
“It is interesting to note that
and in general for i>1
See Id. From the preceding description it is seen that the mixed-radix conversion process is iterative. The conversion can be modified to yield a truncated result. Embodiments of the present invention are not limited in this regard.
According to another embodiment of the invention, a Chinese remainder theorem (CRT) arithmetic operation is used to map the RNS solutions No. 1, . . . , No. N to a weighted number system representation. The CRT arithmetic operation can be defined by a mathematical equation (30) [returning to zero (0) based indexing].
where Y(nT) is the result of the CRT arithmetic operation;
The bj's enable an isomorphic mapping between an RNS N-tuple value representing a weighted number and the weighted number. However without loss of chaotic properties, the mapping need only be unique and isomorphic. As such, a weighted number x can map into a tuple y. The tuple y can map into a weighted number z. The weighted number x is not equal to z as long as all tuples map into unique values for z in a range from zero (0) to M−1.
In other embodiments of the present invention, all bj's can be set equal to one or more non-zero values without loss of the chaotic properties. For example, if bj=1 for all j, Equation 30 reduces to Equation 31. The invention is not limited in this regard.
Referring again to
MBL=Ceiling[Log 2(M)] (32)
where M is the product of the relatively prime numbers p0, p1, . . . , pN−1 selected as moduli m0, m1, . . . , mN−1. In this regard, it should be appreciated that M represents a dynamic range of a CRT arithmetic operation. The phrase “dynamic range”, as used herein, refers to a maximum possible range of outcome values of a CRT arithmetic operation. It should also be appreciated that the CRT arithmetic operation generates a chaotic numerical sequence with a periodicity equal to the inverse of the dynamic range M. The dynamic range requires a Ceiling[Log 2(M)] bit precision.
According to an embodiment of the invention, M equals three quadrillion five hundred sixty-three trillion seven hundred sixty-two billion one hundred ninety-one million fifty-nine thousand five hundred twenty-three (3,563,762,191,059,523). By substituting the value of M into mathematical equation (8), the bit length (BL) for a chaotic sequence output Y expressed in a binary system representation can be calculated as follows: BL=Ceiling[Log 2(3,563,762,191,059,523)]=52 bits. As such, the chaotic sequence output is a fifty-two (52) bit binary sequence having an integer value between zero (0) and three quadrillion five hundred sixty-three trillion seven hundred sixty-two billion one hundred ninety-one million fifty-nine thousand five hundred twenty-two (3,563,762,191,059,522), inclusive. Embodiments of the present invention are not limited in this regard. For example, the chaotic sequence output can be a binary sequence representing a truncated portion of a value between zero (0) and M−1. In such a scenario, the chaotic sequence output can have a bit length less than Ceiling[Log 2(M)]. It should be noted that while truncation affects the dynamic range of the system it has no effect on the periodicity of a generated sequence.
As should be appreciated, the above-described chaotic sequence generation can be iteratively performed. In such a scenario, a feedback mechanism (e.g., a feedback loop) can be provided so that a variable “x” of a polynomial equation can be selectively defined as a solution computed in a previous iteration. Mathematical equation (32) can be rewritten in a general iterative form: f(x(nT)=Q(k)x3((n−1)T)+R(k)x2((n−1)T)+S(k)x((n−1)T)+C(k,L). For example, a fixed coefficient polynomial equation is selected as f(x(n·1 ms))=3x3((n−1)·1 ms)+3x2((n−1)·1ms)+x((n−1)·1 ms)+8 modulo 503. n is a variable having a value defined by an iteration being performed. x has a value allowable in a residue ring. In a first iteration, n equals one (1) and x is selected as two (2) which is allowable in a residue ring. By substituting the value of n and x into the stated polynomial equation f(x(nT)), a first solution having a value forty-six (46) is obtained. In a second iteration, n is incremented by one and x equals the value of the first solution, i.e., forty-six (46) resulting in the solution 298, 410 mod 503 or one hundred thirty-one (131). In a third iteration, n is again incremented by one and x equals the value of the second solution.
Referring now to
As shown in
After step 1010, method 1000 continues with step 1012. In step 1012, a value for time increment T is selected. Thereafter, an initial value for the variable x of the polynomial equations is selected. The initial value for the variable x can be any value allowable in a residue ring. Notably, the initial value of the variable x defines a sequence starting location. As such, the initial value of the variable x can define a static offset of a chaotic sequence.
Referring again to
After completing step 1018, method 1000 continues with a decision step 1020. If a chaos generator is not terminated (1020:NO), then step 1024 is performed where a value of the variable “x” in each polynomial equation f0(x(nT)), . . . , fN−1(x(nT)) is set equal to the RNS solution computed for the respective polynomial equation f0(x(nT)), . . . , fN−1(x(nT)) in step 1016. Subsequently, method 1000 returns to step 1016. If the chaos generator is terminated (1020:YES), then step 1022 is performed where method 1000 ends.
Referring now to
As shown in
Referring again to
Each of the solutions can be expressed as a unique residue number system (RNS) N-tuple representation. In this regard, it should be appreciated that the computing processors 11020, . . . , 1102N−1 employ modulo operations to calculate a respective solution for each polynomial equation f0(x(nT)), . . . , fN−1(x(nT)) using modulo based arithmetic operations. Each of the computing processors 11020, . . . , 1102N−1 is comprised of hardware and/or software configured to utilize a different relatively prime number p0, p1, . . . , pN−1 as a moduli m0, m1, . . . , mN−1 for modulo based arithmetic operations. The computing processors 11020, . . . , 1102N−1 are also comprised of hardware and/or software configured to utilize modulus m0, m1, . . . , mN−1 selected for each polynomial equation f0(x(nT)), . . . , fN−1(x(nT)) so that each polynomial equation f0(x(nT)), . . . , fN−1(x(nT)) is irreducible. The computing processors 11020, . . . , 1102N−1 are further comprised of hardware and/or software configured to utilize moduli m0, m1, . . . , mN−1 selected for each polynomial equation f0(x(nT)), . . . , fN−1(x(nT)) so that solutions iteratively computed via a feedback mechanism 11100, . . . , 1110N−1 are chaotic. In this regard, it should be appreciated that the feedback mechanisms 11000, . . . , 1110N−1 are provided so that the solutions for each polynomial equation f0(x(nT)), . . . , fN−1(x(nT)) can be iteratively computed. Accordingly, the feedback mechanisms 111000, . . . , 1110N−1 are comprised of hardware and/or software configured to selectively define variables “x” of a polynomial equation as a solution computed in a previous iteration.
Referring again to
According to an embodiment of the invention, the computing processors 11020, . . . , 1102N−1 are further comprised of memory based tables (not shown) containing pre-computed residue values in a binary number system representation. The address space of each memory table is at least from zero (0) to mm−1 for all m, m0 through mN−1. The table address is used to initiate the chaotic sequence at the start of an iteration. The invention is not limited in this regard.
Referring again to
According to an aspect of the invention, the mapping processor 1104 can be comprised of hardware and/or software configured to identify a truncated portion of a number in the weighted number system that is defined by the moduli solutions No. 1, . . . , No. N. For example, mapping processor 1104 can be comprised of hardware and/or software configured to select the truncated portion to include any serially arranged set of digits of the number in the weighted number system. Mapping processor 1104 can also include hardware and/or software configured to select the truncated portion to be exclusive of a most significant digit when all possible weighted numbers represented by P bits are not mapped, i.e., when M−1<2P. P is a fewest number of bits required to achieve a binary representation of the weighted numbers. The invention is not limited in this regard.
Referring again to
All of the apparatus, methods, and algorithms disclosed and claimed herein can be made and executed without undue experimentation in light of the present disclosure. While the invention has been described in terms of preferred embodiments, it will be apparent to those having ordinary skill in the art that variations may be applied to the apparatus, methods and sequence of steps of the method without departing from the concept, spirit and scope of the invention. More specifically, it will be apparent that certain components may be added to, combined with, or substituted for the components described herein while the same or similar results would be achieved. All such similar substitutes and modifications apparent to those having ordinary skill in the art are deemed to be within the spirit, scope and concept of the invention as defined.
Chester, David B., Michaels, Alan J.
Patent | Priority | Assignee | Title |
Patent | Priority | Assignee | Title |
3564223, | |||
4095778, | Jul 22 1977 | WEST ONE BANK, UTAH | Combination work table and vise |
4646326, | Oct 20 1983 | Motorola Inc. | QAM modulator circuit |
4703507, | Apr 05 1984 | Noise reduction system | |
4893316, | Apr 20 1984 | Motorola, Inc. | Digital radio frequency receiver |
5007087, | Apr 16 1990 | Lockheed Martin Corporation | Method and apparatus for generating secure random numbers using chaos |
5048086, | Jul 16 1990 | Hughes Electronics Corporation | Encryption system based on chaos theory |
5077793, | Sep 29 1989 | The Boeing Company | Residue number encryption and decryption system |
5210770, | Sep 27 1991 | UNWIRED BROADBAND, INC | Multiple-signal spread-spectrum transceiver |
5276633, | Aug 14 1992 | Intersil Corporation | Sine/cosine generator and method |
5297153, | Aug 24 1989 | U.S. Philips Corporation | Method and apparatus for decoding code words protected wordwise by a non-binary BCH code from one or more symbol errors |
5297206, | Mar 19 1992 | Cryptographic method for communication and electronic signatures | |
5319735, | Dec 17 1991 | Raytheon BBN Technologies Corp | Embedded signalling |
5412687, | Oct 15 1993 | Google Inc | Digital communications equipment using differential quaternary frequency shift keying |
5596600, | Apr 06 1995 | TEXAS INSTRUMENTS BURLINGTON INCORPORATED | Standalone canceller of narrow band interference for spread spectrum receivers |
5598476, | Apr 20 1995 | LEAR CORPORATION EEDS AND INTERIORS | Random clock composition-based cryptographic authentication process and locking system |
5646997, | Dec 14 1994 | Sony Corporation | Method and apparatus for embedding authentication information within digital data |
5677927, | Sep 20 1994 | TDC ACQUISITION HOLDINGS, INC | Ultrawide-band communication system and method |
5680462, | Aug 07 1995 | Sandia Corporation | Information encoder/decoder using chaotic systems |
5757923, | Sep 22 1995 | LEAR CORPORATION EEDS AND INTERIORS | Method of generating secret identification numbers |
5811998, | Jan 28 1993 | HEWLETT-PACKARD DEVELOPMENT COMPANY, L P | State machine phase lock loop |
5852630, | Mar 30 1998 | Ikanos Communications, Inc | Method and apparatus for a RADSL transceiver warm start activation procedure with precoding |
5900835, | Jul 09 1998 | The United States of America as represented by the Secretary of the Navy | Coherent hidden markov model |
5923760, | Jul 05 1996 | Applied Nonlinear Sciences, LLC | Chaotic communication apparatus and method for use with a wired or wireless transmission link |
5924980, | Mar 11 1998 | Siemens Aktiengesellschaft | Method and apparatus for adaptively reducing the level of noise in an acquired signal |
5937000, | Sep 06 1995 | Verance Corporation | Method and apparatus for embedding auxiliary data in a primary data signal |
6014446, | Feb 24 1995 | Motorola, Inc. | Apparatus for providing improved encryption protection in a communication system |
6023612, | Jul 05 1996 | THALES BROADCAST & MULTIMEDIA, INC | Modular transmission system and method |
6038317, | Dec 24 1997 | Secret key cryptosystem and method utilizing factorizations of permutation groups of arbitrary order 2l | |
6078611, | Sep 16 1997 | Google Technology Holdings LLC | Rake receiver and finger management method for spread spectrum communication |
6141786, | Jun 04 1998 | Intenational Business Machines Corporation | Method and apparatus for performing arithmetic operations on Galois fields and their extensions |
6212239, | Jan 09 1998 | Fractal Dynamics LLC | Chaotic dynamics based apparatus and method for tracking through dropouts in symbolic dynamics digital communication signals |
6304216, | Mar 30 1999 | CSR TECHNOLOGY INC | Signal detector employing correlation analysis of non-uniform and disjoint sample segments |
6304556, | Aug 24 1998 | Cornell Research Foundation, Inc. | Routing and mobility management protocols for ad-hoc networks |
6310906, | Aug 18 1999 | Regents of the University of California, The | Chaotic carrier pulse position modulation communication system and method |
6314187, | Aug 05 1997 | Micronas Intermetall GmbH | Method for encryption or decryption using finite group operations |
6331974, | Jun 23 1997 | Regents of the University of California, The | Chaotic digital code-division multiple access (CDMA) communication systems |
6377782, | Mar 01 1999 | WAVESTAR COMMUNICATIONS SYSTEMS, LLC | Method and apparatus for communicating between a client device and a linear broadband network |
6473448, | Feb 25 1999 | Yazaki Corporation | Spread spectrum signal generation method, spread spectrum signal generator, stream encryption method, and stream enciphered codes communication method |
6570909, | Jul 09 1999 | HMD Global Oy | Interference suppression in a CDMA receiver |
6614914, | May 16 1996 | DIGIMARC CORPORATION AN OREGON CORPORATION | Watermark embedder and reader |
6665692, | May 10 1999 | Nokia Technologies Oy | Method for updating a linear feedback shift register of code generator |
6732127, | Jan 10 2001 | HEWLETT-PACKARD DEVELOPMENT COMPANY L P | Verifiable random number generator using chaos |
6744893, | Aug 25 1999 | Southwest Research Institute | Receiver estimation engine for a chaotic system |
6754251, | Mar 09 1998 | Intel Corporation | Spread-spectrum telephony with accelerated code acquisition |
6766345, | Nov 30 2001 | Analog Devices, Inc | Galois field multiplier system |
6842479, | Oct 02 1998 | HIGHBRIDGE PRINCIPAL STRATEGIES, LLC, AS COLLATERAL AGENT | Method and apparatus for interference cancellation in a rake receiver |
6842745, | Jan 12 2001 | STMICROELECTRONICS S R L | Programmable chaos generator and process for use thereof |
6864827, | Oct 15 2003 | National Technology & Engineering Solutions of Sandia, LLC | Digital intermediate frequency receiver module for use in airborne SAR applications |
6865218, | Nov 27 2000 | Ericsson Inc. | Multipath interference reduction for a CDMA system |
6888813, | May 14 1998 | Code division multiple access (CDMA) transmission system | |
6901104, | Nov 30 1998 | KONINKLIJKE PHILIPS N V | Wirless network |
6937568, | Nov 15 1999 | Cisco Technology, Inc. | Adaptive rate shaping to prevent overflow |
6980656, | Jul 17 1998 | Leidos, Inc | Chaotic communication system and method using modulation of nonreactive circuit elements |
6980657, | Jul 17 1998 | Leidos, Inc | Communications system using chaotic synchronized circuits |
6986054, | Mar 30 2001 | Hitachi, Ltd. | Attack-resistant implementation method |
6993016, | Nov 16 2000 | VENTURE LENDING & LEASING III, INC , AS AGENT | Methods and apparatus for transmission of analog channels over digital packet networks |
6999445, | May 27 1999 | Apple Inc | Multiple access communication system using chaotic signals and method for generating and extracting chaotic signals |
7023323, | Aug 18 1997 | X-Cyte, Inc. | Frequency hopping spread spectrum passive acoustic wave identification device |
7027598, | Sep 19 2001 | 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 |
7035220, | Oct 22 2001 | Intel Corporation | Technique for providing end-to-end congestion control with no feedback from a lossless network |
7069492, | Mar 13 2002 | Canon Kabushiki Kaisha | Method of interleaving a binary sequence |
7076065, | May 11 2001 | Lockheed Martin Corporation | Chaotic privacy system and method |
7078981, | Jul 27 2004 | Lucent Technologies Inc. | 16 QAM modulator and method of 16 QAM modulation |
7079651, | May 20 1996 | IRDETO B V | Cryptographic method and apparatus for non-linearly merging a data block and a key |
7095778, | Jan 18 2002 | Mitsubishi Denki Kabushiki Kaisha | Spread spectrum transmitter and spread spectrum receiver |
7133522, | Apr 05 2001 | International Business Machines Corporation | Method and apparatus for encryption of data |
7170997, | Dec 07 2001 | CRYPTICO A S | Method of generating pseudo-random numbers in an electronic device, and a method of encrypting and decrypting electronic data |
7190681, | Jul 10 1996 | Error coding in asynchronous transfer mode, internet and satellites | |
7200225, | Nov 12 1999 | Elliptic curve point ambiguity resolution apparatus and method | |
7233969, | Nov 14 2000 | ParkerVision, Inc. | Method and apparatus for a parallel correlator and applications thereof |
7233970, | May 02 2001 | NCIPHER SECURITY LIMITED | Computational method, system, and apparatus |
7245723, | Jul 17 1998 | Leidos, Inc | Chaotic communication system and method using modulation of nonreactive circuit elements |
7269198, | Nov 19 2001 | Raytheon BBN Technologies Corp | Systems and methods for beaconing in wireless networks with low probability of detection |
7269258, | Nov 16 2001 | Yazaki Corporation | Cryptographic key, encryption device, encryption/decryption device, cryptographic key management device, and decryption device |
7272168, | Apr 01 2003 | Nokia Siemens Networks Oy | Determining the correlation between received samples and available replica samples |
7277540, | Jan 20 1999 | Kabushiki Kaisha Toshiba | Arithmetic method and apparatus and crypto processing apparatus for performing multiple types of cryptography |
7286802, | Feb 15 2002 | Viavi Solutions Inc | Wireless simulator |
7310309, | Jul 17 2002 | AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE LIMITED | Dynamic rate limiting adjustment |
7349381, | Apr 28 2000 | Rockwell Collins; Rockwell Collins, Inc | Synchronization technique for spread spectrum frequency hopped data links and radios using the same |
7423972, | Nov 28 2001 | Flash Networks LTD | System and method for a transmission rate controller |
7529292, | Oct 01 2001 | InterDigital Technology Corporation | Code tracking loop with automatic power normalization |
7643537, | Jan 23 2007 | L3 Technologies, Inc | Spread spectrum signal detection with inhibiting for known sidelobe locations |
7725114, | May 07 2007 | Wi-Fi, GPS and MIMO systems | |
7779060, | Nov 12 2002 | STMICROELECTRONICS S R L | Method of generating a chaos-based pseudo-random sequence and a hardware generator of chaos-based pseudo random bit sequences |
7830214, | Nov 29 2005 | Samsung Electronics Co., Ltd. | Adjustable chaotic signal generator using pulse modulation for ultra wideband (UWB) communications and chaotic signal generating method thereof |
7853014, | Feb 27 2007 | NCIPHER SECURITY LIMITED | Ring arithmetic method, system, and apparatus |
7929498, | Jun 30 1995 | InterDigital Technology Corporation | Adaptive forward power control and adaptive reverse power control for spread-spectrum communications |
7974146, | Dec 19 2008 | U S BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT | Wordline temperature compensation |
20010017883, | |||
20020012403, | |||
20020034191, | |||
20020034215, | |||
20020041623, | |||
20020054682, | |||
20020099746, | |||
20020110182, | |||
20020115461, | |||
20020122465, | |||
20020128007, | |||
20020172291, | |||
20020174152, | |||
20020176511, | |||
20020186750, | |||
20030007639, | |||
20030016691, | |||
20030044004, | |||
20030156603, | |||
20030182246, | |||
20030198184, | |||
20040001556, | |||
20040059767, | |||
20040092291, | |||
20040100588, | |||
20040146095, | |||
20040156427, | |||
20040161022, | |||
20040165681, | |||
20040196212, | |||
20040196933, | |||
20050004748, | |||
20050021308, | |||
20050031120, | |||
20050050121, | |||
20050075995, | |||
20050089169, | |||
20050129096, | |||
20050207574, | |||
20050249271, | |||
20050259723, | |||
20050265430, | |||
20050274807, | |||
20060072754, | |||
20060088081, | |||
20060093136, | |||
20060123325, | |||
20060209926, | |||
20060209932, | |||
20060251250, | |||
20060264183, | |||
20070098054, | |||
20070121945, | |||
20070133495, | |||
20070149232, | |||
20070195860, | |||
20070201535, | |||
20070230701, | |||
20070253464, | |||
20070291833, | |||
20080008320, | |||
20080016431, | |||
20080075195, | |||
20080080439, | |||
20080084919, | |||
20080095215, | |||
20080107268, | |||
20080198832, | |||
20080204306, | |||
20080263119, | |||
20080294707, | |||
20080294710, | |||
20080294956, | |||
20080304553, | |||
20080304666, | |||
20080307022, | |||
20080307024, | |||
20090022212, | |||
20090034727, | |||
20090044080, | |||
20090059882, | |||
20090110197, | |||
20090122926, | |||
20090196420, | |||
20090202067, | |||
20090245327, | |||
20090279688, | |||
20090279690, | |||
20090285395, | |||
20090296860, | |||
20090300088, | |||
20090309984, | |||
20090310650, | |||
20090316679, | |||
20090323766, | |||
20090327387, | |||
20100030832, | |||
20100054225, | |||
20100073210, | |||
20100111296, | |||
20100142593, | |||
20100254430, | |||
20100260276, | |||
20110222393, | |||
EP849664, | |||
EP949563, | |||
EP2000900, | |||
EP2000902, | |||
GB1167272, | |||
JP2001255817, | |||
JP2004279784, | |||
JP2005017612, | |||
JP7140983, | |||
WO135572, | |||
WO2006110954, | |||
WO2008065191, | |||
WO2008099367, | |||
WO2008130973, | |||
WO2009146283, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Jul 01 2009 | Harris Corporation | (assignment on the face of the patent) | / |
Date | Maintenance Fee Events |
Date | Maintenance Schedule |
Feb 12 2016 | 4 years fee payment window open |
Aug 12 2016 | 6 months grace period start (w surcharge) |
Feb 12 2017 | patent expiry (for year 4) |
Feb 12 2019 | 2 years to revive unintentionally abandoned end. (for year 4) |
Feb 12 2020 | 8 years fee payment window open |
Aug 12 2020 | 6 months grace period start (w surcharge) |
Feb 12 2021 | patent expiry (for year 8) |
Feb 12 2023 | 2 years to revive unintentionally abandoned end. (for year 8) |
Feb 12 2024 | 12 years fee payment window open |
Aug 12 2024 | 6 months grace period start (w surcharge) |
Feb 12 2025 | patent expiry (for year 12) |
Feb 12 2027 | 2 years to revive unintentionally abandoned end. (for year 12) |