Multiantenna Secure Cognitive Radio Networks With Finite-Alphabet Inputs: A Global Optimization Approach for Precoder Design

This paper considers the precoder design for multiantenna secure cognitive radio networks. We use finite-alphabet inputs as the signaling and exploit statistical channel state information (CSI) at the transmitter. We maximize the secrecy rate of the secondary user and control the transmit power and...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on wireless communications Ročník 15; číslo 4; s. 3044 - 3057
Hlavní autoři: Weiliang Zeng, Zheng, Yahong Rosa, Chengshan Xiao
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.04.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Antennas
Cognitive radio
Computation
Design engineering
Erbium
finite-alphabet inputs
global optimization
linear precoding
Mathematical analysis
Mathematical models
Maximization
MIMO
Multi-antenna secure cognitive radio networks
multiple-input multiple-output
Networks
Optimization
Receivers
Secrecy aspects
statistical channel state information
linear precoding
statistical channel state information
multiple-input multiple-output
finite-alphabet inputs
Multiantenna secure cognitive radio networks
global optimization
ISSN:1536-1276, 1558-2248
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper considers the precoder design for multiantenna secure cognitive radio networks. We use finite-alphabet inputs as the signaling and exploit statistical channel state information (CSI) at the transmitter. We maximize the secrecy rate of the secondary user and control the transmit power and the power leakage to the primary receivers that share the same frequency spectrum. The secrecy rate maximization is important for practical systems, but challenging to solve, mainly due to two reasons. First, the secrecy rate with statistical CSI is computationally prohibitive to evaluate. Second, the optimization over the precoder is a nondeterministic polynomial-time hard (NP-hard) problem. We utilize an accurate approximation of the secrecy rate to reduce the computational effort and then propose a global optimization approach based on branch-and-bound method. The idea is to define a simplex and transform the secrecy rate into a concave function. The derived concave function converges to the secrecy rate when the defined simplex shrinks down. Using this feature, we solve a sequence of concave maximization problems over iteratively shrinking simplices and eventually attain the globally optimal solution that maximizes the approximation of the secrecy rate. When the complexity is concerned, a low-complexity variant with limited number of iterations can be used in practice. We demonstrate the performance gains when compared with others through numerical examples.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2016.2515090