Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/6570
Title: A novel PDWC-UCO algorithm based optimal placement of buffer in FPGA architecture [articol]
Authors: Sridevi, A.
Lakshmiprabha, V.
Subjects: Buffer Placement
Clustering
Field Programmable Gate Array (FPGA)
Particle Distance Weighted Clustering (PDWC)
Unity Clustering Optimization (UCO)
Issue Date: 2020
Citation: Sridevi, A.; Lakshmiprabhaj, V.: A novel PDWC-UCO algorithm based optimal placement of buffer in FPGA architecture. Timişoara: Editura Politehnica, 2020.
Series/Report no.: Journal of Electrical Engineering;Vol 20 No 4
Abstract: Clock distribution networks consume a significant amount of the whole chip power budget. Therefore, reduction in the power consumption of the clock networks is a significant objective in high-performance Integrated Circuit (IC) designs. This paper presents a novel Particle Distance Weighted Clustering (PDWC)-Unity Clustering Optimization (UCO) algorithm for the optimal placement of clock buffers in the Field Programmable Gate Array (FPGA) architecture. A novel PDWC algorithm is applied for clustering the logical components based on the minimum distance between components. A UCO algorithm is developed to determine the optimal location for the placement of the buffers. This clustering technique reduces the delay rate of the architecture due to the minimum number of logical components. The overall area and power consumption of the FPGA architecture are reduced due to the optimal placement of the buffers and latches. Our proposed PDWC-UCO algorithm achieves lower delay, power consumption, wire length, latency and skew than the existing Flip-Flop (FF) merging and register clustering algorithms.
URI: https://dspace.upt.ro/xmlui/handle/123456789/6570
ISSN: 1582-4594
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Sridevi_f.pdf775.37 kBAdobe PDFView/Open


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