Guard Interval Extension for Individual Users in Uplink OFDMA Mobile Communication Systems 


Vol. 32,  No. 5, pp. 417-425, May  2007


PDF
  Abstract

While the cyclic prefix lengths of downlink OFDMA(Orthogonal Frequency Division Multiple Access) systems are determined based on the maximum delay spreads encountered in cellular environments, the guard interval of uplink OFDMA systems should consider the timing offsets of uplink signals as well as the delay spread lengths. Especially in the cases of initial accesses, handovers, and considerable time elapsed without data transmissions between base and mobile stations in a large cell, uplink timing offsets can be large and a very long guard interval length may be required. In order to keep the small size of the cyclic prefix in uplink OFDMA systems, the systems require a method of extending the guard intervals for users with large timing offsets without affecting the cyclic prefix length of the system. This paper proposes a method extending the guard intervals of individual users in uplink OFDMA systems.

  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]

M. Rim, D. Lim, B. Jeong, T. Noh, "Guard Interval Extension for Individual Users in Uplink OFDMA Mobile Communication Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 5, pp. 417-425, 2007. DOI: .

[ACM Style]

Minjoong Rim, Dae-Woon Lim, Byung-Jang Jeong, and Taegyun Noh. 2007. Guard Interval Extension for Individual Users in Uplink OFDMA Mobile Communication Systems. The Journal of Korean Institute of Communications and Information Sciences, 32, 5, (2007), 417-425. DOI: .

[KICS Style]

Minjoong Rim, Dae-Woon Lim, Byung-Jang Jeong, Taegyun Noh, "Guard Interval Extension for Individual Users in Uplink OFDMA Mobile Communication Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 5, pp. 417-425, 5. 2007.