.png){kind=icon}
.png){kind=icon}
Return
Approximate Sum Rate for Integer-Forcing Receiver
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2017.2728525.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The computation of the achievable sum rate for integer-forcing (IF) linear receivers requires the search for the shortest set of linearly independent lattice vectors (SIVP). Since SIVP is considered an NP-hard problem, we propose two approximations to the IF achievable sum rate. The first approximation is suitable for systems with two antennas at both transmitter and receiver (2 x 2 arrays) and is based on the analysis of the Gauss-Lagrange algorithm. The second approximation considers n x n array systems and is based on Minkowski's second theorem. Assuming a block-fading channel with Rayleigh distribution, we have derived the exact probability density function of both approximations. We have used these results to obtain the mean sum-rate, outage probability, and outage rate for uncorrelated fading channels. For the second approximation, the effect of channel correlation on these metrics was also analyzed. An exhaustive series of simulations have been conducted to assess the tightness and robustness of both solutions.
Keywords:
Integer-forcing linear receivers
MIMO
lattice reduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W