• DocumentCode
    3518869
  • Title

    New unit-memory codes obtained by puncturing periodically time-varying convolutional codes

  • Author

    Filho, Bartolomeu F Uchoa ; Palazzo, Reginaldo, Jr. ; De Almeida, Celso ; Said, Amir

  • Author_Institution
    FEEC, Campinas Univ., Brazil
  • Volume
    2
  • fYear
    1998
  • fDate
    9-13 Aug 1998
  • Firstpage
    534
  • Abstract
    New good high-rate punctured convolutional codes (PCC) are presented. While any previously known PCC was derived by puncturing a low-rate time-invariant mother code, the new PCC are shown to be derived by puncturing a periodically time-varying convolutional code (PTVCC) acting as the mother code. To find the new PCC, we first show that any PTVCC (hence, any PCC) is equivalent to a type of time-invariant convolutional code. Focusing on a fixed unit-memory (UM) code, we also show that under certain conditions there exists a PTVCC along with a puncturing pattern that is equivalent to that UM code. A combinatorial optimization algorithm is then used to search for the new good UM codes for which equivalent PCC do exist. We observe that the new PCC compare favorably to the previously known PCC in several respects
  • Keywords
    combinatorial mathematics; convolutional codes; optimisation; search problems; combinatorial optimization algorithm; equivalence; mother code; periodically time-varying convolutional codes; punctured convolutional codes; puncturing pattern; searching; time-invariant convolutional code; unit-memory codes; Convolutional codes; Decoding; Hamming weight; Signal to noise ratio; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Telecommunications Symposium, 1998. ITS '98 Proceedings. SBT/IEEE International
  • Conference_Location
    Sao Paulo
  • Print_ISBN
    0-7803-5030-8
  • Type

    conf

  • DOI
    10.1109/ITS.1998.718451
  • Filename
    718451