CN103795481A - Cooperative spectrum sensing method based on free probability theory - Google Patents

Cooperative spectrum sensing method based on free probability theory Download PDF

Info

Publication number
CN103795481A
CN103795481A CN201410042029.6A CN201410042029A CN103795481A CN 103795481 A CN103795481 A CN 103795481A CN 201410042029 A CN201410042029 A CN 201410042029A CN 103795481 A CN103795481 A CN 103795481A
Authority
CN
China
Prior art keywords
mrow
msub
msubsup
math
msup
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
CN201410042029.6A
Other languages
Chinese (zh)
Other versions
CN103795481B (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.)
Nanjing Post and Telecommunication University
Original Assignee
Nanjing Post and Telecommunication University
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 Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201410042029.6A priority Critical patent/CN103795481B/en
Publication of CN103795481A publication Critical patent/CN103795481A/en
Application granted granted Critical
Publication of CN103795481B publication Critical patent/CN103795481B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)
  • Radio Transmission System (AREA)
  • Monitoring And Testing Of Transmission In General (AREA)

Abstract

The invention discloses a cooperative spectrum sensing method based on a free probability theory. The cooperative spectrum sensing method is suitable for an MIMO communication environment and includes the steps that received signals of a plurality of antennas of all auxiliary base stations are sampled, and sampled signals are processed in a centralized mode; according to noise variance of all the received sampled signals and channels, by means of the asymptotic freedom characteristic and the Wishart distribution characteristic of a random matrix, the average received signal power (img file=' DDA0000463198220000011. TIF' wi=' 64' he=' 54' /) of all receiving antennas is solved by the adoption of a free deconvolution algorithm, and namely statistics are detected; according to target false alarm probability pf, a detection threshold value tau is calculated by using MonteCarlo simulation under the condition that only noise exsits; finally (img file=' DDA0000463198220000012. TIF' wi=' 41' he=' 54' /) is compared with tau to judge whether a main base station sends signals or not. The accurate receiving power can be obtained through the received signals of the auxiliary base stations, and moreover the spectrum sensing performance can be improved effectively particularly under the condition of a low signal to noise ratio and small samples.

Description

cooperative spectrum sensing method based on free probability theory
Technical Field
The invention relates to the technical field of computer communication of cognitive radio spectrum sensing, in particular to a cooperative spectrum sensing method based on a free probability theory.
Background
Under the fixed spectrum allocation mode commonly adopted in all countries at present, the utilization rate of most authorized frequency bands is low, and great waste of wireless spectrum resources is caused. On the other hand, with the rapid development of the wireless communication industry, the available wireless spectrum resources are increasingly scarce. How to meet the explosive growth of wireless spectrum demand has become a common problem facing global mobile communications. Therefore, cognitive radio has received a great deal of attention in recent years from both academic and industrial fields as one of the effective ways to alleviate the problem of shortage of wireless spectrum resources. The basic idea of cognitive radio is spectrum multiplexing or spectrum sharing, which allows cognitive users to communicate using the primary user frequency band when the band is idle. In order to do this, the cognitive user needs to perform spectrum sensing frequently, that is, detect whether the master user is using the frequency band. Once the primary user reuses the frequency band, the cognitive user must detect the primary user with a high detection probability and quickly exit the frequency band within a specified time. The spectrum sensing technology is the core and the foundation of the cognitive radio technology and becomes a hot spot of current research. Currently, research in this field has been greatly advanced, and various research institutes or individuals have intensively studied it from various aspects of spectrum sensing, have preliminarily established a theoretical framework of spectrum sensing, and have been applied to corresponding international standards. For example, the IEEE802.22 standard is the first international standard that explicitly employs spectrum sensing, which specifies that fixed wireless local area networks and televisions operate in the same frequency band, and that idle television bands can be automatically detected and utilized to improve spectral efficiency.
The existing spectrum sensing method mainly includes Energy Detection (ED), Matched Filter Detection (MFD), Cyclostationary Feature Detection (CFD), interference temperature Detection, and various multi-node cooperation detections evolved from the foregoing. The multi-node cooperative detection is mainly used for overcoming the influence of wireless communication fading and shadow so as to prevent the hidden terminal problem. Recently, another scholars have proposed schemes based on Random Matrix Theory (RMT), such as MME algorithm. Unlike previous studies in this field, this type of scheme does not require knowledge of the noise statistics and variance, but only with respect to the maximum and minimum eigenvalues of the random matrix.
The spectrum sensing methods have advantages and disadvantages and applicable conditions, but have a problem that the performance of the spectrum sensing methods still cannot meet the practical requirement under the conditions of low signal-to-noise ratio and small samples. Therefore, finding a high-performance spectrum sensing method has become an urgent problem to be solved.
In the last 80 th century, under the pioneering work of Voiculescu, the free probability theory has developed into a complete research field. The free probability theory is an important branch of the random matrix theory, is a powerful tool for describing the asymptotic characteristic of the random matrix, establishes a strong relation between two random matrices and their sum or product matrices, and can be used for a digital communication system modeled by the random matrix. In recent years, it has been applied to the field of spectrum sensing to further improve performance at low signal-to-noise ratios, which essentially separates the true signal power matrix from the sample covariance matrix containing the signal and noise powers. The present invention can solve the above problems well.
Disclosure of Invention
The invention aims to provide a cooperative spectrum sensing method based on a free probability theory, which is suitable for an MIMO communication environment, can obtain accurate receiving power from a receiving signal of a secondary base station, and solves the problem of lower spectrum sensing performance under the conditions of low signal-to-noise ratio and small sample.
The technical scheme adopted by the invention for solving the technical problems is as follows: in fig. 1 of the model of the cooperative spectrum sensing system to which the present invention is directed, K secondary base stations BS distributed at different geographical locations1,BS2,…,BSKAnd the cooperative sensing channel is used for judging whether the main base station is transmitting signals.The main base station and each secondary base station are respectively provided with NtAnd NrAnd antennas between which is a MIMO rayleigh fading channel. The cooperative spectrum sensing method based on the free probability theory comprises the following specific steps:
1. and sampling the received signals of the multiple antennas of each secondary base station, and performing centralized processing on the sampled signals. The sampling rate is 1/TsThen the k-th receiver outputs a sampled signal at time n ofK is 1,2, …, K. The sampled signals collected at time n by all the receiving antennas are then
Figure BDA0000463198200000022
Wherein (·)ΗRepresents a conjugate transpose;
2. according to the noise variance of all received sampling signals and channels, by means of the asymptotic free characteristic and Wishart distribution characteristic of the random matrix, KN is solved by adopting an algorithm based on free deconvolutionrAverage received signal power of each antenna
Figure BDA0000463198200000029
I.e., the detection statistics. The method comprises the following specific steps:
(1) inputting: receiving sampling signals { y (n), n ═ 1,2, …, MSAnd channel noise variance σ2. Wherein M isSIs the total number of samples of the received signal;
(2) calculating a sample covariance matrix for a received sampled signal
Figure BDA0000463198200000023
And its eigenvalue { lambdai,i=1,2,…,KNr};
(3) Computing
Figure BDA00004631982000000210
K order moment of
Figure BDA0000463198200000024
And
Figure BDA0000463198200000025
k order moment of
Figure BDA0000463198200000026
(4) Computing
Figure BDA0000463198200000027
The method comprises the following steps:
Figure BDA0000463198200000028
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>=</mo> <msub> <mi>&gamma;</mi> <mi>k</mi> </msub> <mo>/</mo> <mrow> <mo>(</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>M</mi> <mi>S</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mo>}</mo> <mo>;</mo> </mrow> </math>
(5) computing
Figure BDA0000463198200000032
The method comprises the following steps:
<math> <mrow> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <msub> <mi>&mu;</mi> <mrow> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mi>I</mi> </mrow> </msub> </msubsup> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mi>k</mi> </msup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msubsup> <mrow> <mo>{</mo> <mi>&alpha;</mi> </mrow> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>=</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>-</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <msub> <mi>&mu;</mi> <mrow> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mi>I</mi> </mrow> </msub> </msubsup> <mo>}</mo> </mrow> </math>
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>=</mo> <mi>cummom</mi> <mrow> <mo>(</mo> <mo>{</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </math>
(6) computingThe method comprises the following steps:
<math> <mrow> <mo>{</mo> <msub> <mi>&rho;</mi> <mi>k</mi> </msub> <mo>}</mo> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <mo>&CenterDot;</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>P</mi> </msubsup> <mo>=</mo> <msub> <mi>&rho;</mi> <mi>k</mi> </msub> <mo>/</mo> <mrow> <mo>(</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mo>}</mo> <mo>;</mo> </mrow> </math>
(7)
Figure BDA00004631982000000310
i.e. muPFirst moment of (d).
The symbol explanation in the above steps:
Figure BDA00004631982000000311
and
Figure BDA00004631982000000312
respectively representing free addition deconvolution operator and free multiplication in free probability theoryA normal deconvolution operator;
Figure BDA00004631982000000327
and muPRespectively represent matricesσ2The extreme probability distribution of I (I is the identity matrix) and P;and
Figure BDA00004631982000000315
correspond to
Figure BDA00004631982000000316
Law mucC taking respectively
Figure BDA00004631982000000317
And
Figure BDA00004631982000000318
the momcumm and cummomm are obtained according to a moment-cumulant formula of the distribution mu, the input of the momcumm is a moment sequence, the output of the momcumm is a cumulant sequence, the input of the cummomm is a cumulant sequence, and the output of the cummomm is a moment sequence.
3. According to target false alarm probability pfThe detection threshold τ is calculated using Monte Carlo simulation in the presence of noise only. Step 2 is first performed to obtain noise samples only
Figure BDA00004631982000000319
After many such simulations, the calculation
Figure BDA00004631982000000320
Mean value of (theta)PSum variance
Figure BDA00004631982000000321
Approximately satisfying a gaussian distribution. Then according to the target false alarm probability pfCalculating a threshold τ = υPQ-1(pf)+θPWherein Q is-1(. cndot.) is an inverse Q-function,
4. will be provided with
Figure BDA00004631982000000324
And tau, and determining whether the main base station is transmitting signals. When in useWhen the master base station is transmitting a signal; when in use
Figure BDA00004631982000000326
At this time, the main base station does not transmit a signal.
Has the advantages that:
1. in the MIMO communication environment, the invention adopts the algorithm based on free deconvolution to calculate the detection statistic, uses MonteCarlo simulation to obtain the detection threshold value, realizes the spectrum sensing, and can obtain accurate receiving power from the receiving signal of the secondary base station.
2. The invention can effectively improve the spectrum sensing performance, especially under the conditions of low signal-to-noise ratio and small samples.
Drawings
Fig. 1 is a diagram of a cooperative spectrum sensing system model according to the present invention.
FIG. 2 is a flow chart of the method of the present invention.
FIG. 3 is a graph of the results of Monte Carlo simulations in the presence of noise only
Figure BDA0000463198200000048
Is normalized to the histogram.
Fig. 4 is a diagram illustrating comparison of perceptual performance between the method of the present invention and a detection method based on feature values.
Detailed Description
The invention is described in further detail below with reference to the figures and examples.
Example 1
As shown in FIG. 1, K secondary base stations BS distributed at different geographical locations1,BS2,…,BSKAnd the cooperative sensing channel is used for judging whether the main base station is transmitting signals. The main base station and each secondary base station are respectively provided with NtAnd NrAnd antennas between which is a MIMO rayleigh fading channel. When the main base station transmits signals, the sampling rate is 1/TsThe sampled signal output by the kth receiver at time nCan be expressed as
y k ( n ) = P k N t H k s ( n ) + v k ( n ) , k = 1 . . . k - - - ( 1 )
Wherein,
Figure BDA0000463198200000043
is a transmitted symbol vector at time n, the elements of which satisfy zero mean independent equal distribution, and the variance is 1;is a MIMO channel matrix between the transmitter and the kth receiver, whose elements are complex Gaussian variables with mean 0 and variance 1, i.e. obeying Nc(0,1);PkIs the received signal power of each antenna of the kth receiver;
Figure BDA0000463198200000045
is the complex gaussian noise vector at the kth receiver,
Figure BDA0000463198200000046
all secondary base stations perceive the same frequency band and their received signals are centrally processed. The following symbols are defined:
Figure BDA0000463198200000047
Figure BDA0000463198200000051
Figure BDA0000463198200000052
Figure BDA0000463198200000053
the received signal model (1) can also be written as
y ( n ) = P 1 2 Hs ( n ) + v ( n ) - - - ( 2 )
The spectrum sensing problem is therefore the following binary hypothesis testing problem
y ( n ) = v ( n ) , H 0 x ( n ) + v ( n ) , H 1 - - - ( 3 )
Wherein
<math> <mrow> <mi>x</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mover> <mo>=</mo> <mi>&Delta;</mi> </mover> <msup> <mi>P</mi> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> </msup> <mi>Hs</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow> </math>
Η0Denotes that no signal is sent by the main BS, h1Indicating that the master BS is transmitting a signal. In the present invention, we propose a new spectrum sensing method based on the free probability theory, whose basic idea is to estimate the distribution of the elements of the diagonal matrix P, so that the average received signal power can be estimated
Figure BDA0000463198200000057
By mixing
Figure BDA0000463198200000058
H by comparison with a threshold value of τ0H and H1Make a decision in between, that is if
Figure BDA0000463198200000059
H is H1Otherwise is H0
In this connection, it is possible to use,solving by free probability theory
Figure BDA00004631982000000510
Is a simple and easy method. The mathematical background of the free probability theory is:
let ANIs an NxN-dimensional Hermitian matrix with only real eigenvalues, and the eigenvalue set is lambdai(AN) I 1,2, …, an empirical probability distribution over N of
<math> <mrow> <msub> <mi>&mu;</mi> <msub> <mi>A</mi> <mi>N</mi> </msub> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mn>1</mn> <mi>N</mi> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <mn>1</mn> <mrow> <mo>(</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mi>N</mi> </msub> <mo>)</mo> </mrow> <mo>&le;</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow> </math>
Where 1 (-) is an indicator function. Of interest to us is the limiting spectral distribution μ at N → ∞AIt is composed of
Unique description, where Ε [ · ] denotes expectation, tr (·) denotes the traces of the matrix.
In particular, if the elements of the N M matrix H satisfy a zero-mean independent homodistribution with a variance of 1/M, A is when N, M → ∞ and N/M → cN=HHΗLimit spectral distribution mucIs that
Figure BDA0000463198200000062
Law, its density function is
<math> <mrow> <msup> <mi>f</mi> <msub> <mi>&mu;</mi> <mi>c</mi> </msub> </msup> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mfrac> <mn>1</mn> <mi>c</mi> </mfrac> <mo>)</mo> </mrow> <mo>+</mo> </msup> <mi>&delta;</mi> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>+</mo> <mfrac> <mn>1</mn> <mrow> <mn>2</mn> <mi>&pi;cx</mi> </mrow> </mfrac> <msqrt> <msup> <mrow> <mo>(</mo> <mi>x</mi> <mo>-</mo> <mi>a</mi> <mo>)</mo> </mrow> <mo>+</mo> </msup> <msup> <mrow> <mo>(</mo> <mi>b</mi> <mo>-</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>+</mo> </msup> </msqrt> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow> </math>
Wherein (z)+=max{0,z},
Figure BDA0000463198200000064
Figure BDA0000463198200000065
In particular, mucAn asymptotic eigenvalue distribution of the Wishart matrix is described, where the elements of H satisfy an independent homodistribution, subject to
Figure BDA0000463198200000066
If two random matrices A are givenN、BNTheir limiting probability distributions are respectively μA、μBWe wish to be based on μAAnd muBObtaining AN+BNAnd ANBNIs/are as followsA limit probability distribution. To this end we introduce a concept similar to "independence" in classical probability theory, called "progressive freedom", to compute these distributions. When A isNAnd BNWhen the asymptotic free is satisfied, AN+BNCan be determined from the limiting probability distribution ofAAnd muBIs obtained by free addition convolution, expressed as
Figure BDA0000463198200000067
ANBNCan be determined from the limiting probability distribution ofAAnd muBIs obtained by free multiplicative convolution, denoted asIn other words, when ANAnd BNWhen the asymptotic free is satisfied, AN+BNAnd ANBNCan be represented by ANAnd BNThe moment of (2) is obtained.
Both the free-add and multiplicative convolutions are interchangeable, i.e.
Figure BDA0000463198200000069
And
Figure BDA00004631982000000610
and defineDeconvoluted for free addition, i.e. if
Figure BDA00004631982000000612
Then
Figure BDA00004631982000000613
Analogously, defineDeconvolution for free multiplication, i.e. if
Figure BDA00004631982000000615
Then
Figure BDA00004631982000000616
ANAnd BNThe conditions for meeting the asymptotic freedom are very abstract. However, we know that two independent co-distributed gaussian matrices, two independent co-distributed Hermitian matrices, one independent co-distributed gaussian or Hermitian matrix and one definite diagonal matrix are asymptotically free.
Then, using free probability theory to solve
Figure BDA00004631982000000617
The specific theoretical basis and method are as follows:
A. limit distribution mu of the power matrix PP
Suppose MSSamples y (1), …, y (M) of a received signalS) For sensing the spectrum. The covariance matrix of the samples of the received signal is
Figure BDA00004631982000000618
When the master base station is transmitting, there is y (n) ═ x (n) + v (n). The sample covariance matrix of the signal components x (n) is
<math> <mrow> <mover> <mi>&Sigma;</mi> <mo>^</mo> </mover> <mo>=</mo> <mfrac> <mn>1</mn> <msub> <mi>M</mi> <mi>S</mi> </msub> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>M</mi> <mi>S</mi> </msub> </munderover> <mi>x</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>x</mi> <msup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>H</mi> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow> </math>
For the signal-Gaussian noise model, the two sample covariance matrices are described above using free probability theory
Figure BDA0000463198200000072
Andsatisfies the following equation
Figure BDA0000463198200000074
Wherein
c = KN r M S - - - ( 11 )
On the other hand, the covariance matrix of the signal components x (n) obtained from equation (4) is
<math> <mrow> <mi>&Sigma;</mi> <mo>=</mo> <mi>E</mi> <mo>{</mo> <mi>x</mi> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>x</mi> <msup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mi>H</mi> </msup> <mo>}</mo> <mo>=</mo> <msup> <mi>P</mi> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> </msup> <msup> <mi>HH</mi> <mi>H</mi> </msup> <msup> <mi>P</mi> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>12</mn> <mo>)</mo> </mrow> </mrow> </math>
Definition of
Figure BDA0000463198200000077
Z is KNr×MSDimension matrix with elements satisfying zero mean value independent distribution and variance of 1/MS. Obtained by using formula (9)
<math> <mrow> <msup> <mi>ZZ</mi> <mi>H</mi> </msup> <mo>=</mo> <msup> <mi>&Sigma;</mi> <mrow> <mo>-</mo> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> </mrow> </msup> <mover> <mi>&Sigma;</mi> <mo>^</mo> </mover> <msup> <mi>&Sigma;</mi> <mrow> <mo>-</mo> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> </mrow> </msup> </mrow> </math> Or <math> <mrow> <mover> <mi>&Sigma;</mi> <mo>^</mo> </mover> <mo>=</mo> <msup> <mi>&Sigma;</mi> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> </msup> <msup> <mi>ZZ</mi> <mi>H</mi> </msup> <msup> <mi>&Sigma;</mi> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>13</mn> <mo>)</mo> </mrow> </mrow> </math>
I.e., Wishart distribution characteristics. It is noteworthy that ZZΗThe elements of (1) satisfy zero mean value independent same distribution, and the variance is 1; HH (Hilbert-Huang) with high hydrogen storage capacityΗThe Wishart matrix has elements meeting zero mean value independent same distribution and variance of 1. Thus is in
Figure BDA0000463198200000079
Their corresponding limit distributions under the law are
Figure BDA00004631982000000710
Andfrom formulae (12) and (13), we obtain
Substituting equation (14) into equation (10) yields a limit distribution of the signal power matrix P of
Figure BDA00004631982000000713
B、μPNumerical calculation process of
In the formula (15), the reaction mixture is,μPincludes an
Figure BDA00004631982000000714
Free-add deconvolution of
Figure BDA00004631982000000715
Law mucBoth of which can be efficiently implemented by the moment-cumulant method described below.
1) Calculation and
Figure BDA00004631982000000716
free-addition deconvolution of (c): the R-transform of the probability distribution μ is defined as
<math> <mrow> <msub> <mi>R</mi> <mi>&mu;</mi> </msub> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>=</mo> <munder> <mi>&Sigma;</mi> <mi>n</mi> </munder> <msubsup> <mi>&alpha;</mi> <mi>n</mi> <mi>&mu;</mi> </msubsup> <msup> <mi>z</mi> <mi>n</mi> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>16</mn> <mo>)</mo> </mrow> </mrow> </math>
WhereinIs the nth order cumulative amount of μ. The importance of R-transform is due to the additive nature of free-add convolution, i.e.
Equivalent to the cumulative amount being additive under free-add convolution, i.e.
Figure BDA0000463198200000084
The moments and the cumulative quantities of the distribution μ are related as follows:
<math> <mrow> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&mu;</mi> </msubsup> <mo>=</mo> <munder> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>&le;</mo> <mi>k</mi> </mrow> </munder> <msubsup> <mi>&alpha;</mi> <mi>n</mi> <mi>&mu;</mi> </msubsup> <msub> <mi>coef</mi> <mrow> <mi>k</mi> <mo>-</mo> <mi>n</mi> </mrow> </msub> <mrow> <mo>(</mo> <msup> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <msubsup> <mi>m</mi> <mn>1</mn> <mi>&mu;</mi> </msubsup> <mi>z</mi> <mo>+</mo> <msubsup> <mi>m</mi> <mn>2</mn> <mi>&mu;</mi> </msubsup> <msup> <mi>z</mi> <mn>2</mn> </msup> <mo>+</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>)</mo> </mrow> <mi>n</mi> </msup> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>19</mn> <mo>)</mo> </mrow> </mrow> </math>
wherein coefn(. represents z)nThe coefficient of (a). From equation (19), we can derive the cumulative quantity sequence
Figure BDA0000463198200000086
Obtaining a sequence of moments
Figure BDA0000463198200000087
And vice versa. Defining a function momcum, taking a moment sequence as an input quantity and taking a cumulant sequence as an output quantity; the function cummom takes the cumulant series as input and the moment series as output.
To obtain
Figure BDA0000463198200000088
First, we calculate the sample covariance matrix in equation (8)
Figure BDA0000463198200000089
Characteristic value of
Figure BDA00004631982000000822
Then calculating the moment
Figure BDA00004631982000000810
On the other hand, σ2The characteristic values of I are all sigma2. Thus, it is possible to provide
Figure BDA00004631982000000811
Has a moment of
<math> <mrow> <msubsup> <mi>m</mi> <mi>k</mi> <msub> <mi>&mu;</mi> <mrow> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mi>I</mi> </mrow> </msub> </msubsup> <mo>=</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mi>k</mi> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>21</mn> <mo>)</mo> </mrow> </mrow> </math>
2) Calculation of the sum ofcDeconvolution by free multiplication of (1):
Figure BDA00004631982000000813
and muAThe moments of (c) have the following relationship:
Figure BDA00004631982000000814
wherein
<math> <mrow> <mi>Z</mi> <mrow> <mo>(</mo> <mi>z</mi> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>c</mi> <mo>&CenterDot;</mo> <msubsup> <mi>m</mi> <mn>1</mn> <msub> <mi>&mu;</mi> <mi>A</mi> </msub> </msubsup> <mi>z</mi> <mo>+</mo> <mi>c</mi> <mo>&CenterDot;</mo> <msubsup> <mi>m</mi> <mn>2</mn> <msub> <mi>&mu;</mi> <mi>A</mi> </msub> </msubsup> <msup> <mi>z</mi> <mn>2</mn> </msup> <mo>+</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>)</mo> </mrow> <mi>n</mi> </msup> </mrow> </math>
Comparing equations (22) and (19) shows that equation (22) is a moment-cumulant equation, except that the cumulant is represented by
Figure BDA00004631982000000816
Alternative, moment isAnd (6) replacing. Thus, using the function momcum, the input is
Figure BDA00004631982000000818
The corresponding output is
Figure BDA00004631982000000819
To calculate
Figure BDA00004631982000000820
The moment of (c).
After performing the free multiplication and addition deconvolution in equation (15), we get μPMoment of
Figure BDA00004631982000000821
As mentioned earlier, the decision rule for spectrum sensing is based on the average received power
Figure BDA0000463198200000091
Is estimated, i.e. muPA first moment of (i.e.
Figure BDA0000463198200000092
Thus, we can conclude that the computation is based on free deconvolution
Figure BDA0000463198200000093
Comprises the following steps:
(1) inputting: receiving sampling signals { y (n), n ═ 1,2, …, MSAnd channel noise variance σ2
(2) Calculating the sample covariance matrix in equation (8)
Figure BDA0000463198200000094
And its eigenvalue { lambdai,i=1,2,…,KNr};
(3) Calculating moments in equation (20)And moments in formula (21)
Figure BDA00004631982000000921
(4) Computing
Figure BDA0000463198200000096
The method comprises the following steps:
Figure BDA0000463198200000097
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>=</mo> <msub> <mi>&gamma;</mi> <mi>k</mi> </msub> <mo>/</mo> <mrow> <mo>(</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>M</mi> <mi>S</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mo>}</mo> <mo>;</mo> </mrow> </math>
(5) computing
Figure BDA0000463198200000099
The method comprises the following steps:
<math> <mrow> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <msub> <mi>&mu;</mi> <mrow> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mi>I</mi> </mrow> </msub> </msubsup> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mi>k</mi> </msup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msubsup> <mrow> <mo>{</mo> <mi>&alpha;</mi> </mrow> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>=</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>-</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <msub> <mi>&mu;</mi> <mrow> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mi>I</mi> </mrow> </msub> </msubsup> <mo>}</mo> </mrow> </math>
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>=</mo> <mi>cummom</mi> <mrow> <mo>(</mo> <mo>{</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </math>
(6) computing
Figure BDA00004631982000000914
The method comprises the following steps:
<math> <mrow> <mo>{</mo> <msub> <mi>&rho;</mi> <mi>k</mi> </msub> <mo>}</mo> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <mo>&CenterDot;</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>P</mi> </msubsup> <mo>=</mo> <msub> <mi>&rho;</mi> <mi>k</mi> </msub> <mo>/</mo> <mrow> <mo>(</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mo>}</mo> <mo>;</mo> </mrow> </math>
(7)
Figure BDA00004631982000000917
next, for the selection of the detection threshold τ, it is common to satisfy the target false alarm probability pfThat is to say
Figure BDA00004631982000000918
But in H0In this case, the result of the algorithm based on free deconvolution introduced above
Figure BDA00004631982000000919
There is no analytical expression for the probability distribution. We then used Monte Carlo simulations to obtain H0Under the circumstances
Figure BDA00004631982000000920
As shown in fig. 3, the validated histogram approximates a gaussian distribution. Thus, in the case of only noise samples, we can use the estimated noise variance and perform a free deconvolution-based algorithm to obtainWe run many such simulations and then compute themMean value of (theta)PSum variance
Figure BDA0000463198200000103
To obtain
Figure BDA0000463198200000104
Then the target false alarm probability pfHas a detection threshold of
τ=υPQ-1(pf)+θP(23) Wherein Q-1(. cndot.) is an inverse Q-function,
Figure BDA0000463198200000105
finally, will
Figure BDA0000463198200000106
And tau, and determining whether the main base station is transmitting signals. When in use
Figure BDA0000463198200000107
When the master base station is transmitting a signal; when in use
Figure BDA0000463198200000108
At this time, the main base station does not transmit a signal.
To better describe the effect of the present invention, it will be further demonstrated by the following simulation examples:
1. simulation parameter setting
Figure BDA0000463198200000109
A MIMO Rayleigh fading channel is arranged between the main base station and each secondary base station. The secondary base stations are distributed over different geographical locations, so PkAre different from each other. Further averaging
Figure BDA00004631982000001010
Wherein
Figure BDA00004631982000001011
2. Simulation method
The existing detection method based on characteristic values and the method of the invention.
Introduction of a detection method based on a characteristic value: eigenvalue based detection methods do not require noise variance and utilize the asymptotic property of the maximum to minimum eigenvalue ratio of the sample covariance matrix. Specifically, it first calculates the sample covariance matrix in equation (8)
Figure BDA00004631982000001012
And its characteristic valueThen compare
Figure BDA00004631982000001013
And threshold τEVIf, if
Figure BDA00004631982000001014
Then is H1Otherwise is H0. The threshold value is calculated by the formula <math> <mrow> <msub> <mi>&tau;</mi> <mi>EV</mi> </msub> <mo>=</mo> <msup> <mrow> <mo>(</mo> <mfrac> <mrow> <msqrt> <msub> <mi>KN</mi> <mi>r</mi> </msub> </msqrt> <mo>+</mo> <msqrt> <msub> <mi>M</mi> <mi>S</mi> </msub> </msqrt> </mrow> <mrow> <msqrt> <msub> <mi>KN</mi> <mi>r</mi> </msub> </msqrt> <mo>-</mo> <msqrt> <msub> <mi>M</mi> <mi>S</mi> </msub> </msqrt> </mrow> </mfrac> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mfrac> <msup> <mrow> <mo>(</mo> <msqrt> <msub> <mi>KN</mi> <mi>r</mi> </msub> </msqrt> <mo>+</mo> <msqrt> <msub> <mi>M</mi> <mi>S</mi> </msub> </msqrt> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>2</mn> <mo>/</mo> <mn>3</mn> </mrow> </msup> <msup> <mrow> <mo>(</mo> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>M</mi> <mi>S</mi> </msub> <mo>)</mo> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>6</mn> </mrow> </msup> </mfrac> <msubsup> <mi>F</mi> <mrow> <mi>TW</mi> <mn>2</mn> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>p</mi> <mi>f</mi> </msub> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> Wherein
Figure BDA00004631982000001016
Is an inverse Tracy-Widom second cumulative distribution function. In our simulation
Figure BDA00004631982000001017
3. Simulation result
As shown in fig. 4, the method of the present invention compares the spectrum sensing performance with the detection method based on the feature value. It can be seen that the performance of the inventive method is superior to the eigenvalue based method at all SNR values and total number of samples, especially at low signal-to-noise ratios and small samples.
Example 2
As shown in fig. 2, the present invention provides a cooperative spectrum sensing method based on the free probability theory, which is suitable for the MIMO communication environment, and specifically includes the following steps:
step 1: sampling received signals of a plurality of antennas of each secondary base station, and carrying out centralized processing on the sampled signals;
step 2: solving the average received signal power of all receiving antennas by adopting an algorithm based on free deconvolution by means of the asymptotic free characteristic and the Wishart distribution characteristic of a random matrix according to the noise variance of all the received sampling signals and channels
Figure BDA00004631982000001112
I.e., the detection statistic;
and step 3: according to target false alarm probability pfCalculating a detection threshold tau under the condition that only noise exists by applying Monte Carlo simulation;
and 4, step 4: will be provided with
Figure BDA0000463198200000111
And tau, and determining whether the main base station is transmitting signals. When in useWhen the master base station is transmitting a signal; when in use
Figure BDA0000463198200000113
At this time, the main base station does not transmit a signal.
Step 1 in the method of the present invention comprises:
k secondary base stations BS distributed in different geographical positions1,BS2,…,BSKAnd the cooperative sensing channel is used for judging whether the main base station is transmitting signals. The main base station and each secondary base station are respectively provided with NtAnd NrAnd antennas between which is a MIMO rayleigh fading channel. The sampling rate is 1/TsThen the k-th receiver outputs a sampled signal at time n of
Figure BDA0000463198200000114
K is 1,2, …, K. The sampled signals collected at time n by all the receiving antennas are then
Figure BDA0000463198200000115
Wherein (·)ΗRepresenting a conjugate transpose.
Step 2 in the method of the invention comprises:
(1) inputting: receiving sampling signals { y (n), n ═ 1,2, …, MSAnd channel noise variance σ2. Wherein M isSIs the total number of samples of the received signal;
(2) calculating a sample covariance matrix for a received sampled signal
Figure BDA0000463198200000116
And its eigenvalue { lambdai,i=1,2,…,KNr};
(3) Computing
Figure BDA0000463198200000117
K order moment of
Figure BDA0000463198200000118
And
Figure BDA0000463198200000119
k order moment of
Figure BDA00004631982000001110
(4) Computing
Figure BDA00004631982000001111
The method comprises the following steps:
Figure BDA0000463198200000121
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>=</mo> <msub> <mi>&gamma;</mi> <mi>k</mi> </msub> <mo>/</mo> <mrow> <mo>(</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>M</mi> <mi>S</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mo>}</mo> <mo>;</mo> </mrow> </math>
(5) computing
Figure BDA0000463198200000123
The method comprises the following steps:
<math> <mrow> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <msub> <mi>&mu;</mi> <mrow> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mi>I</mi> </mrow> </msub> </msubsup> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mi>k</mi> </msup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msubsup> <mrow> <mo>{</mo> <mi>&alpha;</mi> </mrow> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>=</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>-</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <msub> <mi>&mu;</mi> <mrow> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mi>I</mi> </mrow> </msub> </msubsup> <mo>}</mo> </mrow> </math>
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>=</mo> <mi>cummom</mi> <mrow> <mo>(</mo> <mo>{</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </math>
(6) computing
Figure BDA0000463198200000128
The method comprises the following steps:
<math> <mrow> <mo>{</mo> <msub> <mi>&rho;</mi> <mi>k</mi> </msub> <mo>}</mo> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <mo>&CenterDot;</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>P</mi> </msubsup> <mo>=</mo> <msub> <mi>&rho;</mi> <mi>k</mi> </msub> <mo>/</mo> <mrow> <mo>(</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mo>}</mo> <mo>;</mo> </mrow> </math>
(7)
Figure BDA00004631982000001211
i.e. muPFirst moment of (d).
The symbol explanation in the above steps:
Figure BDA00004631982000001212
and
Figure BDA00004631982000001213
respectively representing a free addition deconvolution operator and a free multiplication deconvolution operator in a free probability theory;
Figure BDA00004631982000001214
and muPRespectively represent matrices
Figure BDA00004631982000001215
σ2The extreme probability distribution of I (I is the identity matrix) and P;
Figure BDA00004631982000001216
and
Figure BDA00004631982000001217
correspond toLaw mucC taking respectively
Figure BDA00004631982000001219
And
Figure BDA00004631982000001220
the momcumm and cummomm are obtained according to a moment-cumulant formula of the distribution mu, the input of the momcumm is a moment sequence, the output of the momcumm is a cumulant sequence, the input of the cummomm is a cumulant sequence, and the output of the cummomm is a moment sequence.
Step 3 in the method of the present invention comprises:
step 2 is first performed to obtain noise samples only
Figure BDA00004631982000001221
After many such simulations, the calculation
Figure BDA00004631982000001222
Mean value of (theta)PSum variance
Figure BDA00004631982000001223
Figure BDA00004631982000001224
Approximately satisfying a gaussian distribution. Then according to the target false alarm probability pfCalculating a threshold τ = υPQ-1(pf)+θPWherein Q is-1(. cndot.) is an inverse Q-function,
Figure BDA00004631982000001225

Claims (5)

1. A cooperative spectrum sensing method based on a free probability theory is characterized by comprising the following steps:
step 1: sampling received signals of a plurality of antennas of each secondary base station, and carrying out centralized processing on the sampled signals;
step 2: solving the average received signal power of all receiving antennas by adopting an algorithm based on free deconvolution by means of the asymptotic free characteristic and the Wishart distribution characteristic of a random matrix according to the noise variance of all the received sampling signals and channels
Figure FDA00004631981900000111
I.e., the detection statistic;
and step 3: according to target false alarm probability pfCalculating a detection threshold tau under the condition that only noise exists by applying Monte Carlo simulation;
and 4, step 4: will be provided withComparing with tau to judge whether the main base station is transmitting signal; when in use
Figure FDA0000463198190000012
When the master base station is transmitting a signal; when in use
Figure FDA0000463198190000013
At this time, the main base station does not transmit a signal.
2. The cooperative spectrum sensing method based on the free probability theory as claimed in claim 1, wherein step 1 of the method comprises:
k secondary base stations BS distributed in different geographical positions1,BS2,…,BSKThe cooperative sensing channel is used for judging whether the main base station is transmitting signals; the main base station and each secondary base station are respectively provided with NtAnd NrAntennas between which is a MIMO rayleigh fading channel; the sampling rate is 1/TsThen the k-th receiver outputs a sampled signal at time n of
Figure FDA0000463198190000014
K is 1,2, …, K; the sampled signals collected at time n by all the receiving antennas are thenWherein (·)ΗRepresenting a conjugate transpose.
3. The cooperative spectrum sensing method based on the free probability theory as claimed in claim 1, wherein step 2 of the method comprises:
(1) inputting: receiving sampling signals { y (n), n ═ 1,2, …, MSAnd channel noise variance σ2Wherein M isSIs the total number of samples of the received signal;
(2) calculating a sample covariance matrix for a received sampled signal
Figure FDA0000463198190000016
And its eigenvalue { lambdai,i=1,2,…,KNr};
(3) Computing
Figure FDA00004631981900000112
K order moment ofAnd
Figure FDA0000463198190000018
k order moment of
Figure FDA0000463198190000019
(4) Computing
Figure FDA00004631981900000110
The method comprises the following steps:
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>=</mo> <msub> <mi>&gamma;</mi> <mi>k</mi> </msub> <mo>/</mo> <mrow> <mo>(</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>M</mi> <mi>S</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mo>}</mo> <mo>;</mo> </mrow> </math>
(5) computing
Figure FDA0000463198190000023
The method comprises the following steps:
<math> <mrow> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <msub> <mi>&mu;</mi> <mrow> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mi>I</mi> </mrow> </msub> </msubsup> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mi>k</mi> </msup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <msubsup> <mrow> <mo>{</mo> <mi>&alpha;</mi> </mrow> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>=</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&nu;</mi> </msubsup> <mo>-</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <msub> <mi>&mu;</mi> <mrow> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mi>I</mi> </mrow> </msub> </msubsup> <mo>}</mo> </mrow> </math>
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>=</mo> <mi>cummom</mi> <mrow> <mo>(</mo> <mo>{</mo> <msubsup> <mi>&alpha;</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> <mo>;</mo> </mrow> </math>
(6) computingThe method comprises the following steps:
<math> <mrow> <mo>{</mo> <msub> <mi>&rho;</mi> <mi>k</mi> </msub> <mo>}</mo> <mo>=</mo> <mi>momcum</mi> <mrow> <mo>(</mo> <mo>{</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <mo>&CenterDot;</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>&eta;</mi> </msubsup> <mo>}</mo> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <mo>{</mo> <msubsup> <mi>m</mi> <mi>k</mi> <mi>P</mi> </msubsup> <mo>=</mo> <msub> <mi>&rho;</mi> <mi>k</mi> </msub> <mo>/</mo> <mrow> <mo>(</mo> <mfrac> <msub> <mi>KN</mi> <mi>r</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mo>}</mo> <mo>;</mo> </mrow> </math>
(7)
Figure FDA00004631981900000211
i.e. muPThe first moment of (d);
the symbol explanation in the above steps:
Figure FDA00004631981900000212
and
Figure FDA00004631981900000213
respectively representing a free addition deconvolution operator and a free multiplication deconvolution operator in a free probability theory;
Figure FDA00004631981900000214
and muPRespectively represent matrices
Figure FDA00004631981900000215
σ2The extreme probability distribution of I (I is the identity matrix) and P;
Figure FDA00004631981900000216
and
Figure FDA00004631981900000217
correspond to
Figure FDA00004631981900000218
Law mucC taking respectively
Figure FDA00004631981900000219
And
Figure FDA00004631981900000220
momcumm and cummomm are obtained according to a moment-cumulant formula of distribution mu, the input of momcumm is a moment sequence, the output is a cumulant sequence, the input of cummomm is a cumulant sequence, and the output isIs a sequence of moments.
4. The cooperative spectrum sensing method based on the free probability theory as claimed in claim 1, wherein step 3 of the method comprises:
step 2 is first performed to obtain noise samples only
Figure FDA00004631981900000221
After many such simulations, the calculation
Figure FDA00004631981900000222
Mean value of (theta)PSum varianceApproximately satisfying a Gaussian distribution, and then based on a target false alarm probability pfCalculating a threshold τ = υPQ-1(pf)+θPWherein Q is-1(. cndot.) is an inverse Q-function,
Figure FDA00004631981900000224
5. the cooperative spectrum sensing method based on the free probability theory as claimed in claim 1, wherein: the method is applicable to a MIMO communication environment.
CN201410042029.6A 2014-01-28 2014-01-28 Cooperative spectrum sensing method based on free probability theory Expired - Fee Related CN103795481B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410042029.6A CN103795481B (en) 2014-01-28 2014-01-28 Cooperative spectrum sensing method based on free probability theory

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410042029.6A CN103795481B (en) 2014-01-28 2014-01-28 Cooperative spectrum sensing method based on free probability theory

Publications (2)

Publication Number Publication Date
CN103795481A true CN103795481A (en) 2014-05-14
CN103795481B CN103795481B (en) 2017-02-22

Family

ID=50670833

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410042029.6A Expired - Fee Related CN103795481B (en) 2014-01-28 2014-01-28 Cooperative spectrum sensing method based on free probability theory

Country Status (1)

Country Link
CN (1) CN103795481B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103973382A (en) * 2014-05-19 2014-08-06 西安电子科技大学 Frequency spectrum detecting method based on limited random matrix
CN103973381A (en) * 2014-05-19 2014-08-06 西安电子科技大学 Cooperative spectrum detection method based on Cholesky matrix decomposition
CN103973383A (en) * 2014-05-19 2014-08-06 西安电子科技大学 Cooperative spectrum detection method based on Cholesky matrix decomposition and eigenvalue
CN104038944A (en) * 2014-06-25 2014-09-10 哈尔滨工业大学 Cognitive radio spectrum sensing method based on random matrix
CN106338666A (en) * 2016-08-29 2017-01-18 上海交通大学 Power grid stability detection method based on free probability theory
CN108616720A (en) * 2018-03-06 2018-10-02 西安大衡天成信息科技有限公司 A kind of more station spectrum monitoring data compressing methods

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102118201A (en) * 2010-12-31 2011-07-06 吉首大学 Frequency spectrum blind sensing method based on covariance matrix decomposition
CN103297160A (en) * 2013-05-27 2013-09-11 东南大学 Spectrum sensing method and spectrum sensing device for goodness-of-fit test based on normalized eigenvalues

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102118201A (en) * 2010-12-31 2011-07-06 吉首大学 Frequency spectrum blind sensing method based on covariance matrix decomposition
CN103297160A (en) * 2013-05-27 2013-09-11 东南大学 Spectrum sensing method and spectrum sensing device for goodness-of-fit test based on normalized eigenvalues

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
LEI WANG,ETC.: "《Cooperative MIMO Spectrum Sensing Using Free Probability Theory》", 《IEEE》 *
LEI WANG,ETC.: "《Cooperative Spectrum Sensing Using Free Probability Theory》", 《IEEE》 *
王磊等: "《基于RMT的协作MIMO频谱感知》", 《解放军理工大学学报(自然科学版)》 *
王磊等: "《基于RMT的协作检测算法》", 《信号处理》 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103973382A (en) * 2014-05-19 2014-08-06 西安电子科技大学 Frequency spectrum detecting method based on limited random matrix
CN103973381A (en) * 2014-05-19 2014-08-06 西安电子科技大学 Cooperative spectrum detection method based on Cholesky matrix decomposition
CN103973383A (en) * 2014-05-19 2014-08-06 西安电子科技大学 Cooperative spectrum detection method based on Cholesky matrix decomposition and eigenvalue
CN103973381B (en) * 2014-05-19 2016-01-20 西安电子科技大学 Based on the cooperative spectrum detection method of Cholesky matrix decomposition
CN103973383B (en) * 2014-05-19 2016-01-20 西安电子科技大学 The cooperative spectrum detection method with characteristic value is decomposed based on Cholesky
CN103973382B (en) * 2014-05-19 2016-04-27 西安电子科技大学 Based on the frequency spectrum detecting method of limited random matrix
CN104038944A (en) * 2014-06-25 2014-09-10 哈尔滨工业大学 Cognitive radio spectrum sensing method based on random matrix
CN104038944B (en) * 2014-06-25 2017-04-12 哈尔滨工业大学 Cognitive radio spectrum sensing method based on random matrix
CN106338666A (en) * 2016-08-29 2017-01-18 上海交通大学 Power grid stability detection method based on free probability theory
CN106338666B (en) * 2016-08-29 2018-12-25 上海交通大学 A kind of grid stability detection method based on free probability theory
CN108616720A (en) * 2018-03-06 2018-10-02 西安大衡天成信息科技有限公司 A kind of more station spectrum monitoring data compressing methods
CN108616720B (en) * 2018-03-06 2020-02-07 西安大衡天成信息科技有限公司 Multi-station frequency spectrum monitoring data compression processing method

Also Published As

Publication number Publication date
CN103795481B (en) 2017-02-22

Similar Documents

Publication Publication Date Title
CN103795481B (en) Cooperative spectrum sensing method based on free probability theory
CN101507151B (en) Method, device and computer program for classifying a received signal
CN107820255B (en) Improved covariance absolute value cooperative spectrum sensing method
CN103795479A (en) Cooperative spectrum sensing method based on characteristic values
CN103973382B (en) Based on the frequency spectrum detecting method of limited random matrix
CN103973383B (en) The cooperative spectrum detection method with characteristic value is decomposed based on Cholesky
CN105897321A (en) SWIPT signal receiving method based on time slot assignment, and receiver
CN104378320A (en) Anti-interference communication method and receiving device based on single-channel blind source separation
CN104660356A (en) Half-blindness collaborative spectrum sensing method with reliable false-alarm performance
CN110932806A (en) Multi-antenna spectrum sensing method under alpha stable noise fading channel
CN102932047A (en) Detection method for multitape spectrum of cognitive radio (CR) suitable for multiaerial system
CN102271022A (en) Spectrum sensing method based on maximum generalized characteristic value
CN104683050A (en) Multi-antenna total blind spectrum sensing method capable of effectively resisting noise uncertainty
CN104363064A (en) Cooperative spectrum sensing method based on preference users
CN104954089B (en) A kind of frequency spectrum sensing method being compared based on multiple antennas instantaneous power
CN106972900B (en) Based on generalized T2Blind spectrum sensing method for statistics
CN104601264A (en) Multi-antenna spectrum sensing method applicable to high-dimension finite sample conditions
CN103117821A (en) Weighing cooperation spectrum sensing method based on rayleigh quotient
CN202918327U (en) Automatic classification system for digital modulation signal
CN109600181B (en) Spectrum sensing method for multiple antennas
CN103973381B (en) Based on the cooperative spectrum detection method of Cholesky matrix decomposition
Beaulieu et al. Novel simple forms for multivariate Rayleigh and Rician distributions with generalized correlation
Ghorbel et al. Exact performance of cooperative spectrum sensing for cognitive radios with quantized information under imperfect reporting channels
Ma et al. QoS-constrained weighted sum-rate maximization in multi-cell multi-user MIMO systems: An ADMM approach
CN103781089B (en) The system of selection of cognitive user in a kind of cooperation spectrum perception

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20170222

CF01 Termination of patent right due to non-payment of annual fee