This paper studies linear precoding and decoding schemes for K-user interference channel systems. It was shown by Cadambe and Jafar that the interference alignment (IA) algorithm achieves a theoretical bound on degrees of freedom (DOF) for interference channel systems. Based on this, we first introduce a non-iterative solution for the precoding and decoding scheme. To this end, we determine the orthonormal basis vectors of each user's precoding matrix to achieve the maximum DOF, then we optimize precoding matrices in the IA method according to two different decoding schemes with respect to individual rate. Second, an iterative processing algorithm is proposed which maximizes the weighted sum rate. Deriving the gradient of the weighted sum rate and applying the gradient descent method, the proposed scheme identifies a local-optimal solution iteratively. Simulation results show that the proposed iterative algorithm outperforms other existing methods in terms of sum rate. Also, we exhibit that the proposed non-iterative method approaches a local optimal solution at high signal-to-noise ratio with reduced complexity.
Bibliographical noteFunding Information:
This research was supported in part by the MKE (The Ministry of Knowledge Economy), Korea, under the ITRC (Information Technology Research Center) support program supervised by the NIPA (National IT Industry Promotion Agency) (NIPA-2009-2009-C1090-0902-0013), and in part by Seoul R&BD Program (R0911771). This paper was presented in part at the IEEE Global Communications Conference (GLOBECOM), Honolulu, USA, November 2009.
- Gradient decent
- Interference alignment (IA)
- Interference channel
- Linear precoding
- Minimum mean-square error (MMSE) filtering
ASJC Scopus subject areas
- Computer Science Applications
- Electrical and Electronic Engineering
- Applied Mathematics