• DocumentCode
    3277997
  • Title

    Wavelet convolutional codes with bipartite trellises

  • Author

    Fekri, F. ; McLaughlin, S.W. ; Mersereau, R.M. ; Schafer, R.W.

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    245
  • Abstract
    We introduce a method novel to generate new types of time-varying convolutional codes using finite-field wavelets. These codes have a new type of trellis that we refer to as a bipartite (or k-partite) trellis. An important feature of the k-partite trellises is their reduced decoding complexity
  • Keywords
    computational complexity; convolutional codes; decoding; trellis codes; wavelet transforms; bipartite trellises; decoding complexity reduction; finite-field wavelets; k-partite trellis; time-varying convolutional codes; Code standards; Convolution; Convolutional codes; Decoding; Design methodology; Educational institutions; Filter bank; Information theory; Speech coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
  • Conference_Location
    Washington, DC
  • Print_ISBN
    0-7803-7123-2
  • Type

    conf

  • DOI
    10.1109/ISIT.2001.936108
  • Filename
    936108
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3277997