Name
Abstract | ||
|---|---|---|
This paper addresses the problem of precoding matrix selection in large-scale MIMO cellular systems, where traditional codebook search methods may result in high complexity for the receiver due to the increased codebook size. For this reason, we propose to first compute an unconstrained reference codeword, and then search the codebook for the best approximation of such reference codeword, using low-complexity distance metrics. We consider two possible choices for the distance metric: the chordal distance, previously used in the literature for codebook design, and a newly defined distance function based on the sum of phase differences between the elements of two complex matrices. We show that the proposed method can match or outperform state-of-the-art approaches (based on capacity or mutual information) with significantly lower per-candidate complexity. |
Year | Venue | Field |
|---|---|---|
2016 | 2016 IEEE 84TH VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL) | Approximation algorithm,Mimo systems,Computer science,Metric (mathematics),MIMO,Theoretical computer science,Code word,Mutual information,Precoding,Codebook |
DocType | ISSN | Citations |
Conference | 2577-2465 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Federico Penna | 1 | 261 | 19.71 |
| Hongbing Cheng | 2 | 80 | 7.84 |
| Jungwon Lee | 3 | 890 | 95.15 |