ABSTRACT

Kokkonen & Pietilä (2002) proposed a bit synchronization algorithm, which basically computes time averages of bit energies for all twenty possible bit boundary positions and selects the position which maximizes the bit energy. This method uses bit energy efficiently, so it can operate with weak signal. But it similarly can’t be applied to bit synchronization under high dynamic conditions.