We have examined the two basic stream operations, average and multiplication, for the two basic stream representations. We have also examined conversions between these representations, the division algorithm, and sequences of operations.

The operations for the dyadic representation in general have a lower lookahead requirement than the corresponding signed binary ones, but also suffer from the problem of dyadic digit swell--especially the dyadic multiplication algorithm.

We have also seen that the division algorithm has a higher lookahead requirement, that a sequence of operations can rapidly lead to a high lookahead requirement, and that the order in which operations are performed can affect the lookahead complexity.