By Topic

Precoder Design for K-User Interference Channels with Finite Alphabet Signals

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
B Hari Ram ; Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai - 600 036, India ; Wei Li ; Arun Ayyar ; Jorma Lilleberg
more authors

We consider a MIMO K-user interference channel with finite alphabet signaling, and design an optimal precoder for maximizing the sum mutual information between all transmitter-receiver pairs. Perfect channel knowledge is assumed to be available at all the transmitters, but, decoding of the interfering signals is not done at any receiver. A gradient descent algorithm is employed for maximizing the sum mutual information. Simulation results for the three user interference channel show that when compared to conventional schemes which maximize the signal-to-interference plus noise ratio or minimize the mean squared error, the proposed design achieves a significantly better bit error rate performance. Along with the proposed precoder, the minimum distance detector which decodes the desired signal (while treating interference as colored Gaussian noise with a known covariance) was utilized at all the receivers, in order to get this enhanced performance.

Published in:

IEEE Communications Letters  (Volume:17 ,  Issue: 4 )