TY - JOUR
T1 - A high-level synthesis algorithm with inter-island distance based operation chainings for RDR architectures
AU - Terada, Kotaro
AU - Yanagisawa, Masao
AU - Togawa, Nozomu
N1 - Publisher Copyright:
Copyright © 2015 The Institute of Electronics, Information and Communication Engineers.
PY - 2015/7/1
Y1 - 2015/7/1
N2 - In deep-submicron era, interconnection delays are not negligible even in high-level synthesis and regular-distributed-register architectures (RDR architectures) have been proposed to cope with this problem. In this paper, we propose a high-level synthesis algorithm using operation chainings which reduces the overall latency targeting RDR architectures. Our algorithm consists of three steps: The first step enumerates candidate operations for chaining. The second step introduces maximal chaining distance (MCD), which gives the maximal allowable inter-island distance on RDR architecture between chaining candidate operations. The last step performs list-scheduling and binding simultaneously based on the results of the two preceding steps. Our algorithm enumerates feasible chaining candidates and selects the best ones for RDR architecture. Experimental results show that our proposed algorithm reduces the latency by up to 40.0% compared to the original approach, and by up to 25.0% compared to a conventional approach. Our algorithm also reduces the number of registers and the number of multiplexers compared to the conventional approaches in some cases.
AB - In deep-submicron era, interconnection delays are not negligible even in high-level synthesis and regular-distributed-register architectures (RDR architectures) have been proposed to cope with this problem. In this paper, we propose a high-level synthesis algorithm using operation chainings which reduces the overall latency targeting RDR architectures. Our algorithm consists of three steps: The first step enumerates candidate operations for chaining. The second step introduces maximal chaining distance (MCD), which gives the maximal allowable inter-island distance on RDR architecture between chaining candidate operations. The last step performs list-scheduling and binding simultaneously based on the results of the two preceding steps. Our algorithm enumerates feasible chaining candidates and selects the best ones for RDR architecture. Experimental results show that our proposed algorithm reduces the latency by up to 40.0% compared to the original approach, and by up to 25.0% compared to a conventional approach. Our algorithm also reduces the number of registers and the number of multiplexers compared to the conventional approaches in some cases.
KW - Floorplan
KW - High-level synthesis
KW - Interconnection delay
KW - Operation chaining
KW - RDR architecture
UR - http://www.scopus.com/inward/record.url?scp=84937598711&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937598711&partnerID=8YFLogxK
U2 - 10.1587/transfun.E98.A.1366
DO - 10.1587/transfun.E98.A.1366
M3 - Article
AN - SCOPUS:84937598711
SN - 0916-8508
VL - E98A
SP - 1366
EP - 1375
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
IS - 7
ER -