Abstract
Low-complexity precoding design without iteration for multiple-input multiple-output channels with finite alphabet input is studied. Contrast to the iterative gradient method for finding the globally optimal precoder, which is time-consuming and computationally complicated, this work studies low-complexity precoding design with high performance. The problem of optimising the mutual information is identical to maximising the minimum Euclidean distance of the input vector at high total power. Hence, the precoding design can be formulated as semi-definite programming problem and thus can be optimally solved. Numerical examples show that the proposed scheme achieves good tradeoff between the computational complexity and high performance compared with the conventional counterparts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
