Performance Analysis of Discrete-valued Vector Reconstruction Based on Box-constrained Sum of L1 Regularizers | IEEE Conference Publication | IEEE Xplore

Performance Analysis of Discrete-valued Vector Reconstruction Based on Box-constrained Sum of L1 Regularizers

Publisher: IEEE

Abstract:

In this paper, we analyze the asymptotic performance of a convex optimization-based discrete-valued vector reconstruction from linear measurements. We firstly propose a b...View more

Abstract:

In this paper, we analyze the asymptotic performance of a convex optimization-based discrete-valued vector reconstruction from linear measurements. We firstly propose a box-constrained version of the conventional sum of absolute values (SOAV) optimization, which uses a weighted sum of ℓ 1 regularizers as a regularizer for the discrete-valued vector. We then derive the asymptotic symbol error rate (SER) performance of the box-constrained SOAV (Box-SOAV) optimization theoretically by using convex Gaussian min-max theorem. Simulation results show that the empirical SER performances of Box-SOAV and the conventional SOAV are very close to the theoretical result for Box-SOAV when the problem size is sufficiently large.
Date of Conference: 12-17 May 2019
Date Added to IEEE Xplore: 17 April 2019
ISBN Information:

ISSN Information:

Publisher: IEEE
Conference Location: Brighton, UK

References

References is not available for this document.