Low complexity precoding for MIMOME wiretap channels based on cut-off rate
dc.citation.epage | 2992 | en_US |
dc.citation.spage | 2988 | en_US |
dc.contributor.author | Aghdam, Sina Rezaei | en_US |
dc.contributor.author | Duman, Tolga M. | en_US |
dc.coverage.spatial | Barcelona, Spain | en_US |
dc.date.accessioned | 2018-04-12T11:49:01Z | |
dc.date.available | 2018-04-12T11:49:01Z | |
dc.date.issued | 2016 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 10-15 July 2016 | en_US |
dc.description | Conference Name: IEEE International Symposium on Information Theory, ISIT 2016 | en_US |
dc.description.abstract | We propose a low complexity transmit signal design scheme for achieving information-theoretic secrecy over a MIMO wiretap channel driven by finite-alphabet inputs. We assume that the transmitter has perfect channel state information (CSI) of the main channel and also knows the statistics of the eavesdropper's channel. The proposed transmission scheme relies on jointly optimizing the precoder matrix and the artificial noise so as to maximize the achievable secrecy rates. In order to lower the computational complexity associated with the transmit signal design, we employ a design metric using the cut-off rate instead of the mutual information. We formulate a gradient-descent based optimization algorithm and demonstrate via extensive numerical examples that the proposed signal design scheme can yield an enhanced secrecy performance compared with the existing solutions in spite of its relatively lower computational complexity. The impacts of the modulation order as well as the number of antennas at the transmitter and receiver ends on the achievable secrecy rates are also investigated. | en_US |
dc.description.provenance | Made available in DSpace on 2018-04-12T11:49:01Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 179475 bytes, checksum: ea0bedeb05ac9ccfb983c327e155f0c2 (MD5) Previous issue date: 2016 | en |
dc.identifier.doi | 10.1109/ISIT.2016.7541847 | en_US |
dc.identifier.issn | 2157-8095 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/37720 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/ISIT.2016.7541847 | en_US |
dc.source.title | Proceedings of the IEEE International Symposium on Information Theory, ISIT 2016 | en_US |
dc.subject | Cut-off rate | en_US |
dc.subject | Finite-alphabet inputs | en_US |
dc.subject | MIMO wiretap channel | en_US |
dc.subject | Physical layer security | en_US |
dc.subject | Precoding | en_US |
dc.title | Low complexity precoding for MIMOME wiretap channels based on cut-off rate | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Low complexity precoding for MIMOME wiretap channels based on cut-off rate.pdf
- Size:
- 1.07 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version