This application is related to U.S. Pat. No. 8,731,027, filed Dec. 5, 2011, issued May 20, 2014; U.S. Pat. No. 8,861,571, filed Dec. 5, 2011, issued Oct. 14, 2014; U.S. Pat. No. 9,215,587, filed Jan. 24, 2014, issued Dec. 15, 2015; U.S. Pat. No. 9,369,866, filed Sep. 26, 2014, issued Jun. 14, 2016; and U.S. Pat. No. 9,559,748, filed Mar. 4, 2016, and issued Jan. 31, 2017, the disclosure of each of which is hereby incorporated herein in its entirety by this reference.
Embodiments of the present disclosure relate generally to systems, devices, and methods for wireless communication, in particular, for a spread-spectrum receiver using a normalized matched filter for improving a signal-to-noise ratio in harsh environments.
Filter bank multicarrier spread spectrum (FB-MC-SS) methods have previously been used for communication in harsh environments. In FB-MC-SS methods, each data symbol may be spread over N spectrally disjoint subcarrier frequency bands before transmission. At the receiver, a maximum ratio combiner (MRC) may combine the demodulated signals from different subcarrier bands to increase the signal-to-interference-plus-noise ratio (SINR) at the combiner output.
Assuming the receiver has already identified the presence of a data packet and has obtained the timing phase of the middle point of the received data symbols, methods have been adopted to measure the SINR at each subcarrier band and accordingly calculate the MRC coefficients. For example, method of performing these tasks has been described Haddidin et al., An underlay communication channel for 5G cognitive mesh networks: Packet design, implementation, analysis, and experimental results, IEEE International Conference on Communications (ICC) (2016). The receiver structure presented by Haddidin et al. can operate at some negative SINR, but may fail if part of the frequency band is corrupted by a high level of interference. Under this condition, the receiver may fail to detect the packet and/or identify the symbol timing phase, hence cannot operate successfully. In other words, in harsh environments, packet detection and symbol timing phase estimation are receiver bottle-necks that have not been addressed in prior solutions known to the inventors. Thus, the inventors have identified a need to address this limitation of FB-MC-SS communication methods.
In some embodiments, a method of operating a communication device is disclosed. The method comprises receiving, at a receiver, an incoming RF signal; demodulating, with a demodulator of the receiver, the incoming RF signal to generate a baseband signal; filtering the baseband signal with a normalized matched filter having filter characteristics matched to a pulse-shaping filter of the transmitter that generated the incoming RF signal; and extracting a received signal from a normalized output generated by the normalized matched filter.
In some embodiments, a spread-spectrum receiver for detecting and decoding a signal comprises a demodulator configured to generate a baseband signal responsive to demodulating an incoming RF signal, a normalized matched filter configured to filter the baseband signal with a normalized matched filter having filter characteristics matched to a pulse-shaping filter of the transmitter that generated the incoming RF signal, and a signal extractor configured to extract a received signal from a normalized output generated by the normalized matched filter.
In some embodiments, a communication device comprises a spread-spectrum receiver configured to suppress interference in individual subcarrier bands of a demodulated Filter-Bank Multi-Carrier Spread-Spectrum (FB-MC-SS) signal responsive to normalizing samples of the demodulated FB-MC-SS signal in the frequency domain to a power of unity.
In the following description, reference is made to the accompanying drawings in which are shown, by way of illustration, specific embodiments in which the disclosure may be practiced. The embodiments are intended to describe aspects of the disclosure in sufficient detail to enable those skilled in the art to make, use, and otherwise practice the disclosure. Furthermore, specific implementations shown and described are only examples and should not be construed as the only way to implement the present disclosure unless specified otherwise herein. It will be readily apparent to one of ordinary skill in the art that the various embodiments of the present disclosure may be practiced by numerous other partitioning solutions. Other embodiments may be utilized and changes may be made to the disclosed embodiments without departing from the scope of the disclosure. The following detailed description is not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims.
In the following description, elements, circuits, and functions may be shown in block diagram form in order not to obscure the present disclosure in unnecessary detail. Conversely, specific implementations shown and described are exemplary only and should not be construed as the only way to implement the present disclosure unless specified otherwise herein. Additionally, block definitions and partitioning of logic between various blocks is exemplary of a specific implementation. It will be readily apparent to one of ordinary skill in the art that the present disclosure may be practiced by numerous other partitioning solutions. For the most part, details concerning timing considerations and the like have been omitted where such details are not necessary to obtain a complete understanding of the present disclosure and are within the abilities of persons of ordinary skill in the relevant art.
Those of ordinary skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof. Some drawings may illustrate signals as a single signal for clarity of presentation and description. It will be understood by a person of ordinary skill in the art that the signal may represent a bus of signals, wherein the bus may have a variety of bit widths, and the present disclosure may be implemented on any number of data signals including a single data signal.
The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a special purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A general-purpose processor may be considered a special-purpose processor while the general-purpose processor executes instructions (e.g., software code) stored on a computer-readable medium. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
Also, it is noted that embodiments may be described in terms of a process that may be depicted as a flowchart, a flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe operational acts as a sequential process, many of these acts can be performed in another sequence, in parallel, or substantially concurrently. In addition, the order of the acts may be re-arranged. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. Furthermore, the methods disclosed herein may be implemented in hardware, software, or both. If implemented in software, the functions may be stored or transmitted as one or more instructions or code on computer-readable media. Computer-readable media include both computer storage media and communication media, including any medium that facilitates transfer of a computer program from one place to another.
It should be understood that any reference to an element herein using a designation such as “first,” “second,” and so forth, does not limit the quantity or order of those elements, unless such limitation is explicitly stated. Rather, these designations may be used herein as a convenient method of distinguishing between two or more elements or instances of an element. Thus, a reference to first and second elements does not mean that only two elements may be employed there or that the first element must precede the second element in some manner. In addition, unless stated otherwise, a set of elements may comprise one or more elements.
Embodiments of the disclosure include systems, devices, and methods in which interferences and noise from harsh environments may be suppressed using a normalized matched filter that is matched to a transmitter pulse-shaping filter. Throughout the disclosure, the matched filter of a conventional receiver may be referred to as a “standard matched filter” to be distinguished from what will be referred to as a “normalized matched filter” according to embodiments of the disclosure.
The communication device 200 may be configured to execute software programs containing computing instructions and may include one or more processors 212, memory 214, and other special purpose modules 216. The special purpose modules 216 may include circuitry, computing instructions, or a combination thereof. Other functional modules are also depicted. In general, all or a portion of the modules may be configured as circuitry, computing instructions, or a combination thereof. Some functions to be performed in connection with embodiments of the present disclosure may need to be performed in real-time or near real-time. As a result, specific circuitry may be utilized for some functions such that the functions are performed fast enough. However, some of these functions may be performed by software executed by the processor 212. Thus, the processor 212 may be configured for executing a wide variety of operating systems and applications including the computing instructions for carrying out embodiments of the present disclosure. The memory 214 may be used to hold computing instructions, data, and other information for performing a wide variety of tasks including performing embodiments of the present disclosure.
The communication device 200 may also include a group 250 of key processing modules may include a signal generator 252, a pulse shaping filter 254, a matched filter 256, and a max ratio combiner 258. Functions of these elements are discussed more fully below. On the transmitter side, the communication device 200 may include a spreader 220 configured to spread information 215 such as a data symbol to be transmitted to a remote device. The spreader 220 may feed signals to a modulator 230 to modulate the signals to one or more carrier frequencies and then sent through the circulator 296 for transmission on the antenna 298. On the receiver side, the communication device 200 may include a de-spreader 260 may be used to receive demodulated signals from a demodulator 240 to extract data symbols 219 sent by a remote device.
The FB-MC-SS signal includes a data symbol modulated onto each subcarrier. Moreover, the same data symbol is redundantly modulated onto each subcarrier. In other words, each subcarrier of the FB-MC-SS signal includes the same data. As a non-limiting example, the data symbol modulation may be as simple as a single bit modulated with binary phase shift keying (BPSK). In addition, more complex data symbol modulation techniques may be used for data symbols containing more data bits. For example, and without limitation, modulation techniques, such as quadrature phase shift keying (QPSK) and quadrature amplitude modulations (QAM), such as QAM 16, QAM 32, and QAM 64, may be used. Of course, these examples are intended to be non-limiting, and other data symbol modulation techniques are contemplated. Generally, the more simple modulation schemes may allow for easier data symbol recovery and may be more robust in embodiments transmitting at very low power levels.
The transmitter pulse-shaping filter g(t) may have an impulse response expressed as:
where γk is the spreading gain at the kth subcarrier band, and hk(t) is a passband filter over the kth subcarrier band. The latter is related to a prototype filter h(t) having an impulse response:
hk(t)=h(t)ej2πf
where fk is the center frequency of the kth subcarrier band. In some embodiments, the prototype filter h(t) may be a low pass filter, such as a square-root Nyquist filter (e.g., square-root raised-cosine). The square-root Nyquist filter h(t) may be configured such that the zero-crossings of the Nyquist filter h(t)*h(t) are at the interval T. The square-root Nyquist filter may include a roll-off factor α=1 for a receiver with a desired suppression of out-of-band spectrum. Other choices of the roll-off factor (α) may be used, which may result in some modification to the receiver design. The spreading gain factors γk are a set of complex numbers that may have a unit amplitude (i.e., |γk|2=1) and phase angles that may be uniformly distributed over the interval 0 to 2π. In some embodiments, the set of passband filters hk(t) may have mutually exclusive (i.e., non-overlapping) bands.
Referring specifically to
Moreover, considering equation (2) and that in practical designs h(−t)=h(t) (e.g., ignoring the causality of the impulse response) and hk*(−t)=hk(t). Hence:
With equations (1), (2), and (4), the combined response of the transmitter pulse-shaping filter and the standard matched filter at the receiver may be:
where * denotes linear convolution.
By design the passband filters hk(t)=h(t)ej2πf
Manipulating equation (6), and recalling that |γk|2=1, yields:
η(t)=β(t)ρ(t) (7)
where ρ(t)=h(t)*h(t), by design, is a Nyquist filter, and
In FB-MC-SS, the subcarrier frequencies fk are given the values:
where T is the time interval between the data symbols s[n]. Substituting these frequency values in equation (8) yields:
Thus, β(t) is a periodic function with a period of T.
on the other hand, these phases may have a phase of π (or some multiple of 2π plus π). Hence, the summation on the right-hand side of equation (10) will be equal to −N. In between these positive and negative peaks, β(t) is reduced to a small value.
In a practical channel, the environment (e.g., noise and interference) adds to the received signal and if noise and/or interference passes a certain level, it can seriously corrupt the received signal and as a result packet detection and timing acquisition may become a difficult task to perform. For example,
Referring specifically to
In another scenario, the AWGN at the channel output may be at a level that does not mask out the regular pulses at the standard matched filter output, but there is a strong partial-band interference at a considerably higher level that may completely mask out the regular pulses at the standard matched filter output. This scenario may be more likely to happen in a harsh environment such as where a jammer may introduce some narrow/partial band interference, or in a case where the FB-MC-SS is used as an underlay control channel in a cognitive radio system. In the latter scenario, overlay communications may introduce some high level partial band interference. Thus, depending on the environment the communication signals may be hidden within the noise such that the receiver may not be able to distinguish them.
Embodiments of the disclosure may provide an improvement over the standard matched filter in this scenario, which may be referred to as the normalized matched filter. When the incoming signal is corrupted by a partial band interference at a level that otherwise masks out the regular pulses at the standard matched filter output, the normalized matched filter may be configured to suppress the partial band interference and cause the regular pulses at the output of the normalized matched filter more clearly observable.
The normalized matched filter is described more fully below, and is based on the following understanding of the standard matched filter and the mechanism that leads to the regular pulses at its output. The mathematical equations (5) through (10) provide some details that explain how these regular pulses are generated. In particular, each subcarrier has a contribution to one of the complex exponentials that together produce the periodic signal β(t) that is presented by equation (10). It is also recalled that the sample plot of β(t) presented in
The interference suppression of the normalized matched filter is implemented in the frequency domain. Although any frequency domain signal processing may be adopted, the description focuses on the method of overlap-add signal processing. The normalized matched filter will be described below, after a brief review of the overlap-add method. The overlap-add method implements the time domain filtering operation y[n]=x[n]*g[n], where x[n] is the input sequence and g[n] is a finite impulse response filter, in the frequency domain, by taking the following operations:
In a first operation, x[n] is partitioned into adjacent segments of length P. The segments are called x1[n], x2[n], . . . . In a second operation, assuming g[n] has a length of M, g[n] may be zero-padded to the length L≥P+M−1. The fast Fourier transform (FFT) of this zero-padded version of g[n] is a sequence of length L and will be named G [k] herein. In a third operation, for i=1, 2, . . . , repeat the following steps: (a) zero-pad xi[n] to the length of L, and take its FFT with the FFT result being Xi[k], (b) form the frequency domain sequence Yi[k]=Xi[k]G*[k]. This is the matched filtering operation, and (c) convert Yi[k] to the time domain by applying an inverse FFT (IFFT) to it. Call the result yi[n]. In a fourth operation, the output y[n] may be formed by time-aligning the segments y1[n], y2[n], . . . to the positions that match those of the input segments x1[n], x2[n], . . . and adding the results. This overlap-add procedure is a linear filtering operation.
Embodiments of the disclosure include a normalization process added to the matched filtering operation to form a normalized matched filter configured to reject partial band interference from the input signal. For example, using the example above, in operation (a) of the preceding paragraph, the generated frequency domain samples Xi[k] provide the information about the spectral content of the time-domain signal segment xi[n]. The FFT result Xi[k] may also be divided into a number of partitions, with each partition covering one of the subcarrier bands in the FB-MC-SS signal. The subcarrier bands that are interfered with a strong interference may be characterized by a subset of samples of Xi[k] with large amplitude. To suppress interference in individual subcarrier bands, for each subcarrier band, the corresponding samples of Xi[k] may be normalized to a power of unity. Assuming that a given subcarrier band is characterized by the frequency index set k1≤k≤k2, the set of normalized samples are obtained as:
Repeating this normalization process for all the subcarrier bands, the sample set Xi[k], for k=0, 1, 2, . . . , L−1, is replaced by the corresponding normalized sample set {tilde over (X)}i[k]. Accordingly, after operation (a), the rest of the overlap-add method may continue with the normalized sample set {tilde over (X)}i[k] in place of the original sample set Xi[k]. By normalizing the samples of the overlap-add method, the portions of the signal spectral may be attenuated that belong to the subcarrier bands that are interfered with a stronger interference. As a result, the interference may also be attenuated proportionally. Thus, employing a normalized matched filter may result in an improvement in comparison with a standard matched filter. This modified overlap-add method is a non-limiting example of a particular implementation of the normalized matched filter. Alternative methods are contemplated and would be apparent to those skilled in the art of signal processing. For example, it is contemplated that an alternative normalized matched filter may be utilized based on the overlap-save method.
Whereas the standard matched filter may fail to reveal the regular pulses at its output, the normalized matched filter may remove most of the interference from its output. As a result, pulses may be observed and recoverable in most of the scenarios. The exception is the case where interference has a very high power in which the interference may not be sufficiently removed (e.g., the case presented in
Another embodiment described more fully below may further improve the ability to reduce the interference in harsh environments. To understand this improvement, a brief explanation is described herein as to the impact of the subcarrier power normalization in introducing any distortion to the regular pulses at the matched filter output. Equation (5) above describes the combined impulse response between the transmitter input and the standard matched filter output, assuming an ideal channel. By replacing the standard matched filter with the normalized matched filter, the corresponding combined impulse response will be:
where Al is the real and positive normalization factor applied to the frequency domain samples in the lth subcarrier band. Following the same line of derivations that led to equations (7) and (10) above, equation (12) can also be simplified to the same form as equation (7), with:
Similar to the standard β(t) in equation (10), the normalized β(t) in equation (13) is also a periodic function of time. Taking note that the coefficients Ak are real and positive, the periodic function of normalized β(t) in equation (13) has almost the same form (i.e., a sequence of positive and negative impulses) as the standard β(t) in equation (10). For t=nT, the exponential terms under the summation in equation (13) may have the phase of zero (or some multiples of 2π), and thus constructively add to a peak of
on the other hand, these phases have the value of π (or some multiples of 2π plus π), hence, the summation on the right-hand side of equation (13) will be equal to −ΣkAk. In between these positive and negative peaks, normalized β(t) vanishes to a small value.
The sample set Xi[k], for k=0, 1, . . . , L−1, are effectively a snap-shot of the outputs of filter bank with a prototype filter p[n]. For the normalized matched filter that has been described so far, prototype filter p[n] is a rectangular window. For example, the prototype filter p[n] may be a finite impulse response filter of length P with prototype filter p[n]=1, for n=0, 1, . . . , P−1. This rectangular prototype filter p[n] may have a frequency response that includes a sinc pulse. Such a sinc pulse whose magnitude response is presented in
The addition of smooth roll-offs may also contribute to reducing the interference leakage.
where * denotes linear convolution,
and
The factor
on the right-hand side of (16) may be selected such that the identity
holds. Applying a Fourier transform to both sides of (14):
P(f)=Tw sinc(fTw)×V(f) (17)
where
The prototype filter P(f) is a low-pass filter characterized by a narrow-band main lobe, a number of significant side lobes that expand over a bandwidth of
and a number of well-attenuated side lobes at higher frequencies. If the stopband of the prototype filter is over the frequencies in which
is −50 dB or less, its transition band may exhibit a width of about
as shown in
The windows may be non-overlapping, but, in order not to miss any samples of x[n], the windows may be adjacent to each other.
factoring x[n] out of the summation on the left-hand side of equation (19), the result simplifies to:
For reference below, it is assumed that w0[n] (i.e., the window function of the 0th partition) is non-zero over the interval 0≤n≤P−1. It is noted that that w0[n] is effectively the prototype filter p[n]. In addition, Q denotes the number of samples within each of the roll-off intervals. Therefore, recalling the window arrangements in
wi[n]=p[n−i(P−Q)]. (21)
At operation 1806, xi[n] is extended to the length L>P by appending zeros to its end and an FFT is applied to the result to convert it to the frequency domain. This frequency domain signal is called Xi[k]. The FFT operation may be synthesis filter bank with a rectangular prototype filter. In another embodiment, the rectangular prototype filter may be replaced with a filter with lower out-of-band emissions.
At operation 1808, segments of Xi[k] that correspond to different subcarrier bands of the FB-MC-SS waveform are normalized according to the equation (11). The result is called {tilde over (X)}i[k].
At operation 1810, matched filtering is applied to the normalized frequency domain samples {tilde over (X)}i[k] to obtain {tilde over (Y)}i[k]={tilde over (X)}i[k]G*[k].
At operation 1812, the frequency domain matched filtered sequence {tilde over (Y)}i[k] is converted to the time domain through an IFFT operation and the result is overlapped and added to the previous partition of the output (in the time domain).
At operation 1814, the partition index i is incremented by one and operations 1804 through 1812 may be repeated. These operations may be repeated as long as necessary to obtain the output samples of the normalized matched filter that may be used in any packet detection and timing acquisition algorithm for finding the beginning of an FB-MC-SS data packet and obtaining the correct timing phase.
The normalized matched filter 2020 is configured to have filter characteristics matched to those of the synthesis filter bank in the transmitter and generates a normalized output as discussed above. With the special selection of the parameters discussed above relative to the transmitter, the output from the normalized matched filter 2020 may be the sequence of high amplitude (i.e., narrow) pulses that can be clearly identified even when the FB-MC-SS signal is at a level below the noise level. The combination of the transmit and receive processes may result in a significant and unexpected improvement (both computationally faster and more precise) in timing recovery and frequency lock-in.
A sequence of narrow pulses 2025 from the normalized matched filter 2020 may occur at regular intervals and carry the necessary information for timing and carrier acquisition as well as for their tracking. In general, any carrier and timing recovery method takes advantage of the properties of the modulation method that has been used to construct the transmitted signal. Due to the implementation inaccuracies and channel conditions (e.g., accuracy of components and Doppler shift in the channel), the carrier frequency used at the transmitter and its counterpart frequency at the receiver 2000 are bound to suffer mismatch.
The carrier recovery unit 2030 finds such mismatches and compensates for the mismatches at the receiver 2000. To accomplish this carrier recovery, the normalized matched filter 2020 may be used to develop relatively efficient carrier and timing recovery algorithms. The output of the normalized matched filter 2020 includes the sequence of narrow pulses 2025 at the ½ spacing of the symbol timing (T/2). These narrow pulses 2025 are present at the time instants that are even multiples of T/2 and correspond to about the center of the data symbols.
On the other hand, at the time instants that are odd multiples of T/2, the presence of such pulses depends on the information bits transmitted before and after the time instant. In other words, the pulse at the odd multiples of T/2 will appear when two consecutive symbols have the same value, otherwise the pulse would be a null. This property of the normalized matched filter 2020 enables development of a timing recovery algorithm with a relatively low complexity/processing power. Once the pulses at the even multiples of T/2 are recognized, any carrier offset in the demodulated signal can be identified by comparing the relative phases of the pulses at the successive time instants, leading to carrier frequency recovery.
The carrier recovery unit 2030 may receive the sequence of narrow pulses 2025 and generate control signals 2035 to develop a phase-locked loop (PLL) between the demodulator 2010, the normalized matched filter 2020, and the carrier recovery unit 2030 as is known by those skilled in the art. As the PLL locks on, the phase of the baseband input 2015 is known relative to the sequence of narrow pulses 2025 from the normalized matched filter 2020. As a result, the timing recovery unit 2040 may use the sequence of narrow pulses 2025 as a synchronization signal to ensure that the demodulated and combined signals from all subcarriers (i.e., the baseband input 2015) can be sampled at correct times by the analysis filter bank 2050.
The sequence of narrow pulses 2025 containing the timing information and the baseband input 2015 from the demodulator 2010 are passed to the analysis filter bank 2050. The analysis filter bank 2050 extracts the received signal of each of the various subcarriers in parallel and samples them at a proper timing phase based on the timing information. The analysis filter bank 2050 performs the inverse process of the synthesis filter bank of the transmitter. Thus, the output of the analysis filter bank 2050 is a set of signals 2055 corresponding to each of the subcarrier frequencies in the FB-MC-SS signal. Due to the very low power level of the received signal, some of these signals in the set of signals 2055 may not carry accurate information. However, many of the signals in the set of signals 2055 will carry the same information that was transmitted.
The channel estimator 2060 examines the set of signals 2055 corresponding to each of the subcarrier frequencies to estimate a channel gain and a power of noise plus interference at each of the subcarrier bands by computing the impulse response of each channel in both time and frequency domain. Digital Signal Processing (DSP) and Field-Programmable Gate Arrays (FPGAs) may allow for one example of an inexpensive implementation for many of the functions in the receiver 2000 and the channel estimator 2060 in particular.
The maximum-ratio combining unit 2070 receives the set of signals 2055 from the analysis filter bank 2050 and information 2065 at the output of the channel estimator 2060 to obtain an estimate of the transmitted data symbols. The maximum-ratio combining unit 2070 calculates a weighted average of the detected data symbols at the output of the analysis filter bank 2050. The less noisy outputs are given higher weights and the more noisy outputs are given lower weights. To perform the combining, the maximum-ratio combining unit 2070 may divide a power estimate of each channel by the mean square of the estimated noise/interference, which may result in either a diminished noise where the signal is stronger or elimination of the certain subcarriers where the noise/interference is higher than the mean noise.
The RAKE receiver 2100 includes a normalized matched filter 2120 configured as described above with respect to
The RAKE receiver 2100 makes use of the samples of the output of the normalized matched filter 2120 that correspond to different multi-paths of the channel. These multi-paths are combined together using a maximum ratio combiner. The maximum ratio combiner 2170 gives higher gains to the stronger paths and lower gains to weaker paths. In this way, an optimum receiver that maximizes the SNR at its output (detected symbols) is constructed.
Thus, embodiments of the disclosure improve over conventional partial band interference suppression techniques known to the inventors that rely on the use of notch/bandstop filters which require the knowledge or estimation of the position of interference within the transmission band of the spread spectrum signal. Embodiments of the disclosure may be configured to suppress the interference without knowing the position of interference by applying a non-linear process to the analyzed signal in the frequency domain.
While the present disclosure has been described herein with respect to certain illustrated embodiments, those of ordinary skill in the art will recognize and appreciate that it is not so limited. Rather, many additions, deletions, and modifications to the illustrated embodiments may be made without departing from the scope of the disclosure as hereinafter claimed, including legal equivalents thereof. In addition, features from one embodiment may be combined with features of another embodiment while still being encompassed within the scope of the disclosure. Further, embodiments of the disclosure have utility with different and various detector types and configurations.
This invention was made with government support under Contract No. DE-AC07-05-ID14517 awarded by the United States Department of Energy. The government has certain rights in the invention.
Number | Name | Date | Kind |
---|---|---|---|
3849730 | Ho | Nov 1974 | A |
5204901 | Hershey et al. | Apr 1993 | A |
6154484 | Lee et al. | Nov 2000 | A |
6272121 | Smith et al. | Aug 2001 | B1 |
6553396 | Fukuhara et al. | Apr 2003 | B1 |
6651408 | McClure | Nov 2003 | B1 |
6741551 | Cherubini | May 2004 | B1 |
7123934 | Linebarger et al. | Oct 2006 | B1 |
7180963 | Wang et al. | Feb 2007 | B2 |
7394844 | Orr | Jul 2008 | B1 |
7443917 | Vitenberg | Oct 2008 | B2 |
7558310 | Von Der Embse | Jul 2009 | B1 |
7609611 | Siohan et al. | Oct 2009 | B1 |
7634030 | Kim et al. | Dec 2009 | B2 |
7787545 | Orr et al. | Aug 2010 | B2 |
7898936 | Al Adnani | Mar 2011 | B2 |
8731027 | Moradi et al. | May 2014 | B2 |
9215587 | Moradi et al. | Dec 2015 | B2 |
20020034160 | Marchok et al. | Mar 2002 | A1 |
20020167991 | Suzuki | Nov 2002 | A1 |
20030054851 | Jo et al. | Mar 2003 | A1 |
20030058952 | Webster et al. | Mar 2003 | A1 |
20030072382 | Raleigh et al. | Apr 2003 | A1 |
20030165131 | Liang et al. | Sep 2003 | A1 |
20040047430 | McCarty | Mar 2004 | A1 |
20040101068 | Wang et al. | May 2004 | A1 |
20040196780 | Chin et al. | Oct 2004 | A1 |
20040213351 | Shattil | Oct 2004 | A1 |
20040218695 | Koga et al. | Nov 2004 | A1 |
20050047513 | Vitenberg | Mar 2005 | A1 |
20050154925 | Chitrapu et al. | Jul 2005 | A1 |
20050245268 | Green et al. | Nov 2005 | A1 |
20070211786 | Shattil | Sep 2007 | A1 |
20080130802 | Conroy et al. | Jun 2008 | A1 |
20080226003 | Chevalier et al. | Sep 2008 | A1 |
20080304551 | Li et al. | Dec 2008 | A1 |
20080316912 | Al Adnani | Dec 2008 | A1 |
20090316568 | Harris et al. | Dec 2009 | A1 |
20100246375 | Orlik et al. | Sep 2010 | A1 |
20110002232 | Niewczas et al. | Jan 2011 | A1 |
20110188671 | Anderson et al. | Aug 2011 | A1 |
20120002703 | Yamashita et al. | Jan 2012 | A1 |
20120189036 | Bellanger | Jul 2012 | A1 |
20130142218 | Moradi et al. | Jun 2013 | A1 |
20140169431 | Arambepola et al. | Jun 2014 | A1 |
20150049790 | Moradi | Feb 2015 | A1 |
20160295322 | Orescanin | Oct 2016 | A1 |
Number | Date | Country |
---|---|---|
1503463 | Jun 2004 | CN |
1559129 | Dec 2004 | CN |
1739274 | Feb 2006 | CN |
101867548 | Oct 2010 | CN |
Entry |
---|
Ye et al., “On the Secrecy Capabilities of ITU Channels,” Proc. IEEE Vehicular Technology Conf. (VTC '07-Fall), pp. 2030-2034, Oct. 2007. |
Ye et al., “Extracting secrecy from jointly Gaussian random variables,” Proc. 2006 IEEE Int'l Symp. Information Theory (ISIT '06), pp. 2593-2597, Jul. 2006. |
Wilson et al., “Channel identification: secret sharing using reciprocity in UWB channels,” IEEE Trans. Information Forensics and Security, vol. 2, No. 3, pp. 364-375, Sep. 2007. |
Wasden et al., “Design and Implementation of a Multicarrier Spread Spectrum Communication System,” Military Communication Conference, IEEE, Oct. 29, 2012, pp. 1-7. |
Tope et al., “Unconditionally secure communications over fading channels,” Proc. Military Comm. Conf. (MILCOM '01), vol. 1, pp. 54-58, Oct. 2001. |
Sayeed et al., “Secure wireless communications: secret keys through multipath,” Proc. IEEE Int'l Conf. Acoustic, Speech and Signal Processing (ICASSP '08), pp. 3013-3016, Apr. 2008. |
Patwari et al., “High rate uncorrelated bit extraction for shared secret key generation from channel measurements,” IEEE Trans. Mobile Computing, vol. 9, No. 1, Jan. 2010, pp. 17-30. |
Nigam et al., “Finite Duration Root Nyquist Pulses with Maximum In-Band Fractional Energy,” IEEE Communications Letters, vol. 14, No. 9, Sep. 2010, pp. 797-799. |
Merkle, R.C., “Secure communications over insecure channels,” Commun. ACM, vol. 21, No. 4, 1978, pp. 294-299. |
Maurer, U.M., “Secret Key Agreement by Public Discussion from Common Information,” IEEE Trans. Inf. Theory, vol. 39, No. 3, May 1993, pp. 733-742. |
Maurer et al., “Unconditionally secure key agreement and the intrinsic conditional information,” IEEE Trans. Information Theory, vol. 45, No. 2, pp. 499-514, Mar. 1999. |
Mathur et al., “Radio-telepathy: extracting a secret key from an unauthenticated wireless channel,” Proc. ACM MobiCom, Sep. 2008. |
Madiseh et al., “Secret key extraction in ultra wideband channels for unsynchronized radios,” Proc. Sixth Ann. Conf. Comm. Networks and Services Research (CNSR '08), May 2008. |
Li et al., “Securing wireless systems via lower layer enforcements,” Proc. Fifth ACM Work-shop Wireless Security (WiSe '06), pp. 33-42, Sep. 2006. |
Kondo et al., “Performance of multicarrier DS CDMA Systems,” IEEE Transactions on Communications, vol. 44, pp. 238-246, 1996. |
Kaleh, G.K., “Frequency-diversity spread-spectrum communication system to counter bandlimited gaussian interference,” IEEE Transactions on Communications, vol. 44, No. 7, pp. 886-893, 1996. |
Jana et al., “On fast and accurate detection of unauthorized access points using clock skews,” Proc. ACM MobiCom, Sep. 2008. |
Hershey et al., “Unconventional cryptographic keying variable management,” IEEE Trans. Commun., vol. 43, No. 1, Jan. 1995, pp. 3-6. |
Hassan et al., “Cryptographic key agreement for mobile radio,” Elsevier Digital Signal Processing, vol. 6, 1996, pp. 207-212. |
Hara et al., “Overview of multicarrier cdma,” IEEE Communications Magazine, vol. 35, pp. 126-133, 1997. |
Farhang-Boroujeny, B., “Square-root Nyquist (M) filter design for digital communication systems,” IEEE Trans. on Signal Processing, vol. 56, No. 5, May 2008, pp. 2127-2132. |
Farhang-Boroujeny, “OFDM Versus Filter Bank Multicarrier,” IEEE Signal Processing Magazine, vol. 28, No. 3, May 1, 2011, pp. 92-112. |
Dodis et al., “Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. In Advances in Cryptology .cndot.U EUROCRYPT 2004,” Jan. 20, 20008, pp. 1-46. |
Cheun et al., “Antijamming performance of a multicarrier direct-sequence spread-spectrum system,” IEEE Transactions on Communications, vol. 47, No. 12, pp. 1781-1784, Dec. 1999. |
Azimi-Sadjadi et al., “Robust key generation from signal envelopes in wireless networks,” Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07), pp. 401-410, Nov. 2007. |
Aono et al., “Wireless secret key generation exploiting reactance-domain scalar response of multipath fading channels,” IEEE Trans. Antennas & Propagation, vol. 53, No. 11, pp. 3776-3784, Nov. 2005. |
Ahlswede et al., “Common randomness in information theory and cryptography—Part I: secret sharing,” IEEE Trans. Inf. Theory, vol. 39, No. 4, Jul. 1993, pp. 1121-1132. |
Haddadin et al., “An underlay communication channel for 5G cognitive mesh networks: Packet design, implementation, analysis, and experimental results”, IEEE International Conference on Communications (ICC) (2016) 9 pages. |
Proakis, “Interference suppression in spread spectrum systems”, IEEE 4th International Symposium on Spread Spectrum Techniques and Applications Proceedings, (1996), pp. 259-266. |
Sibbett et al., “Novel maximum-based timing acquisition for spread spectrum communications”, IEEE Globecom Conference (2016) 7 pages. |