Name
Abstract | ||
|---|---|---|
The LLL lattice reduction has been widely used to decrease the bit error rate (BER) of the Babai point, but its running time varies much from matrix to matrix. To address this problem, some fixed-complexity LLL reductions (FCLLL) have been proposed. In this letter, we propose two greedy selection-based FCLLL algorithms: GfcLLL(1) and GfcLLL(2). Simulations show that both of them give Babai points with lower BER in similar or much shorter CPU time than existing ones. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/LCOMM.2017.2712600 | IEEE Communications Letters |
Keywords | Field | DocType |
Bit error rate,Zinc,Complexity theory,Indexes,Lattices,MIMO,Real-time systems | Discrete mathematics,CPU time,Mathematics,Lattice reduction,Bit error rate | Journal |
Volume | Issue | ISSN |
21 | 9 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| jinming wen | 1 | 103 | 14.52 |
| Xiao-Wen Chang | 2 | 208 | 24.85 |