DocumentCode
174689
Title
Storage-allocation to sequential structures in High-Level Synthesis-assisted prototyping
Author
Kumar, Vinay B. Y. ; Maity, Somnath ; Patkar, Sachin B.
Author_Institution
Dept. of Electr. Eng., Indian Inst. of Technol. Bombay, Mumbai, India
fYear
2014
fDate
19-22 Oct. 2014
Firstpage
464
Lastpage
469
Abstract
Algorithm-to-hardware High-Level Synthesis (HLS) tools are becoming increasingly practical, particularly the domain specific approaches to HLS. Storage allocation is an important step in HLS where variables are mapped to onchip storage structures (OSS). HLS flows almost exclusively do this allocation to random access OSS whereas custom designers often pick from a repertoire of intuitive algorithm-appropriate OSS. In this work, revisiting a sparsely addressed problem of storage allocation to sequential access OSS, we report tractable algorithms for storage allocation to three kinds of sequential access style memories-Queue, Queue-Read Sequential-Write memory (QRSWM), and Sequential-Read Sequential-Write memory (SRSWM)-suitable for domains such as signal processing and matrix computations. A basic C to Verilog HLS flow was developed integrating these new allocations options to evaluate their impact on the overall design metrics of interest such as area and power. On application cases such as matrix multiplication and 2D/3D wavelet filtering, a comparison vis-a-vis RAM shows significant improvements in power consumption when targeting TSMC 0.18μ technology.
Keywords
hardware description languages; high level synthesis; queueing theory; sequential circuits; storage allocation; 2D-3D wavelet filtering; QRSWM; SRSWM; TSMC 0.18μ technology; algorithm-to-hardware HLS tools; algorithm-to-hardware high-level synthesis tools; basic C to Verilog HLS flow; intuitive algorithm-appropriate OSS; matrix multiplication; onchip storage structures; queue-read sequential-write memory; random access OSS; sequential access OSS; sequential access style memories; sequential-read sequential-write memory; size 0.18 mum; storage allocation; tractable algorithms; Algorithm design and analysis; Clocks; Power demand; Random access memory; Registers; Resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Design (ICCD), 2014 32nd IEEE International Conference on
Conference_Location
Seoul
Type
conf
DOI
10.1109/ICCD.2014.6974720
Filename
6974720
Link To Document