Bjorklund

Circa 300 BC Euclid published his ‘Elements‘ wherein he described a method for computing the greatest common divisor (GCD) of two integers. It is one of the oldest numerical algorithms still in common use.

In 2003 Eric Bjorklund extended the Euclidean algorithm to address timing issues in Neutron Accelerators. He wanted to solve the following problem:

‘distribute n pulses over m “timing slots” in the most even way possible, even though n may not necessarily be an even divisor of m.

In 2004, Godfried Toussaint demonstrated that the resulting binary patterns mirrored the familiar ostinatos (repeating rhytrhmic phrases) of diverse musical styles. African rhythms are well represented and thus, naturally, have appeared extensively in Central/South American music modern Jazz, pop, rock and dance.

Bjorklund is a Bjorklundian sequencer.

8 independent tracks, each with their own:

– Track Length / Pulses – look at 8/3, 4/1 = 4/16 etc.
– Track Position
– Clock dividers – whole note to 32nd, with tick quantisation
– Track Mute
– Track Solo
– Track Velocity
– Random velocity offset +/- (Humanisation)
– Accent step 1-16
– Track Note
– Track Channel
– Track/Global Randomisation

Global Tempo controls
Preset saving

Build documentation:

  1. Breadboarding an Euclidean sequencer using Arduino / Sanguino with AVRISPmkii in Win7 and Linux.
  2. It lives!
  3. The Algorithm in C
  4. Hardware Notes
  5. A First Session – Simple Rhythms

Comments:

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: