Effect of anti-sparse prior on PAPR performance analysis

The dynamic range of a signal is a critical parameter in many practical applications. Especially in communication engineering high dynamic range mostly is considered as an important problem for technical reasons. norm minimization, or in other words an anti-sparse penalty, naturally spreads the signal evenly. The advantage of spreading is the optimally reduced dynamic range of transformed signals which is a pleasant feature for many application, e.g. peak to average power ratio (PAPR) reduction for orthogonal frequency-division multiplexing (OFDM) systems. In this study, some of the main proximal splitting algorithms are deployed for ℓ∞-norm minimization. The stochastic model of anti-sparsity is investigated with the empirical results of proximal methods and already existing ℓ∞-norm minimization methods. A flexible prior is proposed to model anti-sparsity and it is used for more realistic PAPR performance analysis.

[1]  Erik G. Larsson,et al.  PAR-Aware Large-Scale Multi-User MIMO-OFDM Downlink , 2012, IEEE Journal on Selected Areas in Communications.

[2]  Wotao Yin,et al.  Signal Representation with Minimum L_Infinity Norm , 2012 .

[3]  Wotao Yin,et al.  Democratic Representations , 2014, ArXiv.

[4]  Guillermo Sapiro,et al.  Sparse Representation for Computer Vision and Pattern Recognition , 2010, Proceedings of the IEEE.

[5]  Yuan Ji,et al.  Applications of beta-mixture models in bioinformatics , 2005, Bioinform..

[6]  Hervé Jégou,et al.  Anti-sparse coding for approximate nearest neighbor search , 2011, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[7]  Saliha Buyukcorak,et al.  Lognormal Mixture Shadowing , 2015, IEEE Transactions on Vehicular Technology.

[8]  Slawomir Stanczak,et al.  On Some Physical Layer Design Aspects for Machine Type Communication , 2016, WSA.

[9]  Onur Agin,et al.  Regression clustering with lower error VIA EM algorithm , 2014, 2014 22nd Signal Processing and Communications Applications Conference (SIU).

[10]  Y. Nesterov.  A method for solving the convex programming problem with convergence rate O(1/k^2) , 1983 .

[11]  Roman Vershynin,et al.  Uncertainty Principles and Vector Quantization , 2006, IEEE Transactions on Information Theory.

[12]  Wotao Yin,et al.  Signal representations with minimum ℓ∞-norm , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[13]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[14]  Günes Karabulut-Kurt,et al.  The Effect of Shadow Fading Distributions on Outage Probability and Coverage Area , 2015, 2015 IEEE 81st Vehicular Technology Conference (VTC Spring).

[15]  Jean-Jacques Fuchs,et al.  Spread representations , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[16]  Thomas Strohmer,et al.  PAPR reductioni in OFDM using kashin's representation , 2009, 2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications.