Low complexity trellis representations of convolutional codes via sectionalization of the minimal trellis

It has been shown by McEliece and Lin that convolutional codes can be represented by a minimal trellis structure in order to reduce the decoding complexity of the Viterbi algorithm. This trellis module has an irregular structure presenting sections with different number of states. In this paper we present the sectionalization of the minimal trellis module which yields a more compact and regular trellis representation (in terms of maximum number of states and total number of sections) with the same decoding complexity and distance spectrum of the minimal trellis module. We investigate the effects of the trellis sectionalization over the trellis and merge complexity measures. A set of rules are constructed to govern these effects. A list of the most compact sectionalized trellis modules with the same complexities than the minimal module is shown for codes of several rates. We show that various trellis topologies proposed in the literature are specific cases of the sectionalized minimal trellis.

[1]  Florian Hug,et al.  Searching for high-rate convolutional codes via binary syndrome trellises , 2009, 2009 IEEE International Symposium on Information Theory.

[2]  Mao-Chao Lin,et al.  On (n, n-1) convolutional codes with low trellis complexity , 2002, IEEE Trans. Commun..

[3]  Miguel Garcia,et al.  Saving energy and improving communications using cooperative group-based Wireless Sensor Networks , 2013, Telecommun. Syst..

[4]  D. Graupe,et al.  Punctured Convolutional Codes of Rate (n - 1)/n and Simplified Maximum Likelihood Decoding , 1979 .

[5]  Richard Demo Souza,et al.  High-rate systematic recursive convolutional encoders: minimal trellis and code search , 2012, EURASIP J. Adv. Signal Process..

[6]  Jong Hyuk Park,et al.  Energy efficient virtual MIMO communication for wireless sensor networks , 2009, Telecommun. Syst..

[7]  Alexander Vardy,et al.  Optimal sectionalization of a trellis , 1996, IEEE Trans. Inf. Theory.

[8]  Richard Demo Souza,et al.  Reduced complexity decoding of convolutional codes based on the M-algorithm and the minimal trellis , 2012, Ann. des Télécommunications.

[9]  Alexandros Katsiotis,et al.  Flexible Convolutional Codes: Variable Rate and Complexity , 2012, IEEE Transactions on Communications.

[10]  Øyvind Ytrehus,et al.  On maximum length convolutional codes under a trellis complexity constraint , 2004, J. Complex..

[11]  W. Dehaene,et al.  Energy-scalability enhancement of wireless local area network transceivers , 2004, IEEE 5th Workshop on Signal Processing Advances in Wireless Communications, 2004..

[12]  Enrico Magli,et al.  Energy-Efficient Coding and Error Control for Wireless Video-Surveillance Networks , 2004, Telecommun. Syst..

[13]  Heinrich Meyr,et al.  On Complexity, Energy- and Implementation-Efficiency of Channel Decoders , 2010, IEEE Transactions on Communications.

[14]  Irina E. Bocharova,et al.  Rational rate punctured convolutional codes for soft-decision Viterbi decoding , 1997, IEEE Trans. Inf. Theory.

[15]  Mao-Chao Lin,et al.  On ( ) Convolutional Codes With Low Trellis Complexity , 2002 .

[16]  Bartolomeu F. Uchôa Filho,et al.  Minimal Trellis Modules and Equivalent Convolutional Codes , 2006, IEEE Transactions on Information Theory.

[17]  Liang-Gee Chen,et al.  IC design of an adaptive Viterbi decoder , 1996 .

[18]  Dong Sam Ha,et al.  A low-power Viterbi decoder design for wireless communications applications , 1999, Twelfth Annual IEEE International ASIC/SOC Conference (Cat. No.99TH8454).

[19]  Richard Demo Souza,et al.  Hardware implementation of a Viterbi decoder using the minimal trellis , 2010, 2010 4th International Symposium on Communications, Control and Signal Processing (ISCCSP).

[20]  Robert J. McEliece,et al.  On the BCJR trellis for linear block codes , 1996, IEEE Trans. Inf. Theory.

[21]  Marc Moonen,et al.  Joint DOA and multi-pitch estimation based on subspace techniques , 2012, EURASIP J. Adv. Signal Process..

[22]  Richard Demo Souza,et al.  Error control coding in wireless sensor networks , 2010, Telecommun. Syst..

[23]  J. Bibb Cain,et al.  Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[24]  Alexandros Katsiotis,et al.  New Constructions of High-Performance Low-Complexity Convolutional Codes , 2010, IEEE Transactions on Communications.

[25]  R. Brualdi,et al.  Handbook Of Coding Theory , 2011 .

[26]  R. McEliece,et al.  The trellis complexity of convolutional codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[27]  Richard Demo Souza,et al.  Convolutional codes under a minimal trellis complexity measure , 2006, IEEE Transactions on Communications.