Abstract
The current literature on cellular automata (CA) mostly overlooks the fact that the perceived regularity and locality of interconnects in a CA are often logical rather than physical, and difficult to achieve in practical implementations. Optimized mapping, placement and routing of circuits are especially challenging for Field Programmable Gate Array (FPGA) platforms, which often result in low-performance implementations. We develop a design methodology for the automated implementation of low-resource, high-performance CA circuits, by optimal usage of the underlying FPGA architecture, direct primitive instantiation, and constrained placement. Case study for an 1-D CA circuit reveal higher performance, lower hardware resource requirement (by a factor of 0.5 X), acceptable power-delay product (PDP), and superior design scalability, in comparison to implementations derived by standard FPGA CAD tool design flow.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chowdhury, D.R., Chaudhuri, P.P.: Architecture for VLSI Design of CA Based Byte Error Correcting Code Decoders. In: Proceedings of the 7th International Conference on VLSI Design, pp. 283–286 (1994)
Sarkar, P.: A Brief History of Cellular Automata. ACM Computing Surveys (CSUR) 32(1), 80–107 (2000)
Areibi, S., Grewal, G., Banerji, D., Du, P.: Hierarchical FPGA Placement. Canadian Journal of Electrical and Computer Engineering 32(1), 53–64 (2007)
Ehliar, A.: Optimizing Xilinx designs through primitive instantiation. In: Proceedings of the 7th FPGAworld Conference, FPGAworld 2010, pp. 20–27. ACM, New York (2010)
Chattopadhyay, S., Roy, S., Chaudhuri, P.P.: Technology Mapping on a Multi-Output Logic Module built around Cellular Automata Array for a new FPGA Architecture. In: Proceedings of the 8th International Conference on VLSI Design, pp. 57–62 (1995)
Halbach, M., Hoffmann, R., Röder, P.: FPGA Implementation of Cellular Automata Compared to Software Implementation. In: ARCS Workshops, vol. 41, pp. 309–317 (2004)
Sirakoulis, G.C., Karafyllidis, I., Thanailakis, A., Mardiris, V.: A methodology for VLSI implementation of Cellular Automata algorithms using VHDL. Advances in Engineering Software 32(3), 189–202 (2000)
Torres-Huitzil, C., Delgadillo-Escobar, M., Nuno-Maganda, M.: Comparison between 2D cellular automata based pseudorandom number generators. IEICE Electronics Express 9(17), 1391–1396 (2012)
Xilinx Inc., Virtex-6 FPGA Configurable Logic Block User Guide UG364 (v1.2) (February 3, 2012), http://www.xilinx.com/support/documentation/user_guides/ug364.pdf
Xilinx Inc., Virtex-5 FPGA User Guide UG190 (v5.4) (March 16, 2012), http://www.xilinx.com/support/documentation/user_guides/ug190.pdf
Das, A.K., Ganguly, A., Dasgupta, A., Bhawmik, S., Chaudhuri, P.P.: Efficient Characterization of Cellular Automata. IEE Proceedings E Computers and Digital Techniques 137(1), 81–87 (1990)
Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and its Application, vol. 1. IEEE Computer Society Press (1997)
Mukhopadhyay, D.: Group Properties of Non-linear Cellular Automata. Journal of Cellular Automata 5(1-2), 139–155 (2010)
Cattell, K., Muzio, J.C.: Synthesis of One-Dimensional Linear Hybrid Cellular Automata. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15(3) (1996)
Ahmed, T., Kundarewich, P.D., Anderson, J.H.: Packing Techniques for Virtex-5 FPGAs. ACM Transactions on Reconfigurable Technology and Systems (TRETS) 2(3), Article 18, 18:1–18:24 (2009)
Cattell, K., Muzio, J.: Technical Report: Tables of linear cellular automata for minimal weight primitive polynomials of degrees up to 300. Issue: 163. University of Victoria (B.C.), Department of Computer Science (1991)
Bardell, P.H., McAnney, W.H., Savir, J.: Built-In Test for VLSI: Pseudorandom Techniques. John Wiley & Sons (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Palchaudhuri, A., Chakraborty, R.S., Salman, M., Kardas, S., Mukhopadhyay, D. (2014). Highly Compact Automated Implementation of Linear CA on FPGAs. In: WÄ…s, J., Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2014. Lecture Notes in Computer Science, vol 8751. Springer, Cham. https://doi.org/10.1007/978-3-319-11520-7_40
Download citation
DOI: https://doi.org/10.1007/978-3-319-11520-7_40
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11519-1
Online ISBN: 978-3-319-11520-7
eBook Packages: Computer ScienceComputer Science (R0)