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 nite 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.

Achievable secrecy rates for wiretap OFDM with QAM constellations

RENNA, FRANCESCO;LAURENTI, NICOLA;
2011

Abstract

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 nite 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.
2011
1st International ICST Workshop on Secure Wireless Networks, SECURENETS 2011
9781936968091
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/187246
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact