Wide-Sense Time-Invariant Convolutional Codes in Their Parity Check Matrix

  • Giovanni CancellieriEmail author
Part of the Signals and Communication Technology book series (SCT)


The circuit for syndrome calculation in a convolutional code is introduced. The most general method for obtaining the parity check matrix in a convolutional code, starting from its generator matrix, is presented. The minimal encoder circuit is discussed. Wide-sense time-invariant convolutional codes form a closed ensemble. Code puncturation is studied for convolutional codes looking at their parity check matrix. Tail-biting w.s. time-invariant convolutional codes are examined, considering both the generator and the parity check matrix. Unwrapping a quasi-cyclic code for obtaining convolutional codes, in general w.s. time-invariant, leads to a second conceptual bridge between these two classes of codes, in particular regarding their parity check matrix. This observation is important especially for low-density parity-check codes (LDPC codes). Array codes are now interpreted as LDPC block codes without short cycles of 1-symbols. It is possible to obtain an unwrapped form for such codes, in order to construct interesting LDPC convolutional codes. The equivalence between an array code with two component codes and a direct product code between two parity check codes is demonstrated. The concept of truncated circulants is transferred to a description based on the parity check matrix.


LDPC Code Parity Check Convolutional Code Parity Check Matrix Component Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Abramowitz M, Stegun IA (1968) Handbook of mathematical functions. Dover, New YorkGoogle Scholar
  2. Baldi M, Bianchi M, Cancellieri G et al (2012) On the generator matrix of array codes. In: Proceedings of Softcom 2012, Split (Croatia)Google Scholar
  3. Baldi M, Cancellieri G, Chiaraluce F et al (2014) Array convolutional low-density parity-check codes. IEEE Comm Lett 18:336–339CrossRefGoogle Scholar
  4. Esmaeli M, Tadayon MH, Gulliver TA (2011) More on the stopping and minimum distances of array codes. IEEE Trans Comm 59:750–757CrossRefGoogle Scholar
  5. Fan JL (2000) Array codes as low-density parity check codes. In: Proceedings of 2nd international symposium on Turbo Codes, Brest, France, pp 543–546Google Scholar
  6. Fossorier MPC (2004) Quasi-cyclic low-density parity check codes from circulant permutation matrices. IEEE Trans Inf Theor 50:1788–1793CrossRefzbMATHMathSciNetGoogle Scholar
  7. Jimenez-Felstrom AJ, Zigangirov KS (1999) Time-varying periodic convolutional codes with low density parity-check matrix. IEEE Trans Inf Theor 45:2181–2191CrossRefMathSciNetGoogle Scholar
  8. Johannesson R, Zigangirov KS (1999) Fundamentals of convolutional coding. IEEE Press, New YorkCrossRefGoogle Scholar
  9. Milenkovic O, Kashyap N, Leyba D (2008) Shortened array codes of large girth. IEEE Trans Inf Theor 52:3707–3722CrossRefMathSciNetGoogle Scholar
  10. Mittelholtzer T (2002) Efficient encoding and minimum distance bound for Reed-Solomon-type array codes. In: Proceedings of ISIT 2002, Lousanne, Switzerland, p 282Google Scholar
  11. Tanner RM (1981) A recursive approach to low complexity codes. IEEE Trans Inf Theor 27:533–547CrossRefzbMATHMathSciNetGoogle Scholar
  12. Tanner RM, Sridhara D, Sridharan A et al (2004) LDPC block and convolutional codes based on circulant matrices. IEEE Trans Inf Theor 50:2966–2984CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Information EngineeringPolytechnic University of MarcheAnconaItaly

Personalised recommendations