JSIPJournal of Signal and Information Processing2159-4465Scientific Research Publishing10.4236/jsip.2012.33050JSIP-22136ArticlesComputer Science&Communications A Storage Architecture for High Speed Signal Processing: Embedding RAID 0 on FPGA ingxiaoSun1*QiongzhiWu1ZhaojianJin1Beijing Institute of Technology* E-mail:sunningxiao@sina.com(IS);310820120303382386April 20th, 2012May 25th, 2012 June 10th, 2012© Copyright 2014 by authors and Scientific Research Publishing Inc. 2014This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/

The article proposes a new architecture based on RAID 0 tech in computer science for signal processing field to store high speed data. It is composed of SSD driven by FPGA, called SSD-based RAID on FPGA. This new architecture features high storage rate, mass capacity and small volume, and it is an efficient solution to store high speed data. The article describes the construction of SRF in details, and shows the test result of a demo system based on the architecture.

RAID on FPGA; SSD; High Speed Data Storage1. Introduction

In signal processing field, the system designer has been greatly forced to choose between real-time processing and the storage capacity of the acquisition signal. In the past, the latter always limits the maximum count rates supported without data loss. Systems which could perform both functions at the same time were usually too costly and complex. To solve these problems the first target is to find a sort of the storage medium [1].

Now, with recent advancements in the computer industry, the cost of NAND flash memory becomes lower and the density of NAND flash memory grows larger, the mass-production of solid state drives (SSD) based on NAND flash memory was launched on a full scale [2]. SSD is strong in shock and its I/O performance is better comparing with the conventional hard disk drive (HHD).

Though the storage rate of SSD increases remarkably compared to HHD, SSD alone is hard to meet most requirements of data acquisition and storage system [3,4]. Therefore, RAID 0 tech in computer science is introduced, and we propose an architecture of RAID, which is based on SSD and driven by FPGA, called SSD-based RAID on FPGA (short for SRF), which features mass capacity, high rate and small volume. In addition, in order to save costs, the architecture of SRF is designed to be adjustable in storage rate and capacity.

2. Architecture of SSD-Based RAID on FPGA

Figure 1 depicts the architecture of the SSD-based RAID on FPGA.

ReferencesK. Park, “Reliability and Performance Enhancement Technique for SSD Array Storage System Using RAID Mechanism,” The 9th International Symposium on Communications and Information Technology (ISCIT 2009), 28-30 September 2009, pp. 140-145.W. F. Jones, “A Digital Architecture for Routinely Storing and Buffering the Entire 64-Bit Event Acquisition in Clinical Real-Time 3-D PET: Embedding a 400 Mbyte/ sec SATA RAID 0 Using a Set of Four Solid- Solid-State Drives,” 2008 IEEE Nuclear Science Symposium Conference, 19-25 October 2008, pp. 5036-5040. doi:10.1109/NSSMIC.2008.4774371J. Ren, “I-CASH: Intelligently Coupled Array of SSD and HDD,” The 17th International Symposium on High Performance Computer Architecture (HPCA), 12-16 February 2011, pp. 278-289.W. Wu, “Implementing a Serial ATA Controller base on FPGA,” Computational Intelligence and Design (ISCID 09), Vol. 1, 12-14 December 2009, pp. 467-470.S. S. Rizvi, “Data Storage Framework on Flash Memory Based SSD RAID 0 for Performance Oriented Applications,” The 2nd International Conference on Computer and Automation Engineering (ICCAE), Vol. 1, 26-28 February 2010, pp. 126-128.K. R. Dandekar, H. Ling and G. H. Xu, “Smart Antenna Array Calibration Procedure including Amplitude and Phase Mismatch and Mutual Coupling Effects,” IEEE Conference on Personal Wireless Communications (PWC), Vol. 12, 2000, pp. 293-297.Serial ATA Working Group, “Serial ATA High Speed Serialized AT Attachment Rev 1.0a,” Serial ATA Working Group, 2002, pp. 117-123.