{"title":"Multirate hybrid continuous-time/discrete-time cascade 2–2 ΣΔ modulator for wideband telecom","authors":"J. G. García-Sánchez, J. M. Rosa","doi":"10.1109/VLSISoC.2011.6081599","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081599","url":null,"abstract":"This paper presents the design of a hybrid continuous-time/discrete-time fourth-order cascade ΣΔ modulator intended for wideband low-power wireless applications. The circuit is based on a new concept of multirate operation, in which the front-end stage - implemented using continuous-time (Gm-C) integrators - operates at a higher rate than the back-end (switched-capacitor) stage. This strategy benefits from the faster operation of continuous-time circuits while keeping power efficiency and high robustness against circuit element tolerances. Simulation results show that the modulator is able to operate with a maximum sampling rate of up to 1GHz, digitizing signals with a 44-to-92dB peak signal-to-(noise+distortion) ratio within a programmable 5-to-60MHz bandwidth.1","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"117 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":"115592403","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":"Worst case analysis for evaluating VLSI circuit performance bounds using an optimization method","authors":"Siwat Saibua, Liuxi Qian, Dian Zhou","doi":"10.1109/VLSISoC.2011.6081660","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081660","url":null,"abstract":"The process variations are unavoidable in today's VLSI circuits due to the continuing scaled IC technologies, therefore, the likely behaviors of VLSI circuits with process variations may fail to meet the performance specifications. This paper addresses an efficient method to evaluate the performance bounds of VLSI circuits with process variations in time domain. The described approach proceeds by solving a Nonlinear Programming (NLP) problem to find the upper and lower bounds of the interested outputs, either a node voltage or a branch current, constrained by linearlized equations, circuit equations and parameter variations. The preliminary result shows the performance bounds from the proposed method are sufficiently tight comparing with the bounds obtained from intensive Monte Carlo samplings in SPICE.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"116 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":"124139820","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":"On-chip structure and addressing scheme design for 2-D block data processing in a 64-core array system","authors":"Jing Xie, Huimin Xing, Zhigang Mao","doi":"10.1109/VLSISoC.2011.6081670","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081670","url":null,"abstract":"High throughput and high computation many core based on chip architecture is a development trend for high performance digital signal processing platform design. With frame and block data processing technology feature, the general linear memory architecture and on chip interconnection scheme may cause performance bottleneck for the application. In this paper work, we propose a 64-core array on chip architecture for high throughput and high performance 2-D block data processing, which with the features of hierachical architecture level, mirror symmetric interconnection structure and a Block level 2-D data addressing scheme. From the experiment show, the design can meet real time processing requirement of the 1080P data frame from H.264/AVC specification by use of block level matrix computation with average dynamic power report at 469.3mw.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"62 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":"114566916","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 general statistical estimation for application mapping in Network-on-Chip","authors":"Naifeng Jing, Weifeng He, Zhigang Mao","doi":"10.1109/VLSISoC.2011.6081669","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081669","url":null,"abstract":"Design space exploration is crucial to an optimal application mapping in Network-on-Chip. However, the optimality evaluation of the explored solution has been neglected in previous studies. In this paper, we propose an efficient and credible statistical estimation approach to evaluate the optimality of explored solutions with respect to the mapped communication, which is directly related to power dissipation in the network. Our approach is motivated by a basic statistical property on the solution space, and we consider the diversities in different complex on-chip network designs to make it more applicable. The statistical estimation and the optimality evaluation are validated in experiments by real and synthetic applications. It demonstrates an estimating error around 6% on average, which tends to be even smaller when problem scales up. We envision that the fidelity of our statistical estimation approach will promote its applicability in the promising Network-on-Chip designs.","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":"123438389","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":"Comparative ODE benchmarking of unidirectional and bidirectional DP networks for 3D-IC","authors":"K. Lam, T. Mak, C. Poon","doi":"10.1109/VLSISoC.2011.6081659","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081659","url":null,"abstract":"There has been great technological stride in 3D-IC on its design, analysis, and fabrication, with prediction that they will eventually lead to significant advances in multicore, multiprocessor, and network-on-chip (NoC) systems. A dynamic programming (DP) network is well suited for the grid stack architecture, because of its capability to achieve global optimality using only local computational units with short inter-grid communication links. In this paper we extend the transitive closure and shortest path unidirectional networks to bidirectional networks, with the development of an effective simulation tool for such type of DP networks. In addition to helping to construct real DP networks on 3D-IC, ODE (ordinary differential equation) simulation methodology for solving an average shortest path length problem provides new insights for comparative bench-marking very large-scale 2D/3D networks for different design considerations in application.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"101 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":"127123734","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}
Manas Kumar Puthal, Virendra Singh, M. Gaur, V. Laxmi
{"title":"C-Routing: An adaptive hierarchical NoC routing methodology","authors":"Manas Kumar Puthal, Virendra Singh, M. Gaur, V. Laxmi","doi":"10.1109/VLSISoC.2011.6081616","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081616","url":null,"abstract":"Deterministic routing algorithms are easier to design and implement in NoC but these fail to adapt to congestion. Table based adaptive routing solutions are not scalable. As the number of nodes increases, the area required for routing table becomes a penalty. In this paper, we propose a new hierarchical cluster based adaptive routing called ‘C-Routing’ in 2-D Mesh NoC. The solution reduces routing table size and provides deadlock freedom without use of virtual channels while ensuring livelock free routing. Routers in our method use intelligent routing to route information between the processing elements ensuring the correctness, deadlock freeness, and congestion handling. This method has been evaluated against other adaptive algorithms such as PROM, and Q-Routing etc. Results show that the proposed method performs better for given traffic patterns. C-routing uses adaptivity to avoid congestion by uniform distribution of traffic among the cores by sending flits over two different paths to the destination.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"126 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":"130195768","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}
C. Concatto, A. Kologeski, L. Carro, F. Kastensmidt, G. Palermo, C. Silvano
{"title":"Two-levels of adaptive buffer for virtual channel router in NoCs","authors":"C. Concatto, A. Kologeski, L. Carro, F. Kastensmidt, G. Palermo, C. Silvano","doi":"10.1109/VLSISoC.2011.6081596","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081596","url":null,"abstract":"NoC designs are based on a compromise of latency, power dissipation or energy, usually defined at design time. However, setting all parameters at design time can cause either excessive power dissipation (originated by router underutilization), or a higher latency. Moreover, routers with virtual channels have larger buffer sizes and more complex control, increasing the total costs. The situation worsens whenever the application changes its communication pattern, i.e., when a portable phone downloads a new service. In this paper we propose the use of a two-level adaptive buffer for a virtual channel router, where the buffers units and the virtual channels are dynamically allocated to increase router efficiency in a NoC, even under rather different communication loads. With the proposed architecture the buffer and virtual channels in the input channels of the routers can be adapted at run time. The adaptive virtual channel router decreases the latency in the worst case by 10%, and a reduction of 80% in the best case is achieved when compared to previous works.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"21 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":"127668553","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}
Antonio Artés, J. Ayala, A. Sathanur, J. Huisken, F. Catthoor
{"title":"Run-time self-tuning banked loop buffer architecture for power optimization of dynamic workload applications","authors":"Antonio Artés, J. Ayala, A. Sathanur, J. Huisken, F. Catthoor","doi":"10.1109/VLSISoC.2011.6081635","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081635","url":null,"abstract":"Instruction memory organization is pointed out as one of the major sources of energy consumption in embedded systems. As embedded systems are characterized by restrictive resources and low energy budget, any enhancement in this component allows not only to decrease the total energy consumption, but also to have a better distribution of the energy budget throughout the system. This paper presents a self-tuning banked loop buffer architecture, which is based on a run-time loop buffer controller that optimizes both the dynamic and leakage energy consumption of the instruction memory organization. Results show that using banking in loop buffer architectures leads to higher reduction in the total energy consumption of the instruction memory organization if the tuning approach is applied sparingly. Based on post-layout simulations, our approach improves the total energy consumption by average of 20% in comparison with a loop buffer architecture based on a single monolithic memory, and more than 90% in comparison with instruction memory organizations without loop buffer architectures.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"54 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":"132108852","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}
Shaowei Zhen, Bo Zhang, Ping Luo, Kang Yang, Xiaohui Zhu, Jiangkun Li
{"title":"A high efficiency synchronous buck converter with adaptive dead time control for dynamic voltage scaling applications","authors":"Shaowei Zhen, Bo Zhang, Ping Luo, Kang Yang, Xiaohui Zhu, Jiangkun Li","doi":"10.1109/VLSISoC.2011.6081628","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081628","url":null,"abstract":"An integrated synchronous buck converter with adaptive dead time controlled driver is presented in this paper. The integrated synchronous buck converter works in 2MHz PWM mode and the output voltage can be programmed by digital interface, which is suitable for powering the processor core and internal memory with dynamic voltage scaling (DVS) capability. The controller provides 0 and 100% duty cycles during DVS, maximizing tracking speed while saving power. The driver circuit detects body diode conduction by a proper biased N-type transistor. The synchronous N-type power MOS is turned on at the falling edge of body diode conduction detection in both DCM and CCM. The P-type power MOS is turned on at the falling edge of dead time detection in CCM. As a result, the dead time varies according to the load current, while the conduction time of the body diode in the synchronous power MOS is approaching to the delay of logic circuit and gate driver. The dead time control logic and gate driver are designed with low time lag to minimize body diode conduction time. Experimental results show that the converter can achieve fast reference tracking and the conversion efficiency is up to 90%.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"60 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":"134074705","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":"ThruChip interface (TCI) for 3D networks on chip","authors":"T. Kuroda","doi":"10.1109/VLSISoC.2011.6081644","DOIUrl":"https://doi.org/10.1109/VLSISoC.2011.6081644","url":null,"abstract":"This paper presents a wireless interconnection for 3D Networks on Chip, namely ThruChip Interface (TCI). TCI employs near field inductive coupling that is suitable for high-density parallel channel arrangement with small cross talk. It is less expensive than TSV by over 20¢/chip, since it is implemented by digital circuits in a standard CMOS. It bears comparison with TSV in terms of data rate (10Gb/s/ch), reliability (BER<10−14), and energy dissipation (0.1pJ/b). ESD protection devices can be eliminated to lower delay, power, and area. It provides with an AC coupling link to make interface design easy under multiple/variable VDD's. The cost/performance will further be improved exponentially by thinning chip thickness. This talk will cover basics, applications, and future perspectives of the TCI.","PeriodicalId":412989,"journal":{"name":"2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip","volume":"40 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":"121438511","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}