Secrecy rates of finite-input intersymbol interference channels
| buir.advisor | Duman, Tolga Mete | |
| dc.contributor.author | Hanoğlu, Serdar | |
| dc.date.accessioned | 2016-11-21T08:10:00Z | |
| dc.date.available | 2016-11-21T08:10:00Z | |
| dc.date.copyright | 2016-10 | |
| dc.date.issued | 2016-10 | |
| dc.date.submitted | 2016-11-15 | |
| dc.department | Department of Electrical and Electronics Engineering | en_US |
| dc.description | Cataloged from PDF version of article. | en_US |
| dc.description | Thesis (M.S.): Bilkent University, Department of Electrical and Electronics Engineering, İhsan Doğramacı Bilkent University, 2016. | en_US |
| dc.description | Includes bibliographical references (leaves 65-68). | en_US |
| dc.description.abstract | Due to the broadcast nature of the communication medium, security is a critical problem in wireless networks. Securing the transmission at the physical layer is a promising alternative or complement to the conventional higher level techniques such as encryption. During the past decade, various studies have been carried out which investigate such possibilities in providing secrecy for different scenarios. On the other hand, secrecy over intersymbol interference (ISI) channels has not received significant attention, and much work remains to be done. With this motivation, we focus on secrecy rates of finite-input ISI channels for both fixed and fading channel coefficients. We argue that the secrecy rates of ISI channels can be computed by the forward recursion of the BCJR algorithm. Moreover, by utilizing Markov input distributions for transmission over the ISI channels, achievable secrecy rates can be increased. However, the existing iterative method in the literature to obtain the optimal Markov input distribution is computationally complex as many BCJR recursions are needed. Thus, we propose an alternative solution by introducing a codebook based approach. Particularly, among the existing Markov input distributions in the codebook, we propose to select the one which spectrally matches the main channel. Our numerical results reveal that the proposed low complexity approach undergoes a minimal loss with respect to the existing iterative algorithm while offering a considerably reduced complexity. We also propose injection of artificial noise (AN) to increase the secrecy rates, and show that this is especially useful for moderate and high signal to noise ratio (SNR) values where the use of Markov input distributions is not beneficial. We inject AN to frequencies where the eavesdropper's channel is better than the main channel. We show that this approach significantly increases the secrecy rates compared to the existing methods. Furthermore, we consider the effect of channel state information (CSI) on the secrecy rates, and demonstrate that availability of eavesdropper's CSI at the transmitter is highly beneficial in terms of the achievable secrecy rates. | en_US |
| dc.description.degree | M.S. | en_US |
| dc.description.statementofresponsibility | by Serdar Hanoğlu. | en_US |
| dc.format.extent | xiv, 68 leaves : charts (some color). | en_US |
| dc.identifier.itemid | B154649 | |
| dc.identifier.uri | http://hdl.handle.net/11693/32525 | |
| dc.language.iso | English | en_US |
| dc.publisher | Bilkent University | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Physical layer security | en_US |
| dc.subject | Intersymbol-interference channels | en_US |
| dc.subject | Artificial noise | en_US |
| dc.subject | Fading|afinite-alphabet inputs | en_US |
| dc.subject | Finite state Markov channels | en_US |
| dc.subject | Spectral shaping | en_US |
| dc.title | Secrecy rates of finite-input intersymbol interference channels | en_US |
| dc.title.alternative | Sonlu girdi setine sahip simgeler arası girişim kanallarındaki güvenlik seviyesi | en_US |
| dc.type | Thesis | en_US |