Research Repository

A fast constrained sphere decoder for ill conditioned communication systems

Kanaras, I and Chorti, A and Rodrigues, MRD and Darwazeh, I (2010) 'A fast constrained sphere decoder for ill conditioned communication systems.' IEEE Communications Letters, 14 (11). 999 - 1001. ISSN 1089-7798

Full text not available from this repository.

Abstract

This letter proposes a fast constrained sphere decoder for ill conditioned communications systems that exhibits less complexity than but similar performance to the generalised sphere decoder. The operational principle is based on i) the reduction of the search space by setting the hypersphere initial radius to be equal to the distance to a semidefinite program (SDP) estimate; and ii) the introduction of a heuristic pruning rule to limit the GSD spanning tree. The new algorithm achieves significant reduction in the required computational effort at the expense of a small error penalty for large dimensional systems in low signal to noise ratio (SNR) regimes. © 2010 IEEE.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Clare Chatfield
Date Deposited: 15 Jul 2015 18:24
Last Modified: 05 Feb 2019 19:15
URI: http://repository.essex.ac.uk/id/eprint/9095

Actions (login required)

View Item View Item