Ningtao Chen

Learn More
An iterative algorithm is described, based on the replication process of the Hilbert matrix, for encoding and decoding the Hilbert order. The time complexity of the proposed algorithm is smaller than those published previously, and the space complexity is bounded by a constant. Moreover, the new algorithm has a wider applicability when compared with(More)
Wireless OFDM signals typically have a cyclicprefixed guard interval. The FFT timing synchronisation at the receiver is traditionally based on the peak point of the correlation output between the guard interval and its corresponding duplicate at the OFDM symbol’s tail. This approach does not in general find the optimum timing position for the FFT when the(More)
A fast algorithm for constructing Neighbor-Joining phylogenetic trees has been developed. The CPU time is drastically reduced as compared with Saitou and Nei's algorithm (SN) [4] and Studier and Kepler's algorithm (SK) [5]. The new algorithm includes three techniques: Firstly, a linear array A[N] is introduced to store the sum of every row of the distance(More)
  • 1