PROJECT TITLE :

Blind Compute-and-Forward

ABSTRACT:

Compute-and-forward (C&F) is a promising new approach to interference management, enjoying several advantages over other info-theoretic schemes. C&F usually needs channel state info (CSI) at the receivers so that an “optimal” scaling issue will be computed for the needs of decoding. During this paper, a blind C&F theme—i.e., one not requiring CSI—is developed. In place of attempting to compute the optimal scaling factor, this new scheme seeks a number of “good” scalars, i.e., scalars that allow correct decoding despite probably being suboptimal. The region of all such smart scalars is characterised. To find a sensible scalar, a computationally economical theme is proposed that involves error-detection, a hierarchically organized list, also a use of the smoothing lemma from lattice theory. Simulation results show that our blind C&F theme achieves—for a category of nested lattice codes—the same throughput as its CSI-enabled counterpart at the expense of, approximately, a 2-fold increase in computational complexity within the high-throughput region. Moreover, our blind C&F scheme will be applied to multisource multirelay networks with a sensible performance/complexity tradeoff.