Low complexity turbo decoding for binary hidden Markov channels
Low complexity turbo decoding for binary hidden Markov channels
复制标题
二进制隐马尔可夫通道的低复杂度 Turbo 解码
DOI：
10.1109/vetecs.2000.851243
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
J. Villasenor
中科院分区：
文献类型：
--
作者：
J. Garcia;J. Villasenor
我们描述了在二进制隐马尔可夫信道上通信的并行连接码。我们提出了一种简化的解码系统，该系统利用信道的先验统计，明显优于基于传统方法的系统，该方法使用信道交织器来创建假定为无内存的信道。虽然这种方法的性能比最知名的方法略差，但它的主要优点（除了降低复杂性外）是不需要根据信道参数改变turbo编码器结构。
We describe parallel concatenated codes for communications over binary hidden Markov channels. We present a simplified decoding system that utilizes the a priori statistics of the channel and clearly outperforms systems based on the traditional approach of using a channel interleaver to create a channel which is assumed to be memoryless. Although the performance of this method is slightly worse than that of the best known methods, its main advantage (besides the reduced complexity) is that there is no need to change the turbo encoder structure depending on the channel parameters.