We describe a new intermediate compiler representation, static token form, that is suitable for dataflow-style synthesis of high-level asynchronous specifications. Static token form transforms variables into tokens, and simplifies the pipelining of asynchronous computations according to their dataflow graphs. We present a compiler framework that automates this synthesis method, and show how it can be applied to pipelined asynchronous FPGA architectures.
['John Teifel', 'Rajit Manohar']
Static tokens: using dataflow to automate concurrent pipeline synthesis