CAJ | 학술논문

多信道联合感知问题由于具有非凸性使得求解困难，该文首次尝试用确定性全局优化方法对该问题进行求解。该问题首先被转化为单调优化问题，进而提出一种基于单调优化框架的凸松弛分支定界(BRBCR)算法。仿真实验表明，所提算法较传统的凸优化方法可大幅度提升系统性能，收敛速度较PA(Polyblock Algorithm)以及传统的BRB算法提高了2个数量级，即使信道数目多达16，收敛精度为610-，该文算法16 s内即可收敛。此外，该算法还可为其它算法提供基准，对这些算法性能进行评估。
다신도연합감지문제유우구유비철성사득구해곤난，해문수차상시용학정성전국우화방법대해문제진행구해。해문제수선피전화위단조우화문제，진이제출일충기우단조우화광가적철송이분지정계(BRBCR)산법。방진실험표명，소제산법교전통적철우화방법가대폭도제승계통성능，수렴속도교PA(Polyblock Algorithm)이급전통적BRB산법제고료2개수량급，즉사신도수목다체16，수렴정도위610-，해문산법16 s내즉가수렴。차외，해산법환가위기타산법제공기준，대저사산법성능진행평고。
In Multiband Joint Detection (MJD) of wideband sensing, the most challenge is to set the optimal decision thresholds due to the non-convex nature of the problem. This paper proposes the Branch Reduce and Bound algorithm with Convex Relaxation (BRBCR) technique to optimize the problem which can be transformed into a Monotonic Optimization Problem (MOP). The performance of the proposed method is analyzed through computer simulations. Experiment results show that this method can significantly improve the system performance as compared with the conventional convex optimization method. The convergence speed of the proposed method is two orders of magnitude faster than the Polyblock Algorithm (PA) or the conventional Branch Reduce and Bound (BRB) algorithm. Even though the number of channels is 16 and the convergence precision is 10-6 , this method can converge within 16 s. In addition, the proposed algorithm can also provide an important benchmark for evaluating the performance of other heuristic algorithms targeting with the same problem.