![]() | Only 14 pages are availabe for public view |
Abstract Bit synchronizers play important role in communication systems. They are intended to provide the receiver with timing information about the start and stop of each received data symbol for proper detection. The information is extracted from the received signal which is a difficult process because of the presence of noise and signal delay unknown t the receiver. In this dissertation, digital implementation s of two synchronization loops, namely the data – transition tracking loop (DTTL), and a zero-crossing bit synchronization loop are proposed. Computer simulations are carried out to evaluate the performance of each loop. In addition, theoretical analysis for the binary – quantized version of the DTTL is performed.The performance of another existing synchronization loop is improved by incur-prorating sequential fillers. Theoretical analysis and computer simulation are pressured to determine the improved of the loop operation. Finally, some introductory work is done to show the utilization of tree-search algorithms in the area of bit synchronization. |