Performance Analysis of UWB Signal Acquisition Algorithms According to Frame Interval and Bin Spacing in Indoor Wireless Channels 


Vol. 29,  No. 12, pp. 1623-1632, Dec.  2004


PDF
  Abstract

In this paper, we analyze the performance of linear search and bit reversal search algorithms based on the single-dwell serial search for rapId UWB (Ultra Wide Band) signal acquisition in typical indoor wireless channel environments. Simulation results according to bin spacing and frame interval In IEEE 802.15. Task Group 3a UWB indoor wireless channels show that bit reversal search algorithm achieves much smaller normalized mean acquisition time than linear search algorithm. In particular, it is found that the normalized mean acquisItion time of the bit reversal search according to the range of searching termination interval closely matches the ideal case. In addition, We observe that the acquisition performance of bit reversal search algorithm becomes much better as bin spacing gets finer.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Oh, S. Yang, Y. Shin, "Performance Analysis of UWB Signal Acquisition Algorithms According to Frame Interval and Bin Spacing in Indoor Wireless Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 12, pp. 1623-1632, 2004. DOI: .

[ACM Style]

Joongok Oh, Suckchel Yang, and Yoan Shin. 2004. Performance Analysis of UWB Signal Acquisition Algorithms According to Frame Interval and Bin Spacing in Indoor Wireless Channels. The Journal of Korean Institute of Communications and Information Sciences, 29, 12, (2004), 1623-1632. DOI: .

[KICS Style]

Joongok Oh, Suckchel Yang, Yoan Shin, "Performance Analysis of UWB Signal Acquisition Algorithms According to Frame Interval and Bin Spacing in Indoor Wireless Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 12, pp. 1623-1632, 12. 2004.