TY - GEN
T1 - Secure degrees of freedom of N ×n ×m wiretap channel with a K-antenna cooperative jammer
AU - Nafea, Mohamed
AU - Yener, Aylin
PY - 2015/9/9
Y1 - 2015/9/9
N2 - The secure degrees of freedom (s.d.o.f.) of a multiantenna Gaussian wiretap channel with N antennas at the transmitter and receiver and an arbitrary number of antennas, M, at the wiretapper is characterized when a multiantenna cooperative jammer (CJ) is available as a helper. This generalizes our previous result that assumed the same number of antennas at the eavesdropper as the legitimate parties. In particular, for arbitrary values of N andM, the s.d.o.f. is derived for all possible values of the number of antenna at the CJ, K. The achievability is based on a variety of signalling, beamforming, and alignment techniques which vary according to the value of K, whether M is larger than, smaller than, or equal to N, and whether the s.d.o.f. is integer valued or not an integer. The converse is based on combining an upper bound for the s.d.o.f. which allows for cooperation between the transmitter and CJ and holds for some values of K, with another upper bound which exploits the secrecy and reliability constraints and holds for other values of K.
AB - The secure degrees of freedom (s.d.o.f.) of a multiantenna Gaussian wiretap channel with N antennas at the transmitter and receiver and an arbitrary number of antennas, M, at the wiretapper is characterized when a multiantenna cooperative jammer (CJ) is available as a helper. This generalizes our previous result that assumed the same number of antennas at the eavesdropper as the legitimate parties. In particular, for arbitrary values of N andM, the s.d.o.f. is derived for all possible values of the number of antenna at the CJ, K. The achievability is based on a variety of signalling, beamforming, and alignment techniques which vary according to the value of K, whether M is larger than, smaller than, or equal to N, and whether the s.d.o.f. is integer valued or not an integer. The converse is based on combining an upper bound for the s.d.o.f. which allows for cooperation between the transmitter and CJ and holds for some values of K, with another upper bound which exploits the secrecy and reliability constraints and holds for other values of K.
UR - http://www.scopus.com/inward/record.url?scp=84953718130&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84953718130&partnerID=8YFLogxK
U2 - 10.1109/ICC.2015.7248977
DO - 10.1109/ICC.2015.7248977
M3 - Conference contribution
AN - SCOPUS:84953718130
T3 - IEEE International Conference on Communications
SP - 4169
EP - 4174
BT - 2015 IEEE International Conference on Communications, ICC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Conference on Communications, ICC 2015
Y2 - 8 June 2015 through 12 June 2015
ER -