Design and Analysis of 8-bit Smith Waterman based DNA Sequence Alignment Accelerator's Core on ASIC Design Flow | IEEE Conference Publication | IEEE Xplore

Design and Analysis of 8-bit Smith Waterman based DNA Sequence Alignment Accelerator's Core on ASIC Design Flow


Abstract:

This paper present the design and analysis of 8-bit Smith Waterman (SW) based DNA sequence alignment accelerator's core on ASIC design flow. The objective of the project ...Show More

First Page of the Article

Abstract:

This paper present the design and analysis of 8-bit Smith Waterman (SW) based DNA sequence alignment accelerator's core on ASIC design flow. The objective of the project is to construct and analyse the core module that can perform the Smith Waterman algorithm's operations, which are comparing, scoring and back tracing, using the technique used in on ASIC design flow. Nowadays, the DNA and protein databases are increasing rapidly and these add new challenges to the current computing resources. New techniques, algorithms, designs, hardware and software that can maximize the computational speed, minimize the power and energy consumption, and boost the throughput need to be developed in order to meet the current and future requirements. In DNA sequence alignment process, the DNA sequences are compared using different alignment requirement techniques such as global alignment, local alignment, motif alignment and multiple sequence alignment. Moreover, there are several algorithms used to perform the sequence alignment process such as NeedlemanWunch algorithm, Smith Waterman algorithm, FASTA, BLAST and so on. For this paper, the focus is on local alignment using Smith Waterman algorithm. The design was modelled using Verilog and the functionality was verified using Xilinx and VCS. The RTL codes was mapped and synthesized to technology based logics using Design Compiler (DC). The core's layout was implemented using Place and Route tool, IC Compiler (ICC). Based on the results, the core design area was 2108.937620 um2.The maximum time constraints were 6.85 ns and 6.93 ns in ICC and PT. The minimum time constraints were 0.28 ns and 0.30 ns in ICC and PT respectively. In conclusion, the design had been successfully implemented on ASIC design flow. Moreover, the results showed that the design can be further optimized to work at faster speeds.
Date of Conference: 17-19 November 2010
Date Added to IEEE Xplore: 28 January 2011
ISBN Information:
Conference Location: Pisa, Italy

First Page of the Article

References is not available for this document.

I. Introduction

The advancement in bioinformatics and biological computation researches in genome led to the increment of the biomedical databases. These databases increase at the exponential rate by the scale of 1.5 to 2 [3]. Due to that, there a several databanks created to store the data such as Swiss Prot, TrEMBL, PIR [4], [5] and few others. The increment of the data sizes adds complexity to the current computing methods and resources as it might not be able to perform the scientific analysis efficiently. Therefore, new specialized tools, hardware and software need to be created in order to overcome the limitations. The main focus can be on speed, power, algorithm, memory resource and architecture [4], [5].

Select All
1.
S. A. M. Al Junid, Z. A. Majid and A. K. Halim, "High speed DNA sequencing accelerator using FPGA", ICED 2008. International Conference on Electronic Design 2008, pp. 1-4, 2008.
2.
S.A.M.A Junid et al., "Development of DNA Sequencing Accelerator Based on Smith Waterman Algorithm with Heuristic Divide and Conquer Technique for FPGA Implementation", Proceedings of the International Conference on Computer and Communication Engineering 2008, pp. 994-996, May 2008.
3.
F. Zhang, X.Z. Qiao and Z.Y. Liu, "A parallel smith-waterman algorithm based on divide and conquer", ICA3PP, 2002.
4.
A.M. Lesk, Introduction to Bioinformatics, Oxford: Oxford Uni Press, 2005.
5.
D.E. Krane and M.L. Raymer, Fundamental Concepts of Bioinformatics, San Francisco: Pearson, 2003.
6.
T.F. Smith and M.S. Waterman, "Identification of common molecular subsequences", J of Molecular Biology, vol. 147, no. 1, pp. 195-197, 1981.
7.
O. Gotoh, "An improved algorithm for matching biological sequences", J of Molecular Biology, vol. 162, no. 3, pp. 705-708, 1982.
8.
A. Boukerche et al., "Reconfigurable Architecture for Biological Sequence Comparison in Reduced Memory Space", IEEE International Parallel and Distributed Processing Symposium 2007, pp. 1-8, March 200.
9.
T.F Oliver, B. Schmidt and D.L. Maskell, "Reconfigurable architectures for bio-sequence database scanning on FPGAs", IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 52, no. 2, pp. 851-855, Dec. 2005.
10.
D. T. Hoang, "Searching genetic databases on splash 2", Proceedings 1993 IEEE Workshop on Field-Programmable Custom Computing Machines, pp. 185-192, 1993.
11.
H. T. Kung, "Why systolic architectures?", Computer, pp. 37-46, January 1982.
12.
D. P. Lopresti, "P-NAC: a systolic array for comparing nucleic acid sequences", IEEE Computer, vol. 20, pp. 98-99, July 1987.
13.
K. Puttegowda et al., "A Run-Time Reconfigurable System for Gene Sequence Searching", 16th International Conference on VLSI Design, pp. 561, 2003.
14.
D. T. Hoang, "A systolic array for the sequence alignment problem", pp. 92-22, 1992.
15.
C.W. Yu et al., "A Smith-Waterman systolic cell", Proceedings of the Tenth International Workshop on Field Programmable Logic and Applications (FPL03), pp. 375-384, 2003.
16.
"A Reconfigurable Computing Model for Biological Research Application of Smith-Waterman Analysis to Bacterial Genomes", White Paper, 2005.
17.
L. Yan et al., "An implementation of parallel accelerating system on chip for DNA sequence matching", Proceedings of the 7th WSEAS International Conference on Simulation Modelling and Optimization, pp. 165-170, 2007.
18.
S. Alum et al., "Parallel biological sequence comparison using prefix Computations", Journal of Parallel and Distributed Computing, vol. 63, no. 3, pp. 264-272, March 2003.
19.
S. A. M. Al Junid, M. A. Haron, Z. Abd Majid, A. K. Halim, F. N. Osman and H. Hashim, "Development of Novel Data Compression Technique for Accelerate DNA Sequence Alignment Based on Smith Waterman Algorithm", EMS 09. Third UKSim European Symposium on Computer Modeling and Simulation 2009, pp. 181-186, 2009.
20.
R. Hughey and D.P. Lopresti, "B-SYS: A 470-processor programmable systolic array", Proc. Int. Coni Parallel Processing, vol. 1, pp. 58-583, August 1991.
21.
D. Dahle, L. Grate, E. Rice and R. Hughey, "The UCSC kestrel general purpose parallel processor", Proc. Int. Con Parallel and Distributed Processing Techniques and Applications, pp. 1243-1249, June 1999.
22.
D. M. Dahle et al., "Kestrel: Design of an 8-bit SIMD parallel processor", IEEE PMC. 17th Con. on Advanced Research in VLSI, vol. 1, pp. 145-162, September 1997.
23.
PixelFusion PIc. Fuzion product literature, 1999, [online] Available: http://www.pixelfusion.com.
24.
Paracel Inc. Genematcher2 Product Literature, 2001, [online] Available: http://www.paracel.com.
25.
C.T. White et al., "BioSCAN: a VLSI-based system for biosequence analysis", ICCD 91, pp. 504-509, Oct 1991.
26.
D. Bias et al., "The UCSC Kestrel parallel processor", IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 1, pp. 80-92, Jan 2005.
27.
R. Hughey and D. Bias, "The UCSC Kestrel Application-Unspecific Processor", International Conference on Application-specific Systems Architectures and Processors 2006, pp. 163-168, Sept. 2006.
28.
T.H. Cormen et al., Introduction to Algorithms, Massachusetts: MIT Press, 2001.
29.
P. Zhang, G. Tan and G.R. Gao, "Implementation of the Smith-Waterman algorithm on a configurable supercomputing platform", Proceedings of the 1st international workshop on High-performance reconfigurable computing technology and applications, pp. 39-48, nov 2007.

Contact IEEE to Subscribe

References

References is not available for this document.