Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
On the complexity of sphere decoding in digital communications
IEEE Transactions on Signal Processing
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Closest point search in lattices
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
A Schnorr-Euchner sphere decoder (SESD) with increasing radii algorithm (IRA) named as the IRA-SESD and two ordering preprocessing strategies are considered in this paper. Statistical constrain radii (SCRs) are obtained from probabilistic distribution of path metric in order to statistically prune branches. Ordering preprocessing schemes are jointly applied to further reduce computational complexity of the IRA-SESD. This ordering aided IRA-SESD presents near-ML performance with low complexity. The proposed scheme has been evaluated by computer simulations for uncoded multiple-input multiple-output (MIMO) systems.