Design and Analysis of High Performance and Low Power Matrix Filling for DNA Sequence Alignment Accelerator Using ASIC Design Flow

N. Khairudin, M. A. Haron, S. Junid, A. Halim, M. Idros, N. S. A. Razak
{"title":"Design and Analysis of High Performance and Low Power Matrix Filling for DNA Sequence Alignment Accelerator Using ASIC Design Flow","authors":"N. Khairudin, M. A. Haron, S. Junid, A. Halim, M. Idros, N. S. A. Razak","doi":"10.1109/EMS.2011.9","DOIUrl":null,"url":null,"abstract":"Efficient sequence alignment is one of the most important and challenging activities in bioinformatics. Many algorithms have been proposed to perform and accelerate sequence alignment activities. Among them Smith-Waterman (S-W) is the most sensitive (accurate) algorithm. This paper presents a novel approach and analysis of High Performance and Low Power Matrix Filling for DNA Sequence Alignment Accelerator by using ASIC design flow. The objective of this paper is to improve the performance of the DNA sequence alignment and to optimize power reduction of the existing technique by using Smith Waterman (SW) algorithm. The scope of study is by using the matrix filling method which is in parallel implementation of the Smith-Waterman algorithm. This method provides more efficient speed up compared to the traditional sequential implementation but at the same time maintaining the level of sensitivity. The methodology of this paper is using FPGA and Synopsis. This technique is used to implement the massive parallelism. The design was developed in Verilog HDL coding and synthesized by using LINUX tools. Matrix Cells with a design area 8808.307mm2 at 40ns clock period is the best design. Thus the power required at this clock period also smaller, dynamic power 111.1415uW and leakage power 212.9538 Nw. This is a large improvement over existing designs and improves data throughput by using ASIC design flow.","PeriodicalId":131364,"journal":{"name":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMS.2011.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Efficient sequence alignment is one of the most important and challenging activities in bioinformatics. Many algorithms have been proposed to perform and accelerate sequence alignment activities. Among them Smith-Waterman (S-W) is the most sensitive (accurate) algorithm. This paper presents a novel approach and analysis of High Performance and Low Power Matrix Filling for DNA Sequence Alignment Accelerator by using ASIC design flow. The objective of this paper is to improve the performance of the DNA sequence alignment and to optimize power reduction of the existing technique by using Smith Waterman (SW) algorithm. The scope of study is by using the matrix filling method which is in parallel implementation of the Smith-Waterman algorithm. This method provides more efficient speed up compared to the traditional sequential implementation but at the same time maintaining the level of sensitivity. The methodology of this paper is using FPGA and Synopsis. This technique is used to implement the massive parallelism. The design was developed in Verilog HDL coding and synthesized by using LINUX tools. Matrix Cells with a design area 8808.307mm2 at 40ns clock period is the best design. Thus the power required at this clock period also smaller, dynamic power 111.1415uW and leakage power 212.9538 Nw. This is a large improvement over existing designs and improves data throughput by using ASIC design flow.
基于ASIC设计流程的DNA序列比对加速器的高性能低功耗矩阵填充设计与分析
高效序列比对是生物信息学领域最重要和最具挑战性的工作之一。已经提出了许多算法来执行和加速序列比对活动。其中Smith-Waterman (S-W)算法最为敏感(准确)。本文提出了一种基于ASIC设计流程的DNA序列比对加速器高效低功耗矩阵填充的新方法和分析方法。本文的目的是为了提高DNA序列比对的性能,并利用Smith Waterman (SW)算法优化现有技术的功耗。本文的研究范围是采用并行实现Smith-Waterman算法的矩阵填充方法。与传统的顺序实现相比,该方法提供了更有效的速度,但同时保持了灵敏度水平。本文的方法是使用FPGA和概要。该技术用于实现大规模并行性。本设计采用Verilog HDL编码进行开发,利用LINUX工具进行合成。在40ns时钟周期下,设计面积为8808.307mm2的Matrix Cells为最佳设计。因此该时钟周期所需功率也较小,动态功率为111.1415uW,漏功率为212.9538 Nw。这是对现有设计的巨大改进,并通过使用ASIC设计流程提高了数据吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信