سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات161
تعداد شماره‌ها6,470
تعداد مقالات69,914
تعداد مشاهده مقاله122,491,839
تعداد دریافت فایل اصل مقاله95,720,417
Javan, Abolfazl, Jafarpour, Maryam, Moieni, Ali, Shekaramiz, Mohammad. (1399). Implementation of Combinational Logic Circuits Using Nearest-Neighbor One-Dimensional Four-State Cellular Automata. , 52(2), 41-56. doi: 10.22059/jac.2020.79225
Abolfazl Javan; Maryam Jafarpour; Ali Moieni; Mohammad Shekaramiz. "Implementation of Combinational Logic Circuits Using Nearest-Neighbor One-Dimensional Four-State Cellular Automata". , 52, 2, 1399, 41-56. doi: 10.22059/jac.2020.79225
Javan, Abolfazl, Jafarpour, Maryam, Moieni, Ali, Shekaramiz, Mohammad. (1399). 'Implementation of Combinational Logic Circuits Using Nearest-Neighbor One-Dimensional Four-State Cellular Automata', , 52(2), pp. 41-56. doi: 10.22059/jac.2020.79225
Javan, Abolfazl, Jafarpour, Maryam, Moieni, Ali, Shekaramiz, Mohammad. Implementation of Combinational Logic Circuits Using Nearest-Neighbor One-Dimensional Four-State Cellular Automata. , 1399; 52(2): 41-56. doi: 10.22059/jac.2020.79225

Implementation of Combinational Logic Circuits Using Nearest-Neighbor One-Dimensional Four-State Cellular Automata

Journal of Algorithms and Computation
دوره 52، شماره 2، اسفند 2020، صفحه 41-56    اصل مقاله (538.63 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2020.79225
نویسندگان
Abolfazl Javan1؛ Maryam Jafarpour* 2؛ Ali Moieni1؛ Mohammad Shekaramiz3
1University of Tehran, College of Engineering, Faculty of Engineerng Science, Department of Algorithms and Computation
2Department of Algorithms and Computation, College of Engineering, University of Tehran Tehran, 1417613131, Iran
3Department of Electrical and Computer Engineering, Utah State University Logan, UT 84322-4120, USA
چکیده
Cellular automata are simple mathematical idealizations of natural systems. They consist of a lattice of discrete identical sites, each site taking on a finite set of, say, integer values. Over the years, scientists have been trying to investigate the computational capabilities of cellular automata by limiting the dimension, neighborhood radius, and the number of states.
In this article, we represent a novel implementation of combinational logic circuits using nearest-neighbor one-dimensional four-state cellular automata (CA). The novelty behind the proposed model is the reduction of the required number of states and yet being able to implement combinational logic-circuits in the conventional CA fashion. This can open a new window to the computation using cellular automata.
کلیدواژه‌ها
Cellular Automata؛ Cellular Machine؛ Combinational Logic Circuits؛ Universality
آمار
تعداد مشاهده مقاله: 267
تعداد دریافت فایل اصل مقاله: 238


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب