22.09.2015 Views

of Microprocessors

Musical-Applications-of-Microprocessors-2ed-Chamberlin-H-1987

Musical-Applications-of-Microprocessors-2ed-Chamberlin-H-1987

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

DIGITAL HARDWARE<br />

615<br />

TO MULTIPLEXED<br />

PHASE AOOE\<br />

FREQUENCY<br />

CONTROL IN<br />

FREQUENCY<br />

GENERATOR<br />

ACCUMULATOR<br />

elK<br />

MAJOR CYCLE<br />

RATE 62.5 kHz<br />

Fig. 17-17. Harmonic-frequency generator<br />

MINOR CYCLE<br />

RATE 4 MHz<br />

and the two accumulators are therefore actual registers rather than memories.<br />

In operation, the frequency-generation accumulatOr is clocked at the 62.5­<br />

kHz major cycle rate, while the indexing accumulator is clocked at the<br />

4-MHz minor cycle rate. Note that the indexing accumulator must be<br />

cleared at the beginning <strong>of</strong> every major cycle for proper operation.<br />

Amplitude Multiplier<br />

The amplitude multiplier is much more difficult to eliminate so let's<br />

see what is involved in hardware multiplication. There are a multitude <strong>of</strong><br />

hardware multiplication techniques that would require an entire chapter to<br />

describe in detail. There are, however, basically two ways <strong>of</strong> multiplying in<br />

hardware. The first is the serial shift and add algorithm or serial multiplication.<br />

When an M-bit multiplier is being multiplied by an N-bit multiplicand,<br />

the basic approach is to examine the M bits one bit at a time and<br />

based on the result either add the multiplicand to a product accumulator<br />

followed by a shift or just do the shift (either the accumulator can move right<br />

or the multiplicand can move left). This approach is economical <strong>of</strong> hardware<br />

requiring just an N-bit adder, an M + N-bit shift register, and an N-bit<br />

latch but is slow, since M clock cycles are necessary to compute the product.<br />

With Schottky TTL logic, shift and add can be done at about a 20-MHz rate,<br />

which means that a 10 X 10 multiplication requires 500 nsee to perform, too<br />

slow for the Fourier series generator as currently specified, although possibly<br />

adequate for a 32-harmonic implementation.<br />

The second approach is called parallel multiplication. Essentially, a large<br />

number <strong>of</strong> adders and gates is combined to form a massive combinational<br />

logic network that acceprs the factors as static inputs and eventually produces<br />

the product output after the logic states have stabilized. For short word<br />

lengths, it may even be practical to use a ROM as a multiplication table.<br />

Besides much higher speed, the parallel multiplier is much easier to use,<br />

since no clocks or timing signals are necessary. Settling time from when<br />

operands are applied to when the result is stable is in the 150-nsec range for<br />

lO-bit operands and a 20-bit product.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!