Hiroki Nakahara, Tsutomu Sasao, H. Nakanishi, K. Iwai
{"title":"An RNS FFT Circuit Using LUT Cascades Based on a Modulo EVMDD","authors":"Hiroki Nakahara, Tsutomu Sasao, H. Nakanishi, K. Iwai","doi":"10.1109/ISMVL.2015.41","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.41","url":null,"abstract":"This paper proposes an FFT circuit based on a residue number system (RNS) using LUT cascades. To reduce the number of look-up tables (LUTs) in an FPGA, we used two techniques. The first one is the functional decomposition of multipliers using RNS. The second one is the increase of the dynamic range stage by stage. The circuit requires the RNS2RNS converter which converts a small dynamic range to a large dynamic range. To compactly realize the RNS2RNS converter, we decompose it into an RNS2Binary converter and a Binary2RNS converter. Although the Binary2RNS converter can be realized by an LUT cascade based on a multi-terminal multi-valued decision diagram (MTMDD), the RNS2Binary converter tend to be large for the conventional circuit. Thus, we introduce an LUT cascade based on a modulo edge-valued multi-valued decision diagram (mod-EVMDD). The mod-EVMDD is a new type of a decision diagram that efficiently represents the RNS2Binary converter. We implemented the proposed RNS FFT on the Xilinx Corp. Virtex 6 FPGA. Compared with the conventional binary FFT implementation, although the number of block RAMs (BRAMs) increased by 11.1-25.0%, the number of LUTs decreased by 44.2-52.2% and the maximum clock frequency increased by 9.3-41.7%. With this technique, we successfully implemented a required FFT on an available FPGA, since the excessive number of LUTs was the bottleneck of the binary FFT.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122752145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Novel VLSI Architectures for Real-World Intelligent Systems","authors":"M. Kameyama","doi":"10.1109/ISMVL.2015.39","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.39","url":null,"abstract":"A real-world intelligent systems platform based on novel architectures is presented in this article. As real-world applications, we consider advanced intelligent systems such as a highly-safe system and an intelligent robot system which make our daily life safe and comfortable.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123988031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Non-Binary Analog-to-Digital Converter Based on Amoeba-Inspired Neural Network","authors":"Uichi Ishida, Y. Yamazaki, T. Waho","doi":"10.1109/ISMVL.2015.13","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.13","url":null,"abstract":"An analog-to-digital converter (ADC) based on neural networks is proposed, and the feasibility of using no binary coding is discussed with circuit simulation. An amoeba-inspired computing technique is used to construct the present ADC, where switched-capacitor circuits are used as unit neurons. Dummy units are also added to improve the stability of circuit operation. For an ADC with a radix of 2, large quantization errors were observed due to the local minima. It was found that introducing a radix smaller than 2 effectively reduced the quantization error. Low-power operation can be expected by using a dynamic analog circuit technique in the present neuro-ADC.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123134806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Reduction Method for the Number of Variables to Represent Index Generation Functions: s-Min Method","authors":"Tsutomu Sasao","doi":"10.1109/ISMVL.2015.40","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.40","url":null,"abstract":"Most n-variable incompletely specified index generation functions with weight k can be represented by fewer variables than n when k ≪ 2n. Furthermore, with a linear decomposition, the function can be represented by still fewer variables. In this paper, we propose an iterative improvement method, called the s-Min method, to reduce the number of variables.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116912366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Algebras and Algorithms","authors":"M. Valeriote","doi":"10.1109/ISMVL.2015.45","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.45","url":null,"abstract":"This presents the necessary background from universal algebra to describe the connection between algebra and the constraint satisfaction problems (CSP) and then review the progress that has been made towards settling the Dichotomy Conjecture of Feder and Vardi. They conjecture that the subclass of the CSP parametrized by a given finite relational structure will either lie in the complexity class P or be NP-complete. Work on the Dichotomy Conjecture has led to some surprising and fundamental results about finite algebras and has motivated research on a number of fronts. This also focuses on several results that deal with algorithmic questions about finite algebras. A typical sort of problem, one that is of particular relevance to the CSP, is to determine the complexity of deciding if a given finite algebra has a term operation that satisfies some prescribed set of equations.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126065341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Single-Electron Transistor Based Implementation of NOT, Feynman, and Toffoli Gates","authors":"Mozammel H. A. Khan","doi":"10.1109/ISMVL.2015.12","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.12","url":null,"abstract":"NOT, Feynman, and Toffoli gates are the practical building blocks of reversible circuit synthesis techniques. NOT and Feynman gates are primitive quantum gates. Toffoli gates are macro-level gates and realized using various primitive quantum gates. In reversible circuit design papers, logic level circuits are first realized using NOT, Feynman, and Toffoli gates and then the Toffoli gates are decomposed into primitive quantum gates. However, realizations of reversible circuits using electronic devices are not given adequate emphasis. In this paper, we propose preliminary ideas of implementations of NOT, Feynman, and Toffoli gates using single-electron transistor (SET), which is a nano-electronic quantum-tunneling device. NOT gate implementation requires one SET and one pull-up resistor. Feynman gate implementation requires two SETs and two pull-up resistors. Three-input Toffoli gate implementation requires three SETs and two pull-up resistors. The average static power consumptions of NOT, Feynman, and three-input Toffoli gate realizations are 0.091 nW, 0.497 nW, and 0.504 nW, respectively. The proposed implementations will open a facet of nano-electronic low-power realizations of reversible circuits.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133433065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quotient Structures of Non-Commutative Residuated Lattices","authors":"M. Kondo","doi":"10.1109/ISMVL.2015.30","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.30","url":null,"abstract":"In this paper we consider some properties of noncommutative residuated lattices which are considered as an algebraic semantics of substructural logic. We show that there are always prime filters in a non-commutative residuated lattice X and that the intersection of the class Spec(X) of all prime filters of X is identical with {1}, that is, ∩ Spec(X) = {1}.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134443808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic Template Matching with Mixed-Polarity Toffoli Gates","authors":"M. Rahman, Mathias Soeken, G. Dueck","doi":"10.1109/ISMVL.2015.44","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.44","url":null,"abstract":"The Toffoli gate, as originally proposed, had only positive controls. It has been shown that mixed polarity controlled Toffoli gates can be efficiently implemented. In fact, their quantum cost is the same as for positive controlled gates in most cases. Thus it is advantageous to consider circuits with mixed polarity Toffoli gates. Template matching has been successfully used to reduce the number of Toffoli gates in reversible circuits. Little work on templates with mixed polarity gates has been reported. Unfortunately, the number of potential templates increases dramatically, if mixed polarity is introduced. Here we propose a dynamic template matching algorithm that takes templates with few lines and dynamically extends the lines to find matches. Experimental results show that the proposed approach has a significant impact on reducing the total number of gates (57% in the best case) in circuits.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130463993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Early-Stage Operation-Skipping Scheme for Low-Power Stochastic Image Processors","authors":"Daisaku Katagiri, N. Onizawa, T. Hanyu","doi":"10.1109/ISMVL.2015.28","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.28","url":null,"abstract":"Stochastic computation that performs in probabilistic domain has been recently exploited for area-efficient hardware implementation, while it requires large number of bits to represent probabilities, increasing the switching activity and hence power dissipation. In this paper, an early-stage operation-skipping scheme, where stochastic computation is terminated at the early stage by monitoring the intermediate computation result, is introduced for low-power stochastic image processors. In case that the proposed scheme is applied in edge-detection processing as a typical example of image processing, a non-candidate pixel is predicted using a simple threshold detector before the completion of the stochastic edge-detection process. Once the pixel is found, the edge-detection process is stopped, eliminating the stochastic computation at the rest of bits. As a design example, a Robert's operator based stochastic edge detector is implemented using MATLAB. Based on the simulation results, a correlation between an output-image quality using a peak signal-to-noise ratio (PSNR) criteria and the reduction ratio of bits is discussed.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126475071","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}