A Closed-Form BER Expression for Overlap-Based CSS System Design 


Vol. 34,  No. 4, pp. 469-475, Apr.  2009


PDF
  Abstract

Overlap is one of the techniques for increasing bit rate in chirp spread spectrum (CSS). More overlaps can offer higher data throughput; however, they may cause more intersymbol interference (ISI) at the same time, resulting in serious bit error rate (BER) performance degradation. Thus, the number of overlaps should be decided according to the required BER performance. In this paper, we derive a closed form expression for BER of the overlap-based CSS system, exploiting the approximated Gaussian Q function. The derived BER expression includes the number of overlaps as a parameter, and thus, would be very useful in determining the number of overlaps for a specified BER. The numerical results demonstrate that the BER derived in a closed form closely agrees with the simulated BER.

  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]

T. Yoon, Y. Lee, M. Lee, I. Song, S. Yoon, "A Closed-Form BER Expression for Overlap-Based CSS System Design," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 4, pp. 469-475, 2009. DOI: .

[ACM Style]

Taeung Yoon, Youngyoon Lee, Myungsoo Lee, Iickho Song, and Seokho Yoon. 2009. A Closed-Form BER Expression for Overlap-Based CSS System Design. The Journal of Korean Institute of Communications and Information Sciences, 34, 4, (2009), 469-475. DOI: .

[KICS Style]

Taeung Yoon, Youngyoon Lee, Myungsoo Lee, Iickho Song, Seokho Yoon, "A Closed-Form BER Expression for Overlap-Based CSS System Design," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 4, pp. 469-475, 4. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880