Parallel reconfigurable computing and its application to hidden Markov model

  • Paul, Anand
  • Jiang, , Yung-Chuan
  • Jeong, Jechang
Citations

SCOPUS

3

초록

Parallel processing techniques are increasingly found in reconfigurable computing, especially in digital signal processing (DSP) applications. In this paper, we design a parallel reconfigurable computing (PRC) architecture which consists of multiple dynamically reconfigurable computing units. The hidden Markov model (HMM) algorithm is mapped onto the PRC architecture. First, we construct a directed acyclic graph (DAG) to represent the HMM algorithms. A novel parallel partition approach is then proposed to map the HMM DAG onto the multiple DRC units in a PRC system. This partitioning algorithm is capable of design optimization of parallel processing reconfigurable systems for a given number of processing elements in different HHM states.

키워드

FPGAHMMparallel processorspartitioning algorithmreconfigurable processingFPGAHMMParallel processorPartitioning algorithmsReconfigurable processingAlgorithmsAxial flowComputation theoryHidden Markov modelsOptimizationReconfigurable hardwareSignal processingStructural designParallel processing systems
제목
Parallel reconfigurable computing and its application to hidden Markov model
저자
Paul, AnandJiang, , Yung-ChuanJeong, Jechang
DOI
10.1049/cp.2010.0542
발행일
2010-11
유형
Conference Paper
저널명
IET Conference Publications
2010
568 CP
페이지
82 ~ 91