dc.creator | Arvaniti, E. | en |
dc.creator | Mavridis, I. | en |
dc.creator | Kakarountas, A. | en |
dc.date.accessioned | 2015-11-23T10:22:53Z | |
dc.date.available | 2015-11-23T10:22:53Z | |
dc.date.issued | 2010 | |
dc.identifier | 10.1109/ISVLSI.2010.34 | |
dc.identifier.isbn | 9780769540764 | |
dc.identifier.uri | http://hdl.handle.net/11615/25821 | |
dc.description.abstract | In this work a comprehensive exploration of Binary Sequence Generators (BSG) is offered, focusing on an alternative type of BSG (radix-2 counter) presenting low design complexity and interesting speed characteristics, based on 2D Cellular Automata (CA). Various "seed" configurations are explored and two architectures are examined, defining the most appropriate CA in terms of speed, silicon area and power dissipation. © 2010 IEEE. | en |
dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-77957897309&partnerID=40&md5=be7bf30e8a51ba02b14146f733b8fcd9 | |
dc.subject | Binary counter | en |
dc.subject | Cellular automata | en |
dc.subject | Computer arithmetic | en |
dc.subject | Digital circuit | en |
dc.subject | VLSI | en |
dc.subject | Binary counters | en |
dc.subject | Design complexity | en |
dc.subject | Power dissipation | en |
dc.subject | Radix 2 | en |
dc.subject | Sequence generators | en |
dc.subject | Silicon area | en |
dc.subject | Speed characteristics | en |
dc.subject | Binary sequences | en |
dc.subject | Digital arithmetic | en |
dc.subject | Digital integrated circuits | en |
dc.subject | Electric converters | en |
dc.subject | Pattern recognition systems | en |
dc.subject | VLSI circuits | en |
dc.title | Exploration of 2D cellular automata as binary sequence generators | en |
dc.type | conferenceItem | en |