TY - GEN
A1 - Srisuchinwong, Banlue
A1 - Thanailakis, Antonios
A1 - Hicks, Peter J.
A1 - York, Trevor A.
A1 - Tsalides, Ph.
A2 - Caban, Dariusz - red.
PB - Zielona Góra: Uniwersytet Zielonogórski
N2 - Cellular Automata (CA) and their natural affinity for VLSI are discussed. Group behaviour of CA is related to that for modulo-arithmetic units and this leads to an architecture for modulo multiplication. Implementation of a mod-127 multiplier using two techniques, full custom CMOS design and Xilinx programmable gate arrays is described. The principle of operation is based on two identical 12x12, null-bounded, CA each having semi-group order 126.
N2 - In practice, implementation utilises the data compression capabilities to reduce the area required by these arrays by about 90%. This is achieved by using triangular CA, each comprising 15 cells that have appropriately chosen initial boundary conditions. Encoding and decoding is performed on-chip and the complexity of this task is significantly reduced by observing only critical cells. Performance and area requirements for this modest function are revealed such that predictions can then be made for more substantial units.
L1 - http://www.zbc.uz.zgora.pl/Content/57287/AMCS_1993_3_1_26.pdf
L2 - http://www.zbc.uz.zgora.pl/Content/57287
KW - sterowanie
KW - sterowanie-teoria
KW - sztuczna inteligencja
KW - matematyka stosowana
KW - informatyka
T1 - VLSI implementation of cellular automata: Modulo-arithmetic units
UR - http://www.zbc.uz.zgora.pl/dlibra/docmetadata?id=57287
ER -