Direct approximation: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
Deleted potentially confusing sentence |
||
| Line 3: | Line 3: | ||
round(log2(r)*nEdo) | round(log2(r)*nEdo) | ||
A [[patent val]] is the best mapping of a representative set of intervals (taken to be [[generator]]s for a [[JI subgroup]]) in a given EDO; for the ''p''-[[prime limit]] this set consists of [[prime interval]]s | A [[patent val]] is the best mapping of a representative set of intervals (taken to be [[generator]]s for a [[JI subgroup]]) in a given EDO; for the ''p''-[[prime limit]] this set consists of [[prime interval]]s. | ||
==== Examples of Patent Intervals ==== | ==== Examples of Patent Intervals ==== | ||
Revision as of 02:58, 22 December 2021
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 is referred to as direct mapping, and it involves rounding the product of the binary logarithm (log2) of the interval ratio (r) and the EDO number (nEdo).
round(log2(r)*nEdo)
A patent val is the best mapping of a representative set of intervals (taken to be generators for a JI subgroup) in a given EDO; for the p-prime limit this set consists of prime intervals.
Examples of Patent Intervals
| \ | 12edo | 17edo | 19edo | 26edo |
|---|---|---|---|---|
| 3/2 | 7 | 10 | 11 | 15 |
| 5/4 | 4 | 5 | 6 | 8 |
| 6/5 | 3 | 4 | 5 | 7 |
| 7/4 | 10 | 14 | 15 | 21 |