We consider the transmissions of successive short packets. Each of them combines information to be transmitted (codeword) with information for synchronizing the frame (syncword). For short packets, the cost of including syncwords is no longer negligible and its design requires careful optimization. In particular, a trade-off arises depending on the way the total transmit power or the total frame length is split among the syncword and the codeword. Assuming optimal finite-length codes, we develop tight upper bounds on the probability of erroneous synchronization, for both frames with concatenated syncword and frames with superimposed syncword. We use these bounds to optimize this trade-off. Simulation results show that the proposed bounds and analysis have practical relevance for short packet communication system design.

我们考虑连续短分组的传输。它们每个都将要发送的信息（码字）与用于同步帧（同步字）的信息结合在一起。对于短数据包，包括同步字的成本不再可忽略不计，其设计需要仔细优化。特别地，根据总发射功率或总帧长度在同步字和码字之间分配的方式而产生折衷。假设有最佳的有限长度代码，我们为具有串联同步字的帧和具有重叠同步字的帧开发了错误同步概率的严格上限。我们使用这些界限来优化这种权衡。仿真结果表明，所提出的范围和分析对短分组通信系统设计具有实际意义。