Search results for "Computer architecture"

showing 10 items of 191 documents

THE WORD ZHEN貞 IN THE BOOK OF CHANGES: DECONSTRUCTION APPROACH

2020

PhilosophyPhilosophyDeconstructionWord (computer architecture)LinguisticsPhilosophia: International Journal of Philosophy
researchProduct

Real-time low level feature extraction for on-board robot vision systems

2006

Robot vision systems notoriously require large computing capabilities, rarely available on physical devices. Robots have limited embedded hardware, and almost all sensory computation is delegated to remote machines. Emerging gigascale integration technologies offer the opportunity to explore alternative computing architectures that can deliver a significant boost to on-board computing when implemented in embedded, reconfigurable devices. This paper explores the mapping of low level feature extraction on one such architecture, the Georgia Tech SIMD Pixel Processor (SIMPil). The Fast Boundary Web Extraction (fBWE) algorithm is adapted and mapped on SIMPil as a fixed-point, data parallel imple…

PixelComputer sciencebusiness.industryComputationvision systems real-timeFeature extractionNull (SQL)Computer architectureEmbedded systemRobotSIMDArchitectureUnconventional computingbusiness
researchProduct

Transducers for the bidirectional decoding of prefix codes

2010

AbstractWe construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod (1999) in [5] and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding.We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of Girod’s encoding method. We prove that it has the same properties as those of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.

Prefix codeGeneral Computer ScienceSettore INF/01 - InformaticaGeneralizationComputer scienceGirod’s encodingTransducersPrefix codeTheoretical Computer SciencePrefixTransducerPrefix codesAlgorithmDecoding methodsWord (computer architecture)Computer Science(all)
researchProduct

Some Decision Results on Nonrepetitive Words

1985

The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.

PrefixCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Discrete MathematicsUnique factorization domainComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Square-free integerComputer Science::Formal Languages and Automata TheoryBinary alphabetWord (computer architecture)Mathematics
researchProduct

Statechart-based design controllers for FPGA partial reconfiguration

2015

Statechart diagram and UML technique can be a vital part of early conceptual modeling. At the present time there is no much support in hardware design methodologies for reconfiguration features of reprogrammable devices. Authors try to bridge the gap between imprecise UML model and formal HDL description. The key concept in author's proposal is to describe the behavior of the digital controller by statechart diagrams and to map some parts of the behavior into reprogrammable logic by means of group of states which forms sequential automaton. The whole process is illustrated by the example with experimental results.

Programming languageProcess (engineering)Computer scienceControl reconfigurationcomputer.software_genreAutomatonLogic synthesisUnified Modeling LanguageComputer architectureKey (cryptography)Digital controlField-programmable gate arraycomputercomputer.programming_languagePhotonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2015
researchProduct

Dynamic Test Methods for COTS SRAMs

2014

International audience; In previous works, we have demonstrated the importance of dynamic mode testing of SRAM components under ionizing radiation. Several types of failures are difficult to expose when the device is tested under static (retention) mode. With the purpose of exploring and defining the most complete testing procedures and reveal the potential hazardous behaviors of SRAM devices, we present novel methods for the dynamic mode radiation testing of SRAMs. The proposed methods are based on different word address accessing schemes and data background: Fast Row, Fast Column, Pseudorandom, Adjacent (Gray) and Inverse Adjacent (Gray). These methods are evaluated by heavy ion and atmos…

Pseudorandom number generatorsingle event upset (SEU)Nuclear and High Energy Physicsta114ta213Computer scienceCOTSneutrons65 nmmultiple cell upset (MCU)SRAMColumn (database)[SPI.TRON]Engineering Sciences [physics]/ElectronicsRadiation testingNuclear Energy and EngineeringElectronic engineering90 nmHeavy ionStatic random-access memoryElectrical and Electronic Engineeringheavy ionsNeutron irradiationWord (computer architecture)dynamic testDynamic testingIEEE Transactions on Nuclear Science
researchProduct

A characterization of regular circular languages generated by marked splicing systems

2009

AbstractSplicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. A splicing system is defined by giving an initial set I and a set R of rules. Some unanswered questions are related to the computational power of circular splicing systems. In particular, a still open question is to find a characterization of circular languages generated by finite circular splicing systems (i.e., circular splicing systems with both I and R finite sets). In this paper we introduce a special class of the latter systems named marked systems. We prove that a marked system S generates a regular circular language if an…

Pure mathematicsGeneral Computer ScienceMolecular computing Splicing systems Circular words Formal languages Automata theoryMolecular computingQuantitative Biology::GenomicsDecidabilityTheoretical Computer ScienceSet (abstract data type)Formal languagesRegular languageFormal languageRNA splicingAutomata theorySplicing systemsCircular wordsFinite setAlgorithmWord (computer architecture)Automata theoryMathematicsComputer Science(all)
researchProduct

From Bi-ideals to Periodicity

2008

The necessary and sufficient conditions are extracted for periodicity of bi-ideals. They cover infinitely and finitely generated bi-ideals.

Pure mathematicsIdeal (set theory)Mathematics::Commutative AlgebraGeneral MathematicsCalculusCover (algebra)Finitely-generated abelian groupSoftwareWord (computer architecture)Computer Science ApplicationsMathematicsRAIRO - Theoretical Informatics and Applications
researchProduct

RabbitQC: high-speed scalable quality control for sequencing data

2019

Abstract Motivation Modern sequencing technologies continue to revolutionize many areas of biology and medicine. Since the generated datasets are error-prone, downstream applications usually require quality control methods to pre-process FASTQ files. However, existing tools for this task are currently not able to fully exploit the capabilities of computing platforms leading to slow runtimes. Results We present RabbitQC, an extremely fast integrated quality control tool for FASTQ files, which can take full advantage of modern hardware. It includes a variety of operations and supports different sequencing technologies (Illumina, Oxford Nanopore and PacBio). RabbitQC achieves speedups between …

Quality ControlStatistics and ProbabilityFASTQ formatDownstream (software development)Exploitmedia_common.quotation_subjectBiochemistryNanopores03 medical and health sciencesSoftwareQuality (business)Molecular Biology030304 developmental biologymedia_common0303 health sciencesbusiness.industry030302 biochemistry & molecular biologyHigh-Throughput Nucleotide SequencingSequence Analysis DNAComputer Science ApplicationsComputational MathematicsTask (computing)Computational Theory and MathematicsComputer architectureScalabilityNanopore sequencingbusinessSoftwareBioinformatics
researchProduct

Implementation of Universal Digital Architecture using 3D-NoC for Mobile Terminal

2014

International Conference on Control, Decision and Information Technologies (CoDIT), Ecole Natl Ingenieurs Metz, Metz, FRANCE, NOV 03-05, 2014; International audience; The need to integrate multiple wireless communication protocols into a single low-cost flexible hardware platform is prompted by the increasing number of emerging communication protocols and applications in modern embedded systems. So the current challenge is to design of new digital architectures, in addition to its ability to take over of many functions. In this paper we have identified similarities between the despreader units in Rake receiver and the processor element in FFT-SDF (Fast Fourier Transform-Single path Delay Fe…

RTL modelingComputer scienceOrthogonal frequency-division multiplexing[SPI] Engineering Sciences [physics]Common Operators02 engineering and technologyGeneric hardware architecturesFFT- SDF[SPI]Engineering Sciences [physics]Gate arrayVHDL[ SPI ] Engineering Sciences [physics]0202 electrical engineering electronic engineering information engineeringGeneric hardware architectures Rake receiver FFT- SDF Common Operators 3D-Network on chip RTL modelingField-programmable gate arraycomputer.programming_languageVirtexbusiness.industry020208 electrical & electronic engineering020206 networking & telecommunicationsDigital architectureRake receiverComputer architectureEmbedded systemRake receiver3D-Network on chipbusinessCommunications protocolcomputer
researchProduct