• DocumentCode
    3065657
  • Title

    A constructive approach for reducing the state complexity of self-dual lattices

  • Author

    Khandani, A.K. ; Esmaeili, M.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
  • fYear
    1997
  • fDate
    29 Jun-4 Jul 1997
  • Firstpage
    386
  • Abstract
    This work presents a systematic method to successively minimize the state complexity of the self-dual lattices. This is based on representing the lattice on an orthogonal co-ordinate system corresponding to the Gram-Schmidt (GS) vectors of a Korkin-Zolotarev (KZ) reduced basis. We give expressions for the GS vectors of a KZ basis of the E8(3/), Ksub 12/, BWn and Λ24 lattices. Using the proposed method, we have re-derived the trellis diagrams given previously in a systematic and unified approach. It is also shown that for certain complex representation of the Λ24 and the BWn lattices, we have: (i) the corresponding GS vectors are along the standard co-ordinate system, and (ii) the branch complexity at each section of the resulting trellis meets a given lower bound. This results in a very efficient trellis representation for these lattices
  • Keywords
    computational complexity; dual codes; lattice theory; trellis codes; Λ24 lattice; BWn lattice; Gram-Schmidt vectors; Korkin-Zolotarev reduced basis; constructive approach; lower bound; orthogonal co-ordinate system; self-dual lattices; state complexity reduction; trellis diagrams; trellis representation; Councils; Decoding; Erbium; Lattices; Merging; Notice of Violation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
  • Conference_Location
    Ulm
  • Print_ISBN
    0-7803-3956-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1997.613323
  • Filename
    613323