# US 2015/0106405 A1 · Hidden markov model processing engine

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0106405 A1
- Document ID: US20150106405A1
- Status: Published application
- Kind: A1
- Application number: 14/054,884
- Filed: 2013-10-16
- Published: 2015-04-16
- Earliest claimed: 2013-10-16
- Assignees: Spansion LLC
- Applicants: Spansion LLC
- Inventors: Ojas BAPAT; Richard Fastow; Jens Olson; Kenichi Kumatani
- Web page: https://patentgrep.com/patent/US20150106405A1

## CPC

- G06F 16/28: Databases characterised by their database models, e.g. relational or object models
- G06F 16/2462: {Approximate or statistical queries}
- G10L 15/14: using statistical models, e.g. Hidden Markov Models [HMMs] (G10L15/18 takes precedence)
- G10L 15/142: {Hidden Markov Models [HMMs]}
- G10L 15/30: Distributed recognition, e.g. in client-server systems, for mobile phones or network applications
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING

## Abstract

A method, apparatus, and tangible computer readable medium for processing a Hidden Markov Model (HMM) structure are disclosed herein. For example, the method includes receiving Hidden Markov Model (HMM) information from an external system. The method also includes processing back pointer data and first HMM states scores for one or more NULL states in the HMM information. Second HMM state scores are processed for one or more non-NULL states in the HMM information based on at least one predecessor state. Further, the method includes transferring the second HMM state scores to the external system.

## Claims

### Claim 1

A method comprising:
receiving Hidden Markov Model (HMM) information from an external system;
processing back pointer data and first HMM state scores for one or more NULL states in the HMM information;
processing second HMM state scores for one or more non-NULL states in the HMM information based on at least one predecessor state; and
transferring the second HMM state scores to the external system.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
updating the back pointer data based on the HMM information associated with the one or more non-NULL states; and
transferring the updated back pointer data to the external system.

### Claim 3 (depends on 1)

The method of claim 1, wherein the external system comprises a memory device, and the receiving comprises receiving the HMM information via a single read access from the memory device.

### Claim 4 (depends on 1)

The method of claim 1, wherein the receiving comprises formatting an HMM identification, a number of states associated with an HMM structure, a best score associated with the HMM structure, a state pointer for each of the one or more NULL and non-NULL states, an observation probability for each of the one or more non-NULL states, a path pointer for each of the one or more NULL and non-NULL states, and a state-type flag for each of the one or more NULL and non-NULL states, or a combination thereof in a data format known by an HMM processing engine.

### Claim 5 (depends on 1)

The method of claim 1, wherein the receiving comprises receiving HMM information associated with different types of HMM structures.

### Claim 6 (depends on 1)

The method of claim 1, wherein the processing the back pointer data comprises updating the back pointer data with a back pointer of a predecessor state having the best incoming probability, wherein the best incoming probability is based on a state score and a transition probability associated with one or more predecessor states.

### Claim 7 (depends on 1)

The method of claim 1, wherein the processing the second HMM state scores comprises summing a maximum value associated with one or more predecessor states and an observation probability associated with the one or more non-NULL states, wherein the maximum value is based on a state score and a transition probability associated with the one or more predecessor states.

### Claim 8 (depends on 1)

The method of claim 1, wherein the processing the first HMM state scores comprises selecting a maximum value associated with one or more predecessor states, wherein the maximum value is based on a state score and a transition probability associated with the one or more predecessor states.

### Claim 9

An apparatus comprising:
a state type fetch module configured to determine a presence of one or more NULL and non-NULL states in HMM information;
a processing module configured to:
process back pointer data and first HMM state scores for the one or more NULL states; and
process second HMM state scores for one or more non-NULL states based on at least one predecessor state; and
an output list module configured to transfer the second HMM state scores to an external system.

### Claim 10 (depends on 9)

The apparatus of claim 9, further comprising:
an input list module configured to provide the HMM information to the state type module and the processing module.

### Claim 11 (depends on 9)

The apparatus of claim 9, wherein the processing module is configured to:
update the back pointer data based on the HMM information associated with the one or more non-NULL states; and
transfer the updated back pointer data to the output list module.

### Claim 12 (depends on 9)

The apparatus of claim 9, wherein the state type fetch module is configured to determine the presence of the one or more NULL and non-NULL states in the HMM information based on a predetermined data format comprising an HMM identification, a number of states associated with an HMM structure, a best score associated with the HMM structure, a state pointer for each of the one or more NULL and non-NULL states, an observation probability for each of the one or more non-NULL states, a path pointer for each of the one or more NULL and non-NULL states, and a state-type flag for each of the one or more NULL and non-NULL states, or a combination thereof.

### Claim 13 (depends on 9)

The apparatus of claim 9, wherein the processing module is configured to update the back pointer data with a back pointer of a predecessor state having the best incoming probability, wherein the best incoming probability is based on a state score and a transition probability associated with one or more predecessor states.

### Claim 14 (depends on 9)

The apparatus of claim 9, wherein the processing module is configured to sum a maximum value associated with one or more predecessor states and an observation probability associated with the one or more non-NULL states, wherein the maximum value is based on a state score and a transition probability associated with the one or more predecessor states.

### Claim 15 (depends on 9)

The apparatus of claim 9, wherein the processing module is configured to select a maximum value associated with one or more predecessor states, wherein the maximum value is based on a state score and a transition probability associated with the one or more predecessor states.

### Claim 16

A tangible computer readable medium having stored therein one or more sequences of one or more instructions for execution by one or more processors to perform a method for processing a Hidden Markov Model (HMM) structure, the method comprising:
receiving HMM information from an external system;
process back pointer data and first HMM state scores for one or more NULL states in the HMM information;
process second HMM state scores for one or more non-NULL states in the HMM information based on at least one predecessor state; and
transferring the second HMM state scores to the external system.

### Claim 17 (depends on 16)

The tangible computer readable medium of claim 16, wherein the method further comprises:
updating the back pointer data based on the HMM information associated with the one or more non-NULL states; and
transferring the updated back pointer data to the external system.

### Claim 18 (depends on 16)

The tangible computer readable medium of claim 16, wherein the external system comprises a memory device, and the receiving comprises receiving the HMM information via a single read access from the memory device.

### Claim 19 (depends on 16)

The tangible computer readable medium of claim 16, wherein the receiving comprises formatting an HMM identification, a number of states associated with an HMM structure, a best score associated with the HMM structure, a state pointer for each of the one or more NULL and non-NULL states, an observation probability for each of the one or more non-NULL states, a path pointer for each of the one or more NULL and non-NULL states, and a state-type flag for each of the one or more NULL and non-NULL states, or a combination thereof in a data format known by an HMM processing engine.

### Claim 20 (depends on 16)

The tangible computer readable medium of claim 16, wherein the receiving comprises receiving HMM information associated with different types of HMM structures.
