TY - GEN

T1 - BER analysis of regularized least squares for BPSK recovery

AU - Ben Atitallah, Ismail

AU - Thrampoulidis, Christos

AU - Kammoun, Abla

AU - Al-Naffouri, Tareq Y.

AU - Hassibi, Babak

AU - Alouini, Mohamed-Slim

N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): URF/1/2221-01
Acknowledgements: This publication is based upon work supported by the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research (OSR) under Award No. URF/1/2221-01.

PY - 2017/6/20

Y1 - 2017/6/20

N2 - This paper investigates the problem of recovering an n-dimensional BPSK signal x0 {’1, 1}$^{n}$ from m-dimensional measurement vector y = Ax+z, where A and z are assumed to be Gaussian with iid entries. We consider two variants of decoders based on the regularized least squares followed by hard-thresholding: the case where the convex relaxation is from {’1, 1}$^{n}$ to „ $^{n}$ and the box constrained case where the relaxation is to [’1, 1]$^{n}$. For both cases, we derive an exact expression of the bit error probability when n and m grow simultaneously large at a fixed ratio. For the box constrained case, we show that there exists a critical value of the SNR, above which the optimal regularizer is zero. On the other side, the regularization can further improve the performance of the box relaxation at low to moderate SNR regimes. We also prove that the optimal regularizer in the bit error rate sense for the unboxed case is nothing but the MMSE detector.

AB - This paper investigates the problem of recovering an n-dimensional BPSK signal x0 {’1, 1}$^{n}$ from m-dimensional measurement vector y = Ax+z, where A and z are assumed to be Gaussian with iid entries. We consider two variants of decoders based on the regularized least squares followed by hard-thresholding: the case where the convex relaxation is from {’1, 1}$^{n}$ to „ $^{n}$ and the box constrained case where the relaxation is to [’1, 1]$^{n}$. For both cases, we derive an exact expression of the bit error probability when n and m grow simultaneously large at a fixed ratio. For the box constrained case, we show that there exists a critical value of the SNR, above which the optimal regularizer is zero. On the other side, the regularization can further improve the performance of the box relaxation at low to moderate SNR regimes. We also prove that the optimal regularizer in the bit error rate sense for the unboxed case is nothing but the MMSE detector.

UR - http://hdl.handle.net/10754/625622

UR - http://ieeexplore.ieee.org/document/7952960/

UR - http://www.scopus.com/inward/record.url?scp=85023777364&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2017.7952960

DO - 10.1109/ICASSP.2017.7952960

M3 - Conference contribution

SN - 9781509041176

SP - 4262

EP - 4266

BT - 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

PB - Institute of Electrical and Electronics Engineers (IEEE)

ER -