首页> 外文会议>UKSim Fifth European Modelling Symposium on Computer Modelling and Simulation >Design and Analysis of High Performance and Low Power Matrix Filling for DNA Sequence Alignment Accelerator Using ASIC Design Flow
【24h】

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

机译:基于ASIC设计流程的DNA序列比对加速器高性能低功耗矩阵填充设计与分析

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:高效的序列比对是生物信息学中最重要和最具挑战性的活动之一。已经提出了许多算法来执行和加速序列比对活动。其中Smith-Waterman(S-W)是最灵敏(准确)的算法。本文利用ASIC设计流程,提出了一种用于DNA序列比对加速器的高性能,低功耗矩阵填充的新方法和分析。本文的目的是通过使用Smith Waterman(SW)算法来提高DNA序列比对的性能,并优化现有技术的功耗降低。研究范围是通过使用与Smith-Waterman算法并行执行的矩阵填充方法。与传统的顺序实现相比,此方法可提供更有效的加速,但同时可保持敏感度。本文的方法是使用FPGA和Synopsis。该技术用于实现大规模并行处理。该设计以Verilog HDL编码开发,并使用LINUX工具进行综合。最佳设计是在40ns时钟周期的设计单元为8808.307mm2的矩阵单元。因此,在该时钟周期所需的功率也较小,动态功率为111.1415uW,泄漏功率为212.9538 Nw。这是对现有设计的重大改进,并通过使用ASIC设计流程提高了数据吞吐量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号