A deterministic algorithm that achieves the PMEPR of c log n for multicarrier signals
暂无分享,去创建一个
[1] Joel Spencer. Ten Lectures on the Probabilistic Method: Second Edition , 1994 .
[2] Z. Nehari. On Bounded Bilinear Forms , 1957 .
[3] Babak Hassibi,et al. On multicarrier signals where the PMEPR of a random codeword is asymptotically logn , 2004, IEEE Transactions on Information Theory.
[4] J.B. Huber,et al. A comparison of peak power reduction schemes for OFDM , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.
[5] Kenneth G. Paterson,et al. On the existence and construction of good codes with low peak-to-average power ratios , 2000, IEEE Trans. Inf. Theory.
[6] Babak Hassibi,et al. On the average power of multiple subcarrier intensity modulated optical signals: Nehari's problem and coding bounds , 2003, IEEE International Conference on Communications, 2003. ICC '03..
[7] J. Spencer. Six standard deviations suffice , 1985 .
[8] J. Spencer. Ten lectures on the probabilistic method , 1987 .
[9] John M. Cioffi,et al. Efficient algorithms for reducing PAR in multicarrier systems , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[10] James A. Davis,et al. Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes , 1998, IEEE Trans. Inf. Theory.
[11] Karl Zeller,et al. Schwankung von Polynomen zwischen Gitterpunkten , 1964 .