(Back to Session Schedule)

SASIMI 2013
The 18th Workshop on Synthesis And System Integration of Mixed Information Technologies

Poster III
Time: 16:50 - 18:00 Monday, October 21, 2013
Location: Tanchō-Hakuchō 1 & Kujyaku
Chairs: Shinobu Nagayama (Hiroshima City University, Japan), Zhu Qiang (Cadence Design Systems, Japan)

R3-1 (Time: 16:50 - 16:52)
TitleA Heuristic Method to Find Linear Decompositions for Incompletely Specified Index Generation Functions
AuthorTsutomu Sasao, *Yuta Urano, Yukihiro Iguchi (Meiji University, Japan)
Pagepp. 143 - 148
Keywordlogic minimization, linear transform, Functional decomposition, minimul covering
AbstractThis paper shows a method to find a linear transformation that reduces the number of variables to represent a given incompletely specified index generation function. It first generates the difference matrix, and then finds the minimal set of variables using a covering table. Linear transformations are used to modify the covering table to produce a smaller solution.

R3-2 (Time: 16:52 - 16:54)
TitleA New Design Methodology for Rounding and Hardware Minimization in Look-Up-Table-Based Arithmetic Function Evaluation
Author*Shen-Fu Hsiao (National Sun Yat-sen University, Taiwan), Hou-Jen Ko (Purdue University, U.S.A.), Yu-Ling Tseng (SpringSoft, Taiwan), Chia-Sheng Wen (National Sun Yat-sen University, Taiwan)
Pagepp. 149 - 152
Keywordfunction evaluation, error analysis, truncated multiplier, digital arithmetic
AbstractThis paper presents a new approach of determining the bit-widths of hardware components in arithmetic function evaluators based on Look-Up Tables (LUTs) The rounding of floating-point constant values to be stored in LUTs and the hardware minimization in the subsequent arithmetic computation are considered jointly in order to optimize the entire design. The piecewise polynomial approximation with truncated multiplication is used to demonstrate the proposed method. Previous similar designs usually determine the bit widths of the quantized polynomial coefficients and the corresponding multipliers by pre-assigning allowable errors for the individual hardware components, including ROM and arithmetic units. The proposed design considers all the error sources, including the approximation errors, quantization errors, truncation errors, and final rounding errors simultaneously. Thus, the total error budget can be utilized more efficiently and the bit widths of the hardware components (ROM, multipliers, adders) can be optimized, leading to significant improvements in both area and delay. Experimental results show that the proposed method can reduce up to 48% of the total area and up to 25% of delay compared to conventional design approaches.

R3-3 (Time: 16:54 - 16:56)
TitleA Global Router Considering Scenic Controls
AuthorHsueh-Ju Chou (Faraday Technology Corporation, Taiwan), Hsi-An Chien, *Ting-Chi Wang (National Tsing Hua University, Taiwan)
Pagepp. 153 - 158
KeywordGlobal Routing, Scenic Controls
AbstractIn this paper, we study a global routing problem that considers not only overflow and wirelength but also scenic controls. A scenic control is often given to a timing-critical net for coping with timing closure in a modern physical synthesis flow. We enhance an academic global router to handle scenic controls. The enhancements are (1) a new net ordering method for rip-up and reroute, (2) two length bound allocation methods, and (3) a length-bounded adaptive multi-source and multi-sink maze routing method. The experimental results show that our global router is able to produce a high-quality solution in terms of overflow and wirelength without any violation of scenic controls for each test case.

R3-4 (Time: 16:56 - 16:58)
TitleA Tuning Method of Programmable Delay Element with Two Values for Yield Improvement
Author*Hayato Mashiko, Yukihide Kohira (The University of Aizu, Japan)
Pagepp. 159 - 164
KeywordDelay variation, Timing violation, Yield, Programmable delay element
AbstractTo recover the timing violations, which cause significant reduction in the yield of LSI chips, programmable delay elements called PDEs are inserted into the clock tree before fabrication and their delays are tuned after fabrication. In this paper, we use PDEs with two delay values and propose a delay tuning method of the PDE to improve the yield and to reduce the number of tests. Moreover, we evaluate the circuits obtained by the proposed method by using commercial CAD tools.
PDF file

R3-5 (Time: 16:58 - 17:00)
TitleImpact of Drive Strength and Well-Contact Density on Heavy-Ion-Induced Single Event Transient
Author*Jun Furuta (Kyoto University, Japan), Masaki Masuda, Katsuyuki Takeuchi, Kazutoshi Kobayashi (Kyoto Institute of Technology, Japan), Hidetoshi Onodera (Kyoto University, Japan)
Pagepp. 165 - 169
Keywordsoft error, SET, pulse width
AbstractWe measure distributions of heavy-ioninduced Single Event Transient (SET) pulse widths from the 4 kinds of inverter chains to measure their characteristics and estimate SET-induced soft error rates on a Flip-Flop (FF) and a delayed TMR FF. Measurement results show that maximum SET-induced soft error rate on a FF is equivalent to 20% of Single Event Upset (SEU) rate. On the delayed TMR with 400ps delay element, SET-induced soft error rate can be reduced by using 4x inverters with 2μm well-contact distance.

R3-6 (Time: 17:00 - 17:02)
TitleA Technique for Accelerating Adaptive Super Resolution Technique Based on Local Features of Images Using GPU
Author*Kento Kugai, Yuzuru Shizuku, Tetsuya Hirose, Nobutaka Kuroki, Masahiro Numa (Kobe University, Japan)
Pagepp. 170 - 175
KeywordCUDA, GPGPU, Super Resolution
AbstractIn this paper, we propose a technique to accelerate adaptive super resolution technique based on local features of images using a Graphics Processing Unit (GPU). We have applied the acceleration technique to both super resolution process and learning process. Experimental results have shown that the proposed technique achieves speedups of 2.36 times in average, and 3.35 times at the maximum compared with the conventional technique using Central Processing Unit (CPU).

R3-7 (Time: 17:02 - 17:04)
TitleParallel Layer-Aware Partitioning for 3D Designs
Author*Yi-Hang Chen, Yi-Ting Chen, Juinn-Dar Huang (National Chiao Tung University, Taiwan)
Pagepp. 176 - 179
Keywordthrough-silicon via, 3D integration technology, layering, partitioning, multicore architecture
AbstractAs compared with two-dimensional (2D) ICs, 3D integration is a breakthrough technology of growing importance that has the potential to offer significant performance and functional benefits. This emerging technology allows stacking multiple layers of dies and resolves the vertical connection issue by through-silicon vias (TSVs). However, though a TSV is considered a good solution for vertical connection, it also occupies significant silicon estate and incurs reliability problem. Because of these challenges, to minimize the number of TSVs becomes important in the design processes. Therefore, in this paper, we propose a two-phase parallel layer-aware partitioning algorithm for TSV minimization in 3D structures. In the first-phase, we employ OpenMP to parallelize the 2-way min-cut partitioning steps and get the initial solution. In the second-phase, we further improve the result by using parallel simulated annealing algorithm on GPU. The experimental results show that proposed method can reduce the number of TSVs by about 39% as compared to several existing methods.
PDF file

R3-8 (Time: 17:04 - 17:06)
TitleLithium-Ion Battery Degradation Model and Its Application to Power Management of Smart House
Author*Ryosuke Miyahara, Ami Watanabe, Masahiro Fukui (Ritsumeikan University, Japan)
Pagepp. 180 - 185
KeywordSmart house, battery modeling, power management
AbstractAiming at low carbon society, it is important that smart houses spread for efficient utilization of natural energy sources, e.g., photovoltaic battery. However, cost of the degradation of the batteries is a non-ignorable portion of the total cost for the power management in the smart houses. This paper discusses how to formulate the degradation of the batteries, and clarifies the efficient keys to control the cost of battery degradation. Finally, we propose an efficient power management scheme for real smart houses.

R3-9 (Time: 17:06 - 17:08)
TitleParameter Estimation and Model Reduction for Digital IIR Filters Using a Modified PSO Algorithm
Author*Wei-Der Chang, Ching-Lung Chi (Shu-Te University, Taiwan)
Pagepp. 186 - 189
Keywordmodified PSO, filter design
AbstractThis paper develops a new design method for digital IIR filters in the parameter estimation and model reduction. The employed method is the modified particle swarm optimization (MPSO) whose velocity formula is slightly changed to enhance the algorithm performance. Design steps of MPSO-based are presented for the IIR filters. Finally, two kinds of experiments including the filter parameter estimation and model reduction are provided as well. Simulation results will show the applicability of the proposed method.

R3-10 (Time: 17:08 - 17:10)
TitleInvestigating Performance Advantages of Random Topologies on Network-on-Chip
AuthorSarat Yoowattana (Asian Institute of Technology, Thailand), *Ikki Fujiwara, Michihiro Koibuchi (National Institute of Informatics, Japan)
Pagepp. 190 - 194
KeywordNetwork-on-Chip, topology, interconnection networks
AbstractAs technology continues to scale down, the number of cores significantly increases, e.g. 64 cores. The communication latencies increasingly give the negative impact on the performance of parallel applications on Chip MultiProcessors (CMPs). A random topology, which provides lowest diameter and average shortest path length, has been recently considered for low-latency Network-on-Chip (NoC). In this work we investigate its advantage in throughput-and-latency properties for various traffic patterns and we compare the random topology with traditional non-random topologies, such as two-dimensional mesh in various network sizes. Thorough our cycle-accurate network simulation, we found that the random topology significantly outperforms 2-D mesh and 2-D torus in terms of network latency.
PDF file

R3-11 (Time: 17:10 - 17:12)
TitleSpeed Traffic-Sign Recognition Algorithm for Real-Time Driving Assistant System
Author*Masaharu Yamamoto, Anh-Tuan Hoang, Mutsumi Omori, Tetsushi Koide (Hiroshima University, Japan)
Pagepp. 195 - 200
KeywordNumber recognition, Hardware implementation, Driving safety support system, Speed traffic-sign, Real-time
AbstractThe purpose of this research is development of an algorithm for hardware implementation for number recognition applying in speed traffic-sign recognition system for car driving assistant. We recognize the speed limit of the speed traffic-sign using hardware oriented extraction algorithm. The numbers are recognized by comparing their feature values with the recognized features. The proposed hardware oriented number recognition algorithm achieves almost 100 % in recognition rate in 31 scenes in highways and 23 scenes in local roads.
PDF file

R3-12s (Time: 17:12 - 17:14)
TitleA Development and Evaluation of Variable Speed Charger System for Lithium-Ion Battery
Author*Akihiro Segawa, Yusuke Yamamoto, Lei Lin, Masahiro Fukui (Ritsumeikan University, Japan)
Pagepp. 201 - 202
KeywordLithium-ion Battery, Charger, variable speed charger
AbstractThis paper describes a development and evaluation variable speed charger system for lithium ion battery. High speed charge is a cause to occur degradation and a safe problem because the over-current and over-voltage are supplied to the battery at charging, and temperature of the battery rises. Thus, we proposed a variable speed charge system that controls the charge current depending on the temperature rise. The variable speed charger supplies variable current during the CC (Constant Current) charge operation. That is controlling the currents to restrain a temperature rise of the battery. It reduces the damages to battery and optimally charge for a battery.