J4 ›› 2013, Vol. 40 ›› Issue (4): 161-166.doi: 10.3969/j.issn.1001-2400.2013.04.027

• Original Articles • Previous Articles     Next Articles

Research on the recognition algorithm of Turbo codes on  trellis termination

LI Xiaotian;ZHANG Runsheng;LI Yanbin   

  1.  (The 54th Research Institude of CETC, Shijiazhuang  050081, China)
  • Received:2012-03-14 Online:2013-08-20 Published:2013-10-10
  • Contact: LI Xiaotian E-mail:lxtrichard@126.com

Abstract:

For the blind recognition of Turbo codes in information interception, the recognition algorithm of turbo codes on trellis termination fall into following two parts. In coding structure recognition, turbo codes on trellis termination is defined as linear block codes, so the blind recognition of code length and start is achieved by analyzing the rank of codes matrix with a different number of columns and a different start; In encoder parameter recognition, by comparing the sequence matrix's column vector before and after interleaving and determining the decision threshold, the influence of error codes whose number is lower than the decision threshold is removed, and consequently, the problem of poor fault-tolerant performance in the traditional interleaving mode recognition method is solved. Simulation shows that the correct percentage of recognition is higher than 80% at 10-3 BER, and confirms the validity and reliability of the algorithm.

Key words: channel coding, Turbo codes, trellis termination, blind recognition, fault-tolerant performance

CLC Number: 

  • TN911.22