Title :
Cube lattice decoder
Author :
Alghoniemy, Masoud ; Tewfik, Ahmed H.
Author_Institution :
Dept. of Electron. & Commun., Egypt-Japan Univ. of Sci. & Technol., Alexandria, Egypt
Abstract :
An insight to the ℓ1 lattice decoder for flat-fading multiple antenna wireless communications systems is presented in this paper. In particular, we show that by formulating the problem as a bounded error subset selection, the equivalent decoder finds the nearest lattice point to the received signal in the ℓ1 sense. The search for the nearest lattice point is bounded inside a hypercube centered at the received vector; where the dimensions and orientation of the hypercube depends on the channel conditions. The search for the nearest codeword to the received vector is achieved by modeling the problem as a Mixed Integer Linear Program. The proposed decoder achieves near-optimum performance while its complexity is invariant with the operating signal to noise ratio.
Keywords :
decoding; integer programming; linear programming; multifrequency antennas; radiocommunication; bounded error subset selection; cube lattice decoder; flat fading multiple antenna; mixed integer linear programming; signal to noise ratio; wireless communications; Complexity theory; Decoding; Hypercubes; Lattices; MIMO; Signal to noise ratio;
Conference_Titel :
Software, Telecommunications and Computer Networks (SoftCOM), 2010 International Conference on
Conference_Location :
Split, Dubrovnik
Print_ISBN :
978-1-4244-8663-2
Electronic_ISBN :
978-953-290-004-0