How deep does fifo require to be stop underflow or overflow, Computer Engineering

Assignment Help:

Given the subsequent FIFO and rules, how deep does the FIFO require to be to stop underflow or overflow?

RULES:

a. frequency(clk_A) = frequency(clk_B) / 4

b. period(en_B) = period(clk_A) * 100

c. duty cycle(en_B) = 25%

Suppose that clk_B = 100MHz (10ns)

By a. clk_A = 25MHz (40ns)

By b. period(en_B) = 40ns * 400 = 4000ns, but we merely output for 1000ns, because of c., so 3000ns of make possible we are doing no output work. Thus, FIFO size = 3000ns/40ns = 75 entries.

Related Discussions:- How deep does fifo require to be stop underflow or overflow

Cookies, basic purpose of cookies

basic purpose of cookies

Chemistry, what are the applications of photochemistry?

what are the applications of photochemistry?

State about the mp4- mpeg-4, MP4 (MPEG-4) MPEG-4 files are in a format ...

MP4 (MPEG-4) MPEG-4 files are in a format which can hold a mixture of multimedia objects like video, audio, animation, images etc. MP4 players again use compression technology

Explain different system calls for performing different task, Write down di...

Write down different system calls for performing different kinds of tasks. The major types of system calls are given as: Process Control: These kinds of system calls are

Picket fence problem, diagrams of picket fence problem

diagrams of picket fence problem

Determine a positive logic system logic state level, In a positive logic sy...

In a positive logic system, logic state 1 corresponds to ? Ans. For positive digital logic, we choose two voltages levels. Higher voltage shows logic 1 and a lower voltage sho

Explain dma and interrupt breakpoints, Q. Explain about DMA and Interrupt B...

Q. Explain about DMA and Interrupt Breakpoints? DMA interface transfers complete block of data one word at a time directly to or from memory without going through processor. Wh

Minimum possibility -minimax algorithm, Minimum possibility -minimax algori...

Minimum possibility -minimax algorithm: Finally, we want to put the scores on the top edges in the tree. So there is over again a choice. Whenever, in this case, we have to r

What are the variations in a fast adder, a. Design a fast adder. What are t...

a. Design a fast adder. What are the variations in a fast adder? b. Define how the virtual address is changed into real address in a paged virtual memory system. Give an example

Determine the workarounds in multiple inheritances, What are several issues...

What are several issues for selecting best workarounds in multiple inheritances? Some restrictions methods are used. Use two approaches of delegations, which is an implementati

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages