Essay on Fifo: Fifo and Fifo Buffer

Submitted By neham30
Words: 2042
Pages: 9
Open Document
Expert Verilog, SystemVerilog & Synthesis Training

Simulation and Synthesis Techniques for Asynchronous
FIFO Design

Clifford E. Cummings, Sunburst Design, Inc. cliffc@sunburst-design.com ABSTRACT
FIFOs are often used to safely pass data from one clock domain to another asynchronous clock domain. Using a
FIFO to pass data from one clock domain to another clock domain requires multi-asynchronous clock design techniques. There are many ways to design a FIFO wrong. There are many ways to design a FIFO right but still make it difficult to properly synthesize and analyze the design.
This paper will detail one method that is used to design, synthesize and analyze a safe FIFO between different clock domains using Gray code pointers that are synchronized into a different clock domain before testing for "FIFO full" or "FIFO empty" conditions. The fully coded, synthesized and analyzed RTL Verilog model (FIFO Style #1) is included. Post-SNUG Editorial Comment
A second FIFO paper by the same author was voted “Best Paper - 1st Place” by SNUG attendees, is listed as reference [3] and is also available for download.

1.0

Introduction

An asynchronous FIFO refers to a FIFO design where data values are written to a FIFO buffer from one clock domain and the data values are read from the same FIFO buffer from another clock domain, where the two clock domains are asynchronous to each other.
Asynchronous FIFOs are used to safely pass data from one clock domain to another clock domain.
There are many ways to do asynchronous FIFO design, including many wrong ways. Most incorrectly implemented
FIFO designs still function properly 90% of the time. Most almost-correct FIFO designs function properly 99%+ of the time. Unfortunately, FIFOs that work properly 99%+ of the time have design flaws that are usually the most difficult to detect and debug (if you are lucky enough to notice the bug before shipping the product), or the most costly to diagnose and recall (if the bug is not discovered until the product is in the hands of a dissatisfied customer). This paper discusses one FIFO design style and important details that must be considered when doing asynchronous
FIFO design.
The rest of the paper simply refers to an “asynchronous FIFO” as just “FIFO.”

2.0

Passing multiple asynchronous signals

Attempting to synchronize multiple changing signals from one clock domain into a new clock domain and insuring that all changing signals are synchronized to the same clock cycle in the new clock domain has been shown to be problematic[1]. FIFOs are used in designs to safely pass multi-bit data words from one clock domain to another.
Data words are placed into a FIFO buffer memory array by control signals in one clock domain, and the data words are removed from another port of the same FIFO buffer memory array by control signals from a second clock domain. Conceptually, the task of designing a FIFO with these assumptions seems to be easy.
The difficulty associated with doing FIFO design is related to generating the FIFO pointers and finding a reliable way to determine full and empty status on the FIFO.

2.1

Synchronous FIFO pointers

For synchronous FIFO design (a FIFO where writes to, and reads from the FIFO buffer are conducted in the same clock domain), one implementation counts the number of writes to, and reads from the FIFO buffer to increment (on
FIFO write but no read), decrement (on FIFO read but no write) or hold (no writes and reads, or simultaneous write and read operation) the current fill value of the FIFO buffer. The FIFO is full when the FIFO counter reaches a predetermined full value and the FIFO is empty when the FIFO counter is zero.
Unfortunately, for asynchronous FIFO design, the increment-decrement FIFO fill counter cannot be used, because two different and asynchronous clocks would be required to control the counter. To determine full and empty status for an asynchronous
Show More

Related Documents: Essay on Fifo: Fifo and Fifo Buffer

Essay on Powerpoint: Inventory and Cost

Chapter 6 Inventories and Cost of Sales QUESTIONS 1. (a) FIFO: The cost of the first (earliest) items purchased in inventory flow to cost of goods sold first. (b) LIFO: The cost of the last (most recent) items purchased in inventory flow to cost of goods sold first. 2. Merchandise inventory is disclosed on the balance sheet as a current asset. It is also sometimes reported in the income statement as part of the calculation of cost of goods sold. 3. Incidental costs sometimes are ignored…

Words 7015 - Pages 29

Littlefield Simulation

Based on previous calculations for the utilization of each station, we knew before starting Littlefield Simulation that Station 3, with a utilization of 90.37%, was going to be a bottleneck in our production. The earlier we could purchase a new machine for Station 3 the better. Of course, similar to The Goal, the challenge would be once the new Station 3 machine was purchased the bottle neck would then become Station 1 with a utilization of 89.49%. Due to the reorder quantity cash restrictions, we…

Words 587 - Pages 3

Nt1310 Unit 4

Option 1, FIFO (first-in, first-out) implements the idea that the page that was the earliest to be entered into the buffer is least likely to be needed again. As a result, when the buffer is full, and a new page needs to be added, the page that has been in the buffer the longest is dropped and the new page is added. 2. Under what condition will this heuristic not be efficient? In this context an efficient buffer, is one that has the highest potential to provide a block of data out of the buffer and not…

Words 1265 - Pages 6

Operations management Essay

Operations strategy 1.1 Introduction Operations: the processes by which companies manufacture and distribute products and / or services to their customers. Operations management: dealing with such processes can be configured properly in order to successfully meet the requirements and needs of the market. Any decision taken in this area is extremely important and impactful for the enterprise (strategic framework) as the operations represent the "core" of any organization. Given the importance…

Words 6381 - Pages 26

M362 Unit 2 Notes Essay

M362 Developing Concurrent Distributed Systems Unit 2 Processes A task is sequence of instructions treated as an element of work. Each application a user is running can be represented by a process that is running or executing. A process is different from a program in that it is the program’s execution – the program itself is regarded as static. A platform is a particular combination of software and hardware upon which a process is executing – a process is the culmination of a programs’ source…

Words 3997 - Pages 16

08 Level 3 CSTR study and assessment guide AQ2013 Essay

Cost and revenues (Level 3) Study and assessment guide OFQUAL unit code: D/504/3912 SQA unit code: UD58 04 Version date: April 2013 (version 2) Introduction Please note that this document is subject to annual review and revision to ensure that it accurately reflects the assessment criteria. This guidance note is written for the QCF Unit Cost and revenues (2013 standards). The AAT unit for this will be assessed by one 150 minute computer based examination. Please read this document in conjunction…

Words 3173 - Pages 13

The Role Of Operations Management

BU S IN E S S O P E R A T IO N S : IN VE STIG ATIO N AN D RE PORT Christal . Le! 1 TABLE OF CONTE NTS Executive summary 3 Strategic Role of operations management 4 Operational Strategies 5 Conclusion 9 Christal . Le! 2 E X E C U TIVE S U M M A RY Operation refers to the coordination of those activities in a business that are involved in combining inputs for the purpose of producing an output that is valued by consumers. The operations department is responsible for acquiring the inputs…

Words 2331 - Pages 10

Essay on Computer Architecture

CS [46]290 ECE [46]100 Conte Memory Hierarchies, Cache Memories CACHE-1 Who Cares About the Memory Hierarchy? Processor-DRAM Memory Gap (latency) 1000! Moore s Law CPU! µProc 60%/yr. (2X/1.5yr) Performance 100! 10! Processor-Memory Performance Gap: (grows 50% / year) Less Law? DRAM 1! 1980! 1981! 1982! 1983! 1984! 1985! 1986! 1987! 1988! 198 9! 1990! 1991! 1992! 1993! 1994! 1995! 1996! 1997! 1998! 1999! 2000! DRAM 9%/yr. (2X/10 yrs) Time CACHE-2 Random Access…

Words 4018 - Pages 17

Essay on Transmission Control Protocol and Tcp Variants

received packets after the queue is full moreover results in low-network performance. To address this problem, RED was proposed to improve the performance of TCP connections. As a queue management mechanism, it drops packets in the considered router buffer to adjust the network traffic behavior according to the queue size. In application, TCP Variants (Reno, NewReno, Vegas, Fack and Sack1) show oscillatory curve of packet reception if RED is considered for queuing, besides, some variants out performs…

Words 2367 - Pages 10

Assignment Quality Essay

FACULTY OF ARTS, DESIGN & TECHNOLOGY Programme:BEng Manufacturing and Production Engineering Programme Code:J901 Module Code: 4ME512 Module Title: Quality and Reliability ASSIGNMENT 1 & 2 – LEAN MANUFACTURING AND QUALITY TOOLS IMPLEMENTATION IN MOLD SOLUTIONS LIMITED Submitted by: Ninna Mari Alves de Araujo Student ID: 100312521 24 April 2014 Executive Summary Lean Manufacturing and Quality Tools are described and an implementation proposal is presented. The company of study is…

Words 4663 - Pages 19