Abstract—This paper introduces a new methodology for determining the minimum number of
registers needed to pipeline a linear asynchronous pipeline so that the final cycle time
meets some constraints. Moreover, the methodology defines the optimum placing for the
registers; ends with an optimally pipelined circuit.