Patent Publication Number: US-11395140-B2

Title: Belief propagation-based physical layer blind authentication method and system for time-varying fading channels

Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
     This is a national stage application, filed under 37 U.S.C. 371, of International Patent application No. PCT/CN2017/116026, filed on Dec. 13, 2017. 
     TECHNICAL FIELD 
     The present disclosure relates to the field of wireless communication technologies, and in particular to a physical layer blind authentication method and system for a time-varying fading channel based on a belief propagation (BP) technique. 
     BACKGROUND 
     At present, three main physical layer authentication technologies exist. The first authentication technology is the Spread Spectrum Authentication method (Auth-SS). The basic idea is to use the traditional direct-sequence spread spectrum or frequency hopping technology. Since different pulses use different frequencies, this technology requires a certain amount of bandwidth to achieve authentication. In addition, a key limitation of the Auth-SS technology is that only users who understand prior knowledge of the spread spectrum technology are involved in the communication. Therefore, the scope of application of this technology is relatively narrow. 
     The second authentication technology is based on the Authentication with Time Division Multiplexing (Auth-TDM). The basic idea is that the transmitter periodically sends information signals and authentication signals alternately. After receiving a signal, the receiver directly extracts the desired authentication information to implement authentication of the signal. The Auth-TDM is an authentication technology proposed in the early development of wireless communication. The advantage is that it is easy to operate, and that authentication signals and information do not need to be pre-processed (encryption may be performed for security reasons) before signals are transmitted. The authentication signal is transmitted independently of the information signal, so the authentication signal needs to occupy a certain amount of bandwidth. With the increasing amount of wireless information, further improvement of information privacy for users and the continuous enhancement of attack technologies of the enemy, the security of this authentication technology is greatly challenged and cannot meet the requirements of users. 
     The third authentication technology is the Authentication with Superimposition (Auth-SUP). The basic idea is to superimpose the authentication signal on the information signal (the superimposition manner may be arbitrary and is determined by the key), and then the transmitter simultaneously transmits the authentication signal and the information signal, and after the receiver receives the signals, the authentication signal in the superimposed signals is extracted by using the key to achieve the purpose of signal authentication. 
     Compared with the early Auth-TDM technology, in the Auth-SUP authentication technology, the authentication signal and the information signal need to be processed before signal transmission, a certain signal processing capacity of the transmitter is required, which is more complicated to achieve than the Auth-TDM technology, and the authentication signal and the information signal are simultaneously sent, so that extra bandwidth is not occupied. At this time, since the authentication signal is superimposed in the information signal, the receiver needs to extract the information after receiving the signal, so the signal processing difficulty is higher than that of the Auth-TDM technology, but the concealment of the authentication information is higher than that of the Auth-TDM. In addition, since the authentication signal plays a role of noise for the extraction of the information signal, the signal-to-noise ratio (SNR) of the receiver is correspondingly reduced, which adversely affects the extraction of the information signal. 
     In the existing Auth-TDM and Auth-SUP authentication technologies, another pilot signal is further transmitted in addition to the information signal and the authentication signal since for the two authentication technologies, the receiver needs to estimate the channel parameters and recover the symbols after receiving the signals and then extracts the authentication signal, so that a certain signal processing capability of the receiver is also required. In some specific cases, these signal processing technologies may not be feasible and may easily cause estimation errors in the channel parameter estimation and symbol recovery processes, which may adversely affect the final extraction of the authentication signal. 
     In addition, the Auth-TDM, the Auth-SS, and the Auth-SUP expose the fact that authentication information is included. Auth-SS and Auth-TDM technologies are more likely to attract the attention of other users in the scenario, especially hostile users, compared with conventional signals that do not include authentication information. The hostile user analyzes, counterfeits or tampers with the signal, and the legitimate receiver cannot authenticate the expected signal. Relatively speaking, the concealment of the Auth-SUP authentication technology is significantly higher than that of Auth-SS and Auth-TDM. However, this superiority is based on the premise that the computing power of the hostile user is limited. Once the computing power of the hostile user is increased, it is also possible for the hostile user to extract or even destroy the authentication information. 
     It must be mentioned that the existing Auth-SS technology and Auth-SUP technology have severe performance degradation in the time-varying fading channel scenario. The reality is that as the number of wireless communication users continues to increase, the communication environment will become more complex and the possibility of interference will increase. As the number of urban communication users increases and the city continues to develop, the simple time invariant fading channel is not sufficient to characterize the current communication environment. Therefore, it is necessary to consider the wireless communication physical layer authentication technology based on the time-varying fading channel to improve the security of wireless communication and meet the communication security requirements of users. 
     SUMMARY 
     In view of the above, the present disclosure aims to provide a physical layer blind authentication method and system for a time-varying fading channel based on a belief propagation technique. In the method and system, extra signal bandwidth is not needed, the authentication signal does not become noise affecting the extraction of an information signal in a carrier signal, and the statistical characteristic of the noise at the receiver is not affected. 
     Thus, in a first aspect of the present disclosure, a physical layer blind authentication method for a time-varying fading channel based on belief propagation is provided, which is a physical layer authentication method for wireless communication of a wireless communication system having a transmitter and a receiver. The method includes: transmitting, by the transmitter, a carrier signal to a wireless channel, where the carrier signal includes an authentication signal, a pilot signal, and an information signal, the authentication signal is superimposed on the pilot signal, and the wireless channel is the time-varying fading channel; receiving, by the receiver, the carrier signal, and performing blind known interference cancellation (BKIC) processing and differential signal processing on the carrier signal to obtain a target authentication signal, where in the BKIC processing, the pilot signal is cancelled through a belief propagation technique by using a prior probability density function and a Tanner graph of a target signal; obtaining, by the receiver, a reference signal based on a key and the pilot signal, performing the differential signal processing on the reference signal to obtain a reference authentication signal, and calculating a correlation between the target authentication signal and the reference authentication signal to obtain a test statistic; and comparing the test statistic with a prescribed threshold to determine whether the carrier signal is capable of passing authentication. 
     In the present disclosure, the authentication signal is superimposed on the pilot signal. Thus, the Signal to Interference plus Noise Ratio at the receiver may not be affected. In the BKIC processing, the pilot signal is cancelled through the belief propagation technique by using the prior probability density function and the Tanner graph of the target signal. In this case, the pilot signal can be cancelled through the belief propagation technique without channel estimation. 
     In the physical layer blind authentication method provided in the first aspect of the present disclosure, the carrier signal is transmitted in blocks in a form of data blocks to facilitate operation of data. 
     In the physical layer blind authentication method provided in the first aspect of the present disclosure, in each carrier signal block, a sum of a length of a pilot signal and a length of an information signal is equal to a length of the each carrier signal block. 
     In addition, in the physical layer blind authentication method provided in the first aspect of the present disclosure, the reference signal is obtained based on the key and the pilot signal by using a hash matrix. Thus, the reference signal is processed to obtain the reference authentication signal and it can be determined whether the target authentication signal passes the authentication according to the correlation between the reference authentication signal and the target authentication signal. 
     In the physical layer blind authentication method provided in the first aspect of the present disclosure, if the test statistic is not less than the prescribed threshold, the carrier signal passes the authentication. 
     In the physical layer blind authentication method provided in the first aspect of the present disclosure, the prescribed threshold is obtained based on a statistical characteristic of the pilot signal and a preset upper limit of a false alarm probability. 
     In a second aspect of the present disclosure, a physical layer blind authentication device for a time-varying fading channel based on a belief propagation technique is provided. The device includes a processor and a memory. The processor is configured to execute a computer program stored in the memory to implement any physical layer blind authentication method described above. 
     In a third aspect of the present disclosure, a computer readable storage medium is provided and is configured to store at least one instruction which, when executed by a processor, implements any physical layer blind authentication method described above. 
     In a fourth aspect of the present disclosure, a physical layer blind authentication system for a time-varying fading channel based on belief propagation is provided. The system includes a transmitting device and a receiving device. The transmitting device is configured to transmit a carrier signal to a wireless channel, where the carrier signal includes an authentication signal, a pilot signal and an information signal, the authentication signal is superimposed on the pilot signal, and the wireless channel is the time-varying fading channel. The receiving device comprises: a first processing module, a second processing module, and a determining module. The first processing module is configured to receive the carrier signal and perform blind known interference cancellation (BKIC) processing and differential signal processing on the carrier signal to obtain a target authentication signal, where in the BKIC processing, the pilot signal is cancelled through a belief propagation technique by using a prior probability density function and a Tanner graph of a target signal. The second processing module is configured to obtain a reference signal based on a key and the pilot signal, perform the differential signal processing on the reference signal to obtain a reference authentication signal, and calculate a correlation between the target authentication signal and the reference authentication signal to obtain a test statistic. The determining module is configured to compare the test statistic with a prescribed threshold to determine whether the carrier signal is capable of passing authentication. 
     In the present disclosure, the transmitting device of the physical layer blind authentication system superimposes the authentication signal on the pilot signal. Thus, no extra transmitting bandwidth resource is occupied. The receiving device of the physical layer blind authentication system performs BKIC processing in which the pilot signal is cancelled through the belief propagation technique by using the prior probability density function and the Tanner graph of the target signal. In this case, the receiving device can cancel the pilot signal through the belief propagation technique without channel estimation. 
     In the physical layer blind authentication system provided in the fourth aspect of the present disclosure, the second processing module is configured to obtain the reference signal based on the key and the pilot signal using a hash matrix. Thus, the reference signal is processed to obtain the reference authentication signal and it can be determined whether the target authentication signal passes the authentication according to the correlation between the reference authentication signal and the target authentication signal. 
     In the physical layer blind authentication system provided in the fourth aspect of the present disclosure, in the determining module, the prescribed threshold is obtained based on a statistical characteristic of the pilot signal and a preset upper limit of a false alarm probability. 
     Compared with the existing art, the embodiments of the present disclosure have the following beneficial effects. 
     Compared with the existing Auth-SS, Auth-SUP, and Auth-TDM, the present disclosure requires no extra signal bandwidth to implement authentication of the physical layer of the wireless communication, the authentication signal does not become noise affecting extraction of the receiving signal, and the statistical characteristics of noise at the receiver is not affected. The blind authentication technology provided by the present disclosure deals with a time-varying fading channel, and is more applicable to complicated and variable wireless communication environment in the actual communication scenarios. In addition, since in the present disclosure, the authentication signal is superimposed on the pilot signal, if the entire signal obtained by superimposing the authentication signal and the pilot is used as a pilot signal, the accuracy of channel estimation can further be improved. 
    
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         FIG. 1  is a schematic diagram illustrating signal transmission of a physical layer blind authentication method according to an embodiment of the present disclosure. 
         FIG. 2  is a schematic flowchart of a physical layer blind authentication method according to an embodiment of the present disclosure. 
         FIG. 3  is a schematic structural diagram of a signal transmitted by a transmitter in a physical layer blind authentication method according to an embodiment of the present disclosure. 
         FIG. 4  is a schematic flowchart of a process of blind known interference cancellation (BKIC) processing at a receiver in a physical layer blind authentication method according to an embodiment of the present disclosure. 
         FIG. 5  is a schematic diagram illustrating signal processing modules of a transmitter in a physical layer blind authentication system according to an embodiment of the present disclosure. 
         FIG. 6  is a schematic diagram illustrating signal processing modules of a receiver in a physical layer blind authentication system according to an embodiment of the present disclosure. 
         FIG. 7  is a schematic structural diagram of a physical layer blind authentication device according to an embodiment of the present disclosure. 
     
    
    
     DETAILED DESCRIPTION 
     The preferred embodiments of the present disclosure will be described in detail below with reference to the drawings. In the following description, the same components are denoted by the same reference numerals, and the description thereof will not be repeated. In addition, the drawings are merely schematic and the ratio of the dimensions of the components to each other or the shapes of the components and the like may be different from the actual ones. 
     It should be noted that the terms “first”, “second”, “third”, “fourth” and the like in the description, claims and above drawings of the present disclosure are used to distinguish between different objects, and are not intended to describe a specific order. Furthermore, the terms “comprises” and “comprising” and any variant thereof are intended to cover a non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but optionally also includes steps or units not listed, or other steps or units optionally inherent to these processes, methods, products or devices. 
     The embodiments disclose a physical layer blind authentication method, device and system for a time-varying fading channel based on a belief propagation technique, which is a physical layer authentication method, device and system for wireless communication of a wireless communication system having a transmitter and a receiver. That is, the embodiments disclose a physical layer blind authentication method, device, and system for a wireless communication time-varying fading channel based on a belief propagation technique. The physical layer authentication can be performed more accurately. The details are described below in conjunction with the drawings. 
       FIG. 1  is a schematic diagram illustrating signal transmission of a physical layer blind authentication method according to an embodiment of the present disclosure. 
     In the present embodiment, as shown in  FIG. 1 , the physical layer blind authentication method of the wireless communication time-varying fading channel based on the belief propagation technique is based on a general signal transmission model. In this signal transmission model, four users are included, the sending party (transmitter) is a legitimate sending party, the transmitter transmits a signal to the legitimate receiving party (the receiver), and the other two receiving parties are a listening user and a hostile user in the system. Once the hostile user finds that authentication information may exist in the signal sent by the transmitter, the hostile user will analyze the signal, and attempt to extract, destroy, or even tamper with the authentication information. However, the embodiment is not limited thereto, two or more transmitters may exist, two or more legitimate receiving parties may exist, and two or more listening users and two or more hostile users may exist. 
     In the present embodiment, it is assumed that the transmitter and the receiver jointly have a key for authentication, so that the receiver can use the key to extract authentication information from the signal transmitted by the transmitter. The authentication signal includes authentication information. In the present embodiment, the carrier signal includes an authentication signal, and the conventional signal does not include an authentication signal. The listening user knows nothing about the authentication method. Although the listening user can accept and recover the signal sent by the transmitter, the listening user does not analyze the signal in depth and does not affect the authentication process. The hostile user can detect the existence of the authentication signal by analyzing the characteristics of the signal, and intends to destroy the authentication signal. 
     In the present embodiment, the transmitter in the above signal model may include a base station or a user equipment. The base station (e.g., an access point) may refer to a device in an access network that communicates with a wireless terminal over one or more sectors over an air interface. The base station may be used to convert the received air frame and the IP packet to each other and act as a router between the wireless terminal and the rest of the access network, where the rest of the access network may include an Internet Protocol (IP) network. The base station may also coordinate attribute management of the air interface. For example, the base station may be a Base Transceiver Station (BTS) in Global System for Mobile Communication (GSM) or Code Division Multiple Access (CDMA), or may be a base station (NodeB) in wideband CDMA (WCDMA), or may be an evolutional Node B (NodeB or eNB or e-NodeB) in Long-Term Evolution (LTE), which is not limited in the present embodiment. 
     The user equipment may include, but is not limited to, a smart phone, a notebook computer, a personal computer (PC), a personal digital assistant (PDA), a mobile Internet device (MID), a wearable device (such as a smart watch, a smart bracelet and smart glasses) and various types of electronic devices, where the operating system of the user equipment may include, but is not limited to, an Android operating system, an IOS operating system, a Symbian operating system, a Black Berry operating system, the Windows Phone 8 operating system and so on, which is not limited in the present embodiment. 
     In the present embodiment, the transmitter in the above signal model transmits a signal to the receiver through the wireless channel, where the receiver may include the base station. The base station (e.g., an access point) may refer to a device in an access network that communicates with a wireless terminal over one or more sectors over an air interface. The base station may be used to convert the received air frame and the IP packet to each other and act as a router between the wireless terminal and the rest of the access network, where the rest of the access network may include an Internet Protocol (IP) network. The base station may also coordinate attribute management of the air interface. For example, the base station may be a Base Transceiver Station (BTS) in GSM or CDMA, or may be a base station (NodeB) in WCDMA, or may be an evolutional Node B (NodeB or eNB or e-NodeB) in LTE, which is not limited in the present embodiment. 
     The receiver may further include a user equipment. The user equipment may include, but is not limited to, a smart phone, a notebook computer, a personal computer (PC), a personal digital assistant (PDA), a mobile Internet device (MID), a wearable device (such as a smart watch, a smart bracelet and smart glasses) and various types of electronic devices, where the operating system of the user equipment may include, but is not limited to, an Android operating system, an IOS operating system, a Symbian operating system, a Black Berry operating system, the Windows Phone 8 operating system and so on, which is not limited in the present embodiment. 
     The embodiments disclose a physical layer blind authentication method for a wireless communication time-varying fading channel based on a belief propagation technique.  FIG. 2  is a schematic flowchart of a physical layer blind authentication method according to an embodiment of the present disclosure.  FIG. 3  is a schematic structural diagram of a signal transmitted by a transmitter in a physical layer blind authentication method according to an embodiment of the present disclosure. 
     In the present embodiment, the physical layer blind authentication method of the wireless communication time-varying fading channel based on the belief propagation technique is a physical layer authentication method for wireless communication of the wireless communication system having the transmitter and the receiver. Based on the signal transmission model described above, as shown in  FIG. 2 , the transmitter transmits a carrier signal to the wireless channel. The carrier signal includes an authentication signal, a pilot signal, and an information signal. The authentication signal is superimposed on the pilot signal. The wireless channel is the time-varying fading channel (step S 101 ). 
     In step S 101 , as shown in  FIG. 3 , the carrier signal includes an authentication signal, a pilot signal, and an information signal, and the authentication signal is superimposed on the pilot signal. The signal length of the authentication signal is equal to the signal length of the pilot signal. Thus, the superimposition of the authentication signal onto the pilot signal avoids taking up extra signal bandwidth. 
     In the present embodiment, the information signal includes information to be transmitted by the user at the transmitter. The carrier signal transmitted by the transmitter is transmitted in blocks in the form of data blocks. Each of the carrier signal blocks includes a pilot portion and an information portion. The pilot portion includes an authentication signal and a pilot signal. The information portion includes an information signal. In addition, the carrier signal is transmitted in blocks in the form of data blocks, which facilitates manipulation of the data. 
     In the present embodiment, the signal length of the authentication signal or the pilot signal is the first length, the signal length of the information signal is the second length, the length of each carrier signal block is the total length, and the sum of the signal length of the authentication signal or the pilot signal and the signal length of the information signal is equal to the length of each carrier signal block, that is, the sum of the first length and the second length is equal to the total length. 
     In the present embodiment, the authentication signal is obtained through the pilot signal and the key, that is, the authentication signal is obtained through the pilot signal and the key using the hash matrix. The obtained authentication signal is superimposed on the pilot signal, and the pilot portion of each carrier signal block is obtained. The signal expression of the pilot portion is as follows:
 
 m   i =ρ s   p   i +ρ t   t   i   (1)
 
     In the above signal formula (1) of the pilot portion, ρ s   2  and ρ t   2  are respectively the power allocation factors of the pilot information and the authentication signal. Assuming that the authentication signal and the pilot signal are independent from each other, E{p i   H t i }=0 is obtained. 
     In the present embodiment, the signal of the pilot portion and the information signal of the information portion are combined to form each carrier signal block. 
     Further, in the present embodiment, the transmission channel of the carrier signal is a wireless channel and is a time-varying fading channel. The expression of a carrier signal that has passed through the time-varying fading channel is as follows:
 
 y   iL+k   =h   iL+k   x   iL+k   +n   iL+k   (2)
 
     In the present embodiment, the channel response h iL+k  of the time-varying fading channel follows a complex Gaussian distribution with a mean of zero and a variance of σ h   2 . In addition, dynamic characteristics of h iL+k  are characterized as a first-order Gauss Markov process, and the expression of the first-order Gauss Markov process is as follows:
 
 h   iL+k   =ah   iL+k−1   +w   iL+k   (3)
 
     In general, a∈[0,1] in formula (3) is a fading correlation coefficient, which is determined by the channel Doppler spread and the transmitting bandwidth. In particular, a small value of a indicates fast fading, and a large value of a indicates slow fading. In many types of scenarios, the value of a is available at the receiver. In the actual wireless system scenario, the value of a ranges in a very small interval, for example, a∈[0.9,1]. 
     In the present embodiment, the physical layer blind authentication method further includes that the receiver receives the carrier signal, and performs blind known interference cancellation (BKIC) processing and differential signal processing on the carrier signal to obtain a target authentication signal. In the BKIC processing, the pilot signal is cancelled through the belief propagation technique using a prior probability density function and a Tanner graph of a target signal (step S 102 ). 
     In the present embodiment, the receiver receives the carrier signal. The carrier signal includes a pilot portion and an information portion. The physical layer blind authentication method according to the present embodiment is mainly used for processing the pilot portion of the carrier signal at the receiver. The expression of the pilot portion of the carrier signal received at the receiver is as follows:
 
 y   k   =h   k (ρ s   p   k +ρ t   t   k )+ n   k   , iL≤k≤iL+L   1   (4)
 
     In the present embodiment, the following processing for the carrier signal refers to the processing for the pilot portion of the carrier signal. 
     In step S 102 , the receiver receives the carrier signal, and performs blind known interference cancellation (BKIC) processing on the carrier signal to obtain the target signal. The blind known interference cancellation (BKIC) processing is to use the prior probability density function and the Tanner graph of the target signal to cancel the pilot signal in the carrier signal through the belief propagation technique. Usually, the channel situation needs to be estimated for cancelling the pilot signal in the carrier signal. If the channel responds that effective estimation cannot be performed, the pilot signal in the carrier signal is difficult to cancel. With the blind known interference cancellation method, the pilot signal can be cancelled through a belief propagation technique while the estimation of the channel is avoided. 
     In the present embodiment, the carrier signal received by the receiver may or may not include the authentication signal. That the carrier signal includes the authentication information is set as a first condition, and that the carrier signal does not include the authentication signal is set as a second condition. 
       FIG. 4  is a schematic flowchart of a process of blind known interference cancellation (BKIC) processing at the receiver in the physical layer blind authentication method according to an embodiment of the present disclosure. 
     In the present embodiment, as shown in  FIG. 4 , the BKIC processing includes information initialization (step S 401 ), an information update of a check node (step S 402 ), an information update of a variable node (step S 403 ), and target data detection (step S 404 ). 
     In the present embodiment, the BKIC-processed carrier signal is a complex signal, that is, the carrier signal includes a real carrier signal and an imaginary carrier signal. The processing process of the real carrier signal is the same as the processing process of the imaginary carrier signal, and includes the above four steps. The following describes the processing process of the real carrier signal as an example. 
     In step S 401 , the prior probability density function of R{h k  ρ t t k +n k } is first initialized, and the channel information is unknown, but in general, the upper bound P max  of the signal power is taken as the maximum power of R{y k }. 
     It is assumed that R{h k p t t k } is evenly distributed over [−√{square root over (P max )},√{square root over (P max )}]. Since the noise is a Gaussian random variable, the signal based on the prior information will be expressed as 
     
       
         
           
             
               
                 
                   
                     m 
                     
                       R 
                       ⁢ 
                       
                         { 
                         
                           
                             
                               h 
                               k 
                             
                             ⁢ 
                             
                               ρ 
                               t 
                             
                             ⁢ 
                             
                               t 
                               k 
                             
                           
                           + 
                           
                             n 
                             k 
                           
                         
                         } 
                       
                     
                   
                   = 
                   
                     
                       1 
                       
                         2 
                         ⁢ 
                         
                           
                             
                               P 
                               max 
                             
                             ⁢ 
                             2 
                             ⁢ 
                             π 
                             ⁢ 
                             
                               σ 
                               n 
                               2 
                             
                           
                         
                       
                     
                     ⁢ 
                     
                       
                         ∫ 
                         
                           - 
                           
                             
                               P 
                               max 
                             
                           
                         
                         
                           
                             P 
                             max 
                           
                         
                       
                       ⁢ 
                       
                         
                           exp 
                           ⁡ 
                           
                             ( 
                             
                               
                                 - 
                                 
                                   
                                     ( 
                                     
                                       x 
                                       - 
                                       s 
                                     
                                     ) 
                                   
                                   2 
                                 
                               
                               
                                 2 
                                 ⁢ 
                                 
                                   σ 
                                   n 
                                   2 
                                 
                               
                             
                             ) 
                           
                         
                         ⁢ 
                         d 
                         ⁢ 
                         s 
                       
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
           
         
       
     
     The final estimation result can be obtained by iteratively updating the signal. The iterative process includes two parallel information update parts: One process is to update from top to bottom, i.e., k=1 to k=L 1 , 
               m   r       R   ⁢     {         h   k     ⁢     ρ   t     ⁢     t   k       +     n   k       }       t2b         
is updated first, then
 
               m   r       R   ⁢     {         h   k     ⁢     ρ   t     ⁢     t   k       +     n   k       }       t2b         
is used to update
 
               m   s       R   ⁢     {         h   k     ⁢     ρ   t     ⁢     t   k       +     n   k       }       t2b         
and then updated
 
               m   s       R   ⁢     {         h   k     ⁢     ρ   t     ⁢     t   k       +     n   k       }         t   ⁢           ⁢   2   ⁢   b           
is used to update
 
               m   r       R   ⁢     {         h   k     ⁢     ρ   t     ⁢     t   k       +     n   k       }         t   ⁢           ⁢   2   ⁢   b           
again. Similarly, another process is to update from bottom to top, i.e., to update
 
                 m   r       R   ⁢     {         h   k     ⁢     ρ   t     ⁢     t   k       +     n   k       }         b   ⁢           ⁢   2   ⁢   t       ⁢           ⁢   and   ⁢           ⁢       m   s       R   ⁢     {         h   k     ⁢     ρ   t     ⁢     t   k       +     n   k       }         b   ⁢           ⁢   2   ⁢   t             
from k=L 1  to k=1. These two types of information are respectively updated according to the variable-node update rule and the check-node update rule.
 
     In the present embodiment, the belief propagation technique does not include loops, so only one iteration is needed to obtain the optimal maximum posteriori performance. 
     In step S 402 , if a process of updating from top to bottom is considered, input information 
               m   r       R   ⁢     {         h   k     ⁢     ρ   t     ⁢     t   k       +     n   k       }         t   ⁢           ⁢   2   ⁢   b           
is given, and the output signal may be expressed as
 
     
       
         
           
             
               
                 
                   
                     
                       m 
                       s 
                     
                     
                       R 
                       ⁢ 
                       
                         { 
                         
                           
                             
                               h 
                               
                                 k 
                                 + 
                                 1 
                               
                             
                             ⁢ 
                             
                               ρ 
                               t 
                             
                             ⁢ 
                             
                               t 
                               
                                 k 
                                 + 
                                 1 
                               
                             
                           
                           + 
                           
                             n 
                             
                               k 
                               + 
                               1 
                             
                           
                         
                         } 
                       
                     
                     
                       t 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       2 
                       ⁢ 
                       b 
                     
                   
                   = 
                   
                     
                       
                         p 
                         
                           R 
                           ⁢ 
                           
                             { 
                             
                               
                                 
                                   h 
                                   
                                     k 
                                     + 
                                     1 
                                   
                                 
                                 ⁢ 
                                 
                                   ρ 
                                   t 
                                 
                                 ⁢ 
                                 
                                   t 
                                   
                                     k 
                                     + 
                                     1 
                                   
                                 
                               
                               + 
                               
                                 n 
                                 
                                   k 
                                   + 
                                   1 
                                 
                               
                             
                             } 
                           
                         
                       
                       ⁡ 
                       
                         ( 
                         x 
                         ) 
                       
                     
                     ∝ 
                     
                       
                         ∫ 
                         ω 
                       
                       ⁢ 
                       
                         
                           
                             p 
                             
                               R 
                               ⁢ 
                               
                                 { 
                                 
                                   
                                     
                                       h 
                                       k 
                                     
                                     ⁢ 
                                     
                                       ρ 
                                       t 
                                     
                                     ⁢ 
                                     
                                       t 
                                       k 
                                     
                                   
                                   + 
                                   
                                     n 
                                     k 
                                   
                                 
                                 } 
                               
                             
                           
                           ( 
                           
                             R 
                             ⁢ 
                             
                               { 
                               
                                 
                                   
                                     
                                       p 
                                       k 
                                     
                                     
                                       ap 
                                       
                                         k 
                                         + 
                                         1 
                                       
                                     
                                   
                                   ⁢ 
                                   y 
                                 
                                 + 
                                 
                                   b 
                                   k 
                                 
                                 + 
                                 
                                   
                                     
                                       ρ 
                                       s 
                                     
                                     ⁢ 
                                     
                                       p 
                                       k 
                                     
                                     ⁢ 
                                     s 
                                   
                                   a 
                                 
                               
                               } 
                             
                           
                           ) 
                         
                         ⁢ 
                         
                           exp 
                           ( 
                           
                             - 
                             
                               
                                 s 
                                 2 
                               
                               
                                 2 
                                 ⁢ 
                                 
                                   σ 
                                   ω 
                                   2 
                                 
                               
                             
                           
                           ) 
                         
                         ⁢ 
                         ds 
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
     Where σ   ω     2  may be set as the upper bound of the variance of the channel response. 
     If a process of updating from bottom to top is considered, similar to formula (6), the probability density function of R {h k p t t k +n k } may be expressed as follows: 
     
       
         
           
             
               
                 
                   
                     
                       m 
                       s 
                     
                     
                       R 
                       ⁢ 
                       
                         { 
                         
                           
                             
                               h 
                               k 
                             
                             ⁢ 
                             
                               ρ 
                               t 
                             
                             ⁢ 
                             
                               t 
                               k 
                             
                           
                           + 
                           
                             n 
                             k 
                           
                         
                         } 
                       
                     
                     
                       b 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       2 
                       ⁢ 
                       t 
                     
                   
                   = 
                   
                     
                       
                         p 
                         
                           R 
                           ⁢ 
                           
                             { 
                             
                               
                                 
                                   h 
                                   k 
                                 
                                 ⁢ 
                                 
                                   ρ 
                                   t 
                                 
                                 ⁢ 
                                 
                                   t 
                                   k 
                                 
                               
                               + 
                               
                                 n 
                                 k 
                               
                             
                             } 
                           
                         
                       
                       ⁡ 
                       
                         ( 
                         x 
                         ) 
                       
                     
                     ∝ 
                     
                       
                         ∫ 
                         ω 
                       
                       ⁢ 
                       
                         
                           
                             p 
                             
                               R 
                               ⁢ 
                               
                                 { 
                                 
                                   
                                     
                                       h 
                                       
                                         k 
                                         + 
                                         1 
                                       
                                     
                                     ⁢ 
                                     
                                       ρ 
                                       t 
                                     
                                     ⁢ 
                                     
                                       t 
                                       
                                         k 
                                         + 
                                         1 
                                       
                                     
                                   
                                   + 
                                   
                                     n 
                                     
                                       k 
                                       + 
                                       1 
                                     
                                   
                                 
                                 } 
                               
                             
                           
                           ( 
                           
                             R 
                             ⁢ 
                             
                               { 
                               
                                 
                                   
                                     
                                       ap 
                                       
                                         k 
                                         + 
                                         1 
                                       
                                     
                                     
                                       p 
                                       k 
                                     
                                   
                                   ⁢ 
                                   y 
                                 
                                 - 
                                 
                                   
                                     
                                       ap 
                                       
                                         k 
                                         + 
                                         1 
                                       
                                     
                                     
                                       p 
                                       k 
                                     
                                   
                                   ⁢ 
                                   
                                     b 
                                     k 
                                   
                                 
                                 - 
                                 
                                   
                                     ρ 
                                     s 
                                   
                                   ⁢ 
                                   
                                     p 
                                     
                                       k 
                                       + 
                                       1 
                                     
                                   
                                   ⁢ 
                                   s 
                                 
                               
                               } 
                             
                           
                           ) 
                         
                         ⁢ 
                         
                           exp 
                           ( 
                           
                             - 
                             
                               
                                 s 
                                 2 
                               
                               
                                 2 
                                 ⁢ 
                                 
                                   σ 
                                   ω 
                                   2 
                                 
                               
                             
                           
                           ) 
                         
                         ⁢ 
                         ds 
                       
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
     In step S 403 , for the variable node, the information update processes from top to bottom and from bottom to top are the same. The output of each piece of information in the variable node is updated based on the following expression: 
     
       
         
           
             
               
                 
                   
                     
                       m 
                       r 
                     
                     
                       R 
                       ⁢ 
                       
                         { 
                         
                           
                             
                               h 
                               k 
                             
                             ⁢ 
                             
                               ρ 
                               t 
                             
                             ⁢ 
                             
                               t 
                               k 
                             
                           
                           + 
                           
                             n 
                             k 
                           
                         
                         } 
                       
                     
                     
                       t 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       2 
                       ⁢ 
                       b 
                     
                   
                   = 
                   
                     
                       
                         p 
                         
                           R 
                           ⁢ 
                           
                             { 
                             
                               
                                 
                                   h 
                                   k 
                                 
                                 ⁢ 
                                 
                                   ρ 
                                   t 
                                 
                                 ⁢ 
                                 
                                   t 
                                   k 
                                 
                               
                               + 
                               
                                 n 
                                 k 
                               
                             
                             } 
                           
                         
                         
                           t 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           2 
                           ⁢ 
                           b 
                         
                       
                       ( 
                       
                         
                           x 
                           ⁢ 
                           
                             | 
                           
                           ⁢ 
                           
                             
                               m 
                               s 
                             
                             
                               R 
                               ⁢ 
                               
                                 { 
                                 
                                   
                                     
                                       h 
                                       k 
                                     
                                     ⁢ 
                                     
                                       ρ 
                                       t 
                                     
                                     ⁢ 
                                     
                                       t 
                                       k 
                                     
                                   
                                   + 
                                   
                                     n 
                                     k 
                                   
                                 
                                 } 
                               
                             
                             
                               t 
                               ⁢ 
                               
                                   
                               
                               ⁢ 
                               2 
                               ⁢ 
                               b 
                             
                           
                         
                         , 
                         
                           m 
                           
                             R 
                             ⁢ 
                             
                               { 
                               
                                 
                                   
                                     h 
                                     k 
                                   
                                   ⁢ 
                                   
                                     ρ 
                                     t 
                                   
                                   ⁢ 
                                   
                                     t 
                                     k 
                                   
                                 
                                 + 
                                 
                                   n 
                                   k 
                                 
                               
                               } 
                             
                           
                         
                       
                       ) 
                     
                     = 
                     
                       
                         1 
                         C 
                       
                       ⁢ 
                       
                         
                           m 
                           s 
                         
                         
                           R 
                           ⁢ 
                           
                             { 
                             
                               
                                 
                                   h 
                                   k 
                                 
                                 ⁢ 
                                 
                                   ρ 
                                   t 
                                 
                                 ⁢ 
                                 
                                   t 
                                   k 
                                 
                               
                               + 
                               
                                 n 
                                 k 
                               
                             
                             } 
                           
                         
                         
                           t 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           2 
                           ⁢ 
                           b 
                         
                       
                       ⁢ 
                       
                         m 
                         
                           R 
                           ⁢ 
                           
                             { 
                             
                               
                                 
                                   h 
                                   k 
                                 
                                 ⁢ 
                                 
                                   ρ 
                                   t 
                                 
                                 ⁢ 
                                 
                                   t 
                                   k 
                                 
                               
                               + 
                               
                                 n 
                                 k 
                               
                             
                             } 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
     Where C is the normalization factor. The variable node and the check node are determined through the Tanner graph. 
     In step S 404 , the final probability density function of R{h k ρ t t k +n k } may be expressed as follows. 
     
       
         
           
             
               
                 
                   
                     
                       p 
                       
                         R 
                         ⁢ 
                         
                           { 
                           
                             
                               
                                 h 
                                 k 
                               
                               ⁢ 
                               
                                 ρ 
                                 t 
                               
                               ⁢ 
                               
                                 t 
                                 k 
                               
                             
                             + 
                             
                               n 
                               k 
                             
                           
                           } 
                         
                       
                       
                           
                       
                     
                     ( 
                     
                       x 
                       ⁢ 
                       
                         | 
                       
                       ⁢ 
                       R 
                       ⁢ 
                       
                         { 
                         
                           b 
                           k 
                         
                         } 
                       
                     
                     ) 
                   
                   = 
                   
                     
                       1 
                       C 
                     
                     ⁢ 
                     
                       m 
                       
                         R 
                         ⁢ 
                         
                           { 
                           
                             
                               
                                 h 
                                 k 
                               
                               ⁢ 
                               
                                 ρ 
                                 t 
                               
                               ⁢ 
                               
                                 t 
                                 k 
                               
                             
                             + 
                             
                               n 
                               k 
                             
                           
                           } 
                         
                       
                     
                     ⁢ 
                     
                       
                         m 
                         s 
                       
                       
                         R 
                         ⁢ 
                         
                           { 
                           
                             
                               
                                 h 
                                 k 
                               
                               ⁢ 
                               
                                 ρ 
                                 t 
                               
                               ⁢ 
                               
                                 t 
                                 k 
                               
                             
                             + 
                             
                               n 
                               k 
                             
                           
                           } 
                         
                       
                       
                         t 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         2 
                         ⁢ 
                         b 
                       
                     
                     ⁢ 
                     
                       
                         m 
                         s 
                       
                       
                         R 
                         ⁢ 
                         
                           { 
                           
                             
                               
                                 h 
                                 k 
                               
                               ⁢ 
                               
                                 ρ 
                                 t 
                               
                               ⁢ 
                               
                                 t 
                                 k 
                               
                             
                             + 
                             
                               n 
                               k 
                             
                           
                           } 
                         
                       
                       
                         b 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         2 
                         ⁢ 
                         t 
                       
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
     Where C is the normalization factor. The estimated value of R{h k ρ t t k +n k } may be expressed as follows. 
     
       
         
           
             
               
                 
                   
                     R 
                     ⁢ 
                     
                       { 
                       
                         
                           
                             h 
                             k 
                           
                           ⁢ 
                           
                             ρ 
                             t 
                           
                           ⁢ 
                           
                             t 
                             k 
                           
                         
                         + 
                         
                           n 
                           k 
                         
                       
                       } 
                     
                   
                   = 
                   
                     
                       
                         arg 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         max 
                       
                       x 
                     
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       
                         p 
                         
                           R 
                           ⁢ 
                           
                             { 
                             
                               
                                 
                                   h 
                                   k 
                                 
                                 ⁢ 
                                 
                                   ρ 
                                   t 
                                 
                                 ⁢ 
                                 
                                   t 
                                   k 
                                 
                               
                               + 
                               
                                 n 
                                 k 
                               
                             
                             } 
                           
                         
                       
                       ⁡ 
                       
                         ( 
                         
                           x 
                           ⁢ 
                           
                             | 
                           
                           ⁢ 
                           R 
                           ⁢ 
                           
                             { 
                             
                               b 
                               k 
                             
                             } 
                           
                         
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
     Similarly, the imaginary carrier signal I{h k p t t k +n k } may be estimated by the above steps S 401  to S 404 . 
     Finally, the estimated value of the target signal is expressed as follows:
 
 z   k   =R{h   k   p   t   t   k   +n   k   }+jI{h   k ρ t   t   k   +n   k }  (11)
 
     In addition, in step S 102 , the carrier signal is subjected to BKIC processing to obtain a target signal, and the target signal is subjected to differential signal processing to obtain a target authentication signal. 
     In the present embodiment, the method of differential signal processing is as follows: 
     Under the first condition, the expression of differential signal processing is as follows: 
     
       
         
           
             
               
                 
                   
                     
                       
                         r 
                         k 
                       
                       ⁢ 
                       
                         | 
                       
                       ⁢ 
                       
                         H 
                         1 
                       
                     
                     = 
                     
                       
                         
                           1 
                           
                             ρ 
                             t 
                             2 
                           
                         
                         ⁢ 
                         
                           z 
                           k 
                         
                         ⁢ 
                         
                           z 
                           
                             k 
                             + 
                             1 
                           
                           * 
                         
                       
                       = 
                       
                         
                           a 
                           ⁢ 
                           
                             
                                
                               
                                 h 
                                 k 
                               
                                
                             
                             2 
                           
                           ⁢ 
                           
                             t 
                             k 
                           
                           ⁢ 
                           
                             t 
                             
                               k 
                               + 
                               1 
                             
                             * 
                           
                         
                         + 
                         
                           Δ 
                           k 
                         
                       
                     
                   
                   , 
                   
                     iL 
                     ≤ 
                     k 
                     ≤ 
                     
                       iL 
                       + 
                       
                         L 
                         1 
                       
                       - 
                       1 
                     
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
           
         
       
     
     Where Δ k  is the residual signal and may be approximately modeled as a Gaussian random variable with a mean of zero and a variance of σ Δ     k     2 . 
     Under the second condition, the expression of the differential signal processing is as follows: 
     
       
         
           
             
               
                 
                   
                     
                       r 
                       k 
                     
                     ⁢ 
                     
                       | 
                     
                     ⁢ 
                     
                       H 
                       0 
                     
                   
                   = 
                   
                     
                       
                         1 
                         
                           ρ 
                           t 
                           2 
                         
                       
                       ⁢ 
                       
                         ( 
                         
                           
                             n 
                             k 
                           
                           + 
                           
                             ɛ 
                             k 
                           
                         
                         ) 
                       
                       ⁢ 
                       
                         
                           ( 
                           
                             
                               n 
                               
                                 k 
                                 + 
                                 1 
                               
                             
                             + 
                             
                               ɛ 
                               
                                 k 
                                 + 
                                 1 
                               
                             
                           
                           ) 
                         
                         * 
                       
                     
                     = 
                     
                       ∇ 
                       k 
                     
                   
                 
               
               
                 
                   ( 
                   13 
                   ) 
                 
               
             
           
         
       
     
     Where ∇ k  is a zero-mean complex Gaussian random variable. 
     In the present embodiment, the physical layer blind authentication method further includes: obtaining, by the receiver, a reference signal based on the key and the pilot signal, performing differential signal processing on the reference signal to obtain a reference authentication signal, and calculating the correlation between the target authentication signal and the reference authentication signal to obtain a test statistic (step S 103 ). 
     In step S 103 , obtaining the reference signal based on the key and the pilot signal refers to obtaining the reference signal based on the key and the pilot signal using the hash matrix. Thereby, the reference signal is processed to obtain the reference authentication signal, and whether the target authentication signal passes the authentication can be determined according to the correlation between the reference authentication signal and the target authentication signal. 
     In step S 103 , the reference signal is subjected to differential signal processing to obtain the reference authentication signal, and the correlation between the target authentication signal and the reference authentication signal is calculated to obtain the test statistic, and the next determination may be performed according to the value of the test statistic. 
     In the present embodiment, the reference signal is subjected to differential signal processing to obtain the reference authentication signal. The method of differential signal processing is the same as the differential processing method in the above step S 102 . 
     In the above step S 102 , the carrier signal received by the receiver may include an authentication signal, and that the carrier signal includes the authentication information is set as a first condition, and that the carrier signal does not include the authentication signal is set as a second condition. 
     At the receiver, for the carrier signal, blind known interference cancellation (BKIC) processing and differential signal processing are performed on the carrier signal to obtain a target authentication signal. At the receiver, a reference signal is obtained based on the key and the pilot signal. The reference signal is subjected to differential (DP) signal processing to obtain a reference authentication signal. The rules for generating the reference signal by the hash matrix, the key and the pilot signal at the receiver are the same as the rules for generating the authentication signal by the hash matrix, the key and the pilot signal at the transmitter. The reference authentication signal may be regarded as the authentication signal under the first condition. The target authentication signal may be regarded as the carrier signal under the first condition. Thus, the first condition may be expressed as including the reference authentication signal in the target authentication signal; the second condition may be expressed as not including the reference authentication signal in the target authentication signal. 
     In the present embodiment, the physical layer blind authentication method further includes comparing the test statistic with a prescribed threshold to determine whether the carrier signal can pass the authentication (step S 104 ). 
     In step S 104 , if the test statistic is not less than the prescribed threshold, it is determined that the carrier signal passes the authentication; if the test statistic is less than the prescribed threshold, it is determined that the carrier signal has not passed the authentication. 
     In the present embodiment, if the test statistic is not less than the prescribed threshold, the carrier signal includes the reference authentication signal, that is, the carrier signal passes the authentication; if the test statistic is less than the prescribed threshold, the carrier signal does not include the reference authentication signal, that is, the carrier signal has not passed the authentication. 
     In addition, in the present embodiment, the prescribed threshold is obtained by assuming the verification condition, and the first condition and the second condition described above are the first condition H 1  and the second condition H 0  of the assumption verification condition, respectively. 
     In the present embodiment, under the first condition H 1 , the expression of the test statistic is as follows: 
     
       
         
           
             
               
                 
                   
                     
                       τ 
                       i 
                     
                     ⁢ 
                     
                       | 
                     
                     ⁢ 
                     
                       H 
                       1 
                     
                   
                   = 
                   
                     
                       
                         d 
                         i 
                         H 
                       
                       ⁢ 
                       
                         r 
                         i 
                       
                     
                     = 
                     
                       
                         a 
                         ⁢ 
                         
                           
                             ∑ 
                             
                               k 
                               = 
                               1 
                             
                             
                               
                                 L 
                                 1 
                               
                               - 
                               1 
                             
                           
                           ⁢ 
                           
                             
                                
                               
                                 
                                   h 
                                   
                                     iL 
                                     + 
                                     k 
                                   
                                 
                                 ⁢ 
                                 
                                   t 
                                   
                                     iL 
                                     + 
                                     k 
                                   
                                 
                                 ⁢ 
                                 
                                   t 
                                   
                                     iL 
                                     + 
                                     k 
                                     + 
                                     1 
                                   
                                 
                               
                                
                             
                             2 
                           
                         
                       
                       + 
                       
                         v 
                         i 
                       
                     
                   
                 
               
               
                 
                   ( 
                   14 
                   ) 
                 
               
             
           
         
       
     
     Under the second condition H 0 , the expression of the test statistic is as follows: 
     
       
         
           
             
               
                 
                   
                     
                       τ 
                       i 
                     
                     ⁢ 
                     
                       | 
                     
                     ⁢ 
                     
                       H 
                       0 
                     
                   
                   = 
                   
                     
                       ϕ 
                       i 
                     
                     = 
                     
                       
                         ∑ 
                         
                           k 
                           = 
                           1 
                         
                         
                           
                             L 
                             1 
                           
                           - 
                           1 
                         
                       
                       ⁢ 
                       
                         
                           t 
                           k 
                           * 
                         
                         ⁢ 
                         
                           t 
                           
                             k 
                             + 
                             1 
                           
                         
                         ⁢ 
                         
                           ∇ 
                           k 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   15 
                   ) 
                 
               
             
           
         
       
     
     Where 
               v   i     =       ∑     k   =   1         L   1     -   1       ⁢       t   k   *     ⁢     t     k   +   1       ⁢     Δ   k               
is a Gaussian random variable with a mean of zero and a variance of σ v     i     2 =(L 1 −1)σ Δ   2 σ p   4 . ϕ i  is a Gaussian random variable with a mean of zero and a variance of σ ϕ     i     2 =(L 1 −1)σ ∇   2 σ p   4 .
 
     In addition, the prescribed threshold τ i   0  is determined by the false alarm probability ε FA  associated with the (τ i |H 0 ) distribution, and is expressed as follows: 
     
       
         
           
             
               
                 
                   
                     τ 
                     i 
                     0 
                   
                   = 
                   
                     
                       arg 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         
                           min 
                           τ 
                         
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         
                           Φ 
                           ⁡ 
                           
                             ( 
                             
                               τ 
                               / 
                               
                                 σ 
                                 
                                   ϕ 
                                   i 
                                 
                               
                             
                             ) 
                           
                         
                       
                     
                     ≥ 
                     
                       1 
                       - 
                       
                         ɛ 
                         FA 
                       
                     
                   
                 
               
               
                 
                   ( 
                   16 
                   ) 
                 
               
             
           
         
       
     
     Where (τ i |H 0 ) is the test statistic obtained under the second condition, that is, the statistical characteristic of the pilot signal. Thus, the prescribed threshold may be obtained based on the statistical characteristic of the pilot signal and the preset upper limit of the false alarm probability. 
     In addition, in the present embodiment, if the identity of the transmitter is authenticated, the authentication signal may be used as an extra pilot signal to recover the signal. Thereby, the performance of signal symbol recovery and the estimation performance of the channel response can be improved. 
     In addition, in the present embodiment, the authentication signal is superimposed on the pilot signal, avoiding the adverse effect on the extraction of the conventional signal. Thereby, the signal to interference plus noise ratio (SINR) of the receiver is prevented from being reduced. 
     In the present embodiment, the physical layer blind authentication method of the wireless communication time-varying fading channel based on the belief propagation technique does not need to occupy extra signal bandwidth. In addition, at the receiver, when the information signal is extracted from the carrier signal, the authentication signal does not become the noise of the information signal, that is, the authentication signal does not affect the extraction of the information signal. The authentication signal does not affect the statistical characteristics of the noise at the receiver. 
     In the present embodiment, the physical layer blind authentication method deals with the time-varying fading channel, and is more suitable for a complex and variable wireless communication environment in an actual communication scenario. In addition, the authentication signal is superimposed on the pilot signal. If the entire signal obtained by superimposing the authentication signal and the pilot is used as the pilot signal for channel estimation, the accuracy of the channel estimation can further be improved. 
     The embodiments disclose a physical layer blind authentication system for a wireless communication time-varying fading channel based on a belief propagation technique.  FIG. 5  is a schematic diagram illustrating signal processing modules if a transmitter in a physical layer blind authentication system according to an embodiment of the present disclosure.  FIG. 6  is a schematic diagram illustrating signal processing modules of a receiver in a physical layer blind authentication system according to an embodiment of the present disclosure. 
     In the present embodiment, as shown in  FIG. 5 , the physical layer blind authentication system includes a transmitting device  20 . The transmitting device  20  includes a first generation module  201 , a second generation module  202 , and a synthesizing module  203 . 
     In the present embodiment, as shown in  FIG. 5 , the first generation module  201  generates an authentication signal, that is, the key and the pilot signal generate an authentication signal via the first generation module  201 . The first generation module  201  includes a hash matrix. The authentication signal is obtained based on the key and the pilot signal by using a hash matrix. The obtained authentication signal and the pilot signal have the same signal length. 
     In the present embodiment, as shown in  FIG. 5 , the second generation module  202  generates a pilot portion of a carrier signal. That is, the authentication signal is loaded onto the pilot signal by the second generation module  202  to generate the pilot portion of the carrier signal. The expression of the pilot portion of the carrier signal is formula (1). In addition, the length of the pilot portion of the carrier signal is the signal length of the authentication signal or the signal length of the pilot signal. 
     In the present embodiment, as shown in  FIG. 5 , the synthesizing module  203  generates a carrier signal, that is, the pilot portion and the information portion of the carrier signal are combined via the synthesizing module  203  to generate a carrier signal. The information portion of the carrier signal is an information signal. 
     In the present embodiment, the carrier signal is sent in blocks according to data blocks, each carrier signal block includes a pilot portion and an information portion, and the sum of the signal length of the authentication signal or the pilot signal and the signal length of the information signal is equal to the length of each carrier signal block. In addition, the carrier signal is transmitted in blocks in the form of data blocks to facilitate operation of the data. 
     In the present embodiment, the carrier signal generated by the transmitting device  20  at the transmitter reaches the receiving device  30  at the receiver via a wireless channel. In addition, the wireless channel is the time-varying fading channel. 
     In the present embodiment, the physical layer blind authentication system further includes a receiving device  30 , and the receiving device  30  includes a first processing module, a second processing module, and a determining module. 
     In the present embodiment, the first processing module includes a blind known interference cancellation (BKIC) module  301 . After the carrier signal passes through the blind known interference cancellation (BKIC) module  301 , the pilot signal in the carrier signal is cancelled through the belief propagation technique. 
     In the present embodiment, the blind known interference cancellation (BKIC) module  301  employs the BKIC processing method of cancelling the pilot signal through the belief propagation technique using the prior probability density function and the Tanner graph of the target signal in step S 102 . The specific steps are as shown in  FIG. 4 . The BKIC processing includes information initialization (step S 401 ), the information update of the check node (step S 402 ), the information update of the variable node (step S 403 ), and the target data detection (step S 404 ). 
     In the present embodiment, as shown in  FIG. 6 , the first processing module further includes a differential (DP) processing module  302 . The DP processing module  302  employs the differential signal processing method in step S 102 . The DP processing module  302  performs differential signal processing on the target signal to obtain a target authentication signal. Thereby, the effect of h k  in the target authentication signal is cancelled, i.e., the effect of the channel on the carrier signal is cancelled. 
     In the DP processing module  302 , under the first condition, the expression of the differential signal processing is formula (12), where Δ k  is the residual signal, which may be approximately modeled as a Gaussian random variable with a mean of zero and a variance of σ Δ     k     2 . Under the second condition, the expression of the differential signal processing is formula (13), where ∇ k  is a zero-mean complex Gaussian random variable. 
     In the present embodiment, as shown in  FIG. 6 , the second processing module further includes a hash matrix processing module  303 . A reference signal is obtained based on the pilot signal and the key via the hash matrix processing module  303 . The hash matrix processing module  303  employs the method of generating the reference signal in step S 103 , and the hash matrix processing module  303  includes a hash matrix. 
     In the present embodiment, as shown in  FIG. 6 , the second processing module further includes a differential (DP) processing module  304 . The differential (DP) processing module  304  performs differential signal processing on the reference signal to obtain a reference authentication signal. The DP processing module  304  employs the differential signal processing method in step S 103 . 
     In the present embodiment, as shown in  FIG. 6 , the second processing module further includes an operation module  305 . The operation module  305  is configured to calculate a test statistic of the target authentication signal and the reference authentication signal. The calculation method used by the operation module  305  is the calculation method in step S 103 . 
     In the present embodiment, as shown in  FIG. 6 , the determining module  306  determines whether the target authentication signal passes the authentication by comparing the test statistic with the prescribed threshold, that is, it is determined whether the carrier signal can pass the authentication. 
     In the present embodiment, the prescribed threshold in the determining module  306  is obtained based on the statistical characteristics of the pilot signal and the preset upper limit of the false alarm probability. The calculation method of the prescribed threshold is the threshold calculation method in step S 103 . 
     The embodiments disclose a physical layer blind authentication device  50  for a wireless communication time-varying fading channel based on a belief propagation technique.  FIG. 7  is a schematic structural diagram of a physical layer blind authentication device according to an embodiment of the present disclosure. In the present embodiment, both the transmitter and the receiver include the authentication device  50  as shown in  FIG. 7 . 
     In the present embodiment, as shown in  FIG. 7 , the authentication device  50  includes a processor  501  and a memory  502 . The processor  501  and the memory  502  are separately connected to the communication bus. The memory  502  may be a high speed random access memory (RAM) or a non-volatile memory. It will be understood by those skilled in the art that the structure of the authentication device  50  shown in  FIG. 7  does not constitute a limitation of the present disclosure. The structure may be a bus-shaped structure or a star-shaped structure, and may also include more or fewer components than those shown in  FIG. 7 , or a combination of some components, or a different arrangement of components. 
     The processor  501  is a control center of the authentication device  50 , and may be a central processing unit (CPU). The processor  501  connects various parts of the entire authentication device  50  by using various interfaces and lines, and runs or executes software programs and/or modules stored in the memory  502  as well as calls program codes stored in the memory  502  to perform the following operations. 
     The transmitter transmits a carrier signal to a wireless channel, where the carrier signal includes an authentication signal, a pilot signal and an information signal, the authentication signal is superimposed on the pilot signal, and the wireless channel is the time-varying fading channel (performed by the authentication device  50  at the transmitter). 
     The receiver receives the carrier signal, and performs blind known interference cancellation (BKIC) processing and differential signal processing on the carrier signal to obtain a target authentication signal, where in the BKIC processing, a pilot signal is cancelled through a belief propagation technique by using the prior probability density function and the Tanner graph of the target signal, the receiver obtains a reference signal based on the key and the pilot signal, performs differential signal processing on the reference signal to obtain a reference authentication signal, and calculates a correlation between the target authentication signal and the reference authentication signal to obtain a test statistic; and the test statistic is compared with a prescribed threshold to determine whether the carrier signal can pass authentication (performed by the authentication device  50  at the receiver). 
     In the present embodiment, the processor  501  of the authentication device  50  at the transmitter further performs the following operation: the carrier signal is transmitted in blocks in the form of data blocks. 
     In the present embodiment, the processor  501  of the authentication device  50  at the transmitter further performs the following operation: in each carrier signal, the sum of the signal length of the pilot signal and the signal length of the information signal is equal to the signal length of the carrier signal. 
     In the present embodiment, the processor  501  of the authentication device  50  at the receiver further performs the following operation: a reference signal is obtained based on the key and the pilot signal using a hash matrix. 
     In the present embodiment, the processor  501  of the authentication device  50  at the receiver further performs the following operation: if the test statistic is not less than a prescribed threshold, the carrier signal passes the authentication. 
     In the present embodiment, the processor  501  of the authentication device  50  at the receiver further performs the following operation: the prescribed threshold is obtained based on the statistical characteristic of the pilot signal and the preset upper limit of the false alarm probability. 
     In the embodiments, it should be understood that the disclosed device may be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division, and another division manner may be provided in actual implementation. For example, multiple units or components may be combined or integrated into another system, or some features may be omitted or not implemented. In addition, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interfaces, devices or units, and may be electrical or the like. 
     The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of an embodiment. 
     In addition, each functional unit in each embodiment may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above integrated unit may be implemented in the form of hardware or in the form of a software functional unit. 
     The integrated unit, if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable memory. Based on such understanding, the technical solution of the present disclosure or the part contributing to the existing art or all or part of the technical solution may be embodied in the form of a software product. The computer software product is stored in a memory and includes several instructions for causing a computer device (which may be a personal computer, server or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present disclosure. The foregoing memory includes: a USB flash disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk, and the like, which may store program codes. 
     The embodiments disclose a computer readable storage medium. One of ordinary skill in the art will appreciate that all or part of the various steps of the above-described embodiments may be accomplished by a program (instruction) instructing the associated hardware. The program (instruction) may be stored in a computer readable memory (storage medium), and the memory may include: a flash disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or a CD, etc. 
     Although the present disclosure is described in detail in conjunction with the drawings and embodiments, it should be understood that the above description is not intended to limit the present disclosure in any form. Those skilled in the art may make variations and changes without departing from the spirit and scope of the present disclosure, and such variations and changes fall within the scope of the present disclosure.