CC Blog • Quick Bits • Resources

Binary Rate Multipliers

Written by Andrew Levido

Complex logic circuits have rather fallen out of favour with the rise of low-cost microcontrollers and CPLDs, but it’s often interesting and useful to take a look at some of the devices and techniques that were employed back then. One of these is binary rate multiplication.

Simply put, a binary rate multiplier (BRM) provides an output clock rate that is proportional to a programmable multiple of the input clock rate. This sounds a bit confusing so let’s look at an example. A four-bit BRM typically produces an output frequency  fo that is M/16 times the input frequency fi. In this case M is a four-bit binary number between zero and 15. For example, if we set M = 11, then the output rate would be 11/16 fi  (0.6875 fi).

Despite its name, a binary rate multiplier always produces an output rate less than its input rate. The maximum output rate a 4-bit BRM can produce is 15/16 fi  (0.9375 fi). A good way to think about it is to consider the output rate to be the sum of binary-weighted fractions of the input frequency as shown in Figure 1.  This figure also shows the example we used above with M equal to 11 to illustrate how this works.

Figure 1
The output pulse rate of a binary rate multiplier is simply the sum of binary weighted fractions of the input pulse rate. In the example shown, the multiplicand is 11 and the output rate is 11/16 of the input rate.

This is fairly easily implemented in logic as shown in Figure 2. A synchronous divider (not shown) provides the inputs to four AND gates on the left which create pulse trains with the required frequency, but in a particular non-overlapping pattern. The clock signal is used in each case to constrain the pulse width. The multiplicand bits M0 through M3 gate the appropriate pulse train through to the OR gate which combines them. Two examples are also shown in the figure – one with M=3 and one with M=11.

Figure 2
The circuit required to create a 4-bit BRM is fairly straightforward as shown here. The AND gates on the left take inputs from a synchronous divider (not shown) and produce four non-overlapping pulse trains A0 through A3. These are gated by the multiplicand bits and ORed together to produce the output pulse train.

Fortunately, you don’t have to implement a BRM like this yourself. Off the shelf BRM chips are available in both the 74-series and 4000-series logic families – the 7497 and the 4089 respectively. I am going to focus on the latter.

The 4089 is a 4-bit BRM which works exactly as described above but has some additional inputs and outputs to enable multiple chips to be cascaded. This can be done in two different ways as shown in Figure 3.

Figure 3
Two or more 4089 4-bit BRM chips can be cascaded in either “add mode” which produces a wider BRM, or in “multiply mode” which produces a pulse train proportional to the product of the multiplicands.

When two are cascaded in “Add Mode” you create an 8-bit BRM where fo is (16M+N)/256 times fi . If you treat the two nibbles M and N as one 8-bit value P, you get fo = P/256 fi.   When cascaded  in “Multiply Mode” the output frequency is (M·N)/256 fi.  

This is all very interesting by why would we ever need to use a BRM? The first application is pretty obvious – fractional clock division. For example, if we want to divide a 10.0 MHz clock down to 4.0MHz  we need to divide it by 2.5. An 8-bit BRM with a multiplicand of 102 will get you very close, with an output frequency of 3.984MHz (about 0.4% error). We can however do better, and get a 50% duty cycle output clock as a bonus, by using the same BRM but with M = 205 and adding an external ÷2  flip-flop to the output. This gets us 4.003MHz (0.075% error).

Before microcontrollers were ubiquitous, we also used BRMs to create mathematical functions digitally. The simplest example is multiplication, shown in Figure 4. Here two BRMs cascaded in multiply mode and the resulting pulse rate applied to a digital counter. If the counter is reset every 256 input clock periods, the count represents the number of BRM output pulses every 256 input pulses which is the product of the two 4-bit numbers M and N. You can then display this count on a 3-digit 7-segment display This was a neat way to build a digital multiplier, and frequently used back in the day.

Figure 4
This diagram illustrates the use of two BRMs and a counter to produce a digital multiplier. If the counter is reset every 256 input clock cycles, the count will reflect the product of the two multiplicands.oup/fsm/en/products/reram/.

Bibliography

“CD4089B Data Sheet, Product Information and Support | TI.Com.” Accessed February 23, 2024. https://www.ti.com/product/CD4089B.

“SN7497 Data Sheet, Product Information and Support | TI.Com.” Accessed February 23, 2024. https://www.ti.com/product/SN7497.

Keep up-to-date with our FREE Weekly Newsletter!

Don't miss out on upcoming issues of Circuit Cellar.


Note: We’ve made the Dec 2022 issue of Circuit Cellar available as a free sample issue. In it, you’ll find a rich variety of the kinds of articles and information that exemplify a typical issue of the current magazine.

Would you like to write for Circuit Cellar? We are always accepting articles/posts from the technical community. Get in touch with us and let's discuss your ideas.

Sponsor this Article
+ posts

Andrew Levido (andrew.levido@gmail.com) earned a bachelor’s degree in Electrical Engineering in Sydney, Australia, in 1986. He worked for several years in R&D for power electronics and telecommunication companies before moving into management roles. Andrew has maintained a hands-on interest in electronics, particularly embedded systems, power electronics, and control theory in his free time. Over the years he has written a number of articles for various electronics publications and occasionally provides consulting services as time allows.

Supporting Companies

Upcoming Events


Copyright © KCK Media Corp.
All Rights Reserved

Copyright © 2026 KCK Media Corp.

Binary Rate Multipliers

by Andrew Levido time to read: 3 min