Integer-Forcing Linear Receiver Design with Slowest Descent Method

Compute-and-forward (CPF) strategy is one category of network coding in which a relay will compute and forward a linear combination of source messages according to the observed channel coefficients, based on the algebraic structure of lattice codes. Recently, based on the idea of CPF, integer forcing (IF) linear receiver architecture for MIMO system has been proposed to recover different integer combinations of lattice codewords for further original message detection. In this paper, we consider the problem of IF linear receiver design with respect to the channel conditions. Instead of exhaustive search, we present practical and efficient suboptimal algorithms to design the IF coefficient matrix with full rank such that the total achievable rate is maximized, based on the slowest descent method. Numerical results demonstrate the effectiveness of our proposed algorithms.

No reviews yet.

No comments yet.