Problem 2 A gray code counter is one where only one bit changes at each count. T

ID: 3535338 • Letter: P

Question

Problem 2

A gray code counter is one where only one bit changes at each count. The lesser significant bits change

before the more significant bits change, and the bit sequence does not repeat itself before the counter finishes

its full cycle.Ã‚

For instance, a full cycle of a 4-bit gray code counter, starting at 0000, would proceed as follows:Ã‚

0000 0001 0011 0010 0110 0111 0101 0100 1100 1101 1111 1110 1010 1011 1001 1000

Using Logicworks, design a logic circuit implementing the 4-bit gray code counter, beginning at 0000, and updating

to the next count upon each positive edge of a clock signal. Use logic gates to implement the update equations

for all bits of the counter. Show the output of each bit of the counter.

Submit your Logicworks circuit file containing the .cct extension.

PROBLEM 2

The 74_169 counter is a 4-bit Up/Down counter, that begins at 0000 and counts either up or down depending onÃ‚

a user-specified input. When the counter reaches 1111 and is counting up, the next count is 0000. When theÃ‚

counter is at 0000 and is counting down, the next count is 1111, followed by 1110, 1101, 1100, etc. The count

changes upon each positive edge of a clock signal.

Using Logicworks, design a logic circuit implementing this counter. Use Programmable Logic Arrays (PLAs)

to implement the update equations for all bits of the counter. Show the output of each bit of the counter.

Submit your Logicworks circuit file containing the .cct extension.

this problem can be simply solved by first counting up or counting down normally using any binary up or down counter.

The output of this counter can be fed into another module that converts the binary code into the gray code.

the formula to convert binary to gray code is shown below

b(n) and g(n) being the most significant bit for binary and gray code respenctively.

g(n) = b(n);

g(n-1) = b(n) XOR b(n-1);

g(0) = b(1) XOR b(0)

The above logic can be very simply implemented.

The counter can be made using synchronous sequential cicruit or using asynchronous sequential circuit.

N.B. I am not accustomed to Logicworks so i havent been able to answer to your problem specifically.

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.