Huffman Simplicior enim Sequentialis Logica
Huffman Simplicior est communis algorithmus ad simpliciorem statum transitum.
[table]=StateTransition()
{
transitions
{
1: [1] -> 1/1'b0, [2] -> 3/1'b0;
2: [1] -> 2/1'b1, [2] -> 4/1'b0;
3: [1] -> 3/1'b1, [2] -> 5/1'b0;
4: [1] -> 4/1'b0, [2] -> 1/1'b1;
5: [1] -> 5/1'b0, [2] -> 1/1'b1;
}
}
[simtable]=Simplification.HuffmanMealy(table);
Print("result:");
Print(simtable);
/*
Eventus sit :
result:
StateTransition()
{
transitions
{
1: [1] -> 1/1'b0, [2] -> 3/1'b0;
2: [1] -> 2/1'b1, [2] -> 4/1'b0;
3: [1] -> 3/1'b1, [2] -> 5/1'b0;
4: [1] -> 4/1'b0, [2] -> 1/1'b1;
5: [1] -> 5/1'b0, [2] -> 1/1'b1;
}
simplification
{
tabletype = "well-defined" ;
algorithm = "equivalance" ;
grouping
{
1:1;
2:2,3;
3:4,5;
}
transitions
{
1: [1] -> 1/1'b0, [2] -> 2/1'b0;
2: [1] -> 2/1'b1, [2] -> 3/1'b0;
3: [1] -> 3/1'b0, [2] -> 1/1'b1;
}
}
}
*/
IsCovering IsInverse IsLinearFunction IsMonotonicFunction AndXor MaxValue MinValue BCDEx3 PureBinary ToROBDD DigitalSystem ExcitationTable minterm MantissaToPositiveInteger RadixToIndex object() One OrAnd To2LayerNand Solve ShortestInputsForTransition Balanced MultiCover string GetDontCareLogicFunction GetPositiveLogicFunction Utility ComputeDONTCARE IndependentBase Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.