This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Joint Radio Frequency Fingerprints Identification via Multi-antenna Receiver

Xiaofang Chen,  Wenbo Xu,  and Yue Wang XXX.XXX.XXX.XXX.XXX.
Abstract

In Internet of Things (IoT), radio frequency fingerprints (RFF) technology has been widely used for passive security authentication to identify the special emitter. However, few works took advantage of independent oscillator distortions at the receiver side, and no work has yet considered filtering receiver distortions. In this paper, we investigate the RFF identification (RFFI) involving unknown receiver distortions, where the phase noise caused by each antenna oscillator is independent. Three RFF schemes are proposed according to the number of receiving antennas. When the number is small, the Mutual Information Weighting Scheme (MIWS) is developed by calculating the weighted voting of RFFI result at each antenna; when the number is moderate, the Distortions Filtering Scheme (DFS) is developed by filtering out the channel noise and receiver distortions; when the number is large enough, the Group-Distortions Filtering and Weighting Scheme (GDFWS) is developed, which integrates the advantages of MIWS and DFS. Furthermore, the ability of DFS to filter out the channel noise and receiver distortions is theoretically analyzed at a specific confidence level. Experiments are provided when both channel noise and receiver distortions exist, which verify the effectiveness and robustness of the proposed schemes.

Index Terms:
Emitter distortions, multiple independent oscillators, mutual information (MI), radio frequency fingerprinting identification (RFFI), receiver distortions.

I Introduction

The number of IoT access devices deployed in practical systems is rising quickly as a result of the expansion of IoT application scenarios including automotive industry [1], healthcare [2], smart living [3], etc. According to the International Data Corporation, approximately 40 billion IoT devices will be available globally by 2025. As a large number of IoT devices have plunged into human life, network security has emerged as a growing public concern worldwide [4, 5].

Traditional cryptography-based algorithms are used in most existing wireless communication systems to achieve secure authentication of upper-layer mechanisms [6, 7]. However, these algorithms suffer from some limitations such as computer-limited assumptions, replay attack susceptibility, high communication overhead, complexity, etc [8]. In contrast, radio frequency fingerprints (RFF) as a very promising non-cryptographic authentication technology has recently gained a lot of research interest because of its information-theoretic security, low complexity, and high compatibility.

The concept of RFF was first introduced in 2003 [9]. It extracts the inherent, stable, and unique fingerprints of different emitters to distinguish their physical layer properties [10]. Such fingerprints exist due to the unavoidable accuracy errors and randomness in the device production process [11], which presents as the unintentional modulation at the emitter side, causing minor emitter distortions of the signal that are difficult to imitate.

Although this unintentional modulation is not conducive to the demodulation of the signal, it is the basis for RFF identification (RFFI) to extract radio frequency (RF) features with uniqueness, stability, and intrinsicality to complete the special emitter identification. The current RF features can be categorized into transient and steady-state features [12]. For the transient features, though some scholars have confirmed their feasibility [13], it is difficult to determine its starting point accurately due to the extremely short transient signal, which disables complete feature extraction. Therefore, a lot of researches focus on the feature extraction of the steady-state signal segment. For example, Q. Li et al. adopt the self-phase optical function to optimize variational mode decomposition (VMD) and suppress the modal aliasing after signal decomposition [14]. Y. Li et al. extract features through entropy information and spectral feature method [15].

In addition to RF feature extraction, RFFI contains another two steps: signal pre-processing and signal classification. The signal pre-processing, e.g., transformation [16, 17], data cleaning [18], etc., is used to improve the distinguishability of the subsequent extracted features among different emitters. In terms of signal classification, some traditional classifiers, such as K-means, support vector machine (SVM), and neural networks [12], are commonly adopted to classify the extracted RF features.

Although the above-mentioned works have studied various methods of each step in RFFI, few of them have taken into account receiver distortions. Such distortions unavoidably affect the accurate extraction of emitter fingerprints, and thus impact the performance of RFFI [19]. It has been suggested to complement additional hardware to compensate for the distortions at the receiving side [20], but it might lead to extra distortions that cannot be further explored.

Taking into account the impacts of receiver distortions and complemented hardware, B. He et al. suggest that the performance of RFFI can be enhanced by utilizing the diversity gain of multiple received versions [21]. Therefore, a configuration of multiple receiving antennas is expected to obtain similar benefits. On the other hand, multiple-input multiple-output technology is indispensable in 5G communication. It is pointed out in [22] that the large and heterogeneous antenna systems equipped with separate oscillators for each antenna, which generate oscillator distortions with independent identical distribution characteristics, are necessary for the future. Thus, it is obvious that the independent oscillators generate an independent phase noise to the signal received at each antenna. Currently, no scholars have employed this independent identical distribution property in their RFFI studies.

Considering the above two facts when multiple receiving antennas are configured, we propose three schemes to enhance the robustness and recognition accuracy of RFF. These three schemes are respectively suited to the scenarios with different numbers of receiving antennas. To begin with, Mutual Information Weighting Scheme (MIWS) is proposed when the number of receiving antennas is small. The MIWS is a weighting algorithm that performs a weighted voting operation on the RFFI result at each antenna. It estimates weights based on the mutual information (MI) between the emitter and the received signal at each antenna. Then, when the number of receiving antennas is moderate, Distortions Filtering Scheme (DFS) is proposed to filter out the channel noise and the receiver distortions by exploiting the independent identical distribution property of the received signal. Further, the Group-Distortions Filtering and Weighting Scheme (GDFWS) is proposed to solve the performance saturation phenomenon of DFS when the number of receiving antennas is large. Finally, we use absolute accuracy and confidence level as the metrics of filtering ability to theoretically derive the minimum number of receiving antennas required to satisfy certain performance of DFS. Thereby, the specific scenario in terms of the number of receiving antennas that is applicable for each scheme is derived.

The contributions of our work can be summarized as follows.

  • 1)

    Firstly, when the number of receiving antennas is small, the MIWS scheme is proposed. It utilizes the MI between the transmitting signal and each receiving signal to measure the quality of the latter. Then, the weights of signals at each antenna are calculated accordingly to get the weighted voting of the RFFI results.

  • 2)

    Secondly, when the number of receiving antennas is moderate, the DFS scheme is proposed to deal with channel noise and receiver distortions. To our knowledge, this is the first attempt to filter out the receiver distortions in current literature.

  • 3)

    Thirdly, when the number of receiving antennas is large, the GDFWS scheme is proposed, which enjoys the advantages of both DFS and MIWS. The GDFWS uniformly divides all the antennas into groups first, then filters out channel noise and receiver distortions using DFS within each group to get robust RFFI results, and obtains the weighted voting result of all groups by MIWS.

  • 4)

    Finally, based on the absolute accuracy and confidence level metrics, we theoretically derive the ability of DFS to filter out negative factors to determine the application scenario of DFS. The results simultaneously indicate the specific application scenarios of another two schemes.

The remainder of this paper is organized as follows. Section II briefly reviews the signal distortion model and generalizes the uplink multi-antenna received RFF system model. Three RFFI schemes with multi-antenna receive are described in Section III. In Section IV, we theoretically analyze the impact of the number of receiving antennas on the performance of DFS. Section V shows the results of the experiments, followed by the conclusion in Section VI.

II Background and system model

In this section, we first describe the emitter distortion, channel, and receiver distortion models, and then the uplink multi-antenna received RFF system model is established.

II-A Emitter distortion model

Refer to caption
Figure 1: Sources of the emitter and receiver distortions during typical signal processing, where the sources of distortion modules considered in this paper are framed by red dashed lines.

Fig. 1 depicts a typical end-to-end transceiver link and shows the source of both the emitter and receiver distortions highlighted with red dashed lines. As shown in this figure, the distortions experienced by the transmitted signal at the emitter include filter distortions, I/Q imbalance, spurious tones, and power amplifier nonlinearities. With reference to [21] and [23], the specific mathematical models for these distortions are given as follows.

  • 1)

    Transmit shaping filter distortion:

    We denote the nnth transmitted symbol after constellation mapping as SnS_{n}, and the symbol interval is TsT_{s}. Subsequently, SnS_{n} passes through transmit shaping filter. Considering the inevitable filter distortions due to the limited precision during the manufacturing process, the actual transmit shaping filter is written as

    g~t(t)=gt(t)υ(t),\widetilde{g}_{t}(t)=g_{t}(t)\otimes\upsilon(t), (1)

    where \otimes stands for the convolution, gt(t)g_{t}(t) is assumed to be the ideal transmit shaping filter, and υ(t)\upsilon(t) denotes the filter distortion. The Fourier transform form of υ(t)\upsilon(t) is as follows:

    Υ(f)=AΥ(f)ejΦΥ(f),\Upsilon(f)=A_{\Upsilon}(f)e^{j\Phi_{\Upsilon}(f)}, (2)

    where AΥ(f)A_{\Upsilon}(f) and ΦΥ(f)\Phi_{\Upsilon}(f) denote the amplitude distortion and phase distortion of the filter, respectively. Current literature generally uses the second-order Fourier series model to characterize these two distortions [21], such that

    AΥ(f)=ρ0+ρ1cos(2πfTA),A_{\Upsilon}(f)=\rho_{0}+\rho_{1}\rm{cos}(\frac{2\pi\it{f}}{\it{T_{A}}}), (3)
    ΦΥ(f)=2πq0f+q1sin(2πfTΦ),\Phi_{\Upsilon}(f)=2\pi q_{0}f+q_{1}\rm{sin}(\frac{2\pi\it{f}}{\it{T}_{\rm{\Phi}}}), (4)

    where ρi\rho_{i}, qiq_{i}, i=0,1i=0,1, TAT_{A}, TΦT_{\Phi} are the parameters of the Fourier series. With the filter in (1), the transmission symbols after filter shaping can be written as

    s(t)=n=g~t(tnTs)Sn.s(t)=\sum_{n=-\infty}^{\infty}\widetilde{g}_{t}(t-nT_{s})S_{n}. (5)
  • 2)

    I/Q distortion:

    We denote the in-phase and quadrature components of s(t)s(t) in (5) by sI(t)s_{I}(t) and sQ(t)s_{Q}(t), respectively. The imbalance between sI(t)s_{I}(t) and sQ(t)s_{Q}(t) caused by the modulator is called I/Q distortion, which is mainly manifested as a gain mismatch and quadrature error, then the signal in (5) changes into

    x(t)\displaystyle x(t) =GIsI(t)ej(2πft+ζ/2)+GQsQ(t)ej(2πftζ/2)\displaystyle=G_{I}s_{I}(t)e^{j(2\pi ft+\zeta/2)}+G_{Q}s_{Q}(t)e^{j(2\pi ft-\zeta/2)} (6)
    =αs(t)ej2πft+βs(t)ej2πft,\displaystyle=\alpha s(t)e^{j2\pi ft}+\beta s^{*}(t)e^{j2\pi ft},

    where GIG_{I} and GQG_{Q} represent the gain mismatches of these two components, ζ\zeta denotes the quadrature error, and ()(\cdot)^{*} stands for conjugate operation. To facilitate the following discussion, we define

    {α=12(G+1)cos(ζ2)+j2(G1)sin(ζ2)β=12(G1)cos(ζ2)+j2(G+1)sin(ζ2).G=GI/GQ\begin{cases}\alpha=\frac{1}{2}(G+1)\rm{cos}(\frac{\zeta}{2})+\frac{\it{j}}{2}(\it{G}-\rm{1})\rm{sin}(\frac{\zeta}{2})\\ \beta=\frac{1}{2}(G-1)\rm{cos}(\frac{\zeta}{2})+\frac{\it{j}}{2}(\it{G}+\rm{1})\rm{sin}(\frac{\zeta}{2}).\\ G=G_{I}/G_{Q}\\ \end{cases} (7)
  • 3)

    Spurious tone:

    Affected by oscillators and other active devices, DC offset commonly exists in the signal. The presence of DC offset will result in harmonic components, which we refer to as spurious tone. Considering the impact of spurious tone, the signal in (6) becomes

    x(1)(t)=x(t)+i=1Cciej2π(f+fζ,i)t,x^{(1)}(t)=x(t)+\sum_{i=1}^{C}c_{i}e^{j2\pi(f+f_{\zeta,i})t}, (8)

    where CC is the number of harmonic components, cic_{i} and fζ,if_{\zeta,i} are the amplitude and frequency offset of the iith harmonic component, respectively. It is worth noting that when fζ,i=0f_{\zeta,i}=0 and ci0c_{i}\neq 0, the iith harmonic component is also known as carrier leakage.

  • 4)

    Power amplifier nonlinearities:

    The nonlinearity of the power amplifier causes distortions in both the amplitude and phase of the signal. We express these nonlinear distortions by the Taylor series [19]. Considering a Taylor series of order BB, the distorted signal in (8) further becomes

    x(2)(t)=i=0Bbi(x(1)(t))2i+1,x^{(2)}(t)=\sum_{i=0}^{B}b_{i}(x^{(1)}(t))^{2i+1}, (9)

    where bib_{i} is the iith coefficient of the Taylor polynomial.

II-B Channel and receiver distortion models

In this subsection, we consider the case of single antenna reception for simplicity. This discussion can be extended to multi-antenna reception easily, which will be described in detail in the next subsection. The channel attenuation is denoted by h(t)h(t) and the additive white Gaussian noise (AWGN) is defined as w(t)w(t), then the signal received by the antenna is

z(t)=h(t)x(2)(t)+w(t).z(t)=h(t)x^{(2)}(t)+w(t). (10)

In the aspect of receiver distortions, we concentrate on the phase noise caused by the oscillator, as well as the sampling jitter and quantization error caused by the ADC, which have a greater impact on the received signal compared with other hardware modules [23]. These receiver distortions are modeled as follows.

  • 1)

    Phase noise:

    Assume a phase-locked loop (PLL) is used at the receiver side for phase synchronization. As a typical signal frequency tracker, PLL has the advantages of high output stability and continuously adjustable phase, etc. However, it inevitably produces phase noise, under the impact of which the output signal of PLL is given as:

    y(1)(t)=h(t)x(2)(t)ej(2πft+θ(t))+w^(t)ej(2πft),y^{(1)}(t)=h(t)x^{(2)}(t)e^{-j(2\pi f^{\prime}t+\theta(t))}+\hat{w}(t)e^{-j(2\pi f^{\prime}t)}, (11)

    where

    w^(t)=w(t)ejθ(t),\hat{w}(t)=w(t)e^{-j\theta(t)}, (12)

    ff^{\prime} is the local oscillator frequency and θ(t)\theta(t) denotes its phase noise. Similar to most studies, e.g., [21, 23], we model the phase noise as a Wiener process as follows:

    θ(t)=12πχdθ(t)dt+c(t),\theta(t)=\frac{1}{2\pi\chi}\frac{d\theta(t)}{dt}+c(t), (13)

    where χ\chi is the 3 dB bandwidth of the phase noise power spectrum and c(t)c(t) is the noise obeying the standard Gaussian distribution.

  • 2)

    Sampling jitter:

    Sampling jitter means the deviation of the sampling point from the optimal position when the signal is downsampled by the ADC. In the presence of sampling jitter, the signal in (11) changes into

    y(2)(n)=y(1)(nT+δ(n)T),y^{(2)}(n)=y^{(1)}(nT+\delta(n)T), (14)

    where nn denotes the nnth sampling point, TT is the sampling period and TTsT\ll T_{s}, and δ(n)\delta(n) denotes the relative sampling jitter, which is a random process, and |δ(n)|1|\delta(n)|\ll 1.

  • 3)

    Quantization error:

    The signal is quantized after sampling, and the quantization error is usually modeled as additive noise in the case of uniform quantization. The quantized version of (14) is written as:

    y(n)=y(2)(n)+(n),y(n)=y^{(2)}(n)+\bigtriangleup(n), (15)

    where (n)\bigtriangleup(n) denotes the quantization error at the nnth sampling point. If quantization accuracy is ϵ\epsilon and the dynamic range is [V,V][-V,V], then (n)\bigtriangleup(n) obeys a uniform distribution within the interval [2ϵV,2ϵV][-2^{-\epsilon}V,2^{-\epsilon}V] with a variance of 22ϵV2/32^{-2\epsilon}V^{2}/3.

To summarize, based on (9) to (15), when the effects of the emitter distortions, channel, and receiver distortions are considered, the down-converted signal at the receiver is expressed as (16) written at the top of next page, where the second equation is the simplified form of (16) since sampling jitter does not affect the distribution of w^(nT)\hat{w}(nT).

y(n)=h(nT+δ(n)T)x(2)(nT+δ(n)T)ej(θ(nT+δ(n)T)+2πfTδ(n))+(n)+w^(nT+δ(n)T)ej(2πfTδ(n)).y(n)=h(nT+\delta(n)T)x^{(2)}(nT+\delta(n)T)e^{-j(\theta(nT+\delta(n)T)+2\pi f^{\prime}T\delta(n))}+\bigtriangleup(n)+\hat{w}(nT+\delta(n)T)e^{-j(2\pi f^{\prime}T\delta(n))}. (16)
y(n)=h(nT+δ(n)T)x(2)(nT+δ(n)T)ej(θ(nT)+2πfTδ(n))+(n)+w^(nT).y(n)=h(nT+\delta(n)T)x^{(2)}(nT+\delta(n)T)e^{-j(\theta(nT)+2\pi f^{\prime}T\delta(n))}+\bigtriangleup(n)+\hat{w}(nT). (17)
TABLE I: Three Multi-antenna Received RFFI Schemes.
Scheme MIWS DFS GDFWS
Basic ideas MI weighting distortions filtering intra-group distortions filtering, inter-group weighting
Underline principle diversity gains statistical characteristics statistical characteristics and diversity gains
Application scenario small numbers of receiving antenna medium numbers of receving antenna large numbers of receving antenna

II-C RFF system model with multiple receiving antennas

Based on the single-antenna reception model in the previous subsection, this subsection extends it to a multi-antenna reception scenario. Assuming an uplink multi-antenna received RFF system model consists of MM single-antenna IoT devices and a NN-antenna receiver, each antenna of which is equipped with an independent oscillator.

Suppose that multiple emitters adopt orthogonal access technology to communicate with the receiver, thus this paper does not consider the interference among multiple emitters. According to the previous subsections, the down-converted signal at the iith antenna is established as:

yi(k,n)=hi(k,n)ejθi(k,n)x^m(k,n)+i(k,n)+w^i(k,n),\begin{aligned} y_{i}(k,n)=h_{i}(k,n)e^{-j\theta_{i}(k,n)}\hat{x}_{m}(k,n)\\ +\bigtriangleup_{i}(k,n)+\hat{w}_{i}(k,n)\end{aligned}, (18)

where

hi(k,n)=hi(k,nT+δ(k,n)T),h_{i}(k,n)=h_{i}(k,nT+\delta(k,n)T), (19)
x^m(k,n)=ej2πfTδ(k,n)xm(2)(k,nT+δ(k,n)T),\hat{x}_{m}(k,n)=e^{-j2\pi f^{\prime}T\delta(k,n)}x_{m}^{(2)}(k,nT+\delta(k,n)T), (20)

(k,n)(k,n) represents the nnth sample in the kkth frame. hi(k,n)h_{i}(k,n) is the channel fading coefficient between the emitter and the iith antenna of the receiver, θi(k,n)\theta_{i}(k,n) represents the phase noise of the iith antenna at the receiver side, δ(k,n)\delta(k,n) denotes the sampling jitter, i(k,n)\bigtriangleup_{i}(k,n) indicates the quantization error at the iith antenna, w^i(k,n)\hat{w}_{i}(k,n) is the AWGN at the iith antenna, and xm(2)(k,nT+δ(n)T)x_{m}^{(2)}(k,nT+\delta(n)T) in the form of (9) for the mmth emitter.

As mentioned in the previous subsection, the antenna oscillator inevitably generates phase noise. Fortunately, it is reasonable to assume the phase noise remains constant within a single frame while varies frame-by-frame in this paper [24, 25]. Meanwhile, we assume a slow fading channel, so hi(k,n)h_{i}(k,n) remains constant within a signal frame. Based on these two assumptions, we define hi(k)hi(k,n)h_{i}(k)\triangleq h_{i}(k,n) and θi(k)θi(k,n)\theta_{i}(k)\triangleq\theta_{i}(k,n) for any nn, and the model in (18) is further simplified as

yi(k,n)=hi(k)ejθi(k)x^m(k,n)+i(k,n)+w^i(k,n).\begin{aligned} y_{i}(k,n)=h_{i}(k)e^{-j\theta_{i}(k)}\hat{x}_{m}(k,n)+\bigtriangleup_{i}(k,n)+\hat{w}_{i}(k,n)\end{aligned}. (21)

III RFFI schemes with multi-antenna receiver

Refer to caption
Figure 2: The framework of RFFI with the proposed schemes, where only one scheme can be activated at a time according to the control signal, and the modules highlighted in yellow are proposed in this paper.

In this section, we propose three schemes to realize RFFI as summarized in Table I. These three schemes are applicable to scenarios with different numbers of receiving antennas. As shown in Table I, MIWS is first proposed in case the number of receiving antennas is small. Then, when the number of receiving antennas is sufficient to derive the statistical characteristics of the received signals, we propose DFS to filter out channel noise and receiver distortions. Finally, to address the issue of performance saturation that DFS encounters when the number of antennas is too large, GDFWS is proposed. Fig. 2 depicts the framework of RFFI with these three schemes, where only one scheme is activated by the control signal according to the number of configured antennas, and the modules that we propose are highlighted in yellow.

III-A Mutual information weighting scheme

The MI between the emitted signal and the received signal reflects their information similarity. In this paper, the larger the MI is, the less the emitter signal is affected by channel noise and receiver distortions. Based on this fact, we first estimate the MI between the emitter signal and the received signal at each antenna. Then the weight of the received signal at each antenna is set to be proportional to its corresponding MI. Finally, the RFFI result is obtained as the weighted voting of all classification results predicted from received signals.

In this subsection, we calculate the MI between the emitter signal and the received signal by taking one receiving antenna as an illustration, which can be extended to other antennas easily. For simplicity, the subscript ii of the iith antenna in the subsequent discussion is ignored. Based on the previous analysis, we know that the emitter signal x(2)(t)x^{(2)}(t) undergoes channel fading h(t)h(t), AWGN w(t)w(t), and receiver distortions before completing the classification. To facilitate subsequent analysis, we define

g(t)=h(t)x(2)(t).g(t)=h(t)x^{(2)}(t). (22)

Firstly, with the definition in (22), we transform the signal in (10) into the frequency domain and get

𝐙(f)=𝐆(f)+𝐖(f),\bf{Z}(\it{f})=\bf{G}(\it{f})+\mathbf{W}(\it{f}), (23)

where 𝐙(f)\bf{Z}(\it{f}), 𝐆(f)\mathbf{G}(\it{f}), and 𝐖(f)\mathbf{W}(\it{f}) are the expressions in frequency domain of z(t)z(t), g(t)g(t), and w(t)w(t), respectively. According to [26], the MI between 𝐆(f)\mathbf{G}(\it{f}) and 𝐙(f)\bf{Z}(\it{f}) is calculated as

(𝐙(f);𝐆(f))=(𝐙(f))(𝐙(f)|𝐆(f))=(𝐙(f))(𝐖(f))=12ln(2π(σg2+σw2))12ln(2πσw2)=12ln(1+σg2σw2),\begin{aligned} \mathcal{I}(\bf{Z}\it{(f)};\bf{G}\it{(f)})&=\mathcal{H}(\bf{Z}\it{(f)})-\mathcal{H}(\bf{Z}\it{(f)}|\bf{G}\it{(f)})\\ &=\mathcal{H}(\bf{Z}\it{(f)})-\mathcal{H}(\bf{W}\it{(f)})\\ &=\frac{1}{2}\rm{ln}(2\pi\it{(\sigma_{g}^{\rm{2}}+\sigma_{w}^{\rm{2}})})-\rm{\frac{1}{2}ln(2\pi\it{\sigma_{w}^{\rm{2}})}}\\ &=\frac{1}{2}\rm{ln}(1+\it{\frac{\sigma_{g}^{\rm{2}}}{\sigma_{w}^{\rm{2}}}})\end{aligned}, (24)

where σg2\sigma_{g}^{2} and σw2\sigma_{w}^{2} are the variance of g(t)g(t) and w(t)w(t), respectively. The function ()\mathcal{H}(\cdot) implements entropy calculation.

Consider a special case of (24), i.e., no receiver distortion d(t)d(t) exists. In this case, σy2=σz2\sigma_{y}^{2}=\sigma_{z}^{2}, where σy2\sigma_{y}^{2} represents the variance of y(t)y(t). Then the special case of above equation is

s(𝐙(f);𝐆(f))=s(𝐘(f);𝐆(f))=12ln(2πσy2)12ln(2πσw2)=12ln(σy2σw2).\begin{aligned} \mathcal{I}_{s}(\bf{Z\it{(f)}};\bf{G}\it{(f)})&=\mathcal{I}_{s}(\bf{Y}\it{(f)};\bf{G}\it{(f)})\\ &=\frac{1}{2}\rm{ln}(2\pi\it{\sigma_{y}^{\rm{2}}})-\rm{\frac{1}{2}ln(2\pi\it{\sigma_{w}^{\rm{2}}})}\\ &=\frac{1}{2}\rm{ln(\frac{\it{\sigma_{y}^{\rm{2}}}}{\it{\sigma_{w}^{\rm{2}}}}})\end{aligned}. (25)

Note that (25) is only an ideal case, which does not exist in practical systems. To measure the quality of the received signal, we calculate the difference between (24) and (25) as follows,

I=s(𝐙(f);𝐆(f))(𝐙(f);𝐆(f))=12ln(σy2σw2+σg2)=12ln(σy2σw2+σx(2)2σh2),\begin{aligned} \bigtriangleup I&=\mathcal{I}_{s}(\bf{Z}\it{(f)};\bf{G}\it{(f)})-\mathcal{I}(\bf{Z}\it{(f)};\bf{G}\it{(f)})\\ &=\frac{1}{2}\rm{ln(\frac{\it{\sigma_{y}^{\rm{2}}}}{\it{\sigma_{w}^{\rm{2}}+\sigma_{g}^{\rm{2}}}}})\\ &=\frac{1}{2}\rm{ln(\frac{\it{\sigma_{y}^{\rm{2}}}}{\it{\sigma_{w}^{\rm{2}}+\sigma_{x^{\rm{(2)}}}^{\rm{2}}\sigma_{h}^{\rm{2}}}}})\\ \end{aligned}, (26)

where σh2\sigma_{h}^{2} and σx(2)2\sigma_{x^{\rm{(2)}}}^{\rm{2}} indicate the variance of h(t)h(t) and x(2)(t)x^{(2)}(t) in (10), respectively. In practical applications, σw2\sigma_{w}^{2} and σh2\sigma_{h}^{2} can be derived by some Signal to Noise Ratio (SNR) estimation techniques [27, 28, 29], and channel coefficient estimation techniques[30, 31]. Additionally, σx(2)2\sigma_{x^{(2)}}^{2} can also be estimated based on the received pilots.

Obviously, a smaller I\bigtriangleup I indicates fewer distortions at the receiver. Based on this fact, we define the weight of yi(t)y_{i}(t) as,

ωi=1/Iij=1N1/Ij,\omega_{i}=\frac{1/\bigtriangleup I_{\it{i}}}{\sum_{j=1}^{N}1/\bigtriangleup I_{\it{j}}}, (27)

where Ii\bigtriangleup I_{i} represents the MI difference at the iith receiving antenna in the form of (26).

We use sis\it{{}_{i}} to denote the classification result of yi(t)y_{i}(t). Then the weighted voting of all results is implemented based on their corresponding weights in (27), and the final RFFI result can be obtained.

III-B Distortions filtering scheme

Though the MIWS described in the previous subsection realizes the reduction of the negative impact of channel noise and receiver distortions through diversity gain, a more direct way is to eliminate these negative effects. Thus, this subsection proposes DFS to filter out the channel noise and receiver distortions when the number of receiving antennas is sufficiently large.

If not specifically mentioned, the following derivations are given for single-frame signal, thus we omit the label kk. By defining ϕi=hiejθi\phi_{i}=h_{i}e^{-j\theta_{i}}, the overall system model in (21) is rewritten as

yi(n)=ϕix^m(n)+i(n)+w^i(n).y_{i}(n)=\phi_{i}\hat{x}_{m}(n)+\bigtriangleup_{i}(n)+\hat{w}_{i}(n). (28)

To improve the quality of yi(n)y_{i}(n), DFS attempts to filter out the adverse factors, i.e., ϕi\phi_{i}, i(n)\bigtriangleup_{i}(n), and w^i(n)\hat{w}_{i}(n).

First, by considering all the sampling points of all antennas, (28) is converted into the matrix form

𝐘=𝚽𝐱^T+𝚫+𝐖^=𝚵+𝚫+𝐖^,\begin{aligned} \bf{Y}&=\bf{\Phi}\bf{\hat{x}}^{\it{T}}+\Delta+\bf{\hat{W}}\\ &=\bf{\Xi}+\Delta+\bf{\hat{W}}\end{aligned}, (29)

where

𝚽=(ϕ𝟏ϕ𝟐ϕ𝐍)TN×1,\bf{\Phi}=\ \begin{pmatrix}\phi_{1}&\phi_{2}&\cdots&\phi_{N}\end{pmatrix}^{\it{T}}\in\mathbb{R}^{\it{N}\times\rm{1}}, (30)
𝐱^=(𝐱^𝐦(𝟏)𝐱^𝐦(𝟐)𝐱^𝐦(𝐋))TN×1,\bf{\hat{x}}=\ \begin{pmatrix}\hat{x}_{m}(1)&\hat{x}_{m}(2)\cdots&\hat{x}_{m}(L)\end{pmatrix}^{\it{T}}\in\mathbb{R}^{\it{N}\times\rm{1}}, (31)
𝚵=𝚽𝐱^TN×N,\bf{\Xi}=\bf{\Phi}\bf{\hat{x}}^{\it{T}}\in\mathbb{R}^{\it{N}\times N}, (32)

ΔN×L\Delta\in\mathbb{R}^{\it{N}\times L} with the nnth element of the iith row being i(n)\bigtriangleup_{i}(n), 𝐖^N×L\bf{\hat{W}}\in\mathbb{R}^{\it{N}\times L} with the nnth element of the iith row being w^i(n)\hat{w}_{i}(n), and LL is the number of sampling points in a frame.

The basic idea of DFS is to recover the matrix 𝚵\bf{\Xi} from 𝐘\bf{Y}, and then recover 𝐱^\bf{\hat{x}} based on its relationship with 𝚵\bf{\Xi} given in (32). In doing so, the impacts of 𝚽\bf{\Phi}, Δ\Delta, and 𝐖^\bf{\hat{W}} are expected to be eliminated.

To better illustrate the statistical properties of the received signals, the matrix 𝐘\bf{Y} is rewritten as (33) shown at the top of the next page,

𝐘\displaystyle\bf{Y} =(ϕ1(x^m(1)+v11)ϕ1(x^m(2)+v12)ϕ1(x^m(L)+v1L)ϕ2(x^m(1)+v21)ϕ2(x^m(2)+v22)ϕ2(x^m(L)+v2L)ϕN(x^m(1)+vN1)ϕN(x^m(2)+vN2)ϕN(x^m(L)+vNL)),\displaystyle=\begin{pmatrix}\phi_{1}\cdot(\hat{x}_{m}(1)+v_{11})&\phi_{1}\cdot(\hat{x}_{m}(2)+v_{12})&\cdots&\phi_{1}\cdot(\hat{x}_{m}(L)+v_{1L})\\ \phi_{2}\cdot(\hat{x}_{m}(1)+v_{21})&\phi_{2}\cdot(\hat{x}_{m}(2)+v_{22})&\cdots&\phi_{2}\cdot(\hat{x}_{m}(L)+v_{2L})\\ \vdots&\vdots&\ddots&\vdots\\ \phi_{N}\cdot(\hat{x}_{m}(1)+v_{N1})&\phi_{N}\cdot(\hat{x}_{m}(2)+v_{N2})&\cdots&\phi_{N}\cdot(\hat{x}_{m}(L)+v_{NL})\\ \end{pmatrix}, (33)

where

vij=(w^i(j)+i(j))/ϕi.v_{ij}=(\hat{w}_{i}(j)+\bf{\bigtriangleup}_{\it{i}}\it{(j)})/\phi_{\it{i}}. (34)

It should be noted that i(j)\bf{\bigtriangleup}_{\it{i}}\it{(j)} and w^i(j)\hat{w}_{i}(j) follow the uniform and Gaussian distribution, respectively. Both of them have a mean of 0. Hence, the mean of vijv_{ij} is 0. Based on this property, we calculate the mean of each row of the matrix in (33) to obtain

(𝐘i,.)=ϕi(𝐱^T+𝐯i,.)=ϕi(𝐱^),\mathcal{E}(\bf{Y}_{\it{i},.})=\phi_{\it{i}}\mathcal{E}(\bf{\hat{x}}^{\it{T}}+\bf{v}_{\it{i},.})=\phi_{\it{i}}\mathcal{E}(\bf{\hat{x}}), (35)

where 𝐘i,.\bf{Y}_{\it{i},.} denotes the iith row of the matrix 𝐘\bf{Y} in (33),

𝐯i,.=(𝐯𝐢𝟏𝐯𝐢𝟐𝐯𝐢𝐋),\bf{v}_{\it{i},.}=\begin{pmatrix}v_{i1}&v_{i2}&\cdots&v_{iL}\end{pmatrix}, (36)

and (𝐮)\mathcal{E}(\bf{u}) calculates the mean of the vector 𝐮\bf{u}. Based on (35), it is easy to obtain

(𝐘i,.)(𝐘j,.)=ϕiϕj.\frac{\mathcal{E}(\bf{Y}_{\it{i},.})}{\mathcal{E}(\bf{Y}_{\it{j},.})}=\frac{\phi_{i}}{\phi_{j}}. (37)

Next, we reconstruct the llth row of 𝚵\bf{\Xi} from 𝐘\bf{Y}, the processes of which apply to the other rows of 𝚵\bf{\Xi} as well. By multiplying the jjth row of (33) by ϕl/ϕj{\phi_{l}}/{\phi_{j}} with j=1,2,,Nj=1,2,...,N, which has been obtained by (35) and (37), the matrix in (33) becomes (38).

𝐘~(l)=ϕl(x^m(1)+v11x^m(2)+v12x^m(L)+v1Lx^m(1)+v21x^m(2)+v22x^m(L)+v2Lx^m(1)+vN1x^m(2)+vN2x^m(L)+vNL).\widetilde{\bf{Y}}^{(l)}=\phi_{l}\cdot\begin{pmatrix}\hat{x}_{m}(1)+v_{11}&\hat{x}_{m}(2)+v_{12}&\cdots&\hat{x}_{m}(L)+v_{1L}\\ \hat{x}_{m}(1)+v_{21}&\hat{x}_{m}(2)+v_{22}&\cdots&\hat{x}_{m}(L)+v_{2L}\\ \vdots&\vdots&\ddots&\vdots\\ \hat{x}_{m}(1)+v_{N1}&\hat{x}_{m}(2)+v_{N2}&\cdots&\hat{x}_{m}(L)+v_{NL}\\ \end{pmatrix}. (38)

With the derived 𝐘~(l)\widetilde{\bf{Y}}^{(l)} in (38), by calculating its column mean, we get

c(𝐘~(l))=ϕl(x^m(1)x^m(2)x^m(L)),\mathcal{E}_{c}(\widetilde{\bf{Y}}^{(l)})=\phi_{l}\begin{pmatrix}\hat{x}_{m}(1)&\hat{x}_{m}(2)&\cdots&\hat{x}_{m}(L)\end{pmatrix}, (39)

where c(𝐔)\mathcal{E}_{c}(\bf{U}) calculates the column mean of the matrix 𝐔\bf{U}. It is worth noting that c(𝐘~(l))\mathcal{E}_{c}(\widetilde{\bf{Y}}^{(l)}) is exactly the llth row of 𝚵\bf{\Xi}, which is denoted as 𝚵l,\bf{\Xi}_{\it{l},\cdot}. Following the above procedures, we are able to recover all the rows of 𝚵\bf{\Xi} by varying the value of ll from 1 to NN in order.

By observing 𝚵\bf{\Xi}, we find that directly separating it into 𝚽\bf{\Phi} and 𝐱^\bf{\hat{x}} without any prior knowledge of 𝐱^\bf{\hat{x}} is impossible. Fortunately, by defining x^m(1)\rm{\hat{\it{x}}_{\it{m}}(1)} as the first symbol of this frame, we have

𝚵=𝚽𝐱^T=x^m(1)𝚽𝐱~T,\bf{\Xi}=\bf{\Phi}\hat{x}^{\it{T}}=\rm{\hat{\it{x}}_{\it{m}}(1)}\bf{\Phi}\widetilde{\bf{x}}^{\it{T}}, (40)

where

𝐱~=𝐱^/x^m(1)=(1x^m(2)/x^m(1)x^m(L)/x^m(1))=i=1N𝚵i,./𝚵i,1N.\begin{aligned} \widetilde{\bf{x}}&=\bf{\hat{x}}/\rm{\hat{\it{x}}_{\it{m}}(1)}\\ &=\begin{pmatrix}1&\hat{x}_{m}(2)/\rm{\hat{\it{x}}_{\it{m}}(1)}&\cdots&\hat{x}_{m}(L)/\rm{\hat{\it{x}}_{\it{m}}(1)}\end{pmatrix}\\ &=\frac{\sum_{i=1}^{N}\bf{\Xi}_{\it{i,.}}/\bf{\Xi}_{\it{i},\rm{1}}}{N}\end{aligned}. (41)

It is obvious that 𝐱~\widetilde{\bf{x}} is highly correlated with 𝐱^\bf{\hat{x}}.

Since 𝐱~\widetilde{\bf{x}} retains all the information of 𝐱^\bf{\hat{x}}, it is reasonable to use 𝐱~\widetilde{\bf{x}} rather than 𝐱^\bf{\hat{x}} as the signal for the subsequent RF feature extraction and classification without affecting the performance of RFFI.

We find that in (35) and (39) the calculation of the mean is implemented. However, in practical scenarios, it can only be approximated by averaging. To ensure the effect of filtering out channel noise and receiver distortions, LL and NN should be large enough. Generally, LL is sufficiently large in practical applications. Therefore, the filtering ability of DFS mainly depends on the value of NN, and their relationship will be analyzed in detail in Section IV.

III-C Group-distortions filtering and weighting scheme

The previous analysis has suggested the larger NN is, the smaller the difference between the averaging result and the actual mean 0. When NN is sufficiently large, this difference will be definitely very small. At this moment, even if we further increase NN, the difference will converge and thus no significant performance enhancement will appear. We call such phenomenon of DFS as performance saturation. To alleviate this problem when the number of receiving antennas is large, this subsection proposes GDFWS that divides all antennas into several groups to avoid the appearance of saturation phenomenon.

Refer to caption

Figure 3: GDFWS diagram when received signals are divided into two blocks, where the steps filled with yellow are proposed by us, while the pink is based on existing methods.

Fig. 3 illustrates the overall structure of GDFWS, where signals received by all antennas are divided into four groups for illustration. In this figure, N1=N/2N_{1}=N/2, and N2=N/2+1N_{2}=N/2+1. First, DFS is applied in each group to filter out channel noise and receiver distortions. Then, the obtained x~i(t),i1,2,3,4\widetilde{x}_{i}(t),i\in{1,2,3,4} are delivered to the feature extraction module and weight calculation module, where the former extracts RF features that are subsequently fed into the classification module to obtain classification results 𝐬1×N\bf{s}\in\mathbb{R}^{\rm{1}\times\it{N}}, and the later calculates their respective weights ω1×N\bf{\omega}\in\mathbb{R}^{\rm{1}\times\it{N}}. Finally, the classification result 𝐬\bf{s} and its corresponding weight ω\bf{\omega} are sent into the weighted voting module to obtain the final RFFI result.

Obviously, GDFWS enjoys the advantages of both MIWS and DFS in terms of diversity gain and adverse factors elimination. Meanwhile, the above structure can be easily extended to the case of multiple groups, where the number of antennas in each group is smaller than the one when DFS exhibits performance saturation.

IV Theoretical analysis of DFS and Applicable scenario discussion

In this section, we theoretically analyze the ability of DFS to filter out channel noise and receiver distortions with varying numbers of receiving antennas. The metrics that we consider are confidence level and absolute accuracy. By revealing the relationship between NN and these metrics, we obtain the conclusion about which scheme is more desirable for the case with different numbers of receiving antennas.

We consider the asymptotic case, where L+L\to+\infty, and then study the approximation degree of using averaging operation instead of the actual mean, which reveals its dependence on NN. By averaging each column of (38), the statistical average of the kkth column is derived as:

(𝐘~.,k(l))=ϕl(x^m(k)+v1kx^m(k)+vNk)T=ϕl(x^m(k))+τk,\begin{aligned} \mathcal{E}(\widetilde{\bf{Y}}^{(l)}_{.,k})&=\phi_{l}\cdot\mathcal{E}\begin{pmatrix}\hat{x}_{m}(k)+v_{1k}&\cdots&\hat{x}_{m}(k)+v_{Nk}\end{pmatrix}^{T}\\ &=\phi_{l}(\hat{x}_{m}(k))+\tau_{k}\end{aligned}, (42)

where

τk=(ϕlv1kϕlv2kϕlvNk).\tau_{k}=\mathcal{E}\begin{pmatrix}\phi_{l}v_{1k}&\phi_{l}v_{2k}&\cdots&\phi_{l}v_{Nk}\end{pmatrix}. (43)

In the above equation, τk\tau_{k} represents the difference between the average result and the mean 0. Therefore, the smaller τk\tau_{k} is, the better the filtering effect of DFS on adverse factors, i.e., channel noise and receiver distortions. For simplicity, we define

uik=ϕlvik,u_{ik}=\phi_{l}v_{ik}\\ , (44)

where i1,2,,Ni\in 1,2,...,N. According to (34), the uiku_{ik} in the above equation can be rewritten as

uik=w^i(k)+i(k)=wi(k)ejθi(k)+i(k),\begin{aligned} u_{ik}&=\hat{w}_{i}(k)+\bf{\bigtriangleup}_{\it{i}}\it{(k)}\\ &=w_{i}(k)e^{-j\theta_{i}(k)}+\bf{\bigtriangleup}_{\it{i}}\it{(k)}\end{aligned}, (45)

where the definition of each variable remains the same as in Section II.B. To further simplify, in the following analysis, we ignore kk in the above equation, which reduces to

ui=wiejθi+i.u_{i}=w_{i}e^{-j\theta_{i}}+\bf{\bigtriangleup}_{\it{i}}. (46)

To obtain the distribution of τ\tau, i.e., τk\tau_{k} in (43), we first analyze the distribution of uiu_{i}. Referring to Section II.B, we know that i\bf{\bigtriangleup}_{\it{i}} is uniformly distributed between [2ϵV,2ϵV][-2^{-\epsilon}V,2^{-\epsilon}V]. Suppose the number of quantization bits is 16, i.e., ϵ=16\epsilon=16, and V=1V=1, we have

iU[216,216].\bigtriangleup_{\it{i}}\sim U[-2^{-16},2^{-16}]. (47)

The following discussions can be easily extended to the other cases of VV and ϵ\epsilon. On the other hand, wiw_{i} obeys a Gaussian distribution with mean 0 and variance σw2\sigma_{w}^{2}, and θi\theta_{i} obeys a standard Gaussian distribution, so we easily obtain

wiejθi𝒩(0,σw2).w_{i}e^{-j\theta_{i}}\sim\mathcal{N}(0,\sigma_{w}^{2}). (48)

According to (10), we have

σw2=σx(2)2σh2/10SNR/10,\sigma_{w}^{2}=\sigma_{x^{(2)}}^{2}\sigma_{h}^{2}/10^{\rm{SNR/10}}, (49)

where σx(2)2\sigma_{x^{(2)}}^{2} and σh2\sigma_{h}^{2} are the same as defined in Section III.A. For better illustration, we assume that σx(2)2=1\sigma_{x^{(2)}}^{2}=1 and σh2=1\sigma_{h}^{2}=1, thus the above equation is further simplified as

σw2=10SNR/10.\sigma_{w}^{2}=10^{-\rm{SNR/10}}. (50)

When 0dBSNR30dB0\rm{dB}\leq SNR\leq 30\rm{dB}, it is clear that

216103σw21,2^{-16}\ll 10^{-3}\leq\sigma_{w}^{2}\leq 1, (51)

thus

ui=wiejθi+iwiejθi𝒩(0,σw2).u_{i}=w_{i}e^{-j\theta_{i}}+\bigtriangleup_{\it{i}}\approx w_{i}e^{-j\theta_{i}}\sim\mathcal{N}(0,\sigma_{w}^{2}). (52)

Considering that the average of NN possible samples selected randomly from ui,i1,2,,Nu_{i},i\in 1,2,...,N also follows the Gaussian distribution, so τ\tau in (43) obeys the Gaussian distribution. Furthermore, based on the sampling properties of the sample means [32], it is known that

τ𝒩(0,σw2N).\tau\sim\mathcal{N}(0,\frac{\sigma_{w}^{2}}{N}). (53)

Next, we discuss two performance metrics, i.e., confidence level α\alpha and absolute accuracy ξ\xi. If τ\tau is required to be less than ξ\xi with a confidence level α\alpha, we have

P(|τ|<ξ)=ξξN2πσweτ2N2σw2dτ=α.P(|\tau|<\xi)=\int_{-\xi}^{\xi}\frac{\sqrt{N}}{\sqrt{2\pi}\sigma_{w}}e^{-\frac{\tau^{2}N}{2\sigma_{w}^{2}}}{\rm d}\it{\tau}=\alpha. (54)

Let τ~=Nτ/2/σw\widetilde{\tau}=\sqrt{N}\tau/\sqrt{2}/\sigma_{w}, then the above equation is rewritten as

P(|τ~|<a)=aa1πeτ~2dτ~=erf1(a)=α,P(|\widetilde{\tau}|<a)=\int_{-a}^{a}\frac{1}{\sqrt{\pi}}e^{-\widetilde{\tau}^{2}}{\rm d}\it{\widetilde{\tau}}=\rm{erf}^{-1}(\it{a})=\alpha, (55)

where a=Nξ/2/σwa=\sqrt{N}\xi/\sqrt{2}/\sigma_{w}. As a result, the mathematical relationship between the confidence level α\alpha, absolute accuracy ξ\xi, and the number of receiving antennas NN is

ξ2=2[erf1(α)]2σw2N=2[erf1(α)]2N110SNR/10.\begin{aligned} \xi^{\rm{2}}&=2[\rm{erf}^{-1}(\it{\alpha})]^{\rm{2}}\frac{\sigma_{w}^{\rm{2}}}{N}\\ &=2[\rm{erf}^{-1}(\it{\alpha})]^{\rm{2}}N^{\rm{-1}}\rm{10}^{-\rm{SNR}/10}\end{aligned}. (56)

Clearly, a smaller ξ\xi indicates that DFS is more effective at filtering the adverse factors. To measure the advantage of DFS, we define the performance gain pp such that

p=ξ1ξξ1=11N,p=\frac{\xi_{1}-\xi}{\xi_{1}}=1-\sqrt{\frac{1}{N}}, (57)

where

ξ1=2erf1(α)σw2.\xi_{1}=\sqrt{2}\rm{erf}^{-1}(\it{\alpha})\sigma_{w}^{\rm{2}}. (58)

Only when the gain pp is larger than a threshold p0p_{0}, we regard that introducing DFS can bring benefits. That is

p=11N>p0.p=1-\sqrt{\frac{1}{N}}>p_{0}. (59)

In this paper, we set p0=1/2p_{0}=1/2, and get N>4N>4 based on the above equation. It means that when N4N\leq 4, no obvious gain can be obtained when DFS is employed. In such a scenario, MIWS serves as an alternative.

Table II presents the relationship between NN and ξ\xi in (56) when confidence level α=0.95\alpha=0.95 and SNR=15dB.

TABLE II: The Relationship Between NN and ξ\xi when α=0.95\alpha=0.95 and SNR=15dB.
      NN       4       8       16       32       64       128       256       512
      ξ\xi       0.1743       0.1232       0.0871       0.0616       0.0436       0.0308       0.0218       0.0154
      ξ\bigtriangleup\xi       -       0.0510       0.0361       0.0255       0.0180       0.0128       0.0090       0.0064
      Scheme       MIWS       DFS       GDFWS

From this table, we note that the decreasing rate of ξ\xi, i.e., ξ\bigtriangleup\xi, slows down as NN increases. When N>128N>128, the decreasing rate of ξ\xi is much slower than that when N128N\leq 128. This coincides with the expectation in the previous subsection, i.e., the performance of DFS will be saturated when NN is large enough. To avoid this saturation phenomenon, we use the GDFWS scheme in the cases with medium to high SNR to divide the antenna set into groups of no more than 128 antennas each, which avoids the saturation of DFS in each group.

TABLE III: The Relationship Between NN and ξ\xi when α=0.95\alpha=0.95 and SNR=5dB.
      NN       4       8       …       256       512       1024       2048       4096
      ξ\xi       0.5510       0.3897       …       0.0689       0.0487       0.0344       0.0244       0.0172
      ξ\bigtriangleup\xi       -       0.1614       …       0.0285       0.0202       0.0143       0.0101       0.0071
      Scheme       MIWS       DFS       GDFWS

Table III gives the relationship between NN and ξ\xi in low SNR, where α=0.95\alpha=0.95 and SNR=5dB. It is noted that the saturation of DFS appears when N>2048N>2048, which is much larger than that in Table II. This means that DFS is more likely to saturate with a smaller NN when SNR is higher. In practical applications, the number of receiving antennas is generally limited, i.e., it will not reach 2048, thus DFS is still preferable rather than GDFWS at low SNR.

V Experiment and discussion

In this section, some experiments are provided to verify the efficiency of the proposed schemes.

V-A Experimental setting

According to the produces of RFF, we describe the settings of the simulation experiments in this paper from five aspects in turn: emitters, channel, receiver, RF feature extraction methods, and classifiers, the detail of which are as follows.

  • 1)

    The settings of emitters:

    TABLE IV: The Parameters Settings of Emitters.
           P E       T1\rm{T_{1}}       T2\rm{T_{2}}       T3\rm{T_{3}}       T4\rm{T_{4}}       T5\rm{T_{5}}
          ρ0\rho_{0}       1       1       1       1       1
          ρ1\rho_{1}       0.03       0.06       0.085       0.073       0.040
          TAT_{A}       4       4       4       4       4
          q0q_{0}       1       1       1       1       1
          q1q_{1}       0.0302       0.0295       0.0290       0.0310       0.0313
          TΦT_{\Phi}       4       4       4       4       4
          GG       0.998       1.0056       1.0102       0.9992       0.9982
          ζ\zeta       -0.018       0.0175       0.012       0.003       0.024
          c1c_{1}       0.0013+0.0082j       0.0015+0.0072j       0.0011+0.0068j       0.0017+0.009j       0.002+0.0065j
          c2c_{2}       0.0082       0.0075       0.0070       0.0087       0.0090
          fζ,1f_{\zeta,1}       0       0       0       0       0
          fζ,2f_{\zeta,2}       0.0129       0.0132       0.0123       0.0135       0.0119
          b1b_{1}       1       1       1       1       1
          b3b_{3}       0.3       0.6       0.01       0.4       0.08

    The RF signal is generated according to the emitter distortion model described in Section II. It should be noted that we assume the number of harmonic components in (8) and the order of the Taylor series in (9) both are 2. We consider 5 emitters with the distortion parameters provided in Table IV, where the E and P are abbreviations for Emitters and Parameters, respectively, and T1\rm{T_{1}} to T5\rm{T_{5}} labels for emitter 1 to emitter 5. The modulation mode of the RF signal is QPSK, with the oversampling factor T/Ts=10T/T_{s}=10, 1/Ts=1061/T_{s}=10^{6} MHz, and the signal center frequency is 1GHz. A frame consists of 128 symbols, wherein 32 symbols carry pilots.

  • 2)

    The settings of channel:
    AWGN channel is considered in our experiments, so the channel fading coefficients hi(k)h_{i}(k) in (21) is set to be 1. Nonetheless, the following experimental conclusions also apply to the case where the channel coefficients are random.

  • 3)

    The settings of the receiver:
    The receiver distortions are generated according to the receiver distortion model described in Section II. The distortion parameters of sampling jitter and quantization errors are set as follows: δ(n)=0.003\delta(n)=0.003, V=1V=1, ϵ=16\epsilon=16. The parameter χ\chi in (13) for phase noise varies to show its influence on RFFI accuracy.

  • 4)

    RF feature extraction methods:
    Two classical RF feature extraction methods, i.e., least mean square (LMS)-based feature extraction [33] and intrinsic time-scale decomposition (ITD)-based feature extraction [21], are used in our experiments. The LMS-based feature extraction method updates its filter weights recursively based on some criteria until convergence, then uses its converged weight vector as features. The ITD-based feature extraction method first decomposes the signal by ITD and then calculates the skewness and kurtosis of each decomposed signal as the feature vector.

  • 5)

    Classifiers:
    Currently, there have been many successful classifiers applied to RFFI. However, since classifiers are not the focus of our paper, we choose the typical multi-classification SVM for RFF classification.

In the following experiments, the number of training frames and testing frames for each emitter is 200 and 100, respectively. Each experiment result is obtained by averaging over 1000 trials. We use ORS to represent the original scheme without distortion filtering and the weighted voting operation, which is used as a benchmark for the proposed schemes.

V-B Experimental results of MIWS

Refer to caption

Figure 4: Classification accuracy of MIWS based on ITD with M=5M=5, N=4N=4, and χ\chi of each antenna being 0.001, 0.01, 0.1, 1 (top to bottom), respectively.

Fig. 4 depicts the results of RFFI accuracy with varying SNR for MIWS, where five emitters are present, the ITD-based feature extraction method is adopted, and the receiver is equipped with four antennas with χ\chi of 0.001, 0.01, 0.1, 1, respectively. In this figure, UWS stands for the scheme of equally weighting the signals received by each antenna, while ORS ii represents the scheme that directly uses the signals at the iith receiving antenna without any distortion filtering or weighting operation. It is noteworthy that the results of each ORS in this figure reveal that the larger the χ\chi, the lower the recognition accuracy, which indicates that the ITD-based feature extraction method is sensitive to the phase noise at the receiver. Furthermore, the experimental results indicate that both MIWS and UWS outperform the ORS of each antenna, while the performance of MIWS is better than that of UWS, which highlights the benefit of setting weights according to MI.

Refer to caption

Figure 5: Classification accuracy of MIWS based on LMS with M=5M=5, N=4N=4, and χ\chi of each antenna being 0.001, 0.01, 0.1, 1, respectively.

Fig. 5 depicts the results of RFFI accuracy with varying SNR for MIWS, where the LMS-based feature extraction method is employed, and the other settings are the same as those in Fig. 4. Unlike the ORS with significant differences in Fig. 4, the ORS of each antenna maintains similar RFFI accuracy when χ\chi varies in this figure. This observation suggests that the ITD-based feature extraction method is sensitive to phase noise at the receiver, whereas the LMS-based feature extraction method is robust to it. Therefore, there is no significant difference in the performance of MIWS and UWS when the LMS-based feature extraction method is applied. We also note that both MIWS and UWS enjoy a 10% accuracy gain when compared with ORS, thereby confirming the benefit of weighting when multiple received versions are configurated.

V-C Experimental results of DFS

Refer to caption

Figure 6: Classification accuracy of DFS based on LMS with M=5M=5, and χ=0.01\chi=0.01.

Fig. 6 shows the RFFI results of DFS, where the LMS-based feature extraction method is adopted with M=5M=5 and χ=0.01\chi=0.01 for all receiver antennas. As can be seen from this figure, the superiority of DFS over ORS becomes increasingly apparent as NN increases. Such phenomenon that DFS outperforms ORS in terms of RFFI accuracy demonstrates that DFS can effectively filter out channel noise and receiver distortions. Moreover, there are two noteworthy points: 1) when N=4N=4, DFS performs worse than MIWS, suggesting that MIWS is more appropriate when N4N\leq 4; 2) when SNR==0dB, the performance gain of DFS over ORS is not obvious, whereas when SNR>>15dB, such gain becomes more significant for different NNs, indicating that the level of the performance gain of DFS with respect to ORS is related to the SNR. These two observations are consistent with the statements in Section IV.

Refer to caption

Figure 7: Classification accuracy of DFS based on ITD with M=5M=5, and N=8N=8.

Refer to caption


Figure 8: Classification accuracy of DFS based on ITD with M=5M=5, and SNR=15dB.

Fig. 7 and Fig. 8 show the RFFI accuracy versus receiving phase noise when using the ITD-based RF feature extraction method. The former varies SNR with N=8N=8, and the latter varies NN with SNR=15=15dB. As seen from these two figures, the larger the χ\chi, the worse the RFFI accuracy of ORS. In contrast, DFS shows its stability and robustness under different χ\chi, which indicates that DFS filters out receiver phase noise effectively. Fig. 8 illustrates that the performance of DFS becomes better with the increasing number of receiving antennas, which remains consistent with the conclusion of Fig. 6.

V-D Experimental results of GDFWS

Refer to caption

Figure 9: Classification accuracy of GDFWS based on LMS with M=5M=5, and χ=0.01\chi=0.01.

Figure 9 provides the performance of BDFWS in comparison with DFS when the LMS-based RF feature extraction method is employed. The receiving antennas are evenly divided into four groups, and the other settings are consistent with those in Fig. 6. When SNR\geq10 dB and N=256N=256 or N=512N=512, GDFWS with weighted voting outperforms DFS. However, when SNR<<10 dB, performance saturation does not appear in DFS, thus its performance is comparable with that of GDFWS. Moreover, when N=128N=128, the overall performance of GDFWS is inferior to that of DFS, which suggests that GDFWS is unsuitable for scenarios where N128N\leq 128. Overall, the results presented in this figure demonstrate the effectiveness of GDFWS with weighted voting in scenarios where N>128N>128 and SNR\geq10 dB when compared with DFS, the finding of which is consistent with the theoretical analysis presented in Section IV.

VI Conclusion

This paper investigates three RFFI schemes to cater to the different numbers of receiving antennas. When the number is small, we propose MIWS that uses the weighted voting of intermediate classification results for RFFI. For a moderate quantity of receiving antennas, DFS is proposed to perform statistical averaging to filter out channel noise and receiver distortions. If a large amount of receiving antennas are available, GDFWS, which enjoys the advantages of both MIWS and DFS, is developed to solve the performance saturation problem in DFS and improve classification accuracy. We further study the impact of the number of receiving antennas on DFS performance, and provide guidelines on selecting appropriate schemes for different scenarios in the following aspects: 1) When the number of antennas is N4N\leq 4, MIWS is recommended. 2) When the number of antennas is 4<N1284<N\leq 128, DFS is the best choice. 3) The performance saturation in DFS occurs commonly when SNR is high. Hence, when N>128N>128 and SNR\geq10dB, GDFWS is preferable.

References

  • [1] D. C. Nguyen, M. Ding, P. N. Pathirana, A. Seneviratne, J. Li, D. Niyato, O. Dobre, and H. V. Poor, “6g internet of things: A comprehensive survey,” IEEE Internet of Things Journal, vol. 9, no. 1, pp. 359–383, 2022.
  • [2] F. Alshehri and G. Muhammad, “A comprehensive survey of the internet of things (iot) and ai-based smart healthcare,” IEEE Access, vol. 9, pp. 3660–3678, 2021.
  • [3] R. Yu, X. Zhang, and M. Zhang, “Smart home security analysis system based on the internet of things,” in 2021 IEEE 2nd International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering (ICBAIE), pp. 596–599, 2021.
  • [4] J. Kurmi and R. Matam, “Device identification in iot networks using network trace fingerprinting,” in 2022 International Conference on Smart Applications, Communications and Networking (SmartNets), pp. 1–6, 2022.
  • [5] I. Yaqoob, I. A. T. Hashem, A. Ahmed, S. A. Kazmi, and C. S. Hong, “Internet of things forensics: Recent advances, taxonomy, requirements, and open challenges,” Future Generation Computer Systems, vol. 92, pp. 265–275, 2019.
  • [6] T. Nandy, M. Y. I. Idris, R. M. Noor, A. W. A. Wahab, S. Bhattacharyya, R. Kolandaisamy, and M. Yahuza, “A secure, privacy-preserving, and lightweight authentication scheme for vanets,” IEEE Sensors Journal, vol. 21, no. 18, pp. 20998–21011, 2021.
  • [7] S. A. Jan, N. U. Amin, M. Othman, M. Ali, A. I. Umar, and A. Basir, “A survey on privacy-preserving authentication schemes in vanets: attacks, challenges and open issues,” IEEE Access, vol. 9, pp. 153701–153726, 2021.
  • [8] N. Xie, Z. Li, and H. Tan, “A survey of physical-layer authentication in wireless communications,” IEEE Communications Surveys & Tutorials, vol. 23, no. 1, pp. 282–310, 2021.
  • [9] J. Hall, M. Barbeau, E. Kranakis, et al., “Detection of transient in radio frequency fingerprinting using signal phase,” Wireless and optical communications, pp. 13–18, 2003.
  • [10] Y. Chen, X. Chen, and Y. Lei, “Emitter identification of digital modulation transmitter based on nonlinearity and modulation distortion of power amplifier,” Sensors, vol. 21, no. 13, p. 4362, 2021.
  • [11] W. Nie, Z.-C. Han, M. Zhou, L.-B. Xie, and Q. Jiang, “Uav detection and identification based on wifi signal and rf fingerprint,” IEEE Sensors Journal, vol. 21, no. 12, pp. 13540–13550, 2021.
  • [12] N. Soltanieh, Y. Norouzi, Y. Yang, and N. C. Karmakar, “A review of radio frequency fingerprinting techniques,” IEEE Journal of Radio Frequency Identification, vol. 4, no. 3, pp. 222–233, 2020.
  • [13] J. Toonstra and W. Kinsner, “Transient analysis and genetic algorithms for classification,” in IEEE WESCANEX 95. Communications, Power, and Computing. Conference Proceedings, vol. 2, pp. 432–437, 1995.
  • [14] Q. Li, Y. Jin, S. Yan, and S. Han, “Emitter identification based on improved variational modal decomposition at low snr,” in 2021 International Conference on Artificial Intelligence and Electromechanical Automation (AIEA), pp. 152–156, 2021.
  • [15] Y. Li, X. Chen, Y. Lin, G. Srivastava, and S. Liu, “Wireless transmitter identification based on device imperfections,” IEEE Access, vol. 8, pp. 59305–59314, 2020.
  • [16] M. Zeng, Z. Liu, Z. Wang, H. Liu, Y. Li, and H. Yang, “An adaptive specific emitter identification system for dynamic noise domain,” IEEE Internet of Things Journal, vol. 9, no. 24, pp. 25117–25135, 2022.
  • [17] L. Sun, X. Wang, Z. Huang, and B. Li, “Radio-frequency fingerprint extraction based on feature inhomogeneity,” IEEE Internet of Things Journal, vol. 9, no. 18, pp. 17292–17308, 2022.
  • [18] H. Yuan, Y. Yan, Z. Bao, C. Xu, J. Gu, and J. Wang, “Multipath canceled rf fingerprinting for wireless ofdm devices based on hammerstein system parameter separation,” IEEE Canadian Journal of Electrical and Computer Engineering, vol. 45, no. 4, pp. 401–408, 2022.
  • [19] M. Shi, Y. Huang, and G. Wang, “Carrier leakage estimation method for cross-receiver specific emitter identification,” IEEE Access, vol. 9, pp. 26301–26312, 2021.
  • [20] A. D’Andrea, V. Lottici, and R. Reggiannini, “RF power amplifier linearization through amplitude and phase predistortion,” IEEE Transactions on Communications, vol. 44, no. 11, pp. 1477–1484, 1996.
  • [21] B. He, F. Wang, Y. Liu, and S. Wang, “Specific emitter identification via multiple distorted receivers,” in 2019 IEEE International Conference on Communications Workshops (ICC Workshops), pp. 1–6, 2019.
  • [22] P. Zhang, Y. Shen, X. Jiang, and B. Wu, “Physical layer authentication jointly utilizing channel and phase noise in mimo systems,” IEEE Transactions on Communications, vol. 68, no. 4, pp. 2446–2458, 2020.
  • [23] Y. Huang and H. Zheng, “Theoretical performance analysis of radio frequency fingerprinting under receiver distortions,” Wireless Communications and Mobile Computing, vol. 15, no. 5, pp. 823–833, 2015.
  • [24] Y. Liu and P. Zhang, “Physical layer authentication utilizing carrier frequency offset in dynamic mimo systems,” in 2020 International Conference on Networking and Network Applications (NaNA), pp. 16–21, 2020.
  • [25] P. Zhang, J. Liu, Y. Shen, and X. Jiang, “Exploiting channel gain and phase noise for phy-layer authentication in massive mimo systems,” IEEE Transactions on Information Forensics and Security, vol. 16, pp. 4265–4279, 2021.
  • [26] M. R. Bell, Information theory and radar: Mutual information and the design and analysis of radar waveforms and systems. PhD thesis, California Institute of Technology, 1988.
  • [27] X. Wang, S. Ju, X. Zhang, S. Ramjee, and A. E. Gamal, “Efficient training of deep classifiers for wireless source identification using test snr estimates,” IEEE Wireless Communications Letters, vol. 9, no. 8, pp. 1314–1318, 2020.
  • [28] N. Alagha, “Cramer-rao bounds of snr estimates for bpsk and qpsk modulated signals,” IEEE Communications Letters, vol. 5, no. 1, pp. 10–12, 2001.
  • [29] J. Stahl and P. Mowlaee, “A simple and effective framework for a priori snr estimation,” in 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5644–5648, 2018.
  • [30] M. Ju, L. Xu, L. Jin, and D. Defeng Huang, “Data aided channel estimation for massive mimo with pilot contamination,” in 2017 IEEE International Conference on Communications (ICC), pp. 1–6, 2017.
  • [31] A. N. Uwaechia and N. M. Mahyuddin, “Spectrum-efficient distributed compressed sensing based channel estimation for ofdm systems over doubly selective channels,” IEEE Access, vol. 7, pp. 35072–35088, 2019.
  • [32] S. M. Ross, Introductory statistics. Academic Press, 2017.
  • [33] Y. Yang, A. Hu, Y. Xing, J. Yu, and Z. Zhang, “A data-independent radio frequency fingerprint extraction scheme,” IEEE Wireless Communications Letters, vol. 10, no. 11, pp. 2524–2527, 2021.