Direct approximation: Difference between revisions

Revision as of 00:05, 19 January 2021 view source Aura (talk \| contribs) autopatrolled, emailconfirmed 5,920 edits No edit summary ← Older edit		Revision as of 16:30, 19 January 2021 view source Aura (talk \| contribs) autopatrolled, emailconfirmed 5,920 edits changed the definition of "direct mapping" to refer to the process of creating patent intervals- as per the clarification by Xenwolf. 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. 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'') – this process being referred to as '''direct mapping'''.

	round(log2(r)*nEdo)		round(log2(r)*nEdo)