Apr 26 2014

Sample Map Builder 2

Category: Development,Java,Reaktor,open sourcemarv @ 7:20 pm

I’ve been building this on and off for quite some time but just don’t ever have enough time to finish it up, so rather than just letting it rot on my hard drive for a few more years i’ve put the source up on github.

There are builds available for Win and OSX here :

http://relivethefuture.com/smb/SampleMapBuilder-Windows.zip
http://relivethefuture.com/smb/SampleMapBuilder-OSX.zip

and a PDF manual here :

http://relivethefuture.com/smb/SampleMapBuilder.pdf

It is totally usable in its current state, but please feel free to clone the git repo and make it better, i’ll happily accept pull requests. :)

The repo is here :

https://github.com/Normalised/SampleMapBuilder

Tags:


Apr 01 2013

Euclidean Sequencers in Reaktor

Category: Reaktormarv @ 9:14 am

Here’s an ensemble I made some time ago with an example video here :

Here’s the ensemble

The top 8 sequencers output midi notes and are chained together so that as they cycle they trigger a restart of the next sequencer in the chain. The bottom 4 sequencers trigger envelopes which send out midi CC’s. If you want to change the notes or ccs you’ll have to edit the ensemble.

The sequencer is based on an ensemble from the user library but I can’t find it. If you do find it let me know and i’ll add credit where its due.


Jul 09 2012

Reaktor and the Partials Framework : Common Symbol Reference

Category: Reaktor,Tutorialsmarv @ 6:59 pm

In the Partials Framework you’ll see the same symbols used in a lot of places but without knowing what their generic meaning is it is often hard to work out what they mean in context. I’ll try to provide a list of their generic meanings. Let me know if there are some i’ve missed or if the explanation is wrong.

Symbol Meaning
! Bang / Trigger
# Length / Count
$ Data
id The id of an Event Bus message
[] Index, either position of data item in a message or an array index
t Message type
T Table for message format. See the Splitter component. Defines how the data in a single message can be broken into pieces
-+ Chain Iterator input
+- Chain Iterator output
+ Increment Value
? Test condition
{ b } Event Bus
{ Branch to nested loop (chain iterator)
} Return from nested loop (chain iterator)


Jul 08 2012

Reaktor and the Partials Framework : Deconstructing the Raw Receiver

Category: Reaktor,Tutorialsmarv @ 6:50 pm

As part of the process of learning the Partials Framework im going to try and deconstruct some of the fundamental components to see how they work internally. This first series will focus on the Event Bus part of the framework.

All the files for this article are available in the archive you can download here.

If you haven’t read the documentation available with the partials framework then I suggest you read the ‘Event Blocks and the { b } Event Bus.pdf’ before reading the rest of this as it assumes you have a rough idea about the Event Bus system.

Raw Receiver

Im going to start with the ‘raw receiver’  which is part of the multiplexing -> core library. The purpose of this core macro is to ‘unmarshal’ messages sent on the event bus. It picks the messages apart into the header (id, length) and data and then distributes that data for further processing. Here’s what the macro looks like :

The one input is the event bus input, conventionally labelled { b } in the Partials Framework and 4 outputs :

  1. ID : The ID of the message.
  2. # : the length of the data block
  3. [] : current index into the data block, zero based
  4. $ : data value at the current index

These are symbols that you will see a lot in the partials framework so its worth getting used to what they generally mean.

In the download linked above there is a new version of the raw receiver in which I have renamed some of the ports and blocks to correspond more closely to their purpose in this situation, i’ll refer to this version throughout.

Going inside the raw receiver macro there are 3 macros used to do the work :

  1. Value Delay
  2. State Router
  3. State Action

These macros work together to function as a finite state machine. The Value Delay and State Router are relatively simple but are important to understand because they rely on some fundamental aspects of Core processing.

If you look at the original raw receiver macro you’ll see that some of the ports are labelled 0,1 and 2. These are state IDs and correspond to what state the machine is in. In the renamed version the ports use the names of the states (data, id, #) so you can see which data goes where.

The raw receiver has 3 states when unmarshalling a message that correspond to the 3 pieces of an Event Bus message. The initial state is 1 and is for the message ID, the next state is 2 and is for the message length and finally state 0 is for the data portion of the message. Both header parts of an Event Bus message (ID and length a.k.a #) are single integer values so the state machine is only in states 1 and 2 for the duration of one event each. State 0 lasts for as many events are in the data block, as specified by the # value.

As you might imagine any messages which don’t fit the correct format, such as not enough or too many data events, will almost certainly break the state machine

Now lets look at how each piece works and its role within the state machine.

Value Delay

The Value Delay is almost identical to the ‘Latch’ macro, except the OBC connection between the read and write memory blocks is connected the other way around. In the latch the write is the master and read is the slave but in the Value Delay the read is the master and the write is the slave. If you read the Core Reference docs on page 87 it says

One could ask what the difference is between master and slave. From the point of view of owning the shared object (in this case memory), there is no difference. However, as you may remember from a previous section of this manual, there is a rule that upstream mod­ules are processed before downstream modules when processing simultaneous events.

So whenever simultaneous events occur at the two inputs the latch will first write the event value and then read, i.e. store this new value and send out the new value, whereas the value delay will first read what is stored and then write the new value which means it will send out the old value and store the new one ready for the next clock event. Hence the name ‘value delay’.

A small test ensemble that demonstrates this is available in the download linked at the top of the article.

In the context of this state machine, the value delay is used to send the state ID to the state router. By delaying the output of the value until the next event in the message stream arrives this allows the state machine to define an initial state (in this case its actually 1) , process that event and then set the new state ID ready for when the next incoming event from the message stream arrives.

State Router

The State Router is the simplest piece of the puzzle and as its name implies does state based routing. Functionally its equivalent to the Router M->1 primary module. The state id input is for the state ID (in the original it is called []) and the $ input takes the event stream from the bus. As discussed earlier the 1 state is the ID output, the 2 state is for the data length and 0 is for data events. In the original the ports are named according to the state id’s : 0,1 and 2 but i’ve edited mine to reflect their purpose. I’ve included an ensemble in the download pack which has a raw receiver with these renamed ports (Raw Receiver – Renamed)

State Action

The State Action macro contains the heart of the state machine, its purpose is to both deliver the unmarshalled data to the appropriate output ports and to determine when a state change should occur. Inside it looks like this (again some of the ports have been renamed for clarity)

The inputs correspond to the states, so 0 is the message data, 1 is the id and 2 is the data length. I’ll start with the id state as that is the initial state of the machine. When the id event is received it is sent to both the ‘states’ macro and directly to the id output. The states macro is where the state transition logic happens. If you look inside its a very simple setup :

Note, i’ve added labels to the inputs which aren’t in the original macro. The ‘EOM’ input stands for End of Message and is a trigger sent when the whole message has been processed / consumed.

Starting from the right hand side there is a merge module with a constant 1 as its last input. This is used to define the initial state of the state machine, the 1 event will be sent during initialization to prepare the value delay with the right state ID.

The other 3 macros define the state transitions, so as the id event comes in it triggers the middle value macro which outputs 2 as the new state id. Next when the length event occurs the first value macro outputs 0 to transition into the data state and finally when the EOM event occurs the state machine returns to the starting state of 1. This just continues in a cycle as each message is handled. For example, with a message containing 2 data events there would be 2 header events and 2 data events. id, length, data_0 and data_1. The state of the machine would be 1,2,0,0 and then back to 1 ready for the next message.

Stepping back up a level to the State Action macro you’ll see that most of the work is the handling and output of the data events which happens in the { b } count macro. The actual output of data events is handled just the same as id and #, they’re just sent directly to the output. This means that the { b } count macro is responsible for 2 things : sending the data index out via the [] port  and sending the EOM event to trigger the transition from the data state (0) back to the initial state (1 : the id event state).

To be able to do both of these it has to count the incoming data events, hence the name :)

Inside it looks like this :

The increment macro just keeps count of data events and the ‘is EOM’ (renamed from init in the original) checks if the data index is equal to the length – 1. The increment macro is quite interesting inside and worth working out what its actually doing.

The # (length) event comes in at the top port, labelled 0. The reason its labelled zero is because it resets the counter inside this macro to zero. As you can see the read module doesn’t have an OBC connection, it just sends a zero out when an event arrives at the zero input. The other 3 memory modules are all OBC connected, which means they operate on the same piece of memory. The first write at the top writes the 0 when the # appears to reset the counter, then when a data event arrives at the second input, the current value is read from memory and sent to the output to be used as the data index, but its also written back into memory via the + 1 module which increments the internal counter. Of course this macro could be re-used anytime you need an event counter with a reset.

And that just about wraps it up, when the increment macro sends out an index value which is equal to # – 1, the { b} count macro send the EOM trigger to return the state machine back to the starting state and the next message can be processed.

The download contains 2 ensembles, 1 is the already mentioned Raw Receiver Renamed, which is just the raw receiver core macro with the renamed items. The other (Raw Receiver Test Setup) is a more complete ensemble which shows how to create a message and also contains a couple of event watchers so you can see exactly how the state transitions occur and how the data appears at the outputs.


Nov 20 2009

OSC on Android

Category: Android,Development,OSCMartin @ 10:34 am

I just bought myself a HTC Hero so im starting to learn all the Android development stuff.

So the first thing i’ve tried is to see how easy it is to get my OSCLib stuff working. There isnt a lot to the actual library itself as most of the hard work is handled by Apache Mina. I started a new Android project in eclipse and just tried to send a simple OSC message to a test server on my local machine. It didnt work, the dalvik VM told me I had a verify error. I eventually narrowed this down to the SLF4J library. At this stage I had no clue about how to fix it so back to google to see if someone else had done the hardwork. :)

I found this thread where Thorsten Möller says he actually has a version of slf4j but its not on the main site yet, just in his git repo. So after a clone of that and a run of maven I had a shiny new slf4j-android.jar which I’ve upload to my site here.

I added that jar to the dependencies of my OscAndroDemo test project and it worked. Easy. :)

All the source is available from the OSCLib assembla project. The main library is in /trunk/java, its an eclipse project and in there you can run the OSCServer class for testing. It’ll spit out some info to stdout when it receives a message. The android project is in /trunk/android/AndrOscDemo which you can check out from SVN directly into eclipse.

The demo just connects to 10.0.2.2:10000 and sends a single message. The next stage is to try and do some interesting stuff with the various sensors like the accelerometer and see if any issues arrive once I start sending lots of messages.

Tags: , , , , ,


Apr 28 2009

Voronoi diagram generator in flash

Category: Development,flashMartin @ 12:31 am

After reading Ross Bencina’s paper : “The Metasurface – Applying Natural Neighbour Interpolation to Two to Many Mapping”, I decided to have a go at building a similar system myself and hopefully revive an earlier project for creating different ways of modulating parametric systems (for me that means audio).

The first pass is done and you can see it working right here (flash player 10 required)

The code will be up somewhere soon, at the moment its mainly a port of the code from this page (but refactored to seperate the voronoi model, the scanner and the renderer). Thats combined with an implementation of the FastClip algo from this wikipedia page to keep the lines in the bounding box.

next up is gathering the line segments into polygons and linking stuff together ready for some nearest-neighbour evaluation.

Tags: ,


Oct 08 2008

OSC – Open Sound Control

Category: Development,Java,OSC,open sourceMartin @ 12:11 pm

For some reason, MIDI isnt dead yet, although it is indeed ‘ubiquitous and lightweight’ that doesn’t mean it should stick around. For some tasks its fine, but its definitely starting to show its age. One of the alternatives for communication between audio / video software and devices is Open Sound Control – OSC.

Im not going to go into a deep discussion of MIDI vs. OSC at this point, there are of course some benefits to MIDI which OSC should deal with in some way (e.g. a standardised namespace for representing MIDI semantics, or a discovery mechanism for that namespace..)..anyway, I just want to let you know that I’ve been working on some OSC related stuff to make using it easier from both Actionscript 3 and Max/MSP.

First up is OSCLib, this is intended as a low level set of OSC libraries which you can use in other applications. Actionscript 3 doesnt have UDP, only HTTP sockets whereas most OSC implementations (e.g. Reaktor, Bidule) are UDP based although one notable exception is SuperCollider which supports both. So to help bridge the gap there are java implementations for both HTTP and UDP clients and servers (well, the UDP server is currently missing but should be done in a day or two..)

For Max/MSP there is an MXJ object which wraps the HTTP server so you can send messages from a Flash / Flex client directly to Max/MSP.

There is some documentation on the project wiki pages for getting your dev environment setup and also a Flash / Max demo you can try out.

As a side note if anyone has a Korg Kontrol49 then i’ve also got a project based on OSCLib for working with the Kontrol49 in native mode : KontrolTools. This allows you to have full control of the lights and text displays via OSC as well as generate OSC message from all the knobs, sliders and buttons.

Tags: , , , , , , , , ,


Jan 15 2008

Reaktor Sample Map Generator

Category: Development,Other PlacesMartin @ 6:10 pm

Reaktor is great, but one thing that i dont like about it is the built in sample management, you have to create these ‘sample maps’ to use your own samples but the UI for it is a bit rubbish, like an awful version of kontakt. so i built a tool to generate map files automatically.

UPDATED
I’ve built a new version in Java which is tested and working on both Windows and OSX. You can download the app here.

I’ll put the source up soon when I get a spare minute.

comments, suggestions, modifications are all welcome.

UPDATE 2
If you are wondering how to run a .jar file then you will need to first download and install java then you should then be able to just double-click the .jar file. If for some reason that doesnt work you can ‘Open With…’ and then find where java is installed, somewhere like : C:/Program Files/Java/jre1.6.0_07/bin and choose the ‘javaw.exe’ program.

Tags: , ,


Aug 17 2007

MDK Recorded Live on that there internet radio

Category: Other Places,mp3 downloadMartin @ 3:25 pm

Bit late I know, but you can download a recording of me playing live on the Silent Block show right here, right now

Its about 85 mb.

NOTE. I just updated the link because it was broken (15th Jan 2008)


Jun 14 2007

MDK Live on your internet radio.

Category: Other Places,RealityMartin @ 8:16 am

100% new and unreleased MDK. Make sure you tune in.

silent block flyer


Next Page »