<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06105842</id>
  <dt>a</dt>
  <an>06105842</an>
  <augroup>
    <au>Das, Sukanta</au>
    <au>Sarkar, Anindita</au>
    <au>Sikdar, Biplab K.</au>
  </augroup>
  <ti>Synthesis of reversible asynchronous cellular automata for pattern generation with specific Hamming distance.</ti>
  <so>Sirakoulis, Georgios Ch. (ed.) et al., Cellular automata. 10th international conference on cellular automata for research and industry, ACRI 2012, Santorini Island, Greece, September 24--27, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33349-1/pbk). Lecture Notes in Computer Science 7495, 643-652 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Asynchronous cellular automata (ACA)</ut>
    <ut>reversibility</ut>
    <ut>ACA cycle</ut>
    <ut>reversible ACA rules</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-33350-7_66</li>
  </ligroup>
  <abgroup>
    <ab>Summary: The reversibility issue of 1-dimensional asynchronous cellular automata (ACA) has been reported in [4]. The ACA rules are classified to synthesis reversible ACA. Characterization has been done to explore the update patterns of cells forming the reversible ACA. This work reports synthesis of reversible ACA for pattern generation, where specific Hamming distance between two consecutive ACA states of a cycle is maintained. A hardware realization of ACA is also reported that can effectively be utilized in VLSI circuit design, testing of asynchronous circuit, and Hamming code generation.</ab>
    <rv></rv>
  </abgroup>
</item>