2000 character limit reached
GfcLLL: A Greedy Selection Based Approach for Fixed-Complexity LLL Reduction
Published 4 Jul 2016 in cs.IT and math.IT | (1607.01064v2)
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 paper, 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.