IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v16y2005i03ns0129183105007303.html
   My bibliography  Save this article

Optimization Of 2d Lattice Cellular Automata For Pseudorandom Number Generation

Author

Listed:
  • MARIE THERESE ROBLES QUIETA

    (Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescents, Singapore 119260, Singapore)

  • SHENG-UEI GUAN

    (Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescents, Singapore 119260, Singapore)

Abstract

This paper proposes a generalized approach to 2D CA PRNGs — the 2D lattice CA PRNG — by introducing vertical connections to arrays of 1D CA. The structure of a 2D lattice CA PRNG lies in between that of 1D CA and 2D CA grid PRNGs. With the generalized approach, 2D lattice CA PRNG offers more 2D CA PRNG variations. It is found that they can do better than the conventional 2D CA grid PRNGs. In this paper, the structure and properties of 2D lattice CA are explored by varying the number and location of vertical connections, and by searching for different 2D array settings that can give good randomness based on Diehard test. To get the most out of 2D lattice CA PRNGs, genetic algorithm is employed in searching for good neighborhood characteristics. By adopting an evolutionary approach, the randomness quality of 2D lattice CA PRNGs is optimized. In this paper, a new metric,#rnis introduced as a way of finding a 2D lattice CA PRNG with the least number of cells required to pass Diehard test. Following the introduction of the new metric#rn, a cropping technique is presented to further boost the CA PRNG performance. The cost and efficiency of 2D lattice CA PRNG is compared with past works on CA PRNGs.

Suggested Citation

  • Marie Therese Robles Quieta & Sheng-Uei Guan, 2005. "Optimization Of 2d Lattice Cellular Automata For Pseudorandom Number Generation," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 16(03), pages 479-500.
    • Handle: RePEc:wsi:ijmpcx:v:16:y:2005:i:03:n:s0129183105007303
    DOI: 10.1142/S0129183105007303
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183105007303
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183105007303?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:16:y:2005:i:03:n:s0129183105007303. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.