期刊文献+

凿孔卷积码距离谱的计算

On the computation of the distance spectrum for punctured convolutional codes
下载PDF
导出
摘要 针对基于距离谱的凿孔卷积码优化设计问题,提出了一种高效的凿孔卷积码距离谱计算方法.利用卷积码状态图和凿孔码凿孔图样构造一个长度为凿孔周期的状态转移矩阵序列,并利用状态转移矩阵序列的乘积计算传输函数和距离谱.为了避免符号矩阵的求逆运算,又给出了基于状态逐步消除的传输函数计算方法.分析和仿真结果表明:这种方法既有较高的计算效率,又有很强的实用性,可以用来进行优化设计或者理论分析. For the optimum design problem of punctured convolutional codes based on the distance spectrum, an efficient computing method of the distance spectrum for punctured convolutional codes is proposed. A state transition matrix sequence is constructed with the state graph and punctured pattern, and the product of the matrix sequence is used to compute the transfer function and distance spectrum; furthermore, a state reduction algorithm for computing the transfer function is proposed to avoid the inverting operation of the symbolic matrix. Analyses and simulation results show that this method for computing the distance spectrum can provide efficiency and practicability, and may be used for optimal design or theoretical analysis.
出处 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2008年第6期1089-1093,共5页 Journal of Xidian University
基金 国家自然科学基金资助(60602034)
关键词 凿孔卷积码 距离谱 转移矩阵 传输函数 状态消除算法 punctured convolutional codes distance spectrum transition matrix transfer function state reduction algorithm
  • 相关文献

参考文献11

  • 1Hagenauer J. Rate-Compatible Punctured Convolutional Codes (RCPC Codes) and their Applications[J]. IEEE Trans on Communications, 1988, 36(4): 389-400.
  • 2周秦英,葛晖,王新梅,许卫东.基于分块数据传输的新型HARQ系统[J].西安电子科技大学学报,2005,32(5):720-723. 被引量:3
  • 3Cheng J. Coding Performance of Hybrid ARQ Schemes [J]. IEEE Trans on Communications, 2006, 54(6) : 1 017-1 029.
  • 4Hunter T E, Nosratinia A. Diversity through Coded Cooperation [J]. IEEE Trans on Wireless Communications, 2006, 5(2) : 283-289.
  • 5Noh K, Serpedin E, Suter B. Optimum Cooperation of the Cooperative Coding Scheme for Frequency Division Half- Duplex Relay Channels [J]. IEEE Trans on Wireless Communications, 2007, 6(5) : 1 654-1 658.
  • 6Proakis J G. Digital Communications [M]. New York: McGraw-Hill, 2001.
  • 7CedervaU M, Johannesson R. A Fast Algorithm for Computing Distance Spectrum of Convolutional Codes[J]. IEEE Trans on Information Theory, 1989, 35(6) : 1 146-1 158.
  • 8Li J, Kurtas E. Punctured Convolutional Codes Revisited: the Exact State Diagram and Its Implications[C]//The 38th Asilomar Conference on Signals, Systems and Computers. Piseataway NJ: IEEE, 2004:2 015-2 019.
  • 9Wolf J K, Viterbi A J. On the Weight Distribution of Linear Block Codes Formed from Convolutional Codes[J]. IEEE Trans on Communications, 1996, 44(9) : 1 049-1 051.
  • 10Pimentel C. On the Computation of Weight Enumerators for Convolutional Codes[J]. IEEE Trans on Communications, 2003, 51(3):313-317.

二级参考文献4

  • 1Dennett S. The CDMA2000 ITU-R RTT Candidate Submission[S]. TIA TR45.5, 1998.
  • 2Zhou Y Q, Wang J. Optimum Sub-packet Transmission for Turbo-coded Hybrid ARQ System[A]. ICC'03: Vol 5[C]. Anchorage: IEEE International Conference, 2003. 11-15.
  • 3Chase D. Code Combing-a Maximum-likelihood Decoding Approach for Combing an Arbitrary Number of Noise Packers[J]. IEEE Trans on Commun, 1985, 33(5): 385-393.
  • 4Yamamoto H. Viterbi Decoding Algorithm for Convolutional Codes with Repeat Request[J]. IEEE Trans on Information, 1980, 26(2): 540-547.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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