EFFICIENT VITERBI SCORING ARCHITECTURE FOR HMM-BASED SPEECH RECOGNITION SYSTEMS
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | CHO, YS | ko |
| dc.contributor.author | KIM, JY | ko |
| dc.contributor.author | Lee, Hwang Soo | ko |
| dc.date.accessioned | 2013-02-24T09:37:56Z | - |
| dc.date.available | 2013-02-24T09:37:56Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1992-12 | - |
| dc.identifier.citation | ELECTRONICS LETTERS, v.28, no.25, pp.2338 - 2340 | - |
| dc.identifier.issn | 0013-5194 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/56128 | - |
| dc.description.abstract | A new dedicated architecture for Viterbi scoring in hidden Markov model (HMM)-based real-time isolated word recognition systems is proposed. Because, in HMMs, most states are connected to only three or fewer preceding states, the state transition matrix is a banded upper triangular matrix. Using this property of the HMM, we design an efficient Viterbi scoring architecture. | - |
| dc.language | English | - |
| dc.publisher | IEE-INST ELEC ENG | - |
| dc.title | EFFICIENT VITERBI SCORING ARCHITECTURE FOR HMM-BASED SPEECH RECOGNITION SYSTEMS | - |
| dc.type | Article | - |
| dc.identifier.wosid | A1992KD32500051 | - |
| dc.identifier.scopusid | 2-s2.0-0027111017 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 28 | - |
| dc.citation.issue | 25 | - |
| dc.citation.beginningpage | 2338 | - |
| dc.citation.endingpage | 2340 | - |
| dc.citation.publicationname | ELECTRONICS LETTERS | - |
| dc.contributor.localauthor | Lee, Hwang Soo | - |
| dc.contributor.nonIdAuthor | CHO, YS | - |
| dc.contributor.nonIdAuthor | KIM, JY | - |
| dc.subject.keywordAuthor | SPEECH RECOGNITION | - |
| dc.subject.keywordAuthor | MODELING | - |
- Appears in Collection
- EE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.