1. Vandermonde-Based Unitary Precoding Method for Integer-Forcing Design.
- Author
-
Jiang, Hua, Kong, Linghong, and Du, Sidan
- Subjects
VANDERMONDE matrices ,POLYNOMIAL time algorithms ,RIESZ spaces ,COMPUTATIONAL complexity ,ERROR rates ,GAUSSIAN channels - Abstract
An integer-forcing linear receiver has significantly better performance than conditional receivers for slow-fading channels because it directly recovers an integer linear combination of signals instead of decoding all signals. The performance in terms of achievable rate, outage probability, and error rate can be improved with a unitary matrix precoder imposed at each channel realization. In this paper, a new special unitary matrix precoding approach is proposed to reduce the computational complexity. Different from the parameterization technique with many parameters, the new method constructs a unitary Vandermonde matrix with only a single parameter. The optimal Vandermonde matrix is determined on the basis of the shortest vector of a lattice generated by the precoding matrix in which the single parameter is searched. Therefore, its complexity is reduced to a polynomial time, whereas the traditional unitary precoder has exponential complexity. Simulation results show that the proposed scheme can achieve the performance similar to the benchmark schemes but with much lower complexity. The scheme offers a good trade-off between performance and complexity. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF