On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing - Part I
Totally blind channel estimation for OFDM on fast varying mobile radio channels
IEEE Transactions on Wireless Communications
A new derivation of least-squares-fitting principle for OFDM channel estimation
IEEE Transactions on Wireless Communications
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
IEEE Communications Magazine
Hi-index | 0.00 |
In recent years the quadratic program (QP) is applied for the blind signal detection of the time-varying OFDM systems. The minimum solution of the QP could be obtained through the class of the sphere decoder (SD) algorithm, which is equivalent to the tree search approach. In this paper, we derive some formulas describing the probability information about the received signal. With these formulas, a novel mechanism is proposed to sort all the possible candidate values of the tree search orderly. Different from other SD candidate ordering mechanisms, the new mechanism prevents the search from going deep on the wrong subtrees, ensuring that the correct path is found with as least complexity as possible. The simulations prove the effectiveness of the new method.