Direct approximation: Difference between revisions
changed the definition of "direct mapping" to refer to the process of creating patent intervals- as per the clarification by Xenwolf. |
Noted that the term "direct mapping" can refer to patent intervals themselves via analogy with the relationship between "nearest edomapping" and "patent vals". |
||
| Line 1: | Line 1: | ||
A '''patent interval''' in a given [[EDO]] is the number of EDO steps needed to reach the best approximation of a given interval – usually, but not necessarily just – in that EDO. | A '''patent interval''' in a given [[EDO]] is the number of EDO steps needed to reach the best approximation of a given interval – usually, but not necessarily just – in that EDO. The method for calculating patent intervals – referred to as '''direct mapping''', though this same term can also refer to the result of this process – is by [[rounding]] the product of the [[Wikipedia: binary logarithm|binary logarithm]] (''log2'') of the interval ratio (''r'') and the EDO number (''nEdo''). | ||
round(log2(r)*nEdo) | round(log2(r)*nEdo) | ||