发布求助
文献互助 智能选刊 最新文献

2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)最新文献

筛选
英文 中文
An Approximate Solution Using K-Shortest Paths for a Communication Link Load Balancing Problem 通信链路负载均衡问题的k -最短路径近似解
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212604
Himeno Takahashi, N. Shinomiya
{"title":"An Approximate Solution Using K-Shortest Paths for a Communication Link Load Balancing Problem","authors":"Himeno Takahashi, N. Shinomiya","doi":"10.1109/ITC-CSCC58803.2023.10212604","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212604","url":null,"abstract":"In recent years, the amount of data traffic in information and communication networks has been increasing and the risk of congestion has been rising. Our previous study formulated a problem to determine the flow distribution that minimizes the maximum load factor of links with a goal of leveling the traffic load on the communication links. This problem is called UELB problem and proven to be NP-hard. Therefore, this paper proposes an approximate solution method for the UELB problem using K-shortest paths as one of the heuristic methods. As a result, the proposed method could obtain a feasible solution with less computational complexity than obtaining an exact solution.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125016287","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}
引用次数: 0
Matrix Inversion Accelerated MCU Circuit for Image Recognition Pertinent Computation 矩阵反演加速单片机电路图像识别相关计算
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212438
Weisheng Wang, Yu Jin, Quan Yuan, Heming Sun
{"title":"Matrix Inversion Accelerated MCU Circuit for Image Recognition Pertinent Computation","authors":"Weisheng Wang, Yu Jin, Quan Yuan, Heming Sun","doi":"10.1109/ITC-CSCC58803.2023.10212438","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212438","url":null,"abstract":"As the most complex computation in the fundamental matrix manipulation, the operation of matrix inversion limits the processing capability in the field of the image recognition and the pertinent application specified circuit. The intensive computation of matrix inversion is mitigated by efficient algorithms such as the Sherman-Morrison formula and accelerated floating-point multiplication and addition, while still suffering from division operations. Here, we present a high-performance floating-point divider circuit, which is capsuled as an instructor in to a general processor Cortex-M3 MCU to efficiently improve the matrix inversion speed in image recognition. The reconstructed MCU circuits are fully implemented on the Xilinx Spartan6 FPGA platform. Compared to the Xilinx floating point IP, the proposed architecture intensively reduces the division operation time by 82%.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116561195","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}
引用次数: 0
Analysis of EDF and RM scheduling algorithms for periodic and aperiodic tasks in multi-core ECU 多核ECU中周期和非周期任务的EDF和RM调度算法分析
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212836
Se Jeong Lim, Jong Hun Kim, Jaewook Jeon
{"title":"Analysis of EDF and RM scheduling algorithms for periodic and aperiodic tasks in multi-core ECU","authors":"Se Jeong Lim, Jong Hun Kim, Jaewook Jeon","doi":"10.1109/ITC-CSCC58803.2023.10212836","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212836","url":null,"abstract":"As the development of innovative automotive software continues to progress, the architecture and solutions required for automotive software become more complex. It is challenging to cope with these issues with a single-core Electronic Control Unit (ECU), and therefore a multi-core ECU is being utilized as a solution. When tasks enter the multi-core ECU, it is necessary to properly divide the processes into multiple cores to execute the tasks. Tasks in a vehicle consist of periodic tasks and aperiodic tasks, which are mainly handled through Rate-monotonic (RM) and Earliest Deadline First (EDF) scheduling, utilizing a Server to manage aperiodic tasks. Polling Server (PS) is employed in RM scheduling, and Total Bandwidth Server is used in EDF scheduling to handle aperiodic tasks. The present study aims to conduct a comparative analysis of the performance of two distinct scheduling algorithms through experiments consisting of periodic and aperiodic tasks by examining several variables.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127776605","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}
引用次数: 0
The Time Synchronization of CAN-FD and Ethernet for Zonal E/E Architecture 区域E/E架构中CAN-FD与以太网的时间同步
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212902
S. Oh, Y. Do, Jaewook Jeon
{"title":"The Time Synchronization of CAN-FD and Ethernet for Zonal E/E Architecture","authors":"S. Oh, Y. Do, Jaewook Jeon","doi":"10.1109/ITC-CSCC58803.2023.10212902","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212902","url":null,"abstract":"In recent times, the automotive electric/electronics (E/E) architecture has been changing to meet various requirements such as safety, entertainment, and driver assistance. The zonal E/E architecture that groups electronic control units (ECUs) by their physical location is expected the future automotive E/E architecture. In the zonal architecture, the time synchronization between the nodes in the different zone is a key challenge for reliable and stable vehicular operations. This paper proposes a methodology of time synchronization for the zonal architecture based on the controller area network flexible data rate (CAN-FD), Ethernet. We focus on applying the precision time protocol (PTP) format to CAN-FD messages. The implementation and evaluation are performed by TC275-based embedded boards.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133295987","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}
引用次数: 0
In-Cache Processing with Power-of-Two Quantization for Fast CNN Inference on CPUs 基于2次幂量化的cpu快速CNN推理缓存处理
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212854
Joseph Woo, Seungtae Lee, Seongwoo Kim, Gwang-Jun Byeon, Seokin Hong
{"title":"In-Cache Processing with Power-of-Two Quantization for Fast CNN Inference on CPUs","authors":"Joseph Woo, Seungtae Lee, Seongwoo Kim, Gwang-Jun Byeon, Seokin Hong","doi":"10.1109/ITC-CSCC58803.2023.10212854","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212854","url":null,"abstract":"Convolutional Neural Networks (CNN) demand high computational capabilities, motivating researchers to leverage Processing-In-Memory (PIM) technology to achieve significant performance improvements. However, implementing complex arithmetic operations such as multiplication within memory is a significant challenge in the PIM architecture. To address this challenge, this paper proposes a PIM-enabled cache (PEC) architecture that utilizes shifters for performing multiplication operations at a low cost. We also introduce a filter-wise hardware-friendly Power-of-Two (POT) quantization scheme that quantizes weights into power-of-two values for specific filters to accelerate convolution operations with the PEC. Our experimental results demonstrate that the proposed PEC, together with the POT quantization, achieves 2.28x performance improvement on average with an accuracy degradation of 0.784%.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133746061","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}
引用次数: 0
Proposed Separation Distance for Frequency Sharing between 5G Base Station and Satellite Gateway 5G基站与卫星网关频率共享的分离距离建议
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212735
H. Son
{"title":"Proposed Separation Distance for Frequency Sharing between 5G Base Station and Satellite Gateway","authors":"H. Son","doi":"10.1109/ITC-CSCC58803.2023.10212735","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212735","url":null,"abstract":"Recently, various wireless services are being provided using low earth orbit (LEO) satellites, which operate in orbit between 200 and 2000 kilometers above the earth. In this paper, the interference effect of uplink of LEO's feeder link on 5th generation(5G) mobile communication was analyzed. As a result, a separation distance was derived in which satellite gateway's transmission did not interfere with the 5G base station using same frequency band.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131917362","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}
引用次数: 0
Video Semantic Segmentation for Intersection by Domain Adaptation 基于域自适应的交叉视频语义分割
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212842
Shota Suzuki, Takafumi Katayama, Tian Song, T. Shimamoto
{"title":"Video Semantic Segmentation for Intersection by Domain Adaptation","authors":"Shota Suzuki, Takafumi Katayama, Tian Song, T. Shimamoto","doi":"10.1109/ITC-CSCC58803.2023.10212842","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212842","url":null,"abstract":"In recent years, semantic segmentation, which is one of the image recognition technologies for automatic driving, has attracted attention. Semantic segmentation can perform high accuracy object detection by discriminating classes with pixel level precision. However, training data for segmentation usually requires extensive manual labor because a corresponding label has to be assigned to each pixel. Currently, using a computer graphics (CG) dataset makes it easier to create supervised data. However, when inference images are real-world, intersection over union (IoU) is greatly reduced by the variation of the domain. In this work, an unsupervised domain adaptation (UDA) training method is proposed to achieve efficient intersection video segmentation models for each target domain. The inference is performed for intersection images with relatively complex situations. The simulation results show that the proposed algorithm for semantic segmentation of intersection videos achieve IoU scores comparable to supervised learning for classes that are prominently displayed on the screen.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"361 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115292467","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}
引用次数: 0
Timing Window Shifting for Crosstalk Avoidance in 3D-IC 3D-IC中串扰避免的时序窗移位
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212806
M. Choi, Inhye Kye, Myungwoo Jin, Juho Kim
{"title":"Timing Window Shifting for Crosstalk Avoidance in 3D-IC","authors":"M. Choi, Inhye Kye, Myungwoo Jin, Juho Kim","doi":"10.1109/ITC-CSCC58803.2023.10212806","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212806","url":null,"abstract":"This paper presents an efficient heuristic algorithm for avoiding the occurrence of crosstalk affecting delay in 3D IC by downsizing or upsizing gates. The proposed algorithm classifies gate sizing into two steps, and to maximize the avoidance effect, downsizing in step1 and upsizing in step2 are applied sequentially to avoid aggressors adjacent to the critical path in turn. The proposed algorithm is tested on the benchmark circuit to verify its efficiency, and the experimental results show an average crosstalk avoidance effect of 9.45%. This result demonstrates the feasibility of the proposed new algorithm.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121429493","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}
引用次数: 0
Gene-Ants: Ant Colony Optimization with Genetic Algorithm for Traveling Salesman Problem Solving 基因蚂蚁:基于遗传算法的蚁群优化求解旅行商问题
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212945
Sarin Thong-ia, P. Champrasert
{"title":"Gene-Ants: Ant Colony Optimization with Genetic Algorithm for Traveling Salesman Problem Solving","authors":"Sarin Thong-ia, P. Champrasert","doi":"10.1109/ITC-CSCC58803.2023.10212945","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212945","url":null,"abstract":"The Traveling Salesman Problem (TSP) is a well-known NP-hard problem that receives attention in many fields. To solve the NP-hard problems, Ant Colony Optimization (ACO) is a popular meta-heuristic that gives an effective solution of TSP but the limitation of ACO has an early stage of optimization and falls to the local optimal. To overcome the limitation of ACO, we use Genetic Algorithm (GA) that has the ability to avoid local optimal for improving the solution of ACO. In this paper, we present the ACO with the genetic operation from GA that is called Gene-Ants. Also, compare the result of the Gene-Ants algorithm with the basic ACO algorithm in the different TSP instances benchmark. The summarized results from the experiments show the Gene-Ants algorithm outperforms the basic ACO algorithm in terms of global optimal solution finding and convergence rate.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122587372","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}
引用次数: 0
Analysis of Combination HEX and Minimal HEX Reprogramming Methods Using UDS Protocol 基于UDS协议的组合HEX和最小HEX重编程方法分析
2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC) Pub Date : 2023-06-25 DOI: 10.1109/ITC-CSCC58803.2023.10212492
Jung Ju Lee, Jong Hun Kim, Jae Bum Park, Jaewook Jeon
{"title":"Analysis of Combination HEX and Minimal HEX Reprogramming Methods Using UDS Protocol","authors":"Jung Ju Lee, Jong Hun Kim, Jae Bum Park, Jaewook Jeon","doi":"10.1109/ITC-CSCC58803.2023.10212492","DOIUrl":"https://doi.org/10.1109/ITC-CSCC58803.2023.10212492","url":null,"abstract":"This paper compared the new data transmission methods, Combination Hex and Minimal Hex, with the existing data transmission method, Motorola S19 format, due to the increasing demand for reducing vehicle reprogramming time. The experimental environment consisted of a client-gateway-ECU structure like a real in-vehicle network, and the CAN-TP protocol was used to implement UDS-based reprogramming. Experimental results show that the new data transmission methods, Combination Hex and Minimal Hex formats, have a 30% improvement in transmission time and number of CAN frames compared to the existing data transmission methods.","PeriodicalId":220939,"journal":{"name":"2023 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129852509","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信