  We present a novel algorithm for the completion of low-rank matrices whose
entries are limited to a finite discrete alphabet. The proposed method is based
on the recently-emerged proximal gradient (PG) framework of optimization
theory, which is applied here to solve a regularized formulation of the
completion problem that includes a term enforcing the discrete-alphabet
membership of the matrix entries.
