{"title":"Arithmetic Computations Based on Chemical Reaction Networks","authors":"Yuchen Zhuang, Chongzhou Fang, Zaichen Zhang, X. You, Chuan Zhang","doi":"10.1109/SiPS.2018.8598296","DOIUrl":"https://doi.org/10.1109/SiPS.2018.8598296","url":null,"abstract":"Widely used as formalism for the analysis of chemical and biochemical systems, chemical reaction networks (CRNs) have received increasing attention as a fundamental model for molecular computation. This paper demonstrates that, with a new method, CRNs can compute most arithmetic computations (e.g., non-polynomial functions). By applying Taylor’s Theorem and a finite-state machine (FSM) topology for arithmetic computations, the synthesis flow of accomplishing arithmetic computations is achieved. Since probability transmitted between designed FSMs can be naturally mapped to the concentration of molecular in solution, the whole computing process can be realized with molecular reactions instead of silicon-based hardware design. Theoretical analysis and numerical simulations have demonstrated the feasibility of the proposed approach.","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117060467","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}
Joonas Multanen, Heikki O. Kultala, P. Jääskeläinen, T. Viitanen, Aleksi Tervo, J. Takala
{"title":"LoTTA: Energy-Efficient Processor for Always-On Applications","authors":"Joonas Multanen, Heikki O. Kultala, P. Jääskeläinen, T. Viitanen, Aleksi Tervo, J. Takala","doi":"10.1109/SiPS.2018.8598408","DOIUrl":"https://doi.org/10.1109/SiPS.2018.8598408","url":null,"abstract":"Various use cases in the era of Internet-of-Things (IoT) demand processor devices to have low energy consumption in order to maximize the battery life. In addition to energy constraints, there is often a need to both swiftly execute control-oriented code to provide low reaction times and to occasionally perform real time signal processing tasks efficiently. As a response to these requirements, we propose LoTTA, an extremely energy-efficient exposed datapath core. Its transport-triggered programming model helps in lowering the execution latency via low cost data forwarding. Control efficiency is achieved by an optimized control unit with zero delay slot branches and predicated execution. An instruction register file is included for frequently executed program hot spots to reduce the instruction stream energy consumption. These features allow the processor to execute CHStone and EEMBC CoreMark benchmarks on average with 19% fewer cycles compared to a 6-stage LM32, a traditional RISC core with similar datapath resources. The core consumes 53% less energy on average compared to the RISC core. When including the instruction stream overheads, in the best case, LoTTA saves 79% energy, and on average 40%.","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115088292","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}
Promila Agarwal, Minqiang Jiang, N. Ling, Jianhua Zheng, Philipp Zhang
{"title":"Enhanced Intra Prediction Mode Coding by using Reference Samples","authors":"Promila Agarwal, Minqiang Jiang, N. Ling, Jianhua Zheng, Philipp Zhang","doi":"10.1109/SiPS.2018.8598421","DOIUrl":"https://doi.org/10.1109/SiPS.2018.8598421","url":null,"abstract":"HEVC utilizes 35 intra prediction modes to predict each luma block. To ensure the selected mode for a luma block is signaled with minimal overhead, HEVC defines a set of three most probable modes (MPM), which are derived based on the modes of its two neighbors. If the intra prediction mode is not one of these three most probable modes, it is coded as one of the remaining modes using a longer codeword. To improve the efficiency of intra prediction mode coding further, this paper presents a method to derive a second set of most probable modes, by using neighboring reconstructed samples. One line of reference samples is used as the original pixels and predicted by another line of reference samples. The sum of absolute differences (SAD) is employed as a measurement to select several modes with minimum SADs as the second MPM set. Experimental results show that for all intra configurations, the proposed method achieves on average 0.54%, 0.34%, and 0.34% BD-rate reductions for Y, U and V, respectively.","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115196116","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":"[Title page]","authors":"","doi":"10.1109/sips.2018.8598343","DOIUrl":"https://doi.org/10.1109/sips.2018.8598343","url":null,"abstract":"","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122513565","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":"RECache: ROM-Embedded 8-Transistor SRAM Caches for Efficient Neural Computing","authors":"Amogh Agrawal, K. Roy","doi":"10.1109/SiPS.2018.8598290","DOIUrl":"https://doi.org/10.1109/SiPS.2018.8598290","url":null,"abstract":"One of the fast ways of evaluating complex math tables, transcendental functions, high-order polynomials etc. is by storing them in read-only memories (ROMs). However, storing large dedicated ROMs on-chip is not feasible as they incur large area overhead. Moreover, that part of the chip lies waste when ROMs are not in use. To that effect, we show at least three proposals to embed ROMs into on-chip caches using standard 8-transistor static random access memories (SRAMs). Just by adding an extra word-line (WL) or a source-line (SL), the same bit-cell can store a RAM bit, as well as a ROM bit, while maintaining the performance and area-efficiency of standard SRAMs. Moreover, due to the decoupled read/write port of the 8T-SRAMs, RAM data is not destroyed during ROM accesses, unlike prior works. We demonstrate the effectiveness of using such ROM-Embedded RAMs as caches (RECache). An improvement of up-to 19.4× in cache performance was achieved by using RECache under ‘ROM-intensive’ workloads. Further, we expand the scope of RECache, and demonstrate its applicability in specialized neural hardware. Taking an example of spiking neural network (SNN) acceleration, an energy improvement of 1.7× and iso-area performance improvement of 1.9 × was achieved with RECache, compared to standard SRAM caches.","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122601266","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":"Energy Modeling of Cluster System","authors":"Xunfei Jiang, Yuhong Liu, X. Ruan, Tuguldur Baigalmaa, Lam Nguyen, Daiki Akiyoshi, Charles Peck","doi":"10.1109/SiPS.2018.8598317","DOIUrl":"https://doi.org/10.1109/SiPS.2018.8598317","url":null,"abstract":"Ever increasing energy consumption has been a major cost for maintaining data centers, and there is urgent need to reduce the energy consumption of data centers. The key components contribute a large portion of energy consumed in a computing node, both in terms of electrical cost and cooling cost. In this paper, we studied the performance and thermal profiling of a cluster, and proposed an approach to model energy consumption of a computing node based on the workload that is dispatched to the node. Statistical methods were used in generating the temperature and computing energy cost model, and our experimental result indicated high accuracy of our temperature model and energy model. Our proposed approach could be extended to large-scale cluster systems and data centers.","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"18 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120917535","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":"[Copyright notice]","authors":"","doi":"10.1109/sips.2018.8598391","DOIUrl":"https://doi.org/10.1109/sips.2018.8598391","url":null,"abstract":"","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131340233","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":"Expectation Propagation Detection with Neumann-Series Approximation for Massive MIMO","authors":"Yaping Zhang, Zhizhen Wu, Chunguo Li, Zaichen Zhang, X. You, Chuan Zhang","doi":"10.1109/SiPS.2018.8598353","DOIUrl":"https://doi.org/10.1109/SiPS.2018.8598353","url":null,"abstract":"For massive multiple-input multiple-output (MIMO) systems, signal detection is always a key concern. Traditional detection methods such as minimum mean square error (MMSE) all suffer from a variety of problems in respect of complexity and performance when applied to large-scale MIMO systems. In this paper, expectation propagation (EP) algorithm is employed to guarantee high-accuracy and low-complexity of symbol detection in high-dimensional MIMO systems. Nevertheless, in the iterative updating process of EP algorithm, the inevitable matrix inversion operation is one of the key challenges to the realistic hardware implementation. Therefore, a new improved EP, which is termed as expectation propagation with Neumann-series approximation (EP-NSA), is firstly proposed to accommodate the complexity as well as the performance by executing an approximate matrix inversion with a small number of Neumann-series terms. Simulation results have shown that the proposed EP-NSA with two items achieves notable performance improvement compared to belief propagation (BP) detection when the system loading factor is relatively large. For antenna configurations with large loading factor, this approach achieves similar performance to MMSE while keeping lower computational complexity.","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132507707","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 Genetic Algorithm for Designing Uncoded Space-Time Labelling Diversity Mappers","authors":"Sulaiman Saleem Patel, T. Quazi, Hongjun Xu","doi":"10.1109/SiPS.2018.8598435","DOIUrl":"https://doi.org/10.1109/SiPS.2018.8598435","url":null,"abstract":"The extent to which Uncoded Space-Time Labelling Diversity is able to improve the error performance of space-time block coded (STBC) systems is dependent on the binary mappers used to encode information. Existing design techniques are limited; as they either rely on symmetry-based heuristics, or constrain the size of the constellation due to high computational costs. This paper proposes a new genetic algorithm for labelling diversity (LD) mapper design which is applicable to constellations of any shape or size. The proposed algorithm is tested using 16QAM, 64QAM, 32PSK and three 16APSK constellations that do not display diagonal symmetry. The proposed LD mappers match the best heuristic designs for 16QAM and 64QAM. The 32PSK LD mapper produced achieves a diversity gain of ≈8dB when compared to the available heuristic-based LD mapper. In addition, the 16APSK mappers achieve a diversity gain of approximately 3 to 8dB compared to Alamouti-coded STBC systems for the three non-symmetric constellations considered.","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134117396","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":"Parallel Wavelet-based Bayesian Compressive Sensing based on Gibbs Sampling","authors":"Jian Zhou, C. Chakrabarti","doi":"10.1109/SiPS.2018.8598375","DOIUrl":"https://doi.org/10.1109/SiPS.2018.8598375","url":null,"abstract":"Bayesian compressive sensing (BCS) helps address ill-posed signal recovery problems using the Bayesian estimation framework. Gibbs sampling is a technique used in Bayesian estimation that iteratively draws samples from conditional posterior distributions. However, Gibbs sampling is inherently sequential and existing parallel implementations focus on reducing the communication between computing units at the cost of increase in recovery error. In this work, we propose a two-stage parallel coefficient update scheme for wavelet-based Bayesian compressive sensing, where the first stage approximates the real distributions of the wavelet coefficients and the second stage computes the final estimate of the coefficients. While in the first stage the parallel computing units share information with each other, in the second stage, the parallel units work independently. We propose a new coefficient update scheme that updates coefficients in both stages based on data generated a few rounds ago. Such a scheme helps in relaxing the timing constraints for communication in the first stage and computations in the second stage. We design the corresponding parallel architecture and synthesize it in 7 nm technology node. We show that in a system with 8 computing units, our method helps reduce the execution time by 17.4× compared to a sequential implementation without any increase in the signal recovery error.","PeriodicalId":124158,"journal":{"name":"2018 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134628786","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}