Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/4694
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSengupta, Anirbanen_US
dc.date.accessioned2022-03-17T01:00:00Z-
dc.date.accessioned2022-03-17T15:35:11Z-
dc.date.available2022-03-17T01:00:00Z-
dc.date.available2022-03-17T15:35:11Z-
dc.date.issued2015-
dc.identifier.citationSengupta, A., & Bhadauria, S. (2015). User power-delay budget driven PSO based design space exploration of optimal k-cycle transient fault secured datapath during high level synthesis. Paper presented at the Proceedings - International Symposium on Quality Electronic Design, ISQED, , 2015-April 289-292. doi:10.1109/ISQED.2015.7085441en_US
dc.identifier.isbn9781479975815-
dc.identifier.issn1948-3287-
dc.identifier.otherEID(2-s2.0-84944314588)-
dc.identifier.urihttps://doi.org/10.1109/ISQED.2015.7085441-
dc.identifier.urihttps://dspace.iiti.ac.in/handle/123456789/4694-
dc.description.abstractFault security indicates ability to provide error detection or fetching the correct output. Generation (design space exploration (DSE)) of an optimal fault secured datapath structure based on user power-delay budget during high level synthesis (HLS) in the context k-cycle transient fault is considered an intractable problem. This is due to the fact that for every type of candidate design solution produced during exploration, a feasible k-cycle fault secured datapath may not exist satisfying the conflicting user constraints/budget. Secondly, insertion of random cut to optimize delay overhead associated with fault security in most cases may not yield optimal solutions in the context of user constraints/budgets. The solutions to the above problems have not been addressed in the literature so far. The paper solves the problem by presenting: (a) a novel algorithm for fault secured particle swarm optimization driven DSE (b) novel technique for handling k-cycle transient faults (c) novel schemes for selecting appropriate edges for inserting cuts in the scheduled Control Data Flow Graph (CDFG) minimizing delay overhead associated with fault security. The proposed approach yielded optimal results which minimizes hybrid cost as well as satisfies user constraints. Further, results of comparison with recent approaches indicated significant reduction of final cost. © 2015 IEEE.en_US
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.sourceProceedings - International Symposium on Quality Electronic Design, ISQEDen_US
dc.subjectBudget controlen_US
dc.subjectData flow analysisen_US
dc.subjectData flow graphsen_US
dc.subjectFaultingen_US
dc.subjectGraph algorithmsen_US
dc.subjectGraphic methodsen_US
dc.subjectParticle swarm optimization (PSO)en_US
dc.subjectSpace power generationen_US
dc.subjectTransientsen_US
dc.subjectCDFGen_US
dc.subjectControl data flow graphsen_US
dc.subjectDatapath structuresen_US
dc.subjectdelayen_US
dc.subjectDesign space explorationen_US
dc.subjectK -cycleen_US
dc.subjectOptimal solutionsen_US
dc.subjectpoweren_US
dc.subjectHigh level synthesisen_US
dc.titleUser power-delay budget driven PSO based design space exploration of optimal k-cycle transient fault secured datapath during high level synthesisen_US
dc.typeConference Paperen_US
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: