Title :
Self-adaptive sequence detection via the M-algorithm
Author :
Shah, Sayyed Ali R ; Paris, Bernd-Peter
Author_Institution :
Wireless Commun. Div., Ericsson inc., Richardson, TX, USA
Abstract :
The problem of implementing self-adaptive algorithms in real-time is addressed. Self-adaptive equalization determines the transmitted sequence without using a training sequence. Tree search procedures have been shown to be more effective than dynamic programming. Simulation results for tree search procedures based on the M-algorithm are presented. The focus is on the effects of channel order, sequence length and modulation format on the BER. The performance of the M-algorithm is compared with traditional approaches
Keywords :
Markov processes; adaptive equalisers; estimation theory; modulation; real-time systems; signal detection; trees (mathematics); BER; M-algorithm; channel order; dynamic programming; modulation format; performance; self-adaptive equalization; self-adaptive sequence detection; sequence length; simulation; transmitted sequence; tree search procedures; Bit error rate; Digital communication; Intersymbol interference; Land mobile radio; Maximum likelihood detection; Maximum likelihood estimation; Modulation; Positron emission tomography; State-space methods; Wireless communication;
Conference_Titel :
Communications, 1997. ICC '97 Montreal, Towards the Knowledge Millennium. 1997 IEEE International Conference on
Conference_Location :
Montreal, Que.
Print_ISBN :
0-7803-3925-8
DOI :
10.1109/ICC.1997.595034
