{'fraction_non_alphanumeric': 0.03351519875292284, 'fraction_numerical': 0.0, 'mean_word_length': 5.42, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Robust Transceiver Design in Full-Duplex MIMO Cognitive Radios

We consider a full duplex (FD) multiple-input multiple-output (MIMO) underlay cognitive radio cellular network, in which an FD secondary base-station (BS) serves multiple half-duplex uplink (UL) and downlink secondary users (SUs) at the same time and frequency. We assume that the channel state information (CSI) available at the transmitters is imperfect, and the errors of the CSI are assumed to be norm bounded. Under the impact of channel uncertainty, we address the sum mean-squared-errors minimization problem subject to individual power constraints at the UL SUs, a total power-constraint at the secondary BS, and the interference constraints on the primary users by the secondary network. By transforming the problem into an equivalent semidefinite programming (SDP), we propose an iterative alternating algorithm to compute the transceiver matrices jointly. Moreover, to reduce the high computational complexity of the SDP method, we develop a cutting-set method, which solves the problem by alternating between an optimization step (transceiver design) and a pessimization step (worst-case channel analysis). Numerical results are presented to show the effectiveness and robustness of the proposed algorithms.