In this paper, we deal with the exact circular string matching problem (abbreviated as ECSM). Given a string P = p(1) p(2) a <- p(m), a string P-(i) = p(i) p(i+1) a <- p(m) p(1) a <- p(i-1), for 1 a parts per...
详细信息
In this paper, we deal with the exact circular string matching problem (abbreviated as ECSM). Given a string P = p(1) p(2) a <- p(m), a string P-(i) = p(i) p(i+1) a <- p(m) p(1) a <- p(i-1), for 1 a parts per thousand currency sign i a parts per thousand currency sign m, is a circular string of P. Given a text string T = t(1)t(2) a <- t(n) and a pattern P, the ECSM problem is to find all occurrences of P-(i) in text T for 1 a parts per thousand currency sign i a parts per thousand currency sign m. This paper proposes two algorithms that perform searching of a circular string on text using the bit-parallel technique. Our algorithms use only the composition of bitwise-logical operations and basic arithmetic operations, and apply this technique to solve the problem. These algorithms are given names CSBNDM and CSBNDNq, respectively. We give several experiments to verify that they have good performance for random strings and DNA sequences.
Cyclic redundancy check (CRC) is widely used for error detection. For optimal performances a method has been developed for bit-parallel processing, but it may not take advantage of parallel processor architecture. Her...
详细信息
Cyclic redundancy check (CRC) is widely used for error detection. For optimal performances a method has been developed for bit-parallel processing, but it may not take advantage of parallel processor architecture. Here, a method is proposed for using. the toll power of a very long instruction word (VLIW) digital signal processor (DSP) architecture in CRC computation. The method to at least four times faster for 8, 16 and 32 bits CRC.
In this paper a model of a versatile associative graph processor called AGP is proposed. The model can work both in bit-serial and in bit-parallel mode and enables simultaneous search for a set of comparands and selec...
详细信息
ISBN:
(纸本)0769520804
In this paper a model of a versatile associative graph processor called AGP is proposed. The model can work both in bit-serial and in bit-parallel mode and enables simultaneous search for a set of comparands and selection of the search types. In addition it has some built-in operations designed for associative graph algorithms. The selected functions and basic procedures of this model are described and its possible architecture is discussed.
Multi-comparand associative processors are efficient in parallelprocessing of complex search problems that arise from many application areas including computational geometry, graph theory and list/matrix computations...
详细信息
ISBN:
(纸本)9780769534725
Multi-comparand associative processors are efficient in parallelprocessing of complex search problems that arise from many application areas including computational geometry, graph theory and list/matrix computations. In this paper we report new FPGA implementations of a multi-comparand multi-search associative processor The architecture of the processor working in a combined bit-serial/bit-parallel word-parallel mode and its functions arc, described. Then, several implementations of associative processors in VHDL, using Xilinx Foundation ISE software and Digilent development boards with Xilinx FPGA devices are reported. Parameters of the implemented FPGA processors are presented and discussed.
We successfully demonstrated an 8-bit-wide, bit-parallel datapath composed of an arithmetic logic unit and register files for high-throughput oriented SFQ microprocessors based on a gate-level-pipeline structure. Achi...
详细信息
We successfully demonstrated an 8-bit-wide, bit-parallel datapath composed of an arithmetic logic unit and register files for high-throughput oriented SFQ microprocessors based on a gate-level-pipeline structure. Achieving high-speed operation in the bit-parallel datapath is difficult because of feedback paths. We used concurrent-flow clocking and counter-flow clocking in combination to solve the timing problem at the feedback path in the datapath, and we optimized the number of JJs and pipeline stages in the register file for solving the timing issue. We designed the datapath with the cell library for the AIST 10 kA/cm(2) Advanced Process. The total number of pipeline stages, Josephson junctions, and circuit area of the designed datapath were 52, 18448, and 3.81 mm x 4.05 mm, respectively. We obtained a relatively wide bias margin of the designed datapath at the target clock frequency of 50 GHz, and it operated up to 64 GHz in on-chip high-speed testing.
In this paper, we successfully demonstrate the 50-GHz operation of a microprocessor datapath based on single-flux -quantum (SFQ) logic with a gate-level pipeline (GLP) structure. The microprocessor datapath features a...
详细信息
In this paper, we successfully demonstrate the 50-GHz operation of a microprocessor datapath based on single-flux -quantum (SFQ) logic with a gate-level pipeline (GLP) structure. The microprocessor datapath features a register file (RF), an arithmetic logic unit (ALU), and a long feedback loop that connects these components. Interleaved data-processing is applied in the RF. As the operating frequency of the RF is half that of the ALU, the timing constraints are eased;thus, we can reduce the number of pipeline stages used for timing adjustments. We designed a 4-bit datapath using the proposed technique, targeting 50-GHz opera-tion. Compared to the conventional datapath, the total number of pipeline stages and the latency decreased from 49 to 24 and from 980 to 760 ps respectively. We fabricated test chips using the AIST Nb 9-layer 10-kA/cm(2) process, and performed successful on-chip high-speed tests. In addition, our preliminary experiments suggest that we can expect 1.6-fold higher throughput at an 80-GHz clock frequency, at the cost of a 10% increase in latency.
暂无评论