Please use this identifier to cite or link to this item:
|Title:||On the relationship between the multi-antenna secrecy communications and cognitive radio communications||Authors:||Zhang, L.
|Issue Date:||Jun-2010||Citation:||Zhang, L., Zhang, R., Liang, Y.-C., Xin, Y., Cui, S. (2010-06). On the relationship between the multi-antenna secrecy communications and cognitive radio communications. IEEE Transactions on Communications 58 (6) : 1877-1886. ScholarBank@NUS Repository. https://doi.org/10.1109/TCOMM.2010.06.090063||Abstract:||This paper studies the achievable rates of the multi-antenna or multiple-inputmultiple-output (MIMO) secrecy channel with multiple single-/multi-antenna eavesdroppers. By assuming Gaussian input, the maximum achievable secrecy rate is obtained with the optimal transmit covariance matrix that maximizes the minimum difference between the channel mutual information of the secrecy user and those of the eavesdroppers. The maximum secrecy rate computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently by existing methods. To handle this difficulty, this paper explores a new relationship between the secrecy channel and the recently developed cognitive radio (CR) channel, in which the secondary user transmits over the same spectrum simultaneously with multiple primary users, subject to the received interference power constraints at the primary users, or the so-called "interference temperature (IT)" constraints. By constructing an auxiliary multi-antenna CR channel that has the same channel responses as the secrecy channel, this paper shows that the optimal transmit covariance to achieve the maximum secrecy rate is the same as that to achieve the CR spectrum sharing capacity with properly selected IT constraints. Thereby, finding the optimal complex transmit covariance matrix for the secrecy channel becomes equivalent to searching over a set of real IT constraints in the auxiliary CR channel. Based on this relationship, efficient algorithms are proposed to solve the non-convex secrecy rate maximization problem by transforming it into a sequence of convex CR spectrum sharing capacity computation problems, under various setups of the secrecy channel. © 2010 IEEE.||Source Title:||IEEE Transactions on Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/56904||ISSN:||00906778||DOI:||10.1109/TCOMM.2010.06.090063|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.