Optimal Power Allocation for OFDM-Based Wire-Tap Channels with Arbitrarily Distributed Inputs

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 6 figures. The paper was submitted to WiCON on March 31, 2011, and has been accepted for publication

Scientific paper

In this paper, we investigate power allocation that maximizes the secrecy rate of orthogonal frequency division multiplexing (OFDM) systems under arbitrarily distributed inputs. Considering commonly assumed Gaussian inputs are unrealistic, we focus on secrecy systems with more practical discrete distributed inputs, such as PSK, QAM, etc. While the secrecy rate achieved by Gaussian distributed inputs is concave with respect to the transmit power, we have found and rigorously proved that the secrecy rate is non-concave under any discrete inputs. Hence, traditional convex optimization methods are not applicable any more. To address this non-concave power allocation problem, we propose an efficient algorithm. Its gap from optimality vanishes asymptotically at the rate of $O(1/\sqrt{N})$, and its complexity grows in the order of O(N), where $N$ is the number of sub-carriers. Numerical results are provided to illustrate the efficacy of the proposed algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Optimal Power Allocation for OFDM-Based Wire-Tap Channels with Arbitrarily Distributed Inputs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Power Allocation for OFDM-Based Wire-Tap Channels with Arbitrarily Distributed Inputs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Power Allocation for OFDM-Based Wire-Tap Channels with Arbitrarily Distributed Inputs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-712002

All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.