Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/4985
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSengupta, Anirbanen_US
dc.date.accessioned2022-03-17T01:00:00Z-
dc.date.accessioned2022-03-17T15:36:20Z-
dc.date.available2022-03-17T01:00:00Z-
dc.date.available2022-03-17T15:36:20Z-
dc.date.issued2017-
dc.identifier.citationSengupta, A., Bhadauria, S., & Mohanty, S. P. (2017). TL-HLS: Methodology for low cost hardware trojan security aware scheduling with optimal loop unrolling factor during high level synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 36(4), 655-668. doi:10.1109/TCAD.2016.2597232en_US
dc.identifier.issn0278-0070-
dc.identifier.otherEID(2-s2.0-85017623350)-
dc.identifier.urihttps://doi.org/10.1109/TCAD.2016.2597232-
dc.identifier.urihttps://dspace.iiti.ac.in/handle/123456789/4985-
dc.description.abstractSecurity against hardware Trojan that is capable to change the computational output value is accomplished by employing dual modular redundant (DMR) schedule during high level synthesis (HLS). However, building a DMR for Trojan security is nontrivial and incurs extra delay and hardware. This paper proposes a novel HLS methodology for constraint driven low cost hardware Trojan secured DMR schedule design for loop-based control data flow graphs (CDFGs). Proposed approach simultaneously explores an optimal schedule and optimal loop unrolling factor (U) combination for a low cost Trojan security aware DMR schedule. As a specific example, proposed low cost Trojan secured HLS approach relies on particle swarm optimization algorithm to explore optimized Trojan secured schedule with optimal unrolling that provides security against specific Trojan (causing change in computational output) within user provided area and delay constraints. The novel contributions of this paper are, first an exploration of a low cost Trojan security aware HLS solution for loop-based CDFGs; second, proposed encoding scheme for representing design solution comprising candidate schedule resources, candidate loop unrolling factor and candidate vendor allocation information; third, a process for exploring the a low cost vendor assignment that provides Trojan security; finally, experimental results over the standard benchmark that indicates an average reduction in final cost of 12% compared to recent approach. © 1982-2012 IEEE.en_US
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.sourceIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systemsen_US
dc.subjectCostsen_US
dc.subjectData flow analysisen_US
dc.subjectData flow graphsen_US
dc.subjectGraphic methodsen_US
dc.subjectHigh level synthesisen_US
dc.subjectIntellectual propertyen_US
dc.subjectParticle swarm optimization (PSO)en_US
dc.subjectControl data flow graphsen_US
dc.subjectDelay constraintsen_US
dc.subjectDesign solutionsen_US
dc.subjectEncoding schemesen_US
dc.subjectLoop unrollingen_US
dc.subjectLow cost hardwareen_US
dc.subjectParticle swarm optimization algorithmen_US
dc.subjectTrojansen_US
dc.subjectHardware securityen_US
dc.titleTL-HLS: Methodology for Low Cost Hardware Trojan Security Aware Scheduling with Optimal Loop Unrolling Factor during High Level Synthesisen_US
dc.typeJournal Articleen_US
dc.rights.licenseAll Open Access, Bronze-
Appears in Collections:Department of Computer Science and Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: