Direct approximation: Difference between revisions

Revision as of 23:53, 18 January 2021 view source Aura (talk \| contribs) autopatrolled, emailconfirmed 5,920 edits Hopefully made the relationship between a patent interval and a direct mapping more clear ← Older edit		Revision as of 00:02, 19 January 2021 view source Aura (talk \| contribs) autopatrolled, emailconfirmed 5,920 edits mentioned 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 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'''. However, the term "direct mapping" can also refer to the mathematical procedure used to calculate patent intervals. Patent intervals are 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)