面向联合编码的FTN系统的简化均衡算法OA
Simplified Equalization Algorithm for FTN Systems Oriented Towards Joint Coding
为了解决超奈奎斯特(FTN)系统压缩时域因子传输引入的码间串扰问题,提出一种基于联合信源信道编码(JSCC)的 FTN 系统,并设计一种基于 Ungerboeck 模型的简化均衡算法 S-M-BCJR.通过引入信源先验概率信息,结合信道缩短技术与状态选择机制,该算法在降低算法复杂度的同时维持优良的检测性能.结果表明:文中算法在采用二进制相移键控(BPSK)调制时,复杂度较 BCJR 算法降低约 50%,而误码率性能基本持平.
In order to solve the problem of inter symbol interference introduced by compressed time-domain factor transmission in faster-than-Nyquist(FTN)systems,an FTN system based on joint source channel cod-ing(JSCC)is proposed,and a simplified equalization algorithm,S-M-BCJR,based on the Ungerboeck model is designed.By introducing prior probability information of the source and combining channel shortening tech-niques with a state selection mechanism,the proposed algorithm significantly reduces computational complexity while maintaining excellent detection performance..Simulation results show that when using binary phase shift keying(BPSK)modulation,the complexity of the proposed algorithm is reduced by about 50%compared to the standard BCJR algorithm,with nearly equivalent bit error rate performance.
陈燕;王梦瑶;陈辰
华侨大学 信息科学与工程学院,福建 厦门 361021华侨大学 信息科学与工程学院,福建 厦门 361021华侨大学 信息科学与工程学院,福建 厦门 361021
信息技术与安全科学
BCJR算法联合信源信道编码超奈奎斯特系统S-M-BCJR算法
BCJR algorithmjoint source channel codingfaster-than-Nyquist systemS-M-BCJR algorithm
《华侨大学学报(自然科学版)》 2026 (5)
592-597,6
福建省厦门市自然科学基金资助项目(3502Z202472013)
评论