One-bit quantization with time-varying sampling thresholds (also known as random dithering) has recently found significant utilization potential in statistical signal processing applications due to its relatively low power consumption and low implementation cost. In addition to such advantages, an attractive feature of one-bit analog-to-digital converters (ADCs) is their superior sampling rates as compared to their conventional multi-bit counterparts. This characteristic endows one-bit signal processing frameworks with what one may refer to as sample abundance. We show that sample abundance plays a pivotal role in many signal recovery and optimization problems that are formulated as (possibly non-convex) quadratic programs with linear feasibility constraints. Of particular interest to our work are low-rank matrix recovery and compressed sensing applications that take advantage of one-bit quantization. We demonstrate that the sample abundance paradigm allows for the transformation of such problems to merely linear feasibility problems by forming large-scale overdetermined linear systems -- thus removing the need for handling costly optimization constraints and objectives. To make the proposed computational cost savings achievable, we offer enhanced randomized Kaczmarz algorithms to solve these highly overdetermined feasibility problems and provide theoretical guarantees in terms of their convergence, sample size requirements, and overall performance. Several numerical results are presented to illustrate the effectiveness of the proposed methodologies.

翻译：基于时变采样阈值（也称为随机抖动）的单比特量化，因其相对较低的功耗和实现成本，近年来在统计信号处理应用中展现出巨大的应用潜力。除这些优势外，单比特模数转换器（ADC）的另一个吸引人的特性是其相比传统多比特转换器具有更高的采样速率。这一特性赋予了单比特信号处理框架所谓的“样本丰度”。我们证明，在诸多被建模为（可能非凸）二次规划并带有线性可行性约束的信号恢复与优化问题中，样本丰度发挥着关键作用。我们的工作尤其关注利用单比特量化的低秩矩阵恢复和压缩感知应用。我们证明，样本丰度范式允许通过构建大规模超定线性系统，将此类问题转化为单纯的线性可行性问题——从而免去处理高昂的优化约束和目标函数。为使所提出的计算成本节省措施得以实现，我们提供了增强型随机Kaczmarz算法来求解这些高度超定的可行性问题，并给出了其在收敛性、样本量要求和整体性能方面的理论保证。最后，通过多项数值结果展示了所提方法的有效性。