Integer-Forcing Message Recovering in Interference Channels

In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compared to the state-of-the-art integer-forcing linear receiver (IFLR), our proposed IFMR approach needs to decode considerably less number of messages. In our method, each receiver recovers independent linear integer combinations of the desirable messages each from two independent equations. We propose an efficient polynomial-time algorithm to sequentially find the equations and integer combinations with maximum rates and analyze its complexity. We evaluate the performance of our scheme and compare the results with the minimum mean-square error linear receiver (MMSELR) and lattice-reduction-aided successive interference cancellation with signal-to-interference-plus-noise ratio maximizing preprocessing (LaR-aided SIC with SINR-Max), as well as the IFLR schemes. The results indicate that our IFMR scheme outperforms the MMSELR and LaR-aided SIC with SINR-Max schemes, in terms of achievable rate, considerably. Also, compared to the IFLR, the IFMR scheme achieves slightly less rates in moderate signal-to-noise ratios, with significantly less overall implementation complexity