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

Can a .net web application consume java web service, Can a .NET web applica...

Can a .NET web application consume Java web service? Yes Offcourse.Actually Webservices are independent to language. It depends on WSDL and SOAP. so any single can develope t

Positive logic nand gate is equivalent to negative logic nor, Show that a p...

Show that a positive logic NAND gate is equivalent to negative logic NOR gate. Ans: Positive logic denotes True or 1 with a high voltage and False or 0 with a low volt

K map explanation, K map explanation for mod 5 up synchronous counter ?

K map explanation for mod 5 up synchronous counter ?

what is a persistent cookie in php, A persistent cookie is a cookie which ...

A persistent cookie is a cookie which is keeps in a cookie file permanently on the browser's computer. By default, cookies are formed as temporary cookies which keep only in the br

What are the process states, What are the Process states? By the course...

What are the Process states? By the courses of implementation, processes change state. Status of a process is express by its present activity. Dissimilar practical states of

Higher order predicate logic - artificial intelligence, Higher Order Predic...

Higher Order Predicate Logic: In first order predicate logic, we are allowed to quantify over objects only. If we let ourselves to quantify over predicate or function s

Program level, Program Level This is usually the dependability of the o...

Program Level This is usually the dependability of the operating system, which runs processes simultaneously. Different programs are evidently independent of each other. So par

Mplement a second-order low-pass filter using the finite dif, you will impl...

you will implement a second-order low-pass filter using the finite difference method. The finite difference method is a useful mathematical method that is used to numerically solve

Computer, How does computer started?

How does computer started?

Direct mapped strategy, Determine the layout of the specified cache for a C...

Determine the layout of the specified cache for a CPU that can address 1G x 32 of memory. show the layout of the bits per cache location and the total number of locations. a)

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages