Rhythm Grid Binary Decoder

Decode a binary rhythm step mask into onset indexes and explicit grid size.

Description

Decode a binary rhythm step mask into onset indexes and explicit grid size.

A binary rhythm grid maps each one to an onset position and each zero to an unoccupied step.

When to use this tool

Decode a binary rhythm step mask into onset indexes and explicit grid size.

  • Prepare the supplied bits fields for this operation.
  • Compare the complete example with the representation used by your own input before carrying the result into another step.

How to use the tool and how it works

  1. Enter bits. Use the exact text syntax, units and index conventions explained below.
  2. Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
  3. Read result.steps, result.onsets. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.

Validate bits as at most 128 binary characters. Return steps equal to its length and onsets containing every one position in ascending order.1

Input fieldMeaning and representationAccepted input
bitsbits.Binary text containing only 0 and 1; at most 128 characters
Output fieldInterpretation
resultObject containing the named outputs below.
result.stepsThe steps value under the stated formula or text convention.
result.onsetsThe onsets list in the ordering and representation described above.
json
{
  "input": {
    "bits": "1010"
  },
  "output": {
    "result": {
      "steps": 4,
      "onsets": [
        0,
        2
      ]
    }
  }
}

Limitations and assumptions

  • No duration, velocity, tempo or meter is inferred. Positions are zero-based from the left.
  • Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
  • Lists are limited to 128 entries. JSON text must meet bounded size and depth checks, and numeric outputs beyond the safe finite magnitude are rejected. Exact large integers use decimal strings.
  • Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.

Alternative or Complementary methods

Retain the tick unit, channel numbering and event-pairing policy with the result. Use a MIDI-file parser or audio analysis when the task requires actual messages, playback behavior or recorded sound.

References

  1. Tool behavior and example: Rhythm Grid Binary Decoder — tool.io

Similar or alternative tools

Don't forget to set a bookmark for tool.io!
Privacy | Imprint | Cookies