A greedy selection based approach GfcLLL for fixed-complexity LLL reductions (FCLLL) is proposed. Two greedy selection strategies are presented. Simulations show that each of the two strategies gives Babai points with lower bit error rate in a more or less equal or much shorter CPU time than existing FCLLL algorithms.