US 2016/0104072 A1 · PIPELINING AND PARALLELISM FOR IMPLEMENTING A MIXTURE MODEL

Abstract

One factor in limiting the speed of conventional implementations of mixture models is that the algorithm involves many decisions where different operations are fetched and performed depending on the outcome of the decisions. These decisions cause flushing of the pipeline, and thus prevent the realization of a highly parallel pipeline in a processor. Without parallelism, the throughput of the pipeline in the processor, i.e., the ability to process many samples of the digital input at a time, is limited. To alleviate this issue, implementation of the mixture model is reformulated, among other things, by embedding decisions into the process flow as multiplicative factors. The resulting implementation alleviates the need to use if-else statements for the decisions and reduces the number of times the pipeline has to be flushed. The implementation enables a pipeline with a higher degree of parallelism and thereby increases throughput and speed of the implementation.

Claims20

Dependent claims

A method for enabling parallel processing of decisions in a processor, the decisions involving a mixture model comprising a plurality of probability distributions, the method comprising:

(1) computing a first decision variable based on a first sample and a first probability distribution corresponding to the first sample;
(2) computing one or more first multiplicative factors based on the first decision variable;
and
(3) updating one or more parameters of the first probability distribution using the one or more first multiplicative factors.

1 more element

Dependencies are inferred from the claim text.

Pipelining and parallelism for implementing a mixture model

Life of this patent

Pipelining and parallelism for implementing a mixture model

Life of this patent

Abstract

Claims20