.png){kind=icon}
.png){kind=icon}
Return
Permutation-based frame synchronization method for data transmission systems with short packets
.png){kind=icon}
OA
AI
DOI：10.1016/j.eij.2022.05.005.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper describes the research, development, and implementation of a frame synchronization method for data transmission systems with short packets, specifically those that use nonseparable factorial cod-ing. The key concept of the method is using a permutation as a syncword. This permutation must satisfy the following condition: the minimum Hamming distance to all its circular shifts must be the maximum. The frame synchronization method employs correlation processing and majority processing of data frag-ments transmitted through the communication channel, where the fragment length is equal to the sync -word length. As a result, the proposed frame synchronization method can realize frame synchronization in data transmission systems with adverse noise conditions. Theoretical and practical assessment of the number of accumulated fragments required to establish frame synchronization indicates that imple-menting the proposed method reduces the amount of received data, which subsequently reduces the time required to establish a connection between the transmitter and receiver. In addition, interleaving accumulated fragments further reduces the required number of received fragments.(c) 2022 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Computers and Artificial Intel-ligence, Cairo University. This is an open access article under the CC BY license (http://creativecommons. org/licenses/by/4.0/).
Keywords:
Permutation
Syncword
Frame synchronization
Short-packet communications
Factorial coding
Noise
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.3
Papers:
770
Citations:
1.4K