{"title":"A battery-free energy harvesting system with the switch capacitor sampler (SCS) technique for high power factor in smart meter applications","authors":"Tzu-Chi Huang, Yao-Yi Yang, Yu-Huei Lee, Ming-Jhe Du, Shih-Hsien Cheng, Ke-Horng Chen","doi":"10.1109/VLSISoC.2011.6081609","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081609","url":null,"abstract":"This paper presented a battery-free energy harvesting system with an auto-startup mechanism to achieve AC power monitoring. The proposed switch capacitor sampler (SCS) technique suppresses the total harmonic distortion (THD) since the energy is derived from the AC power lines. It can improve the performance of the power factor correction (PFC) in the harvesting system to achieve high power utilization. As a result, the proposed method can be used as a smart meter for monitoring or controlling the power delivery decision. A battery-free energy harvesting system with the SCS control technique was implemented by using 0.25-µm CMOS process. The die area is 0.25 mm2. The PF value can be raised to 0.98 with low THD of 17%.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129726634","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}
Wenmin Hu, Zhonghai Lu, A. Jantsch, Hengzhu Liu, Botao Zhang, Dongpei Liu
{"title":"Network-on-Chip multicasting with low latency path setup","authors":"Wenmin Hu, Zhonghai Lu, A. Jantsch, Hengzhu Liu, Botao Zhang, Dongpei Liu","doi":"10.1109/VLSISoC.2011.6081594","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081594","url":null,"abstract":"A low-latency path setup approach with multiple setup packets for parallel set is presented. It reduces the header overhead compared to multiaddress encoding. Further, we propose four variants of deadlock-free multicast routing algorithms using different subpath generation methods, different destination partitioning, and channel sharing strategies. Experimental results show that the quatuor partitions path-like tree outperforms other algorithms.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132182587","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}
Jianfei Jiang, Xu Wang, Weiguang Sheng, Weifeng He, Zhigang Mao
{"title":"A clock-less transceiver for global interconnect","authors":"Jianfei Jiang, Xu Wang, Weiguang Sheng, Weifeng He, Zhigang Mao","doi":"10.1109/VLSISoC.2011.6081672","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081672","url":null,"abstract":"High speed and low power transceivers start to be used for global interconnection in state-of-the-art System-on-Chips (SoCs). In traditional transceivers, the bandwidth is largely dependent on the clock rate. This paper presents a clock-less transceiver for global interconnect. The asynchronous transceiver makes the data rate only depend on the link delay and can be conveniently used with low swing scheme to create a high speed and low power communication system. The transceiver is demonstrated and simulated. The simulation results indicate that the transceiver can be used in high speed and low power global communications.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128797806","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 planning for RT-level delay insertion during clock skew-aware register binding","authors":"Keisuke Inoue, M. Kaneko","doi":"10.1109/VLSISoC.2011.6081638","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081638","url":null,"abstract":"In current VLSI complexity systems, clock skew scheduling is one of the key approaches to improve circuit performance and reliability. A delay insertion method has been discussed in logic-level to reduce the clock period. This paper extends this idea into high-level synthesis (HLS), and introduces a new HLS task, namely the minimum-path delay assignment. Since register binding plays an important role on the effect of the minimum-path delay assignment, this paper formulates the problem of simultaneously optimizing register binding and the minimum-path delay assignment. An MILP-based approach will be presented, and evaluated by experiment which shows the approach can reduce the clock period with an average of 14.1% compared to conventional clock skew-aware design.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127966468","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}
Xiaohang Wang, M. Palesi, Mei Yang, Yingtao Jiang, Michael C. Huang, Peng Liu
{"title":"Low latency and energy efficient multicasting schemes for 3D NoC-based SoCs","authors":"Xiaohang Wang, M. Palesi, Mei Yang, Yingtao Jiang, Michael C. Huang, Peng Liu","doi":"10.1109/VLSISoC.2011.6081604","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081604","url":null,"abstract":"In this paper, two topology oriented multicast routing algorithms, MXYZ and AL+XYZ, are proposed to support multicasting in 3D Networks on Chips (NoCs). In specific, MXYZ is a dimension order multicast routing algorithm that targets 3D NoC systems built upon regular topologies, while AL+XYZ is applicable to NoCs with irregular topologies. If the output channel found by MXYZ is not available (i.e. in the same region), an alternative output channel is used to forward/replicate the packets in AL+XYZ. MXYZ is evaluated against a path based regular topology oriented multicast routing and AL+XYZ against an irregular region oriented multiple unicast routing algorithm. Our experimental results have demonstrated that the proposed MXYZ and AL+XYZ schemes have lower latency and energy consumption than the conventional path based multicast routing and the multiple unicast routing algorithms, meriting them to be more suitable for supporting multicasting in 3D NoC systems.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"88 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124315590","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":"Context-aware compiled simulation of out-of-order processor behavior based on atomic traces","authors":"Roman Plyaskin, A. Herkersdorf","doi":"10.1109/VLSISoC.2011.6081615","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081615","url":null,"abstract":"Advanced out-of-order processors exhibit complex dynamic behavior. Therefore, they are difficult to model at abstraction levels higher than cycle-accurate instruction set simulators (ISS's). Conventional compiled simulation techniques have been widely used for fast performance estimation. However, they assume static time intervals between memory accesses and do not consider diverse behavior of out-of-order processors. In this paper, we introduce context-aware compiled simulation, in which the timing of basic blocks is defined dynamically, depending on the previously executed basic blocks. We extend binary-level compiled simulation correspondingly and show that consideration of contexts can significantly increase the accuracy of performance estimation. With the proposed technique, we could reduce the average error of timing estimation to 0,47% at average speedup of 45x compared to sim-outorder simulator from the SimpleScalar tool set.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127516446","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":"Uniform carbon nanotube diameter and nanoarray pitch for VLSI of 16nm P-channel MOSFETs","authors":"Yanan Sun, V. Kursun","doi":"10.1109/VLSISoC.2011.6081642","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081642","url":null,"abstract":"Uniformities of carbon nanotube diameters and nanoarray pitch values of all the transistors across a chip are required to enable low cost very large scale integration (VLSI) with the carbon nanotube technology. Nanotube diameter and nanoarray pitch are concurrently optimized and unified in this paper with two different substrate bias voltages considering a wide range of p-channel transistor sizes. A performance and density metric is evaluated to identify the optimum p-type device profiles suitable for very large scale integration with a 16nm carbon nanotube transistor technology.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123890354","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}
Jamshaid Sarwar Malik, J. Malik, A. Hemani, N. Gohar
{"title":"Generating high tail accuracy Gaussian Random Numbers in hardware using central limit theorem","authors":"Jamshaid Sarwar Malik, J. Malik, A. Hemani, N. Gohar","doi":"10.1109/VLSISoC.2011.6081630","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081630","url":null,"abstract":"An efficient hardware implementation of Gaussian Random Number (GRN) generator based on Central Limit Theorem (CLT) is presented. CLT, although very simple to implement, is never used to generate high quality Gaussian numbers. This is due to the fact that direct implementation of CLT provides very poor accuracy in tail regions of the probability density function. In this work, we have shown that it is possible to achieve high tail accuracy by empirically computing the error in CLT, which can be compensated with a simple correction algorithm. The error has been modeled as first degree piece-wise polynomial approximation, using a novel non-uniform segmentation algorithm to compute the coefficients of polynomial segments. A novel hardware architecture of GRN generator is presented which requires only 420 slices and 1 DSP block of Xilinx Virtex-4 XC4VLX15 operating at 220 MHz. This resource utilization is better than any of the previously reported designs. Demonstrated for the tail accuracy of 6σ, the GRN generator design is scalable to achieve even higher accuracy with minimal increase in hardware resources. The accuracy of GRN generator is validated using statistical goodness of fit tests.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121735062","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":"Cycle avoidance in 2D/3D bidirectional graphs using shortest-path dynamic programming network","authors":"K. Lam, T. Mak, C. Poon","doi":"10.1109/VLSISoC.2011.6081607","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081607","url":null,"abstract":"An ordinary-differential-equation (ODE) simulation model has recently been proposed for an N-node dynamic programming (DP) network, which solves the transitive closure and shortest path problems on an architecturally equivalent N-node 2D/3D grid stack. For large-scale randomly generated bidirectional network, where N is large and the inter-grid paths may take either direction, cycles commonly occur leading to a high percentage of nodes with unbound path lengths. The detection of such cycle nodes can be readily found using a shortest-path DP network. In this work we address several issues on the cycle avoidance problem, by first defining the 〈H〉-index and 〈V〉-index and hence its product 〈HV〉 as the two-dimensional turn ability. A regression model was then proposed and obtained empirically to relate the cycle-node ratio, which is the percentage of cycle nodes over N, with 〈HV〉 for several random networks of sizes N = 10×10×2, 10×10×5, 10×10×8. By reducing 〈HV〉 from 0.8 to 0.2, the cycle-node ratio can be reduced from close to 60% to 20% and indicates a significant avoidance of cycle nodes.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130408244","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}
S. L. Beux, Jelena Trajkovic, I. O’Connor, G. Nicolescu
{"title":"Layout guidelines for 3D architectures including Optical Ring Network-on-Chip (ORNoC)","authors":"S. L. Beux, Jelena Trajkovic, I. O’Connor, G. Nicolescu","doi":"10.1109/VLSISoC.2011.6081645","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081645","url":null,"abstract":"Trends in design of the next generation of Multi-Processors System on Chip (MPSoC) point to 3D integration of thousand of processing elements, requiring high performance interconnect for high throughput and low latency communications. Optical on-chip interconnects enable significantly increased bandwidth and decreased latency. They are thus considered as one of the most promising paradigms for the design of such system. However, existence of interfaces between electronic and photonic signals implies strong constraints on the layout of the 3D architecture and may impact the architecture scalability. In this paper, we propose and evaluate a possible layout for an optical Network-on-Chip used to interconnect processing elements located on different electrical layers.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116939542","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}