Bit Density Based Signal and Jamming Detection in 1-Bit Quantized MIMO Systems

by   M. A. Teeti, et al.

This paper studies the problem of deciding on the absence (i.e., null hypothesis, ℋ_0) or presence (i.e., alternative hypothesis, ℋ_1) of an unknown signal embedded in the received signal in a multiple-input, multiple-output (MIMO) receiver, employing 1-bit quantization. The originality of our solution lies in quantizing the received signal by an adapted 1-bit window comparator, rather than a traditional 1-bit quantizer. This enables us to divide the space of observed binary sequences into two typical sets (w.r.t. the distribution of the no. of 1's in a sequence) asymptotically, where the first set corresponds to ℋ_0 and the second to ℋ_1. As a result, we reduce the detection problem to determining the highly probable set for an observed sequence. Thus, a very low-complexity binary hypothesis detector is proposed and its probability of detection is given. To show the high efficacy of the proposed 1-bit receiver structure, we consider two wireless applications; jamming detection in a massive MIMO system, and probing a non-stationary low-power transmitter in a wireless sensor network (WSN), assuming unknown Rayleigh-fading channels. Compared with an unquantized system employing a chi-square test, it is shown that the performance loss can be roughly as large as 10% in massive MIMO and this gap diminishes as sequence length or/and jamming power increases. For WSN, we show that compared with an unquantized system, the performance gap becomes smaller when the observation interval is extended over a few symbols.



There are no comments yet.


page 3

page 4

page 5

page 6

page 7

page 10

page 12

page 13


On the Capacity of Massive MIMO With 1-Bit ADCs and DACs at the Receiver and at the Transmitter

In this paper, we investigate the capacity of massive multiple-input mul...

Efficient Equalization Method for Cyclic Prefix-Free Coarsely Quantized Massive MIMO Systems

The use of low resolution Analog to Digital Converters (ADCs) can signif...

Low-Complexity Multiuser QAM Detection for Uplink 1-bit Massive MIMO

This work studies multiuser detection for one-bit massive multiple-input...

Weak target detection with multi-bit quantization in colocated MIMO radar

We consider the weak target detection problem with unknown parameter in ...

ADMM-Based One-Bit Quantized Signal Detection for Massive MIMO Systems with Hardware Impairments

This paper considers signal detection in massive multiple-input multiple...

Binary MIMO Detection via Homotopy Optimization and Its Deep Adaptation

In this paper we consider maximum-likelihood (ML) MIMO detection under o...

Accelerated Randomized Methods for Receiver Design in Extra-Large Scale MIMO Arrays

Recent interest has been cast on accelerated versions of the randomized ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

The need for efficient and reliable mechanisms for securing multiple-input, multiple-output (MIMO) systems has been brought on in recent years by the increased demand for safeguarding massive MIMO systems against malicious attacks [32, 7, 6, 15, 11]. Many attempts have shown that passive attack (eavesdropping) in massive MIMO is in principle avoidable asymptotically [15], whereas active attack (jamming attack) is more deleterious, especially pilot jamming. Therefore, jamming attack is a crucial challenge that incurs a significant loss in performance if left undetected.

In [25, 26]

, some asymptotic results in random matrix theory are leveraged to detect and suppress jamming under the assumption that signal and jamming reside in a very small-dimensional subspace compared to the number of BS antennas. The authors in

[26] showed that when the dimension of jamming subspace increases, jamming detection turns to be difficult (if not impossible). In [29], the asymmetry of received signal power levels between the legitimate parties is exploited to develop energy-based detector for detecting pilot attack. An attempt to use pilot hopping and an increased size of pilot set in the uplink of massive MIMO system has been considered in [5] to mitigate the impact of pilot attack. In [28], pilot-data based channel acquisition is considered mitigating pilot attack in the asymptotic sense of data length. Pilot re-transmission and adaptation techniques are considered in [9] to tackle pilot attack.

In [30, 4], jamming detection is formulated as a binary hypothesis testing, and hence pilot attack detection has been studied under different conditions. Reference [30] uses different approaches of hypothesis testing to detect a pilot spoofing originating from a single-antenna jammer in a massive MIMO system. The authors in [4]

consider a generalized likelihood ratio test (GLRT) over many coherence blocks of channel while taking advantage of unused pilots to detect a multiple-antenna jammer. However, there is a tradeoff between detection capability and delay. The estimation of a single-antenna jammer’s statistic is considered in

[2] using unused pilots in the system for jamming suppression. The extension to a multiple-antenna jammer is still lacking. A linear channel estimator and bilinear equalizer in data phase for correlated massive MIMO is studied in [3] to improve performance in the presence of a single-antenna jammer.

1-bit quantized MIMO systems where antennas (collocated or distributed) are equipped with 1-bit analog-to-digital converters (ADCs) instead of high resolution ADCs has been gaining importance in recent years [31, 18, 19, 23, 20, 21] because of the remarkable simplification of physical layer and reduction in energy consumption [27]. The interest in signal quantization has also been an important research topic in wireless sensor networks (WSN) [10, 1], motivated by energy and bandwidth constraints in such networks [14]. In WSN, a relevant problem to this work is that of detecting the presence or absence of a low-power transmitter (declaring its presence periodically) by a set of cheap sensors, where these sensors quantize their observations to a single bit before sending them to a fusion center for processing.

It was shown in [24] that pilot attack can have a deleterious impact on performance of massive MIMO using 1-bit ADCs. Since the polarity () of the signal is only available at the BS, jamming detection appears to be much intricate when compared with the unquantized system. To the best of the author’s knowledge, studies on jamming detection in 1-bit quantized MIMO systems are still lacking. Besides the high non-linearity of traditional 1-bit quantizer, a stronger jammer can quickly saturate its output. Unfortunately, the existing jamming detection approaches developed in the literature for unquantized systems seem inapplicable under 1-bit quantization.

The aim of this work is to provide a binary quantization method in a MIMO receiver which facilitates binary hypothesis testing, and also develop a low-complexity detection method. The proposed quantization and binary hypothesis detection methods will bring many advantages, features and new different applications, including jamming detection in 1-bit quantized massive MIMO system and the detecting the presence of a low-power transmitter in WSN. In such systems, 1-bit quantization is a very attractive solution for its low-hardware complexity and low-energy consumption. Also, it is hoped that this work will stimulate further research on the subject.

We summarize the major contributions of this work as follows.

  1. [leftmargin=*]

  2. We propose an adapted 1-bit window comparator for quantizing the incoming signal, giving rise to a Bernoulli process in the null hypothesis () with fixed success rate and another Bernoulli process in the alternative hypothesis(

    ) with a monotonically increasing success rate with an increasing variance of the model for


  3. A very low-complexity algorithm called bit density detection (BDD) algorithm is developed where the binary hypothesis detection is basically based on counting the number of 1’s in an observed binary sequence. Also, the detection probability is derived. Further, only two parameters are fed to the BDD algorithm, where these parameters are computed offline.

  4. The proposed 1-bit window comparator combined with the BDD algorithm is leveraged for jamming detection in a 1-bit quantized massive MIMO system and for probing a low-power transmitter in a WSN. The results in both cases show that the proposed detection mechanism is promising.

We stress that throughout this paper; we assume that the variance of the model in is known at the receiver, whereas the variance of the model in is assumed unknown.

The rest of this paper is organized as follows. Sec. II provides some motivation for this work and presents the mathematical formulation of the problem. Sec. III presents the proposed 1-bit receiver structure, comprising 1-bit window comparator and binary hypothesis detector, and the major results are given. In Sec. IV we utilize the proposed 1-bit receiver structure for jamming detection in massive MIMO system and for signal probing in WSN. Sec. V shows some numerical results to verify the calculations, and Sec. VI summarizes this paper.

Ii Motivation and Problem Formulation

Ii-a Motivation

In the literature of MIMO communication, a traditional zero-threshold 1-bit quantizer (aka. 1-bit ADC or comparator) has been largely investigated. In typical wireless communication, Rayleigh fading, the randomness of data, interference, and background noise give rise to a received signal admitting a symmetrical or slightly skewed density around zero. If a traditional 1-bit quantizer is used to quantize the received signal, then the number of observed 1’s and 0’s averaged over all randomness is roughly equal.

It is even more interesting to note that

a balance between 1’s and 0’s is expected over a single realization of the channel when the receiver is equipped with a sufficiently large number of antennas, thanks to the law of large numbers.

Binary hypothesis testing in communication systems is one of the most important problems. With binary observations, a receiver needs to decide which one of two hypothetical models gave rise to the observed binary sequence, i.e., detecting the presence or absence of an unknown signal (e.g., undesired jamming signal) in the received observations. In the light of the presence of such undesired signal and coarsely quantized observations, it seems natural to assume that the channel is unknown, since channel estimate may no longer be useful under this situation. With the above discussion in mind, it turns out that, with a traditional 1-bit quantizer, extracting information about a presence of an unknown signal (e.g., jamming) from the observed digits seems intricate. Further, it is unknown yet that using higher-order statistics can lead to a simple detection technique due to the inherent high non-linearity of the traditional quantizer. Besides, a stronger undesired signal such as malicious jamming can quickly saturate its output. Therefore, our proposed binary hypothesis detection mechanism in the next section brings many advantages, comprising low-complexity, simplicity, and usefulness in different applications.


be a binary sequence with independent and identically distributed (i.i.d.) random variables. It is easy to think of this sequence as if it was generated by one of two discrete memoryless sources

and . Let the null () and alternative () hypotheses correspond to a binary sequence generated by the source and , respectively. Further, let and be the success rates of the corresponding binary sources. Thus, both sources have the same entropy, i.e., , where denotes the binary entropy function of a Bernoulli random variable with success rate . For a sufficiently large , the typical sets (i.e., sets of high probability sequences) and of sequences generated by and admit the same cardinality asymptotically 111For an i.i.d. Bernoulli process of success rate , the cardinality (size) of a typical set of binary sequences each of length generated by the process is roughly [8]., i.e., , where denotes the cardinality of a set . Since both typical sets span the whole space of binary sequences (i.e., the two typical sets are almost fully overlapping), there will be no hope to divide the space of binary sequences into two disjoint regions from which one can distinguish if an observed binary sequence was likely generated under or .

Analogous to the typical sets in information theory, our proposed quantization method enables us, in the asymptotic sense, to divide the set of all binary sequences at the output of 1-bit quantizer into two typical sets under both hypotheses (say, presence and absence of an unknown signal). In our case, we take a typical set with regard to the distribution of the number of 1’s in a sequence.

Specifically, we propose to use an adapted 1-bit window comparator (aka window detector) to induce some imbalance between the number of ’s and ’s at its output under both hypotheses. For instance, the density of 1’s (i.e., the ratio between the number of 1’s and the total number of bits in the observed binary sequence) under is kept fixed at some small value, say, . Conditioned on , the number of 1’s in an observed sequence converges to (in probability), thanks to the weak law of large numbers. This means that the null typical set comprises all binary sequences, where the number of 1’s in each sequence is roughly . Hence, for an observed sequence with the number of 1’s which deviates from will be highly likely caused by a model in , i.e., the observed sequence will belong to the alternative typical set.

Fig. 1: Logic-gate diagram of a window comparator.
Fig. 2: The operation of the window comparator in Fig. 1.

Ii-B Problem Formulation

Fig. 1 shows a logic gate diagram of our memoryless 1-bit window comparator, comprising two operational amplifiers working as comparators and a NAND gate. The upper- and lower-window thresholds are given by and , respectively. With reference to Fig. 2, the main operation of the window comparator in Fig. 1 is to detect whether an input voltage is outside a window predetermined by the upper- and lower-window thresholds. This can be mathematically defined by


where is an input signal and is the absolute value of .

We remark here that it is the convention that logic “1” and “0” are reversed in (1) and thus the NAND gate in Fig. 1 becomes AND gate. However, this is not a problem in our case as the role of 1’s and 0’s can be arbitrarily switched during signal processing with no change on our results.

Consider two zero-mean stationary Gaussian processes and where . The first process corresponds to the null hypothesis () and the second to alternative hypothesis ().

Fig. 3: The proposed 1-bit receiver structure for binary hypothesis testing.

Each process undergoes 1-bit quantization after passing through a 1-bit window comparator defined by (1). Thus our binary hypothesis testing problem may be expressed as


The receiver needs to determine if the binary sequence has been caused under or . Throughout this work, we assume that is known at the receiver, whereas is assumed unknown.

Iii The proposed 1-bit receiver structure

This section presents the basic 1-bit receiver structure proposed to facilitate binary hypothesis testing. With reference to Fig. 3, the receiver comprises a 1-bit window comparator for quantizing an incoming signal into binary digits, followed by a very low-complexity binary hypothesis detector that runs BDD algorithm. The detector attempts to decide which hypothesis is most likely to have given rise to the observed binary sequence. We first treat the proposed 1-bit window comparator, then the binary hypothesis detector.

As will be unfolded later, our adapted window comparator makes it possible to recapture a significant amount of information about the presence of an embedded unknown signal in a received waveform.

Fig. 4: Probabilistic output analysis of window comparator.

Iii-a The proposed 1-bit window comparator

We consider the window comparator in Fig. 1 with and , where is a fixed constant (window comparator parameter) which can be optimized to maximize the overall probability of detection. The value of

is typically between 1 and 2, i.e., window width is between two to four times the standard deviation of the model for

. In Sec. V we have presented a set of numerical results which suggests that serves as an appropriate value, maximizing the detection probability under different requirements of the probability of false alarm. A slight deviation from is not very critical, and simply the performance degradation is insignificant. Obviously, letting the window width be too small or too large is useless.

Fig. 4 illustrates the probabilistic output of our window comparator in response to two zero-mean discrete-time Gaussian processes, and . Conditioned on , the window comparator outputs logic 1 with probability given by , i.e., null success rate. The shaded area shows this probability in the figure. Conditioned on , the alternative success rate, denoted by is given by the area under the dashed curve in the intervals and , where this area increases monotonically with increasing .

Referring to Fig. 4, we have that


where is the complementary distribution function (aka. Q-function) of a standard normal random variable and is defined by


From (3) and (4), it is worth remarking that is always fixed regardless of and being monotonically increasing with increasing ratio is the key feature of our quantization method for an efficient detection process.

Again, in the light of (3) and (4), an observed binary sequence at the output of our window comparator is viewed as a realization of an i.i.d. Bernoulli process with success rate (known and fixed) under or with success rate (unknown) under . Asymptotically, the number of 1’s in the binary sequences generated under and will roughly be and , respectively. This means that, in the asymptotic sense, we have two distinct sets of binary sequences, but in practice, is usually finite, therefore there will be some overlapping between these two sets giving rise to detection confusion.

Iii-B Test statistic

The problem now has been reduced to a simple one; to distinguish between two binary sequences of length , generated by two Bernoulli processes with trials and different success rates. That is,


where the notation is a shorthand for the random variable being distributed according to a Bernoulli probability mass function(PMF) of success rate , i.e., . Thus the joint PMFs under both hypotheses are [12],


where denote joint PMF parameterized by .

Using the log-likelihood ratio (LLR) [17] as a sufficient statistic yields


where is an arbitrary test threshold. The notation in the last line of (III-B) means that the LLR decision is that if the left-hand side is greater than , and is that if the left-hand side is less than .

From the third line of (III-B), taking the second term in the left-hand side to the right-hand side, we obtain


Since , the right-hand side of (9) and the multiplicative factor, , on the left-hand side are nonnegative numbers. Also, the factor, , is not a function of ’s. Therefore, dividing both sides of (9) by , (9) boils down to the following sufficient statistic test:


where is the modified detection threshold given by


Note that (10) partitions the space of observed sequences based on the number of 1’s into two regions.The first region is where the receiver accepts as true and rejects , and the second region is where the receiver accepts as true and rejects .

We see that given , the sufficient statistic in (10) does not depend on the unknown parameter ( and are all absorbed in which is a constant to be chosen at our disposal) and is monotonically increasing in the sense that, the more 1’s in the observed binary sequence, the more likely will be. According to the Neyman-Pearson criterion, it is a uniformly most powerful (UMP) [17] test in the sense that for any value of (or equivalently ), the resulting probability of detection, , is maximized for a fixed probability of false alarm . The threshold is determined by the distribution of .

Iii-C The proposed BDD algorithm

Since the null success rate, (3), is available at the receiver beforehand, the test threshold can be selected in away such that the resulting probability of false alarm is less than or equal to a prescribed probability of false alarm, . From (10), the probability of false alarm results from accepting when was true, i.e., . Thus it is determined by the distribution of the sufficient statistic, .

To proceed, we note that is a sum of i.i.d. Bernoulli random variables, hence it follows the binomial distribution under both hypotheses:


Therefore, can be selected such that


and rearranging (III-C) yields


The summation on the left side of (14) can be easily computed numerically to find . For notational convenience, can be expressed

by the inverse binomial cumulative distribution function (CDF), i.e.,


where, in the light of (14), the inverse binomial CDF, , returns the smallest integer such that the binomial CDF evaluated at is equal to or exceeds .

A closed-form solution for (15) is indeed intractable. Nevertheless, an approximate solution for

is possible by invoking the central limit theorem when

is sufficiently large. This allows us to approximate the binomial distribution by a Gaussian distribution. That is, under

, the sum of observed bits can be approximated as a Gaussian random variable with mean and variance , i.e.,

Then approximately,


and hence can be obtained as the smallest integer given by



denotes the inverse Q-function of standard normal distribution and

denotes the floor function which returns the smallest integer which is less than or equal to .

In the above analysis, note that in addition to being sufficiently large, the Gaussian approximation is acceptable when is not too small, which is not a problem in our case.

Unlike a continuous distribution, binomial distribution is discrete. Hence, it is usually the case that there is no integer-valued that satisfies (III-C) with equality and hence the closest solution is accepted, resulting in a probability of a false alarm that is less than the desired one. Also, note that there is a nonzero probability for the event

which is not included in the test, in contrast to a continuous random variable where the probability at a specific value is zero. Therefore, the resulting probability of false alarm due to accepting the closest solution mentioned above will change with

, which affects the desired probability of detection negatively and hence we propose to avoid this situation as explained next.

Thus, we propose to maintain the probability of false alarm at the desired level by introducing some controlled randomization in the decision process, according to the following rule:


where is referred to as the randomization parameter.

According to (18), the detection algorithm resorts to a randomized decision only when the event occurs. This event occurs with probability

which is very small, compared with the probability of the non-randomized decision. It is worth noting that introducing some sort of a controlled randomization in a decision process is not new and has been proven useful in a variety of well-known algorithms including Markov Chain Monte Carlo (MCMC) based MIMO detector

[16] and stochastic population-based search algorithms [22].

Based on (18), (III-C) is modified as


where the first term on the right side of (19) corresponds to the probability of false alarm due to non-randomized decision (i.e., LLR decision (9)) and the second term to the randomized decision (i.e., when the event occurs). From (19), we have that


which is computed offline at the receiver as all involved parameters in (III-C) are known beforehand.

With the aid of (19), it is easy to note that when , and when , and hence , verifying that is a proper probability value. The BDD algorithm is summarized in Algorithm 1.

Input: (15), (III-C)
Test statistic:
if   then
end if
Algorithm 1 BDD algorithm

Summary of Algorithm 1: The initial parameters are the number of binary observations, , window comparator parameter, , the desired probability of false alarm, . The main inputs used by the algorithm are the test threshold , a randomization parameter and the observed sequence (see also Fig. 3). and are computed offline in order using (15) and (III-C), respectively. Note that are fixed and known beforehand. Then, the algorithm computes the number of 1’s in the received sequence (i.e., ) and decides or using one of two approaches: randomized test and LLR test (i.e., binomial test). The decision is based on the first approach if , but on the second approach if . In the randomized test, is decided with probability whereas with probability . To achieve these probabilities, we generate a uniform random number and compare it with . If , then is selected, or is selected otherwise.

The probability of detection is given in the following result.

Theorem 1.

For a fixed probability of false alarm , the probability of detection of BDD algorithm is


The result follows directly from (18) by noting that

where is given in (III-C), and are respectively defined by

In (1), the first and second terms on the right side correspond to the detection probability resulting from the non-randomized (LLR) and randomized decisions, respectively.

The following result shows the asymptotic behaviour of when the number of observations grows large or/and the change in variance between the two hypotheses becomes sufficiently large.

Corollary 1.

When or/and , converges to 1,


The result follows directly by substituting or in (1) while other parameters are held fixed. ∎

In practice, Corollary 1 is valid for modest values of and .

The probability of detection, , for a traditional zero-threshold 1-bit quantizer is recovered by substituting (the upper- and lower-window thresholds collapse into a single zero-threshold) in (1). The resulting is given in the following result.

Corollary 2.

Under a traditional zero-threshold 1-bit quantizer, converges to , i.e.,


This result shows that, under the conditions considered in this work, the traditional 1-bit quantizer fails completely to distinguish between the two hypotheses. We give next a remark on the optimal value of .

Remark 1.

Note that obtaining the optimal value of that maximizes (1) does not lead to a closed form solution. In general, the value of can be chosen between 1 and 2, i.e., one to two times the standard deviation of the model in . The optimal can be simply computed numerically which is found to be approximately when change in variance between the models in and is very small, as discussed in Sec. V.

Note that for the two extremes ( and )—which are not of interest—the probability of detection (1) converges to ,

Iii-D Transmission of binary observations via a noisy channel

If the binary observations need to be transmitted over a noisy channel to another party responsible for taking the final decision, then the test statistic needs to be changed to account for the error introduced by the channel.

Assume a binary symmetric channel (BSC) with crossover probability . Then (III-C) becomes


where and are the new success rates of the Bernoulli random variables after transmission via the BSC.

Thus, replacing and by and in (15), a new test threshold is obtained. The new detection probability in Theorem 1 is thus modified as


In practice a good channel coding is used which can reduce the error introduced by the channel significantly, therefore, the (error-free) detection probability in Theorem 1 is still achievable.

Iv Applications

In this section, we consider the straightforward extension of the proposed 1-bit receiver structure in Fig. 3 for two MIMO wireless applications. The first is jamming detection in a massive MIMO system, and the second is signal probing in a WSN. In both cases, we assume that all channels follow Rayleigh fading with unknown instantaneous realizations at receivers.

Iv-a Massive MIMO

Fig. 5: An uplink massive MIMO system with BS equipped with a set of 1-bit window comparators and BDD algorithm for detecting a pilot attack. In this example, the first pilot symbol of each coherence channel block is used over independent channel blocks.

One-bit quantized massive MIMO system, where the BS has only access to binary measurements, is desirable for its low-hardware complexity and insignificant energy consumption. Fig. 5 shows a conceptual schematic diagram of a massive MIMO system under pilot attack. The issue of practical importance here is simply that of detecting a malicious attack by the BS based on coarsely quantized samples (binary samples).

We propose to equip the BS with a sufficient number of our 1-bit window comparators (not necessarily all antennas) and let the BS run BDD algorithm (Algorithm 1) to detect an unknown jamming in the system, which proves to be a very promising solution for single and multiple-antenna jamming devices.

In our model, all channels are assumed flat Rayleigh-block fading where all channel realizations are unknown at the BS, the large-scale fading coefficients and transmit power of UEs are also known at the BS, however, nothing is known about the jammer, except its channel statistics. Note that the assumption of channel being unknown is more realistic than the assumption of perfect channel, especially when a signal is coarsely quantized and (unknown) jamming power is high, which may render the channel estimate useless.

Signal model and problem formulation

We consider the uplink (training phase) in a single-cell multiuser MIMO system operating in time-division duplex (TDD) mode, i.e., see Fig. 5. The system has users served by a BS with antennas in the same time-frequency resource. Without loss of generality, we consider a single-antenna jammer who sends the same pilot of user (i.e., pilot spoofing) to contaminate its channel estimate at the BS. The case of a multiple-antenna jammer transmitting arbitrary pilot signal is also workable as will be shown in Sec. V.

We use

to denote channel vectors (Rayleigh small-scale fading) corresponding to user

and the jammer, respectively, and all channel vectors stay constant over symbols (i.e., coherence time).

With no loss of generality and for notational simplicity, we equip all antennas with 1-bit window comparators, one per signal dimension. Thus, under (i.e., no jamming) and (i.e., with jamming), the unquantized baseband discrete-time signal received at the BS at time is


where is the pilot symbol sent from the -th user at time instant , and denote the average transmit powers of user and jammer, and are the large-scale coefficients (e.g., path loss and shading) of user and jammer, respectively, and is uncorrelated white Gaussian noise. Without loss of generality, we assume , i.e., constant modulus pilot symbols.

In the following analysis, we study a case where jamming detection is performed using only one pilot symbol (e.g., first symbol) received per coherence time and coherence blocks (independent realizations of channels) is considered as illustrated in Fig. 5. It is worth noting that jamming detection using all pilot symbols during one coherence time is possible as long as for the received samples being independent (with channel being random) under and hence our test is computable. Otherwise correlation should be taken into account leading to uncomputable test statistic, due to the intractability of distribution of correlated Bernoulli random variables.

Jamming detection

According to our channel model, conditioned on each hypothesis, the unquantized signal is complex Gaussian with i.i.d. entries, i.e.,


where is the number of channel blocks and are given by


We recall that is assumed known at the BS, whereas is unknown.

Define and where denotes the vectorization operator, i.e., we stack all real and imaginary components of in a column vector. All entries of are i.i.d. under and i.i.d. under .

Let be length- binary sequence oberved after all window comparators at the BS where is a component-wise operator. According to our well-designed window comparator, the binary sequence is a realization of an i.i.d. Bernoulli random process with different success rates under both hypotheses. Therefore, the jamming detection can be formulated by the following binary hypotheses:


where and are defined in (28).

Given (IV-A), the BS then runs BDD algorithm (Algorithm 1) to decide if there is jamming or not.

Iv-B Wireless sensor network

WSNs are characterized by limited resources such as bandwidth and energy. Because of such system constraints, observations at cheap sensors in the network require to be compressed before being sent to a central unit for processing. Particularly, when the constraint on energy and bandwidth is severe, the sensors map the observations into binary measurements before transmission.

A conceptual schematic diagram of a WSN scenario is shown in Fig. 6, where we are interested in probing a signal sent from a low-power transmitter in the neighborhood by a set of cheap sensors employing the similar 1-bit window comparators to quantize the received signals before sending to a master sensor or node. Then the master node takes a decision using our proposed BDD algorithm and sends the result to a central unit (e.g., access point).

Fig. 6: A wireless sensor network employing 1-bit window comparator at all sensors except the master sensor, to detect the presence or absence of a low-power signal against background noise. The transmitter sends only one symbol () and each sensor reports its observed bit to the master node for the final decision.

Signal model and problem formulation

With reference to Fig. 6, we consider a WSN comprising spatially distributed sensors where each is equipped with a simple window comparator. We also assume that there is a more capable master sensor which collects data from all sensors, running BDD algorithm and reporting the result to an access point (AP).

There is no loss of generality in assuming a real-valued signal model where the complex-valued signal can be decomposed into two i.i.d. real-valued random variables under . Each sensor receives (per channel use) a noisy version of a constant signal, say, sent from a non-stationary low-power transmitter in the neighborhood for declaring its presence periodically, where is the transmit power which is assumed small. It is worth noting here that the assumption of low-power transmitter is of great importance in most WSN applications.

Consider transmission over only 1 symbol, i.e., . Extension to transmission over is possible as will be discussed in Sec. V. Thus, the unquantized signal received by the -th sensor may be written as


where is spatially and temporally independent Gaussian noise, and is an unknown Rayleigh-fading channel coefficient between sensor and transmitter, which is assumed constant over one coherence time of channel .

After 1-bit quantization, we have


where is the binary digit observed at sensor .

Signal detection

Conditioned on each hypothesis, the binary observations at different sensors are assumed statistically independent, which is a reasonable assumption( i.e., noise and channels are independent). Accordingly, the detection problem can be expressed as the following binary hypothesis testing:


where we have assumed that, under low transmit power , the average received power at each sensor is roughly the same, i.e., , i.e., approximately same pathloss, which is a sensible assumption in many situations. Note that BDD algorithm relies only on to compute the test threshold which is fixed and known.

Then each sensor needs to send 1-bit of information to the master node through a multiple access channel (MAC) for the final decision. Assume an error-free channel between sensors and the master node, e.g., a sufficiently good error control coding (ECC) is used[14]. Then, the master sensor collects all data from all sensors perfectly. Having collected data, the master node thus runs BDD algorithm (Algorithm 1) and reports the decision to the AP (see Fig. 6).

V Numerical Results

This section presents some numerical examples to verify the analytical results in this paper. We set , hence the upper- and lower-window thresholds are and . Consequently, (3). The choice of is justified in the next. For the sake of comparison, we simulate the performance under an unquantized system (unquantized observations), employing log-likelihood test which is reduced to test (Chi-square test) [17], where

is the number of degrees of freedom. The former test has been recently used in

[13] for pilot attack detection in unquantized massive MIMO system.

According to Theorem 1, depends on four parameters: and the window comparator parameter . The first two parameters are narurally fixed beforehand, whereas the third is unknown (otherwise the test may not be required). Thus optimizing depends on . Since BDD algorithm detects the change in variance between and , it is natural to select such that the detection capability is maximized for a small change in variance, i.e., when is large, which in turn leads automatically to maximizing under larger change of variance. Because of analytical intractability of (1), numerical evaluation is used instead.

In Fig. 7, we plot against different values of for different values of (small variance change), two fixed and . As shown in Fig. 7, the optimal that maximizes is about under both probabilities of false alarm 222 The slight ripple in the tail is an artifact due to numerical instability.. It is worth noting that as or , converges to and hence the detection capability is diminished, verifying the result in Remark 1. Note that this situation is avoidable as .

Fig. 7: The optimal maximizing of BDD algorithm under very small change in variance between and when . Curves are obtained by Theorem 1, where the leftmost plot corresponds to and the rightmost plot to .
Fig. 8: The distribution of test statistic under and . The analytical results are obtained by (III-C).

Fig. 8 illustrates the distribution of the sum of binary digits (i.e., test statistic ) observed at the output of a window comparator in response to two Gaussian processes () and (), where represents the change in variance between the two hypotheses and . As seen, the simulation results match the analytical ones. The results show that the overlapping region of the two distributions shrinks as increases, thereby the distinguishability between and is monotonically improving. This is in line with Corollary 1 where it is shown that as (i.e., when is sufficiently large).

Fig. 9: Tradeoff between and for different values of change in variance under two Gaussian processes undergoing 1-bit quantization. Solid lines and markers denote simulated and analytical results (Theorem 1), respectively.

Fig. 9 shows the tradeoff between and for two Gaussian processes. The performance curves show that the tradeoff becomes less stringent as the variance of the stochastic process, , under and the number of samples, , increase, as shown in Fig. 9 (left) and Fig. 9 (right), respectively. For instance, Fig. 9 (right) suggests that for a fixed change in variance between both hypotheses, the probability of false alarm can be made arbitrarily small while probability of detection converges to 1, asymptotically in the number of observations. The results are in agreement with the calculations ( i.e., Corollary 1) where the simulated and analytical results match perfectly.

Fig. 10: Performance of 1-bit window-comparator based BDD algorithm in WSN for probing a low-power transmitter.

In Fig. 10 we consider a WSN (complex-valued channel model). We show the performance of BDD algorithm run on a master sensor upon collecting data (error-free channel) from other sensors to detect the existence of a low-power transmitter. The transmitter sends a length- constant signal at dB. We equip all sensors (except the master sensor) with window comparators for counting the number of 1’s observed over symbol intervals and reporting the result to the master sensor for a final decision, after which the AP is acknowledged of the decision. Also, the performance under the unquantized system is shown.

Referring to Fig. 10, the results show that the performance of the proposed 1-bit window comparator combined with BDD algorithm is effective regardless its simplicity. With sensors, by letting the transmitter send 4 symbols () instead of 1 symbol, can be increased from to . As a result, increasing the number of observations interval can relax the need for a larger number of sensors to a achieve a satisfactory . Compared with an unquantized system where all sensors are equipped with sufficiently high-resolution ADCs, the gap in performance decreases gradually as more symbols are transmitted by the transmitter to declare itself. This is because when , symbols received under exhibit some correlation, incurring a loss of performance for both systems and hence narrowing down the gap.

It is worth mentioning that the case (one symbol) gives rise to uncorrelated samples in space and time, hence in Theorem 1 matches perfectly with the simulation result. When , there is some temporal correlation since we assume channel constant during this short-length transmission. Therefore, the analytical which is derived under uncorrelated samples deviates slightly from the simulation results, though it is not noticeable 333When transmit power is sufficiently small, correlation between samples can be negligible and hence the observed bits can be well approximated as i.i.d. Bernoulli random variables.. The analytical probability of detection thus obtained is sufficiently accurate even under correlated observations.

Fig. 11: Performance of 1-bit window-comparator based BDD algorithm in massive MIMO system for detecting a single-antenna jammer. (one coherence block), dB.

Fig. 11 shows the performance of jamming detection in a massive MIMO system. We assume users, (pilot length) and users use mutually orthogonal pilots where all pilot symbols have unit modulus. For simplicity, we assume and dB. Only one coherence channel block () is considered, and all pilot symbols are exploited for detection. Conditioned on , the case renders all received (unquantized) pilot symbols i.i.d. Gaussian random variables having zero-mean and common variance and hence the corresponding binary digits are i.i.d. Bernoulli random variables.

32 44 0.026 1.0882
128 159 0.5989 4.093
256 307 0.7024 8.0365
TABLE I: Simulation parameters of Fig. 11 for BDD algorithm (1-bit quantized system) and