|
|
|
|
|
|
|
For example, if J2 occurs at times t = 1 and t = 3 the sequence of all signals broadcast (the overall state sequence) is: |
|
|
|
| 1 | 2 | 3 | 4 | | Input signal | J2 | | J2 | | | Internal signals | | J1 | J0 | J1 | | S0 | S1 | S1 | S0 | | | J10 | J11 | J11 |
|
|
|
|
|
The use of broadcast units to realize the given transition table is perfectly general and allows the realization of arbitrary transition functions (including counts modulo 2n). |
|
|
|
|
|
|
|
|
6. Treating the persistent strings as data implies that it should be possible to process them in standard computational ways. As a typical operation consider the addition of two persistent binary integers. The object, then, is to set up broadcast units which will carry out this addition. Let A1and A2 be the suffixes which identify the two strings. The addition can be carried out serially, digit by digit, from right to left. Much as in example (4) the "rightmost" digits are successively extracted by the broadcast units |
|
|
|
|
|
|
|
|
These digits, together with the "carry" from the operation on the previous pair of digits, identified by prefix I3, are submitted as in example (5) to broadcast units realizing the transition table: |
|
|
|
|
|
|
|
|
Successive digits of the sum are assembled by the broadcast unit  where, at the end of the process, the prefix A designates the sum. A few additional |
|
|
|
|
|
