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

Illustrate the accumulator architecture, Accumulator Architecture: An accu...

Accumulator Architecture: An accumulator is anespecially designated register which supplies one instruction operand and receives result. Instructions in such machines are usually

What are the two types of branch prediction techniques, What are the two ty...

What are the two types of branch prediction techniques available? The two types of branch prediction methods are 1) Static branch prediction 2) Dynamic branch predicti

Computer organisation, Write-through vs. write-back caches

Write-through vs. write-back caches

Electro chemical series and its applications, electro chemical series and i...

electro chemical series and its applications

Types of structure charts, Types of Structure Charts Transaction struc...

Types of Structure Charts Transaction structure - control module calls subordinate modules, each of which handles a certain transaction More afferent processes Le

Drawback of these electromechanical and mechanical computers, Drawback of t...

Drawback of these electromechanical and mechanical computers The basic drawback was: Inertia/friction of moving components had limited speed. The data movement usin

First in first out method, The First In First Out method assumes items of s...

The First In First Out method assumes items of stocks are issued in the same order as they are received. Thus the goods received first are assumed to be the first to be issued .Any

Time Complexity, how to determiner time complexity of any given polynomial ...

how to determiner time complexity of any given polynomial in data structure?

What is hashing, What is Hashing? Hashing: Hashing gives the direct acc...

What is Hashing? Hashing: Hashing gives the direct access of record from the file no matter where the record is in the file. This is possible with the help of a hashing functio

Explain call by value and call by reference, Call by value and Call by refe...

Call by value and Call by reference Call by value means sending the values of the arguments- The value of each of the original arguments in the calling function is copied in

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages