Skip to main content
. 2017 Aug 2;17(8):1773. doi: 10.3390/s17081773
Algorithm 1 Binary searching algorithm to find η*
Intput:
   Parameters of detector at SU-Tx: αl, αi, N;
   Parameters of detector at SU-Rx: ρ, N, Tc, Td;
   The upper bound on the missed detection rate: β0.
Output:
   The optimal exponent assigned to the SU-Tx for sensitivity relaxation: η*.
1: if qtx(β0) = qrx(β0) then
2:     η* = 0.5
3: else if qtx(β0) < qrx(β0) then
4:     ηs = 0.5, ηe = 1
5: else
6:     ηs = 0, ηe = 0.5
7: end if
8: while |Pfa(ηs)-Pfa(ηe)|>ϵ do
9:     ηi=(ηs+ηe)/2
10:    if Pfa(ηi) has the same sign with Pfa(ηs) then
11:           ηs=ηi
12:     else
13:           ηe=ηi
14:     end if
15: end while
16: η*=(ηs+ηe)/2