Advertisement

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

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

Abstract

The syndrome former sub-matrix is introduced. The generator matrix of a convolutional code can be constructed by means of a procedure called null ex-OR sum of clusters of syndromes. Inversely, it is possible to operate by means of the column construction of the parity check matrix. The importance of a parity check matrix in minimal form is stressed. A strict-sense time-invariant convolutional code in its parity check matrix is characterized by a unique interleaved parity check polynomial. It is possible to distinguish between low-rate and high-rate convolutional codes, taking into account their parity check matrix. The dual of a low-rate convolutional code is a high-rate convolutional code, but the outermost parts of the frame show different structures in the two matrices. A systematic encoder circuit based on the unique interleaved parity check polynomial is presented. Traditional encoder circuits for convolutional codes described by means of the parity check matrix are discussed, considering a unique shift register in observer arrangement. Not well designed convolutional codes and the presence of periodic rows in their parity check matrix are studied. The tail-biting arrangement of a convolutional code is revisited looking at its parity check matrix. When the code is not well-designed, the tail-biting convolutional code has a generator matrix not of full rank, and its periodic row in the parity check matrix vanishes. A second conceptual bridge between cyclic block codes and convolutional codes is presented, now based on the parity check matrix. Modified lengthening in the generator matrix and H-extension in the parity check matrix support this correspondence. A family tree for many classes of error correcting codes is depicted. Not well-designed convolutional codes can be considered the dual with respect to convolutional codes whose parity check matrix is not in its minimal form.

Keywords

Code Rate LDPC Code Parity Check Cyclic Code Convolutional 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.

References

  1. 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
  2. Johannesson R, Zigangirov KS (1999) Fundamentals of convolutional coding. IEEE Press, New YorkCrossRefGoogle Scholar
  3. Lin S, Costello DJ (2004) Error control coding. Pearson/Prentice-Hall, Upper Saddle RiverGoogle Scholar
  4. MacWilliams FJ, Sloane NJA (1977) The theory of error correcting codes. North Holland, New YorkzbMATHGoogle Scholar
  5. Ryan WE, Lin S (2009) Channel codes: classical and modern. Cambridge University Press, CambridgeCrossRefGoogle Scholar
  6. Tanner RM (1981) A recursive approach to low complexity codes. IEEE Trans Inf Theor 27:533–547CrossRefzbMATHMathSciNetGoogle Scholar
  7. 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