Novel Synchronization Scheme for Cooperative ISAC Systems
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929692669378560 |
|---|---|
| author | Peng, Qihao Ren, Hong Peng, Zhendong Pan, Cunhua Elkashlan, Maged Wang, Dongming Wang, Jiangzhou You, Xiaohu |
| author_facet | Peng, Qihao Ren, Hong Peng, Zhendong Pan, Cunhua Elkashlan, Maged Wang, Dongming Wang, Jiangzhou You, Xiaohu |
| contents | Carrier frequency and timing synchronization play the fundamental roles in cooperative integrating communication and sensing (ISAC). To mitigate the effects of synchronization error, this paper develops a novel synchronization scheme in cell-free massive multiple-input multiple-output (mMIMO) systems. First, we characterize the impacts of pilot contamination on synchronization performance, i.e., Cramer-Rao bound (CRB). Furthermore, a maximum likelihood algorithm is presented to estimate the CFO and TO among the pairing APs. Then, to minimize the sum of CRBs, we devise a synchronization strategy based on a pilot-sharing scheme by jointly optimizing the cluster classification, synchronization overhead, and pilot-sharing scheme, while simultaneously considering the overhead and each AP's synchronization requirements. To solve this NP-hard problem, we simplify it into two sub-problems, namely cluster classification problem and the pilot sharing problem. To strike a balance between synchronization performance and overhead, we first classify the clusters by using the K-means algorithm, and propose a criteria to find a good set of master APs. Then, the pilot-sharing scheme is obtained by using the swap-matching operations. Simulation results validate the accuracy of our derivations and demonstrate the effectiveness of the proposed scheme over the benchmark schemes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_18775 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Novel Synchronization Scheme for Cooperative ISAC Systems Peng, Qihao Ren, Hong Peng, Zhendong Pan, Cunhua Elkashlan, Maged Wang, Dongming Wang, Jiangzhou You, Xiaohu Signal Processing Carrier frequency and timing synchronization play the fundamental roles in cooperative integrating communication and sensing (ISAC). To mitigate the effects of synchronization error, this paper develops a novel synchronization scheme in cell-free massive multiple-input multiple-output (mMIMO) systems. First, we characterize the impacts of pilot contamination on synchronization performance, i.e., Cramer-Rao bound (CRB). Furthermore, a maximum likelihood algorithm is presented to estimate the CFO and TO among the pairing APs. Then, to minimize the sum of CRBs, we devise a synchronization strategy based on a pilot-sharing scheme by jointly optimizing the cluster classification, synchronization overhead, and pilot-sharing scheme, while simultaneously considering the overhead and each AP's synchronization requirements. To solve this NP-hard problem, we simplify it into two sub-problems, namely cluster classification problem and the pilot sharing problem. To strike a balance between synchronization performance and overhead, we first classify the clusters by using the K-means algorithm, and propose a criteria to find a good set of master APs. Then, the pilot-sharing scheme is obtained by using the swap-matching operations. Simulation results validate the accuracy of our derivations and demonstrate the effectiveness of the proposed scheme over the benchmark schemes. |
| title | Novel Synchronization Scheme for Cooperative ISAC Systems |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2405.18775 |