We analyze trellis search algorithms for joint sequence estimation and channel tracking, assuming rapidly varying frequency-selective Rayleigh fading. The Generalized Viterbi Algorithm (GVA) and the M-Algorithm (MA) are considered for approximately searching the maximum likelihood path in the trellis diagram and compared with the Viterbi Algorithm (VA). All algorithms perform channel tracking utilizing Per-Survivor Processing (PSP) techniques by associating a channel estimate to each hypothetical trellis path, according to the Least Mean Square (LMS) or Recursive Least Square (RLS) algorithm. To reproduce a typical mobile digital communication system, a Time-Division Multiple Access (TDMA) data frame is assumed, where each user transmits a block of information symbols with known preamble and tail. For Doppler bands up to one hundredth the symbol frequency and a three path delay profile, the MA is shown to exhibit a slightly better performance than the GVA for an equal number of survivors, and outperform the VA.
Efficient trellis search algorithms for adaptive MLSE on fast Rayleigh fading channels / P., Castoldi; Raheli, Riccardo; G., Marino. - (1994), pp. 196-200. (Intervento presentato al convegno IEEE Globecom Commun. Theory Mini-Conf. (CTMC '94) tenutosi a San Francisco, California, U.S.A. nel November 1994) [10.1109/CTMC.1994.512604].
Efficient trellis search algorithms for adaptive MLSE on fast Rayleigh fading channels
RAHELI, Riccardo;
1994-01-01
Abstract
We analyze trellis search algorithms for joint sequence estimation and channel tracking, assuming rapidly varying frequency-selective Rayleigh fading. The Generalized Viterbi Algorithm (GVA) and the M-Algorithm (MA) are considered for approximately searching the maximum likelihood path in the trellis diagram and compared with the Viterbi Algorithm (VA). All algorithms perform channel tracking utilizing Per-Survivor Processing (PSP) techniques by associating a channel estimate to each hypothetical trellis path, according to the Least Mean Square (LMS) or Recursive Least Square (RLS) algorithm. To reproduce a typical mobile digital communication system, a Time-Division Multiple Access (TDMA) data frame is assumed, where each user transmits a block of information symbols with known preamble and tail. For Doppler bands up to one hundredth the symbol frequency and a three path delay profile, the MA is shown to exhibit a slightly better performance than the GVA for an equal number of survivors, and outperform the VA.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
