| 摘要 |
PROBLEM TO BE SOLVED: To share a FIFO in a plurality of data paths without need to set FIFO capacity for each data path. SOLUTION: A FIFO section 130 is constituted of a shift selector for shifting data of FIFO in a shape of N steps of a ring, and N pieces of FIFO with equal capacity. For a request of FIFO writing from the Kth data path, the data of FIFO of data paths from the (K+1)th to the Mth are made to shift to a latter part by one step, and writing of data from the Kth data path to the FIFO of an empty position is performed. For a request of FIFO reading from the Kth data path, the data of FIFO of the data paths from the first to the (K-1)th is made to shift to the latter part by one step so that the empty position of the FIFO of the data path of the Kth is filled after the reading of the requested data, and the capacity of the FIFO which each data path uses is changed dynamically. COPYRIGHT: (C)2005,JPO&NCIPI
|
