UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Lattice-reduction for power optimisation using the fast least-squares solution-seeker algorithm

Rico, UP; Alsusa, E; Masouros, C; (2009) Lattice-reduction for power optimisation using the fast least-squares solution-seeker algorithm. In: IEEE Wireless Communications and Networking Conference, WCNC.

Full text not available from this repository.

Abstract

The power constraint factor in precoding methods plays an important role in the reduction of SER at the receiver. The value of this scaling factor lies in the individual power assigned to the transmit symbols prior the transmission. Such assignment will depend entirely on the matrix condition of the channel, in this case the eigenvalue's power of the channel inverse. Thus, the minimisation of this power constraint will rely on closing the power gap among the transmit symbols, and one solution is to use an auxiliary vector for fixing the matrix condition. This is equivalent to solving the integer leastsquares problem. For achieving this specific goal there are two effective choices: the lattice-reduction, whose objective is to reduce the basis of any given matrix, and the sphere techniques which enumerate all the lattice points inside a sphere centered at the query point. Both choices aim for finding or fitting an approximated least-squares solution occasioning astonishing results in performance when minimising the scaling factor prior to transmit. © 2009 IEEE.

Type:Proceedings paper
Title:Lattice-reduction for power optimisation using the fast least-squares solution-seeker algorithm
DOI:10.1109/WCNC.2009.4917778
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Electronic and Electrical Engineering

Archive Staff Only: edit this record