diff options
| author | Jiuyang Liu | 2021-11-23 04:17:14 +0800 |
|---|---|---|
| committer | GitHub | 2021-11-22 20:17:14 +0000 |
| commit | 2b0bc0ecbc9c53882e2104ecd1e1387039be27f3 (patch) | |
| tree | 7f8fadd4f13f0d371e4af006358ca48e6aef7aa7 /src/main/scala/chisel3/util/experimental/decode/QMCMinimizer.scala | |
| parent | 74d77bf271b7f080017559a2b98e7e78f91ebfb3 (diff) | |
add documentations to decoder. (#2254)
Co-authored-by: mergify[bot] <37929162+mergify[bot]@users.noreply.github.com>
Diffstat (limited to 'src/main/scala/chisel3/util/experimental/decode/QMCMinimizer.scala')
| -rw-r--r-- | src/main/scala/chisel3/util/experimental/decode/QMCMinimizer.scala | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/src/main/scala/chisel3/util/experimental/decode/QMCMinimizer.scala b/src/main/scala/chisel3/util/experimental/decode/QMCMinimizer.scala index c1533f44..8bd8a03e 100644 --- a/src/main/scala/chisel3/util/experimental/decode/QMCMinimizer.scala +++ b/src/main/scala/chisel3/util/experimental/decode/QMCMinimizer.scala @@ -8,6 +8,15 @@ import scala.annotation.tailrec import scala.math.Ordered.orderingToOrdered import scala.language.implicitConversions +/** A [[Minimizer]] implementation to use Quine-Mccluskey algorithm to minimize the [[TruthTable]]. + * + * This algorithm can always find the best solution, but is a NP-Complete algorithm, + * which means, for large-scale [[TruthTable]] minimization task, it will be really slow, + * and might run out of memory of JVM stack. + * + * In this situation, users should consider switch to [[EspressoMinimizer]], + * which uses heuristic algorithm providing a sub-optimized result. + */ object QMCMinimizer extends Minimizer { private implicit def toImplicant(x: BitPat): Implicant = new Implicant(x) |
