CN105634634A - Asynchronous channel perception method with unknown timing - Google Patents

Asynchronous channel perception method with unknown timing Download PDF

Info

Publication number
CN105634634A
CN105634634A CN201610063925.XA CN201610063925A CN105634634A CN 105634634 A CN105634634 A CN 105634634A CN 201610063925 A CN201610063925 A CN 201610063925A CN 105634634 A CN105634634 A CN 105634634A
Authority
CN
China
Prior art keywords
value
moment
time difference
particle
perception
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201610063925.XA
Other languages
Chinese (zh)
Other versions
CN105634634B (en
Inventor
李斌
余盼
赵成林
许方敏
章扬
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201610063925.XA priority Critical patent/CN105634634B/en
Publication of CN105634634A publication Critical patent/CN105634634A/en
Application granted granted Critical
Publication of CN105634634B publication Critical patent/CN105634634B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B17/00Monitoring; Testing
    • H04B17/30Monitoring; Testing of propagation channels
    • H04B17/382Monitoring; Testing of propagation channels for resource allocation, admission control or handover

Landscapes

  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses an asynchronous channel perception method with unknown timing. The asynchronous channel sensing method specifically comprises the following steps: a first step, predicating an existence probability and a perception time difference of a certain PU at a k moment; a second step, updating the existence probability predicted value and the perception time difference via an observation value; a third step, comparing the updated existence probability predicted value with a decision threshold to obtain a state value of the PU; a fourth step, calculating the perception time difference of the PU at the k moment according to the state value; a fifth step, calculating a state value and a weight of a born particle at the k moment according to the perception time difference at a k-1 moment; and a sixth step, judging whether the k moment is the last moment, if so, recording and storing the perception time differences and state values of all moments; and otherwise, iteratively predicting the existence probability and the perception time difference of the PU at a k+1 moment through a particle set at the k moment. The asynchronous channel perception method has the advantages of being suitable for the dynamic spectrum sharing of a heterogeneous wireless network, avoiding the frequent signaling interaction between the PU and SU, reducing the configuration complexity of a CR system and saving the time and the energy cost.

Description

Asynchronous channel sensing method with unknown timing
Technical Field
The invention belongs to the field of communication, and particularly relates to an asynchronous channel sensing method with unknown timing.
Background
With the rapid development of wireless communication, spectrum has become extremely scarce as an unrecoverable resource; in order to solve the problem, Cognitive Radio (CR) technology has been widely focused and studied. The cognitive radio technology aims to repeatedly utilize and share frequency spectrum resources from multiple dimensions of time, space, frequency and the like on the premise of not influencing the normal work of authorized users (PUs).
Since cognitive radio users (SUs) cannot interfere with authorized users, spectrum sensing becomes a first prerequisite in the CR technology; spectrum sensing refers to that an SU acquires occupation information of a specific frequency band through signal detection and processing.
Classical spectrum sensing techniques include: energy Detection (ED), Matched Filter Detection (MFD), and cyclostationary feature detection (CD), in addition to the above-mentioned conventional detection methods, detection methods such as wavelet analysis, compressed sensing, and covariance matrix have been developed in recent years. It is noted that the existing spectrum sensing schemes assume synchronization between the SU sensing time and the PU transmission time.
In many practical applications, such as when LTE-U or other heterogeneous networks perform LBT operations, due to the difficulty in achieving cooperative timing between SU and PU, only channel noise is contained in some sensing time slots of SU, and PU signals are contained in other sensing time slots, resulting in mutual deviation between PU transmission time and SU sensing time.
The unknown sensing time difference can significantly affect the statistical characteristics of SU received signals, and particularly for a system sensitive to synchronous timing information, the spectrum sensing performance of the system can be seriously deteriorated, so that the actual performance of the existing spectrum sensing algorithm is seriously deteriorated, and the actual application requirements are difficult to meet.
Disclosure of Invention
The invention provides an asynchronous channel sensing method with unknown timing, which aims at the problem that in a heterogeneous network, the cooperation timing between an authorized user and a cognitive user can not be carried out usually, so that the sensing time difference exists between an authorized user transmitter and a cognitive user receiver;
the method comprises the following specific steps:
step one, aiming at a certain authorized user PU distributed with spectrum resources, predicting the existence probability q of the PU at the kth momentk|k-1And a perceived time difference;
q is used as a prediction value of the existence probability of PU at the k momentk|k-1Expressed, the formula is as follows:
qk|k-1=pb×(1-qk-1|k-1)+ps×qk-1|k-1
wherein q isk-1|k-1The existence probability of the PU at the k-1 moment is obtained; p is a radical ofbThe birth probability is that the authorized user is in an idle state at the k-1 moment and jumps to a working state at the k moment; p is a radical ofsThe survival probability is that the authorized user is in the working state at the k-1 th moment and the k-th moment is also in the working state.
PU perception time difference t at k-th momentkApproximating with a set of discrete particle values, the particles are divided into two parts: particles that are always present and birth particles.
Aiming at the perception time difference of the PU at the kth moment, the predicted value t of the particlek|k-1The device comprises two parts: predicted value t of sensing time difference particle state valuek|k-1 (i)And the predicted value of the particle weightk|k-1 (i)
Firstly, the predicted value t of the perceived time difference particle state value of the PU at the kth momentk|k-1 (i)Generating according to the importance function:
tk|k-1 (i)~πt(tk|k-1 (i)|tk-1|k-1 (i))
wherein, i is 1,2., N + B; t is tk-1|k-1 (i)Is the state value of the perception time difference corresponding to the ith particle at the moment of k-1, pit(tk|k-1 (i)|tk-1|k-1 (i)) A transition probability distribution that is a perceptual time difference;
then, the predicted value of the weight of the sensing time difference particlesk|k-1 (i)The device comprises two parts: the predicted value of the existing particle weight and the predicted value of the birth particle weight;
ϵ k | k - 1 ( i ) = p s · q k - 1 | k - 1 q k | k - 1 · ϵ k - 1 | k - 1 ( i ) ; i = 1 , 2 , ... , N p b · ( 1 - q k - 1 | k - 1 ) q k | k - 1 · 1 B ; i = N + 1 , N + 2 , ... , N + B
1,2, N; n represents the number of particles that are always present; i ═ N +1, N +2,. and N + B; b represents the number of the birth particles.
Step two, the observation value z received by the PU at the k-th momentkCalculating an updated value q of the presence probability prediction valuek|kAnd an update value of the perception time difference prediction value;
step 201, calculating an updated value q of the predicted value of the existence probability of the PU at the k-th momentk|k
The formula is as follows:
q k | k = I k · q k | k - 1 1 - q k | k - 1 + I k · q k | k - 1
Ikrepresenting the likelihood ratio of the PU;
the function of the likelihood is represented by,indicating that the authorized user PU does not exist; y isk={tk|k-1 (i)Denotes that the authorized user PU is present;
μ0and mu1Is the mean value of the likelihood function; mu.s0=Mσu 2;μ1=Mσu 2+(M-tk|k-1 (i))·α2;σ0 2And σ1 2Is the variance; sigma0 2=2Mσu 4;σ1 2=2Mσu 4+4(M-tk|k-1 (i)2·σu 2(ii) a M represents the sampling times of each perception moment; sigmau 2Indicating the channel noise variance α is the channel fading factor.
Step 202, calculating the updated value of the particle weight of the PU sensing time difference at the kth moment by using the likelihood function as a number1 k|k (i)(ii) a The formula is as follows:
i=1,2...N+B;
step 203, updating the particle weight1 k|k (i)Normalization is carried out to obtain a normalized updated valuek|k (i)
ϵ k | k ( i ) = ϵ ′ k | k ( i ) / Σ i = 1 N + B ϵ ′ k | k ( i )
i=1,2...N+B;
Update value of particle weight'k|k (i)Normalization was performed to include particles that were always present and particles that were born.
Step 204, selecting the existing particle weight values to normalizeUpdated value after changek|k (i)Resampling the predicted value of the particle state value to obtain an updated value t of the predicted value of the particle state value of the perception time differencek|k (i)
Normalizing the updated value of each always existing particle weightk|k (i)N, ═ 1,2.. N; with randomly generated n(i)In contrast, n(i)∈[0,1]If, ifk|k (i)≥n(i)Then, the state value of the particle is saved, let tk|k (i)=tk|k-1 (i)(ii) a Otherwise, let tk|k (i)Equal to the last particle state value saved.
Step 205, normalizing the updated value of each always existing particle weightk|k (i)Reset to
The set of particles that always exist after resampling is tk|k (i),k|k (i)Therein ofi=1,2...N。
Step three, updating the value q of the existence probability predicted value obtained in the step twok|kComparing with the judgment threshold gamma to obtain the state value of the current authorized user PU
The decision threshold gamma is selected as the median of the existing probabilities of the PU.
The calculation is as follows:
x ^ k = 0 , q k | k < &gamma; 1 , q k | k &GreaterEqual; &gamma;
when updating the value qk|kWhen the value is less than the judgment threshold gamma, the state value of the PU of the authorized userIs 0; otherwise, authorizing the state value of the user PUIs 1.
Step four, calculating the perception time difference of the current authorized user PU at the moment k according to the state value of the current authorized user PU
When in useTime, observed value zkTherein is onlyObserving the noise by using the difference in perceived time at time k-1 as the difference in perceived time at time k, i.e.
When in useThen, the PU is used for sensing the updated value of the time difference particle at the k moment, and the sensing time difference value at the k moment is calculatedNamely:
t ^ k = &Sigma; i = 1 N t k | k ( i ) &epsiv; k | k ( i )
step five, according to the perception time difference of the k-1 momentCalculating the state value t of the birth particle at the moment kk|k (i)And normalizing the updated value of each birth particle weightk|k (i)Reset to
t k | k ( i ) ~ &pi; t ( t k | k ( i ) | t ^ k - 1 ) ;
i=N+1,N+2,...,N+B。
The updated value after each birth particle weight value is normalizedk|k (i)Reset to
&epsiv; k | k ( i ) = 1 B
i=N+1,N+2,...,N+B;
The state value t of the birth particle at the moment kk|k (i)Sum weightk|k (i)The following were used:
t k | k ( i ) ~ &pi; t ( t k | k ( i ) | t ^ k - 1 ) &epsiv; k | k ( i ) = 1 B
i=N+1,N+2,...,N+B。
step six, judging whether the moment k is the last moment, if so, recording and storing the perception time difference of all the momentsAnd the status value of the authorized user PUOtherwise, entering the step seven;
step seven, repeating the step one, and using the particle set { t at the moment k obtained in the step two and the step fivek|k (i),k|k (i)N + B, iteratively predicting the existence probability and the perception time difference of the PU at the k +1 th moment.
The invention has the advantages that:
1) the asynchronous channel sensing method with unknown timing is suitable for spectrum sensing under the situation that dynamic unknown time offset exists between authorized users and cognitive users, is particularly suitable for heterogeneous wireless network dynamic spectrum sharing, avoids complicated signaling interaction between a PU and an SU, reduces the configuration complexity of a CR system, effectively saves time and energy expenses, and improves the CR realizability to the maximum extent.
2) The asynchronous channel perception method with unknown timing takes accumulated energy as system observability, and the energy observability which can be realized at low complexity is easy for system integration and design; meanwhile, the device has good expansibility, and other observed quantities can be conveniently taken into the device;
3) the asynchronous channel sensing method with unknown timing carries out joint estimation aiming at the state of an authorized user and unknown time deviation, and can effectively eliminate the information uncertainty of a received signal by estimating and tracking the sensing time difference of dynamic change, thereby obviously improving the spectrum sensing performance and having positive theoretical and practical significance for the dynamic spectrum sharing of a future wireless network.
4) The asynchronous channel sensing method with unknown timing can realize maximum posterior probability and maximum likelihood, and the prior art can not estimate unknown timing deviation by utilizing related likelihood distribution when a PU signal does not exist; when the timing deviation changes, the statistical characteristics of the receiving channel cannot be determined, and the spectrum detection is difficult to realize; in contrast, the method is based on Bayesian statistical reasoning and random finite set, and can solve the problems of mixed detection and estimation.
5) The asynchronous channel sensing method with unknown timing fully utilizes prior transition probability information of the working state of an authorized user, effectively overcomes the non-stable and non-Gaussian characteristics presented by an observation signal (accumulated energy) by adopting the edge particle filtering technology, and avoids the problem of overhigh calculation complexity when the traditional estimation scheme deals with high-dimensional detection.
Drawings
Fig. 1 is a block diagram of a signal processing apparatus at a spectrum sensing receiving end.
FIG. 2 is a diagram illustrating a prediction process of the existence probability at the kth time;
FIG. 3 is a flow chart of a method for asynchronous channel sensing with unknown timing;
FIG. 4 is a flow chart of a method of updating the presence probability prediction value and the perception time difference prediction value of the present invention;
fig. 5 shows the spectrum sensing detection accuracy of the new method under different sensing time difference ranges.
Fig. 6 shows relative errors of estimated perceptual time differences for different perceptual time difference ranges.
Fig. 7 is a graph comparing the performance of the new method spectrum sensing with the performance of the conventional ED.
Detailed Description
The present invention will be described in further detail below with reference to the accompanying drawings.
The invention provides a novel spectrum detection method and a novel spectrum detection device aiming at the spectrum detection problem under the asynchronous sensing scene of unknown time offset, and realizes the joint estimation of the authorized user state and the unknown sensing time deviation. The invention provides a unified dynamic state space model based on a Bayesian statistical estimation theory, provides an iterative estimation scheme based on a maximum posterior probability criterion and a Bernoulli random finite set by utilizing a random finite set, and obtains related complex distribution in a numerical approximation mode through particle filtering by utilizing an importance sampling principle. By accurately acquiring the sensing time difference, mixed spectrum sensing and unknown time offset estimation are realized. The invention can effectively eliminate the information uncertainty of the received signal, thereby obviously improving the spectrum sensing performance, and can be applied to further improve the spectrum efficiency in a future wireless communication network.
As shown in fig. 1, an asynchronous channel sensing apparatus with unknown timing comprises two modules: the device comprises a PU state estimation module and a perception time difference estimation module; the PU state estimation module is simultaneously connected with the antenna and the perception time difference estimation module.
And at a receiving end, joint estimation is realized by utilizing a PU state estimation module and a perception time difference estimation module.
A PU state estimation module: and sequentially updating and estimating the posterior probability of the working state of the authorized user by utilizing a Particle Filtering (PF) technology according to the observation signal of the receiving terminal at the current moment and the output value of the last moment perception time difference estimation module.
A perceptual time difference estimation module: and carrying out iterative estimation on the related state, namely the perception time difference when the PU signal exists by utilizing the thought of a random finite set according to the observation signal of the receiving end at the current moment and the output value of the master user state estimation module at the current moment.
The PU state estimation module receives a signal sent by the PU through the SU receiver, judges whether the PU uses the frequency spectrum resource at the moment in a mode of energy detection by considering the predicted sensing time difference obtained by the sensing time difference module, and transmits the result obtained by judgment to the sensing time difference estimation module.
The perception time difference estimation module judges whether the perception time difference needs to be estimated according to the PU state judgment result obtained by the last module. If the PU exists at a certain moment (namely the PU uses the frequency spectrum resources), the sensing time difference estimation module works, and the sensing time difference at the moment is estimated by the sensing time difference estimation module; if the PU does not exist at a certain moment (i.e. the PU is not using the spectrum resource), the sensing time difference estimation module does not work, and the estimation value of the sensing time difference is equal to the last moment. And obtaining a predicted value of the perception time difference at the next moment according to the currently estimated perception time difference, and transmitting the predicted value to the PU state estimation module for the next iteration.
An asynchronous channel sensing method with unknown timing comprises the steps of firstly, establishing a spectrum sensing dynamic state space detection model, taking the sensing time difference between the state of an unknown authorized user and dynamic change as two hidden states to be estimated, and taking the energy cumulant easy to integrate as the observable of a system.
The established spectrum sensing dynamic state space model is as follows:
xk=H(xk-1)(1)
tk=T(tk-1)(2)
zk=G(xk,tk,uk,m)(3)
where equations (1) and (2) are referred to as state equations, and equation (3) represents a measurement equation.
xkTransferring the state value of the authorized user PU at the kth moment according to a prior state transfer function H (-), wherein two hypothesis tests exist in the spectrum sensing, namely the existence of an authorized user signal and the existence of an authorized user signal are respectively detected by using H0And H1And (4) showing. When the authorized user signal is absent, i.e. the authorized band is idle, xk0; when there is an authorized user signal, the obtained xk=1。
tkAnd transferring the perception time difference of the authorized user transmitter and the cognitive user receiver at the kth moment according to a prior state transfer function T (-).
The observation signal is obtained by a conventional energy detection method, namely zkThe value of the sum of the energies of the sampled signals within the observation time window of a certain length is calculated as follows:
z k = &Sigma; m = 1 M u k , m 2 , H 0 &Sigma; m = 1 t k u k , m 2 + &Sigma; m = t k + 1 M ( s k , m &times; x k + u k , m ) 2 , H 1 - - - ( 4 )
wherein M is the number of sampling points in each sensing period Ts, M is Ts × fs, fs is the sampling frequency, u is the sampling frequencyk,mThe m-th sampling value of the channel noise at the time k is subjected to mean value of 0 and variance of sigmau 2(ii) a gaussian distribution of; suppose that a user is authorized to operate in a state x within a sensing periodkIs not changed, and sk,mSignals are sent on behalf of the PU, and without loss of generality, the PU can be assumed to adopt BPSK modulation signals, i.e. sk,m∈ { -1, +1}, it should be noted that the method of the present invention can be extended to any complex modulated signal.
For convenience of explanation, z is used0:k={z0,z1,...,zkDenotes the observed value sequence from time 0 to time k. Estimation based on MAP criteria
{ x ^ k , t ^ k } = arg max p ( x k , t k | z 0 : k )
Wherein,the transition is made according to a hypothetical first order Markov chain, with a prior distribution of p (x) at a known initial state0) And p (t)0) In the case of (2), the estimated value is obtained by two steps of prediction and update according to the MAP criterion.
In order to approximate the complex distribution in the estimation process, a particle filtering technique based on sequential importance sampling is used. Particle Filter (PF) is based on Monte Carlo importance sampling thought, and integral operation is converted into particle summation operation, and along with the increase of the number of particles, the probability density function of the particles gradually approaches to the required posterior probability density function, so that the Bayesian estimation effect is achieved. In a specific implementation, particle filtering employs a set of filters with weights ω(i)Of discrete particles x(i)To approximate a complex a posteriori distribution p (x), i.e.: p (x) ═ Σiω(i)(x-x(i)). Wherein the discrete particles x(i)And its weight omega(i)Sequential updates are made with new observations. The particle filtering mainly comprises the following 5 steps: (a) initializing particles; (b) sampling the order importance; (c) updating the weight value of the particle according to the new observed value; (d) resampling is carried out; (e) an estimate of the state is obtained based on the particles and the corresponding weights.
Based on the dynamic state space system, the invention designs and provides an iterative estimation algorithm based on the maximum posterior probability by utilizing Bayesian statistical inference and Bernoulli random finite set, and can carry out joint estimation on the state of an unknown authorized user and the dynamic perception time difference; finally, in order to further reduce the algorithm complexity, the importance sampling principle and the particle filtering are utilized, the involved complex distribution is approximated in a numerical mode, and the mixed spectrum sensing and unknown time offset estimation is realized.
As shown in fig. 3, the specific steps are as follows:
step one, aiming at a certain authorized user PU distributed with spectrum resources, predicting the existence probability q of the PU at the kth momentk|k-1And a perceived time difference;
the predicted value of the existence probability of the PU at the kth moment consists of two parts, namely qk|k-1Expressed, as shown in FIG. 2, the formula is as follows:
qk|k-1=pb×(1-qk-1|k-1)+ps×qk-1|k-1
wherein q isk-1|k-1The existence probability of the PU at the k-1 moment is obtained; p is a radical ofbThe birth probability is that the authorized user is in an idle state at the k-1 moment and jumps to a working state at the k moment; p is a radical ofsThe survival probability is that the authorized user is in the working state at the k-1 th moment and the k-th moment is also in the working state.
PU perception time difference t at k-1k-1A discrete set of particle values is used for approximation, as follows:
i k - 1 &Delta; &OverBar; &OverBar; &Sigma; i = 1 N &prime; t k - 1 ( i ) &epsiv; k - 1 ( i )
wherein i represents the ith particle; n' represents the number of particles, tk-1 (i)Representing the state value of the ith particle at time k-1,k-1 (i)representing the weight of the ith particle at time k-1.
T is used for a predicted value of a PU (polyurethane) sensing time difference particle at the kth momentk|k-1It also includes two parts: predicted value t for sensing time difference particle state valuek|k-1 (i)The predicted value of the weight of the known particlek|k-1 (i)
State value x for authorized user PU at time kkAnd the perceived time difference t between the authorized user transmitter and the cognitive user receiver at time kkThe invention will xkAnd tkThese two hidden states are represented by a Bernoulli Random Finite Set (BRFS) Y.
The bernoulli random finite set is not only a random variable of the elements in the set, but also a random variable of the number of the elements in the set (called the cardinality of the bernoulli random finite set, denoted by | Y |), and for an asynchronous perception scene, | Y | ∈ {0,1}, that is:
by a random variable xkTo represent the cardinality of a finite set of bernoulli randomness; when x iskWhen 1, the base number indicating the bernoulli random finite set is 1, and corresponds to | Yk1, |; when x iskWhen 0, the cardinality representing the bernoulli random finite set is 0, i.e. | Yk|=0。
Accordingly, the Bernoulli random finite set probability density is defined as follows:
where q represents the probability of an authorized user being present, p (t)k) Representing a perceived time difference of tkProbability of time.
From the above formula, Y at each timekPossibly getOr tkThus, the particles are divided into two parts during the implementation of the asynchronous perception algorithm: particles that are always present and birth particles.
Firstly, a predicted value t of a PU sensing time difference particle state value at the kth momentk|k-1 (i)Generating according to the importance function:
tk|k-1 (i)~πt(tk|k-1 (i)|tk-1|k-1 (i)),i=1,2,…,N+B
wherein, tk|k-1 (i)Is the state value of the perception time difference corresponding to the ith particle at the moment kt(tk|k-1 (i)|tk-1|k-1 (i)) To sense the time difference tkThe transition probability distribution of (2).
Then, the predicted value of the weight of the sensing time difference particlesk|k-1 (i)The device comprises two parts: the predicted value of the existing particle weight and the predicted value of the birth particle weight;
&epsiv; k | k - 1 ( i ) = p s &CenterDot; q k - 1 | k - 1 q k | k - 1 &CenterDot; &epsiv; k - 1 | k - 1 ( i ) ; i = 1 , 2 , ... , N p b &CenterDot; ( 1 - q k - 1 | k - 1 ) q k | k - 1 &CenterDot; 1 B ; i = N + 1 , N + 2 , ... , N + B
1,2, N; n represents the number of particles that are always present; i ═ N +1, N +2,. and N + B; b represents the number of the birth particles.
Step two, the observation value z received by the PU at the k-th momentkCalculating an updated value q of the predicted value of the existence probabilityk|kAnd an update value of the perception time difference prediction value;
as shown in fig. 4, the specific steps are as follows:
step 201, calculating an updated value q of the predicted value of the existence probability of the PU at the k-th momentk|k
The formula is as follows:
q k | k = I k &CenterDot; q k | k - 1 1 - q k | k - 1 + I k &CenterDot; q k | k - 1
Ikrepresenting the likelihood ratio of the PU;
as can be seen from equation (4) and the central limit theorem, when the number of sampling points in each sensing period Ts is sufficiently large, the observed quantity z is observedkThe approximation follows a gaussian distribution, and the likelihood function is calculated as follows:
zkis the observed value at the k-th moment;the function of the likelihood is represented by,indicating that the authorized user PU does not exist; y isk={tk|k-1 (i)Denotes that the authorized user PU is present;
μ0and mu1Is the mean value of the likelihood function; mu.s0=Mσu 2;μ1=Mσu 2+(M-tk|k-1 (i)2;σ0 2And σ1 2Is the variance; sigma0 2=2Mσu 4;σ1 2=2Mσu 4+4(M-tk|k-1 (i))·α2·σu 2(ii) a M represents the number of sampling points at each sensing moment; sigmau 2Representing the channel noise variance, α is the signal-to-fading factor.
Step 202, calculating the updated value of the particle weight of the PU sensing time difference at the kth moment by using the likelihood function1 k|k (i)
The formula is as follows:
i=1,2...N+B;
step 203, normalizing the updated value of the particle weight to obtain a normalized updated valuek|k (i)
&epsiv; k | k ( i ) = &epsiv; &prime; k | k ( i ) / &Sigma; i = 1 N + B &epsiv; &prime; k | k ( i )
N + B1, 2.; update value of particle weight'k|k (i)Normalization was performed to include particles that were always present and particles that were born.
Step 204, normalizing the updated value according to the existing particle weightk|k (i)Resampling the predicted value of the particle state value to obtain an updated value t of the predicted value of the particle state value with the existing perception time differencek|k (i)
And resampling the particle state value according to the updated weight value. The resampling mainly aims at overcoming the phenomenon of particle degradation, and the main idea is to eliminate particles with low weight value on the basis of importance sampling and copy reserved weightHigh-value particles, thereby achieving the purpose of inhibiting the degradation of the particles; obtaining the updated value t of the particle statek|k (i)
The method specifically comprises the following steps: judging the updated value of each particle weight value after normalizationk|k (i)And generating a random number n(i)Size of (1), n(i)∈[0,1]If, ifk|k (i)≥n(i)Then the predicted value t of the particle state value is calculatedk|k-1 (i)Stored as the updated value t of the particle statek|k (i)I.e. tk|k (i)=tk|k-1 (i)(ii) a Otherwisek|k (i)<n(i)The predicted value t of the particle state value is not savedk|k-1 (i)(ii) a Taking the last saved particle state value as the updated value t of the particle statek|k (i)
The last saved particle state value may be tk|k-1 (i-1),tk|k-1 (i-2),...,tk|k-1 (1)To a certain value.
Step 205, normalizing the updated value of each always existing particle weightk|k (i)Reset to
The resampled set of particles is { t }k|k (i),k|k (i)Therein ofi=1,2...N。
Step three, updating the value q of the existence probability predicted value obtained in the step twok|kComparing with the judgment threshold gamma to obtain the state value of the current authorized user PU
The decision threshold γ is an intermediate value of the PU existence probability, and γ is 0.5 in this embodiment.
The calculation is as follows:
x ^ k = 0 , q k | k < &gamma; 1 , q k | k &GreaterEqual; &gamma;
when updating the value qk|kWhen the value is less than the judgment threshold gamma, the state value of the PU of the authorized userIs 0; otherwise, authorizing the state value of the user PUIs 1.
Step four, calculating the current grant according to the state value of the PU of the current authorized userPerceptual time difference of right user PU at k moment
When in useTime, observed value zkIn which only the observation noise is used, the perception time difference value at the k-1 moment is used as the perception time difference value at the k moment, i.e. the
When in useThen, the PU is used for sensing the updated value of the time difference particle at the k moment, and the sensing time difference value at the k moment is calculatedNamely:
t ^ k = &Sigma; i = 1 N t k | k ( i ) &epsiv; k | k ( i )
step five, according to k-1 hourTemporal perceived time differenceExtracting the state value t of the birth particle at the moment kk|k (i)And normalizing the updated value of each birth particle weightk|k (i)Reset to
t k | k ( i ) ~ &pi; t ( t k | k ( i ) | t ^ k - 1 ) ;
i=N+1,N+2,...,N+B。
The updated value after each birth particle weight value is normalizedk|k (i)Reset to
&epsiv; k | k ( i ) = 1 B
i=N+1,N+2,...,N+B;
The state value t of the birth particle at the moment kk|k (i)Sum weightk|k (i)The following were used:
t k | k ( i ) ~ &pi; t ( t k | k ( i ) | t ^ k - 1 ) &epsiv; k | k ( i ) = 1 B
i=N+1,N+2,...,N+B。
step six, judging whether the moment k is the last moment, if so, recording and storing the perception time difference of all the momentsAnd the status value of the authorized user PUOtherwise, entering the step seven;
step seven, repeating the step one, and using the particle set { t at the moment k obtained in the step two and the step fivek|k (i),k|k (i)N + B, iteratively predicting the existence probability and the perception time difference of the PU at the k +1 th moment.
Example 1:
the asynchronous channel sensing method of the invention is simulated, and the birth probability p of the authorized user is setb0.2, survival probability psThe number of sampling points M is 100, and the total time is 4000, when it is 0.8. MtRange representing difference in perceived timeCircle, i.e. sense time difference tk∈[0,Mt]Respectively take MtIs 20, 60, 100; the simulation result of the spectrum sensing performance is shown in fig. 5, fig. 5 is a simulation diagram of the total correct detection probability under three sensing time difference ranges, the abscissa is the actual signal-to-noise ratio snr, and the ordinate is the overall correct detection probability PD. From the simulation results, it can be seen that, in the case of the fixed sampling point number M being 100, the unknown sensing time difference MtThe larger the dynamic range of (2), the worse the spectrum sensing performance; and meanwhile, the higher the perceived signal-to-noise ratio is, the better the obtained performance is. For example: when snr takes-6 dB, MtP in the 20 stateD=0.9299,MtP in 60 stateD=0.8722,MtP in the 100 stateD0.7959; it can be seen that the influence of the sensing time difference on the sensing performance is great, and therefore, it is very necessary to consider the unknown time difference in the sensing process.
The method of the invention fully considers the influence of unknown time difference in spectrum sensing, estimates and tracks the unknown sensing time difference while executing spectrum detection, the obtained unknown time difference estimation performance is shown as figure 6, figure 6 is a relative error simulation diagram of the estimated sensing time difference under three sensing time difference ranges, the abscissa is the actual signal-to-noise ratio snr, and the ordinate is the relative error of the sensing time differencet(ii) a It can be seen that the unknown time differential state range M is low in signal to noise ratiotThe smaller, the resulting pair tkThe better the estimation effect; the estimation error will decrease significantly as the signal-to-noise ratio increases gradually. For example, when the snr increases to 14dB, the estimation error of the unknown time difference decreases to 0.0155. Therefore, the asynchronous sensing method provided by the invention can accurately estimate the unknown dynamic sensing time difference.
A simulation result graph comparing the asynchronous sensing method and the conventional spectrum sensing method is shown in fig. 7, where the abscissa is the actual snr and the ordinate is the overall correct detection probability PD. It is found from fig. 7 that when there is a dynamically unknown sensing time difference, the spectrum sensing performance will be seriously affected. Considering that the overall detection probability is 0.95, for the traditional energy perception algorithm which does not perform any processing, the required signal-to-noise ratio is 10 dB; assuming that a conventional energy detection scheme can obtain the expectation of an unknown time difference, and taking into account the time difference t when performing the energy decisionkThe dynamic variation characteristic can further improve the perception performance by about 1.8 dB. In contrast, the Bayesian asynchronous sensing scheme provided by the invention can eliminate the uncertainty of the observed signal and the information in the statistical characteristics thereof to the maximum extent by jointly estimating the unknown time difference, thereby remarkably improving the spectrum sensing performance. Experiments show that in order to achieve the overall detection probability of 0.95, the required sensing signal-to-noise ratio is only 2dB, and compared with the traditional energy sensing algorithm which does not perform any processing, the sensing performance can be improved by about 8 dB.
The asynchronous sensing method and the device can accurately estimate and track the time offset of dynamic change and obtain the sensing time difference of unknown change, thereby determining the time-varying statistical characteristic of the received signal and eliminating the information uncertainty of the received signal in the spectrum sensing process to the maximum extent, thereby obviously improving the spectrum sensing performance. In addition, the system model and the joint spectrum sensing algorithm can be conveniently expanded to other application scenes, the estimated and obtained time offset information has important significance for design and performance improvement of the CR communication system, and the CR communication system has good application potential in a future dynamic spectrum sharing network.

Claims (3)

1. An asynchronous channel sensing method with unknown timing is characterized by comprising the following specific steps:
step one, aiming at a certain authorized user PU distributed with spectrum resources, predicting the existence probability q of the PU at the kth momentk|k-1And a perceived time difference;
predicted value q of PU existence probability at k momentk|k-1The formula is as follows:
qk|k-1=|pb×(1-qk-1|k-1)+ps×qk-1|k-1
wherein q isk-1|k-1The existence probability of the PU at the k-1 moment is obtained; p is a radical ofbTo the birth probability, psIs the survival probability;
the perception time difference of the PU at the kth moment is represented by a predicted value of a particle, and the perception time difference comprises two parts: predicted value t of sensing time difference particle state valuek|k-1 (i)And the predicted value of the particle weightk|k-1 (i)
Firstly, a predicted value t of a sensing time difference particle state valuek|k-1 (i)Generating according to the importance function:
tk|k-1 (i)~πt(tk|k-1 (i)|tk-1|k-1 (i))
wherein, i is 1,2., N + B; t is tk-1|k-1 (i)Is the state value of the perception time difference corresponding to the ith particle at the moment of k-1, pit(tk|k-1 (i)|tk-1|k-1 (i)) A transition probability distribution that is a perceptual time difference;
then, a predicted value of the perceived time difference particle weight is obtainedk|k-1 (i)The device comprises two parts: the predicted value of the existing particle weight and the predicted value of the birth particle weight;
&epsiv; k | k - 1 ( i ) = p s &CenterDot; q k - 1 | k - 1 q k | k - 1 &CenterDot; &epsiv; k - 1 | k - 1 ( i ) ; i = 1 , 2 , ... , N p b &CenterDot; ( 1 - q k - 1 | k - 1 ) q k | k - 1 &CenterDot; 1 B ; i = N + 1 , N + 2 , ... , N + B
1,2, N; n represents the number of particles that are always present; i ═ N +1, N +2,. and N + B; b represents the number of the birth particles;
step two, the observation value z received by PU at the moment kkCalculating an updated value q of the presence probability prediction valuek|kAnd an update value of the perception time difference prediction value;
step 201, calculating an updated value q of the predicted value of the existence probability of the PU at the moment kk|k
The formula is as follows:
q k | k = I k &CenterDot; q k | k - 1 1 - q k | k - 1 + I k &CenterDot; q k | k - 1
Ikrepresenting the likelihood ratio of the PU;
step 202, calculating an updated value 'of the particle weight of the PU sensing time difference at the k-th moment by using a likelihood function'k|k (i)
The formula is as follows:
i=1,2...N+B;
step 203, update value of particle weight'k|k (i)Normalizing to obtain normalized valuek|k (i)
&epsiv; k | k ( i ) = &epsiv; &prime; k | k ( i ) / &Sigma; i = 1 N + B &epsiv; &prime; k | k ( i )
i=1,2...N+B;
Step 204, selecting the existing updated value after the normalization of the weight value of the particlesk|k (i)Resampling the predicted value of the particle state value to obtain an updated value t of the predicted value of the particle state value of the perception time differencek|k (i)
Normalizing the updated value of each always existing particle weightk|k (i)N, ═ 1,2.. N; with randomly generated n(i)In contrast, n(i)∈[0,1]If, ifk|k (i)≥n(i)Then, the state value of the particle is saved, let tk|k (i)=tk|k-1 (i)(ii) a Otherwise, let tk|k (i)Equal to the last saved particle state value;
step 205, normalizing the updated value of each always existing particle weightk|k (i)Reset to
The set of particles that always exist after resampling is tk|k (i),k|k (i)Therein of
Step three, updating the value q of the existence probability predicted value obtained in the step twok|kComparing with the judgment threshold gamma to obtain the state value of the current authorized user PU
Selecting a middle value of PU existence probability by the decision threshold gamma;
the calculation is as follows:
x ^ k = 0 , q k | k < &gamma; 1 , q k | k &GreaterEqual; &gamma;
when updating the value qk|kWhen the value is less than the judgment threshold gamma, the state value of the PU of the authorized userIs 0; otherwise, authorizing the state value of the user PUIs 1;
step four, calculating the perception time difference of the current authorized user PU at the moment k according to the state value of the current authorized user PU
When in useTime, observed value zkIn which only the observation noise is used, the perception time difference value at the k-1 moment is used as the perception time difference value at the k moment, i.e. the
When in useThen, the PU is used for sensing the updated value of the time difference particle at the k moment, and the sensing time difference value at the k moment is calculatedNamely:
t ^ k = &Sigma; i = 1 N t k | k ( i ) &epsiv; k | k ( i )
step five, according to the perception time difference of the k-1 momentCalculating the state value t of the birth particle at the moment kk|k (i)And normalizing the updated value of each birth particle weightk|k (i)Reset to
t k | k ( i ) ~ &pi; t ( t k | k ( i ) | t ^ k - 1 ) ;
i=N+1,N+2,...,N+B;
The updated value after each birth particle weight value is normalizedk|k (i)Reset to
&epsiv; k | k ( i ) = 1 B
i=N+1,N+2,...,N+B;
Step six, judging whether the moment k is the last moment, if so, recording and storing the perception time difference of all the momentsAnd the status value of the authorized user PUOtherwise, entering the step seven;
step seven, repeating the step one, and using the particle set { t at the moment k obtained in the step two and the step fivek|k (i),k|k (i)N + B, iteratively predicting the existence probability and the perception time difference of the PU at the k +1 th moment.
2. The method as claimed in claim 1, wherein in step 201, the likelihood ratio I of the PU is determined by the unknown timingk:
The function of the likelihood is represented by,indicating that the authorized user PU does not exist;indicating the existence of an authorized user PU;
μ0and mu1Is the mean value of the likelihood function; mu.s0=Mσu 2;μ1=Mσu 2+(M-tk|k-1 (i))·α2;σ0 2And σ1 2Is the variance; sigma0 2=2Mσu 4;σ1 2=2Mσu 4+4(M-tk|k-1 (i))·α2·σu 2(ii) a M represents the sampling times of each perception moment; sigmau 2Representing the channel noise variance, α is the channel fading factor.
3. The method as claimed in claim 1, wherein in step 203, the updated value of the particle weight value'k|k (i)Normalization is carried out, including updating values of the always existing particle weight values'k|k (i)Carry out normalization and update value of birth particle weight'k|k (i)And (6) carrying out normalization.
CN201610063925.XA 2016-01-29 2016-01-29 A kind of asynchronous channel cognitive method there are unknown timing Active CN105634634B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610063925.XA CN105634634B (en) 2016-01-29 2016-01-29 A kind of asynchronous channel cognitive method there are unknown timing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610063925.XA CN105634634B (en) 2016-01-29 2016-01-29 A kind of asynchronous channel cognitive method there are unknown timing

Publications (2)

Publication Number Publication Date
CN105634634A true CN105634634A (en) 2016-06-01
CN105634634B CN105634634B (en) 2018-04-13

Family

ID=56049224

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610063925.XA Active CN105634634B (en) 2016-01-29 2016-01-29 A kind of asynchronous channel cognitive method there are unknown timing

Country Status (1)

Country Link
CN (1) CN105634634B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106685549A (en) * 2016-11-17 2017-05-17 北京邮电大学 Master user spectrum sensing method and device
CN108398260A (en) * 2018-01-10 2018-08-14 浙江大学 The fast evaluation method of gear-box instantaneous angular velocity based on mixing probabilistic method
CN112383328A (en) * 2020-10-13 2021-02-19 哈尔滨工业大学(深圳) Improved matched filtering message transmission detection method based on probability cutting in communication system
CN113541646A (en) * 2021-05-27 2021-10-22 湖州师范学院 Asynchronous filtering method and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103139874A (en) * 2012-12-17 2013-06-05 中国人民解放军理工大学 Channel selection method which is in cognitive radio and based on time series predictions
CN104283825A (en) * 2014-09-24 2015-01-14 北京邮电大学 Channel estimation method based on dynamic compression sensing
CN104519496A (en) * 2014-12-15 2015-04-15 河海大学常州校区 Method for distributing frequency spectrum according to needs in cognitive radio network
CN104883212A (en) * 2015-06-08 2015-09-02 北京邮电大学 Data transmission method and apparatus based on cooperative relay and frequency spectrum aggregation

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103139874A (en) * 2012-12-17 2013-06-05 中国人民解放军理工大学 Channel selection method which is in cognitive radio and based on time series predictions
CN104283825A (en) * 2014-09-24 2015-01-14 北京邮电大学 Channel estimation method based on dynamic compression sensing
CN104519496A (en) * 2014-12-15 2015-04-15 河海大学常州校区 Method for distributing frequency spectrum according to needs in cognitive radio network
CN104883212A (en) * 2015-06-08 2015-09-02 北京邮电大学 Data transmission method and apparatus based on cooperative relay and frequency spectrum aggregation

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
孙梦巍: ""动态时变衰落信道下的频谱感知算法"", 《通信学报》 *
李德建: ""超宽带信道建模中基于压缩感知的解卷积算法"", 《北京邮电大学》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106685549A (en) * 2016-11-17 2017-05-17 北京邮电大学 Master user spectrum sensing method and device
CN106685549B (en) * 2016-11-17 2020-06-12 北京邮电大学 Primary user spectrum sensing method and device
CN108398260A (en) * 2018-01-10 2018-08-14 浙江大学 The fast evaluation method of gear-box instantaneous angular velocity based on mixing probabilistic method
CN112383328A (en) * 2020-10-13 2021-02-19 哈尔滨工业大学(深圳) Improved matched filtering message transmission detection method based on probability cutting in communication system
CN112383328B (en) * 2020-10-13 2022-01-18 哈尔滨工业大学(深圳) Improved matched filtering message transmission detection method based on probability cutting in communication system
CN113541646A (en) * 2021-05-27 2021-10-22 湖州师范学院 Asynchronous filtering method and system
CN113541646B (en) * 2021-05-27 2023-08-18 湖州师范学院 Asynchronous filtering method and system

Also Published As

Publication number Publication date
CN105634634B (en) 2018-04-13

Similar Documents

Publication Publication Date Title
CN105634634B (en) A kind of asynchronous channel cognitive method there are unknown timing
CN102984711A (en) Multi-user collaborative spectrum sensing method based on single bit compression sensing technology
CN103346845B (en) Based on blind frequency spectrum sensing method and the device of fast Fourier transform
CN103117817B (en) A kind of frequency spectrum detecting method under time-varying fading channels
CN112511477A (en) Hybrid satellite communication modulation identification method and system based on constellation diagram and deep learning
CN104168075B (en) Frequency spectrum detecting method and device in the case of a kind of without knowledge of noise covariance
CN106713190B (en) MIMO transmitting antenna number blind estimation calculation method based on random matrix theory and characteristic threshold estimation
CN104780008A (en) Broadband spectrum sensing method based on self-adaptive compressed sensing
CN103297160A (en) Spectrum sensing method and spectrum sensing device for goodness-of-fit test based on normalized eigenvalues
CN102013928B (en) Fast spectrum perception method in cognitive radio system
CN103916969A (en) Combined authorized user perception and link state estimation method and device
KR101009827B1 (en) Estimating apparatus and method of mobile station speed in a mobile communication system
CN104320362A (en) Method for PCMA signal blind separation
CN106972899A (en) A kind of cooperative frequency spectrum sensing method excavated based on multi-user&#39;s history perception data
CN106788817A (en) A kind of frequency spectrum sensing method based on bayesian criterion and energy measuring method
CN108401255B (en) Double-stage blind spectrum sensing scheme
CN103888201A (en) Cooperative spectrum sensing method utilizing space diversity
CN112187382A (en) Noise power estimation method based on viscous hidden Markov model
CN100589334C (en) Co-channel adjacent cell channel estimating method at the time of multi-cell union detection in TD SCDMA system
KR20120086023A (en) Cognitive radio communication system engine unit using chaotic property
CN109150344B (en) Paired carrier multiple access fast spectrum sensing method in satellite communication
CN105812300A (en) Long code DSSS signal blind estimation method for eliminating information code hopping
CN114268393A (en) Cognitive radio frequency spectrum sensing method based on connected component number characteristics
CN104270328A (en) Method for estimating signal-to-noise ratio in real time
CN104469782B (en) A kind of mobile authorization user frequency spectrum detection and its geographical position method of estimation and device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant