By Topic

A parallel phoneme recognition algorithm based on continuous hidden Markov model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sang-Hwa Chung ; Dept. of Comput. Eng., Pusan Nat. Univ., South Korea ; Min-Uk Park ; Hyung-Soon Kim

This paper presents a parallel phoneme recognition algorithm based on the continuous Hidden Markov Model (HMM). The parallel phoneme recognition algorithm distributes 3-state HMMs of context dependent phonemes to the multiprocessors, computes output probabilities in parallel, and enhances the Viterbi beam search with a message passing mechanism. The algorithm is implemented in a multi-transputer system using distributed-memory MIMD multiprocessors. Experimental results show the feasibility of the parallel phoneme recognition algorithm in constructing a real-time parallel speech recognition system based on time-consuming continuous HMM

Published in:

Parallel Processing, 1999. 13th International and 10th Symposium on Parallel and Distributed Processing, 1999. 1999 IPPS/SPDP. Proceedings

Date of Conference:

12-16 Apr 1999