期刊文献+

分块归零处理Turbo译码器设计与实现 被引量:1

Design and implementation of Turbo decoder based on frame splitting and trellis zero termination
下载PDF
导出
摘要 分块归零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.
出处 《计算机工程与应用》 CSCD 北大核心 2010年第25期64-67,71,共5页 Computer Engineering and Applications
基金 教育部科学技术研究重点项目No.107096 西南交通大学校科研基金项目~~
关键词 TURBO码 分块归零编码处理 并行译码 现场可编程门阵列 Turbo code frame splitting trellis zero termination encoding parallel decoding Field-Programmable Gate Array(FPGA)
  • 相关文献

参考文献6

  • 1Berrou C, Glavieux A, Thitimajshima P.Near shannon limit error-correcting coding and decoding:Turbo-codes[C]//Proc Int Conf Communications, Geneva, Switzerland, 1993 : 1064-1070.
  • 2Hsu J, Wang C.A parallel decoding scheme for Turbo codes[C]// IEEE Int Conf on Circuits and Systems, 1998:445-448.
  • 3Yoon S, Bar-Ness Y.A parallel MAP algorithm for low latency Turbo decoding[J].IEEE Commun Letters,2002,6(7) :288-298.
  • 4Wan Ke, Chen Qing-chun, Fan Ping-zhi,A novel parallel Turbo coding technique based on flame split and trellis terminating[C]// The 4th Int Conf on Parallel and Distributed Computing Applications and Technologies,2003:927-930.
  • 5Ngatched T M N, Takawira F.Simple stopping criterion for Turbo decoding [J].IEEE Electronics Letters, 2001,37 ( 22 ) : 1350-1351.
  • 63GPP Group.Multiplexing and channel coding(Release 8).3GPP TS36.212 V8.4.0 Technical specification group radio access network[S] .2008.

同被引文献13

  • 1闫涛,杜兴民.基于Log-MAP算法的Turbo码量化分析[J].空军工程大学学报(自然科学版),2005,6(4):52-54. 被引量:2
  • 2C Berrou, A Glavieux, P Thitimajshima. Near shannon limit error-correcting coding and decoding: Turbo- codes [A]. in Proc. Int. Conf. Communications [C]. Geneva, Switzerland, 1993-05. 1064-1070.
  • 33GPP TS36.212 v8.4.0, Technical specification group radio access network; Evolved universal terrestrial radio access(E-UTRA) [S]. Multiplexing and channel coding (Release 8), 2008.
  • 4G Montorsi, S Benedetto, "Design of fixed-point iterative decoders for concatenated codes with interleavers [J]. IEEE J. Selected Areas in Commun., 2001, 19(5): 871-882.
  • 5Jiang Li, R G Maunder, B M A1-Hashimi, L Hanzo. Design of fixed-point processing based Turbo codes using extrinsic information transfer charts [A]. in Proe. of IEEE VTC-Fall [C]. 2010. 1-5.
  • 6G Masera, G Piccinini, R Roch. VLSI architectures for Turbo codes [J]. IEEE Trans. VLSI Systems, 1999, 7(3): 369-379.
  • 7H E Gammal, A R Hammons. Analyzing the turbo decoder using the Gaussian approximation [J]. IEEE Trans. Inform. Theory, 2001, 47(2): 671-686.
  • 8Fu Mingyue. Stochastic analysis of Turbo decoding [J]. IEEE J. Selected Areas in Commun., 2005, 51(1): 81-100.
  • 9J Vogt, A Finger. Improving the Max Log Map Turbo decoder [J]. Electronics Letters, 2000, 36(23): 1937-1938.
  • 10J P Woodard, L Hanzo. Comparative study of Turbo decoding techniques: an overview [J]. IEEE Trans. Veh. Techn., 2000, 49(6): 2208-2233.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部