Answers are grounded in this paper and cite their sources.
We present an algorithm based on lattice reduction for the fast decoding of diagonal differential modulation across multiple antenna. While the complexity of the maximum-likelihood (ML) algorithm is exponential both in the number of antenna and the rate, the complexity of our approximate lattice algorithm is polynomial in the number of antennas and the rate. We show that the error performance of our lattice algorithm is very close to the ML algorithm.
No takes yet. Share an insight, caveat, or question.
Clarkson et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: