DocumentCode :
2826726
Title :
Application of tree search algorithms to bit synchronization
Author :
Pomalaza-RÁez, Carlos A. ; Ohan, Sesiiadrmi
Author_Institution :
Dept. of Eng., Purdue Univ., Fort Wayne, IN, USA
fYear :
1990
fDate :
12-14 Aug 1990
Firstpage :
1026
Abstract :
All-digital bit synchronization systems are studied. Tree search algorithms, in particular the (M,L) algorithm, are proposed for improved estimate of the bit epoch. Numerical results show that this method has greater performance than more conventional bit synchronizers such as the data-transition tracking loop
Keywords :
search problems; signal detection; synchronisation; trees (mathematics); (M,L) algorithm; bit epoch estimate; bit synchronization; tree search algorithms; Data mining; Delay; Detectors; Filters; Mathematical analysis; Random variables; Signal processing; Synchronization; Timing; Tracking loops;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on
Conference_Location :
Calgary, Alta.
Print_ISBN :
0-7803-0081-5
Type :
conf
DOI :
10.1109/MWSCAS.1990.140899
Filename :
140899
Link To Document :
بازگشت