Direct approximation: Difference between revisions

Revision as of 00:05, 19 January 2021 view source Aura (talk \| contribs) autopatrolled, emailconfirmed 5,920 edits Undid the previous edit manually as I realized that "patent interval" and "direct mapping" were entirely the same thing after all ← Older edit		Revision as of 00:05, 19 January 2021 view source Aura (talk \| contribs) autopatrolled, emailconfirmed 5,920 edits No edit summary Newer edit →
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, and as such, it is also called a '''direct mapping'''. It is calculated by [[rounding]] the product of the [[Wikipedia: binary logarithm\|binary logarithm]] (''log2'') of the interval ratio (''r'') and the EDO number (''nEdo'').		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, and as such, it is also called a '''direct mapping'''. It is calculated 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)