• DocumentCode
    2921647
  • Title

    A scalable solution to n-bit parity via artificial development

  • Author

    Kuyucu, Tüze ; Trefzer, Martin A. ; Miller, Julian F. ; Tyrrell, Andy M.

  • Author_Institution
    Dept. of Electron., Univ. of York, York, UK
  • fYear
    2009
  • fDate
    12-17 July 2009
  • Firstpage
    144
  • Lastpage
    147
  • Abstract
    The design of electronic circuits with model-free heuristics like evolutionary algorithms is an attractive concept and field of research. Although successful to a point, evolution of circuits that are bigger than a 3-bit multiplier is hindered by the scalability problem. Modelling the biological development as an artificial genotype-phenotype mapping mechanism has been shown to improve scalability on some simple circuit problems and pattern formations. As a candidate solution to the scalability issue, an artificial developmental system is presented. The presented artificial developmental system is shown to develop a scalable parity circuit, which could be infinitely developed to build a growing parity circuit, hence, represents a general, scalable solution to n-bit parity. The result obtained further supports the artificial developmental system as a good candidate solution to the scalability problem in evolvable hardware.
  • Keywords
    biomolecular electronics; evolutionary computation; network synthesis; 3-bit multiplier; N-bit parity; artificial development; artificial genotype-phenotype mapping mechanism; electronic circuits; evolutionary algorithms; model-free heuristics; scalability problem; scalable parity circuit; Algorithm design and analysis; Biological system modeling; Circuit synthesis; Electronic circuits; Evolution (biology); Evolutionary computation; Hardware; Organisms; Pattern formation; Scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Research in Microelectronics and Electronics, 2009. PRIME 2009. Ph.D.
  • Conference_Location
    Cork
  • Print_ISBN
    978-1-4244-3733-7
  • Electronic_ISBN
    978-1-4244-3734-4
  • Type

    conf

  • DOI
    10.1109/RME.2009.5201348
  • Filename
    5201348