This paper presents a new approach to perform detection over frequency non-selective Rayleigh fading channels, via first-order Markov chains. We analyze the performance of the proposed algorithms considering various schemes, including iterative detection schemes. In particular, we show that the particular choice of the encoder influences the bit error rate (BER) performance. In order to limit the complexity of the multiple trellis techniques. We show that the complexity can be significantly reduced without affecting the performance.
A low-complexity DQPSK detection algorithm for fading channel / FERRARI G.; FRANCESCHINI M.; RAHELI R.; BELLINI M.. - (2005), pp. 190-194. ((Intervento presentato al convegno Second International Symposium of Wireless Communication Systems 2005 (ISWCS 2005) tenutosi a Siena, Italy nel settembre [10.1109/ISWCS.2005.1547684].
A low-complexity DQPSK detection algorithm for fading channel
FERRARI, Gianluigi;RAHELI, Riccardo;
2005
Abstract
This paper presents a new approach to perform detection over frequency non-selective Rayleigh fading channels, via first-order Markov chains. We analyze the performance of the proposed algorithms considering various schemes, including iterative detection schemes. In particular, we show that the particular choice of the encoder influences the bit error rate (BER) performance. In order to limit the complexity of the multiple trellis techniques. We show that the complexity can be significantly reduced without affecting the performance.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
