Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Secured communication over frequency-selective fading channels: a practical vandermonde precoding
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
Secure communication in the low-SNR regime: a characterization of the energy-secrecy tradeoff
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Information Theoretic Security
Information Theoretic Security
Multiple-input multiple-output Gaussian broadcast channels with confidential messages
IEEE Transactions on Information Theory
Secure transmission with multiple antennas: part II: the MIMOME wiretap channel
IEEE Transactions on Information Theory
Modulation and coding for linear Gaussian channels
IEEE Transactions on Information Theory
Mutual information and minimum mean-square error in Gaussian channels
IEEE Transactions on Information Theory
Applications of LDPC Codes to the Wiretap Channel
IEEE Transactions on Information Theory
Wireless Information-Theoretic Security
IEEE Transactions on Information Theory
Secure Communication Over Fading Channels
IEEE Transactions on Information Theory
On the Secrecy Capacity of Fading Channels
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Orthogonal frequency division multiplexing (OFDM) systems have enjoyed widespread adoption as the physical layer standard for high data rate wired and wireless networks, due to their ability to efficiently cope with slowly varying dispersive channels. Therefore in searching for feasible implementations of physical layer security techniques, it is appropriate to analyze how existing information theoretic results can be applied to the OFDM structure This paper considers the information theoretic secrecy rates that are achievable in a wiretap OFDM channel when transmitting quadrature amplitude modulation (QAM) constellation symbols. The loss with respect to the secrecy rates obtained with Gaussian distributed inputs is evaluated for both finite constellation cardinalities and in the asymptotic approximation of arbitrarily high cardinality. Moving from the insight gained with this analysis, we propose bit-loading strategies to efficiently allocate the appropriate number of bits in each subchannel, by considering the twofold objective of minimizing the loss with respect to the Gaussian input secrecy capacity and minimizing the total bit load.