Digital VLSI implementation of ultra-discrete cellular automata for simulating traffic flow

We propose a digital VLSI implementation of multiple-value cellular automata for simulating traffic flow. Recently, a family of the Burgers cellular automata (BCA) has been proposed as multi-lane traffic flow models, which are derived from the Burgers´ equation interpreted as a macroscopic traffic flow model using the ultra-discrete method. The family of BCA is suitable for digital VLSI implementation because of the discreteness and the simple update procedure. For developing efficient traffic simulators, we implemented the family of BCA as digital VLSI circuits using a scalable CMOS technology. Using the computer simulator SPICE, it is shown that these circuits operate correctly, and they can be expected to be useful tools to analyze and predict the behavior of traffic flow.