Correlation-Based Optimal Chirp Rate Allocation for Chirp Spread Spectrum Using Multiple Linear Chirps
- Authors
- Kim, Kwang-Yul; Lee, Seung-Woo; Hwang, Yu-Min; Lee, Jae-Seang; Kim, Yon-Sin; Kim, Jin-Young; Shin, Yoan
- Issue Date
- Apr-2017
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- chirp spread spectrum; cross-correlation coefficient; chirp rate allocation; multiple linear chirp; bandwidth separation
- Citation
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E100A, no.4, pp.1088 - 1091
- Journal Title
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- Volume
- E100A
- Number
- 4
- Start Page
- 1088
- End Page
- 1091
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/6415
- DOI
- 10.1587/transfun.E100.A.1088
- ISSN
- 1745-1337
- Abstract
- A chirp spread spectrum (CSS) system uses a chirp signal which changes the instantaneous frequency according to time for spreading a transmission bandwidth. In the CSS system, the transmission performance can be simply improved by increasing the time-bandwidth product which is known as the processing gain. However, increasing the transmission bandwidth is limited because of the spectrum regulation. In this letter, we propose a correlation-based chirp rate allocation method to improve the transmission performance by analyzing the cross-correlation coefficient in the same time-bandwidth product. In order to analyze the transmission performance of the proposed method, we analytically derive the cross correlation coefficient according to the time-bandwidth separation product and simulate the transmission performance. The simulation results show that the proposed method can analytically allocate the optimal chirp rate and improve the transmission performance.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.