论文标题
与内存的线性周期性通道的新帧同步算法 - 完整版
A New Frame Synchronization Algorithm for Linear Periodic Channels with Memory -- Full Version
论文作者
论文摘要
识别接收器接收到的一系列符号的开始时间，通常称为\ emph {frame Synchronization}，是在数字通信系统中采用时间多头传输的良好性能的关键任务。在这项工作中，我们关注的是\ emph {frame Synchronization}的线性通道，其中通道脉冲响应是周期性的，并且加性高斯噪声是相关的和循环的。此类渠道出现在许多通信方案中，包括窄带电源线通信和干扰有限的无线通信。我们根据最佳似然比测试的简化来得出框架同步算法，假设通道脉冲响应在接收器上是未知的，这适用于许多实际情况。表征了每种派生算法的计算复杂性，并提出了选择几乎最佳同步序列的过程。这项工作中得出的算法比非合并相关检测器获得更好的性能，实际上，促进了复杂性和性能之间的受控权衡。
Identifying the start time of a sequence of symbols received at the receiver, commonly referred to as \emph{frame synchronization}, is a critical task for achieving good performance in digital communications systems employing time-multiplexed transmission. In this work we focus on \emph{frame synchronization} for linear channels with memory in which the channel impulse response is periodic and the additive Gaussian noise is correlated and cyclostationary. Such channels appear in many communications scenarios, including narrowband power line communications and interference-limited wireless communications. We derive frame synchronization algorithms based on simplifications of the optimal likelihood-ratio test, assuming the channel impulse response is unknown at the receiver, which is applicable to many practical scenarios. The computational complexity of each of the derived algorithms is characterized, and a procedure for selecting nearly optimal synchronization sequences is proposed. The algorithms derived in this work achieve better performance than the noncoherent correlation detector, and, in fact, facilitate a controlled tradeoff between complexity and performance.
