Asynchronous FIFO (first in first out) address conversion circuit based on Lee restricting competition counting coding

Abstract

The invention discloses an asynchronous FIFO (first in first out) address conversion circuit based on Lee restricting competition counting coding. The asynchronous FIFO address conversion circuit comprises a writing logic circuit based on the Lee coding, a reading logic circuit based on the Lee coding, a writing address to reading clock domain logic circuit and a reading address to writing clock domain logic circuit. By utilizing the asynchronous FIFO address conversion circuit based on the Lee restricting competition counting coding, asynchronous FIFO with the depth being 16 can be subjected to address conversion and management by the Lee restricting competition counting coding, an address generating circuit is simplified, and the reliability of the asynchronous FIFO is improved.

Description

technical field [0001] The invention relates to the technical field of microelectronics, in particular to design an asynchronous FIFO address conversion circuit based on Lee's restricted competition counting code. Background technique [0002] In a communication processing system, data transmission between different clock domains is often required. If it is multi-bit data transmission, in order to ensure data integrity during transmission between asynchronous clock domains, a common method is to use asynchronous FIFO, such as figure 1 As shown, the data enters the cache in the write clock domain and is read out in the read clock domain. In order to ensure the consistency and integrity of the data when the data cache is written and read at the same time, the write address and The relative position of the read address is logically compared to determine the status of the cache (read empty or full). [0003] Due to the asynchrony of the read clock, the address pointers for rea...

AI Technical Summary

Problems solved by technology

Both read and write addresses are multiple bits wide, so direct clock crossing won't solve the problem

Images