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

Layered Cellular Automata For Pseudorandom Number Generation

Author

Listed:
  • SYN KIAT TAN

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

  • SHENG-UEI GUAN

    (School of Engineering and Design, Brunel University, UK)

Abstract

The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA withLadditional layers of memory registers, has simple local interconnections and high operating speed. The time-varyingL-LCA transformation at each clock can be reduced to a single transformation in the set{Af| f = 1, 2, …, 2n-1}formed by the transformation matrixAof a maximum length Cellular Automata (CA), and the entire transformation sequence for a single period can be obtained. The analysis for the period characteristics of state sequences is simplified by analyzing representative transformation sequences determined by the phase difference between the initial states for each layer. TheL-LCA model can be extended by adding more layers of memory or through the use of a larger main CA based on widely available maximum length CA. SeveralL-LCA (L = 1, 2, 3, 4) with 10- to 48-bit main CA are subjected to the DIEHARD test suite and better results are obtained over other CA designs reported in the literature. The experiments are repeated using the well-known nonlinear functionsf30andf45in place of the linear functionf204used in theL-LCA. Linear complexity is significantly increased whenf30orf45is used.

Suggested Citation

  • Syn Kiat Tan & Sheng-Uei Guan, 2007. "Layered Cellular Automata For Pseudorandom Number Generation," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 18(02), pages 217-234.
    • Handle: RePEc:wsi:ijmpcx:v:18:y:2007:i:02:n:s0129183107010413
    DOI: 10.1142/S0129183107010413
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183107010413
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183107010413?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:18:y:2007:i:02:n:s0129183107010413. 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.