检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学信息编码与传输省重点实验室,成都610031
出 处:《计算机工程与应用》2010年第25期64-67,71,共5页Computer Engineering and Applications
基 金:教育部科学技术研究重点项目No.107096;西南交通大学校科研基金项目~~
摘 要:分块归零Turbo编码方案通过采用与分块并行译码相适应的帧分裂和归零编码处理,使码字具有适应分块并行译码的结构特性。相应算法仿真和FPGA设计实现表明,该方案首先无需在相邻分块间考虑重叠比特以保证误码性能,有助于提高短码块长时的译码吞吐率;其次,分块归零处理也使得译码单元内部的状态度量初始值为一个确定值,从而使得各个SISO之间的译码更加独立,降低了译码器FPGA实现复杂度;此外,分块归零的编码结构特性在迭代译码时能够更快收敛。Turbo encoding with frame splitting and trellis zero termination provides a suitable structure for implementing the segmented-based parallel Turbo decoding.The performance simulation, together with the FPGA design and implementation of the proposed Turbo coding scheme unveils that,the overlapping between neighboring segments to guarantee the achieved reliability can be saved, which may be helpful to achieve higher decoding throughput especially for short block size cases.Secondly, the frame splitting with trellis zero termination encoding process implies that both the initial and the end states of each segment are specified with the known all-zeros state, and this may make the SISO decoder respecting to each sub-block independent from each other,which may give rise to a simplified FPGA design.Finally,the segment based trellis zero termination structure property is favorable for a faster convergence in iterative decoding.
关 键 词:TURBO码 分块归零编码处理 并行译码 现场可编程门阵列
分 类 号:TN912.3[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.179