Design of 1-D Piece-wise Maps for Multi-user CDMA Communications Using a Novel GP-DNA Algorithm

Created by W.Langdon from gp-bibliography.bib Revision:1.4524

  author =       "Surendran K. Shanmugam and Vinay Varadan and 
                 Henry Leung",
  title =        "Design of 1-{D} Piece-wise Maps for Multi-user {CDMA}
                 Communications Using a Novel {GP}-{DNA} Algorithm",
  booktitle =    "6th WSEAS International Multiconference on Circuits,
                 Systems, Communications and Computers (CSCC 2002)",
  year =         "2002",
  editor =       "Nikos Mastorakis",
  pages =        "444--481",
  address =      "Rethymno, Crete, Greece",
  month =        jul # " 7-14",
  publisher =    "WSEAS",
  keywords =     "genetic algorithms, genetic programming, dna
                 computation, chaos, CDMA, orthogonal codes",
  annote =       "The Pennsylvania State University CiteSeerX Archives",
  bibsource =    "OAI-PMH server at",
  language =     "en",
  oai =          "oai:CiteSeerX.psu:",
  isbn13 =       "960-8052-63-7",
  URL =          "",
  URL =          "",
  size =         "6 pages",
  abstract =     "This paper addresses the design of one dimensional
                 piece-wise maps to generate optimal codes for short and
                 long code multi-user CDMA systems. A novel approach,
                 GP-DNA, that uses genetic programming to search in the
                 functional space and DNA computation to obtain the
                 optimal initial conditions has been proposed as the
                 design methodology. This method automatically designs
                 orthogonal codes for short-code CDMA and codes with
                 good aperiodic correlation properties for long code
                 CDMA. Monte-Carlo simulations illustrate the improved
                 performance of GP-DNA compared to conventional code
  notes =        "",

Genetic Programming entries for Surendran Shanmugam Vinay Varadan Henry Leung