CN103580678A - High-performance lookup table circuit based on FGPA - Google Patents
High-performance lookup table circuit based on FGPA Download PDFInfo
- Publication number
- CN103580678A CN103580678A CN201310536697.XA CN201310536697A CN103580678A CN 103580678 A CN103580678 A CN 103580678A CN 201310536697 A CN201310536697 A CN 201310536697A CN 103580678 A CN103580678 A CN 103580678A
- Authority
- CN
- China
- Prior art keywords
- look
- cmos
- circuit
- low threshold
- threshold value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000013461 design Methods 0.000 claims abstract description 23
- 238000013500 data storage Methods 0.000 claims description 2
- 210000000352 storage cell Anatomy 0.000 claims 1
- 230000005540 biological transmission Effects 0.000 abstract description 46
- 230000006872 improvement Effects 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 20
- 238000000034 method Methods 0.000 description 12
- 238000005457 optimization Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 208000037516 chromosome inversion disease Diseases 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 230000010354 integration Effects 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- OUXCBPLFCPMLQZ-WOPPDYDQSA-N 4-amino-1-[(2r,3s,4s,5r)-4-hydroxy-5-(hydroxymethyl)-3-methyloxolan-2-yl]-5-iodopyrimidin-2-one Chemical compound C[C@H]1[C@H](O)[C@@H](CO)O[C@H]1N1C(=O)N=C(N)C(I)=C1 OUXCBPLFCPMLQZ-WOPPDYDQSA-N 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012905 input function Methods 0.000 description 1
- 238000003825 pressing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
Images
Landscapes
- Logic Circuits (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
本发明属于集成电路技术领域,具体为一种基于FPGA的高性能查找表电路。本发明采用逻辑门单元和传输门混合设计;以4输入查找表电路为例,由三个反相器,2个CMOS传输门以及一个与非门组成。本发明将电路关键路径上的传输管由4级减到2级,极大的降低了关键路径的延时;采用低阈值CMOS传输门,避免阈值损失造成的延时不对称,从而降低对后续时序电路设计的困难;将CMOS传输管中的PMOS和NMOS管的尺寸设计为相同,使传输管部分PMOS管的面积减小50%。本发明通过对电路架构的改进,在速度、功耗和面积三方面的性能上都有明显的提高,使得在查找表逻辑所支持的可编程逻辑资源能有更加广泛的运用。
The invention belongs to the technical field of integrated circuits, in particular to an FPGA-based high-performance look-up table circuit. The present invention adopts the hybrid design of logic gate unit and transmission gate; taking the 4-input look-up table circuit as an example, it is composed of three inverters, 2 CMOS transmission gates and a NAND gate. The present invention reduces the transmission tube on the critical path of the circuit from 4 stages to 2 stages, which greatly reduces the delay of the critical path; adopts a low threshold CMOS transmission gate to avoid the delay asymmetry caused by the threshold loss, thereby reducing the impact on the subsequent Difficulty in sequential circuit design; the size of the PMOS and NMOS tubes in the CMOS transmission tube is designed to be the same, so that the area of the PMOS tube in the transmission tube is reduced by 50%. Through the improvement of the circuit structure, the present invention obviously improves the performance in three aspects of speed, power consumption and area, so that the programmable logic resources supported by the look-up table logic can be more widely used.
Description
技术领域 technical field
本发明属于FPGA电路技术领域,具体涉及一种高性能的查找表电路。 The invention belongs to the technical field of FPGA circuits, and in particular relates to a high-performance look-up table circuit. the
技术背景 technical background
作为被广泛应用于集成电路设计和验证的FPGA,由于其强大的可编程特性以及不断加入Block RAM、DSP、高速IO以及PLL等IP核而逐渐强大的备选功能系统,使得其在今后的集成电路设计领域占有举足轻重的地位。但是随着工艺尺寸的不断减小,数字集成电路的规模越来越大,功能集成度的要求和芯片性能的要求也越来越高。为了能对功能更全面、性能要求更高的设计进行验证,FPGA经过几十年的发展,结构已经发生了较大的变化,规模也增加了几个数量级,应用范围也越来越广,FPGA的设计在追求更完善的存储、运算、通信功能的同时,对性能的不断提升确是又一个不容忽视的挑战。 As an FPGA widely used in integrated circuit design and verification, due to its powerful programmable features and the continuous addition of IP cores such as Block RAM, DSP, high-speed IO, and PLL, the gradually powerful alternative functional system makes its integration in the future The field of circuit design occupies a pivotal position. However, with the continuous reduction of process size, the scale of digital integrated circuits is getting larger and larger, and the requirements for functional integration and chip performance are also getting higher and higher. In order to verify designs with more comprehensive functions and higher performance requirements, after decades of development, the FPGA structure has undergone major changes, the scale has also increased by several orders of magnitude, and the application range has become wider and wider. While pursuing more perfect storage, computing, and communication functions, the continuous improvement of performance is another challenge that cannot be ignored.
FPGA是一种能根据位流信息来配置内部编程点实现任意输入函数发生并将其构成各种组合或者时序逻辑电路的阵列,而能实现各种函数发生功能的单元,可编程逻辑块,正是这个现场可编程门阵列的核心和重要组成部分。典型的可编程逻辑块(以下简称CLB)主要是由三部分组成:查找表电路、触发器电路和其他组合逻辑电路。触发器电路是为实现时序逻辑提供的时序单元,而其他组合逻辑则是配合查找表电路实现一些输入较少的组合逻辑,比如,2输入与逻辑、2输入异或逻辑。而实现任意输入的函数发生功能的单元则是查找表电路。所以,对查找表电路的优化,在速度、功耗、面积等方面各项性能的提升对实现高速低功耗的FPGA有着重要意义。 FPGA is a unit that can configure internal programming points according to bit stream information to realize arbitrary input function generation and form an array of various combinations or sequential logic circuits, and can realize various function generation functions. Programmable logic blocks, positive It is the core and important part of this field programmable gate array. A typical programmable logic block (hereinafter referred to as CLB) is mainly composed of three parts: look-up table circuit, flip-flop circuit and other combinational logic circuits. The flip-flop circuit is a sequential unit provided for the realization of sequential logic, while other combinational logics cooperate with the look-up table circuit to realize some combinational logic with fewer inputs, such as 2-input AND logic, 2-input XOR logic. The unit that realizes the function generation function of any input is a look-up table circuit. Therefore, the optimization of the look-up table circuit and the improvement of various performances in terms of speed, power consumption, and area are of great significance to the realization of high-speed and low-power FPGAs.
查找表电路通常由4到6个用户输入、相应的译码电路和SRAM存储点构成,可以实现任意的4到6输入1输出的组合逻辑或ROM功能;在FPGA过去的发展中,查找表的结构有几种,图1为一个三输入的查找表结构,是一种由NMOS传输管做成的八选一的译码器,传输管的数量是以二进制树的拓扑结构展开的。随着查找表输入端数目的增加,其电路规模将按2k规律急剧增加,因此高输入查找表电路并不具备实用价值。图2为基于CMOS传输管的查找表结构,可以避免使用NMOS单管传输造成的阈值损失问题,但通常Q端要驱动很大的负载(可编程互连线),所以最后一级的反相器通常做得很大,加上多级级联的CMOS传输门,使SRAM输出的反相器的负载很大,这样会极大的增加电路的延时。 The look-up table circuit is usually composed of 4 to 6 user inputs, corresponding decoding circuits and SRAM storage points, which can realize any combinational logic or ROM function of 4 to 6 inputs and 1 output; in the past development of FPGA, the look-up table There are several structures. Figure 1 shows a three-input lookup table structure, which is a one-of-eight decoder made of NMOS transmission tubes. The number of transmission tubes is expanded in a binary tree topology. With the increase of the number of input terminals of the look-up table, its circuit scale will increase sharply according to the law of 2 k , so the high-input look-up table circuit does not have practical value. Figure 2 shows the look-up table structure based on CMOS transmission tube, which can avoid the threshold loss problem caused by the use of NMOS single-transistor transmission, but usually the Q terminal needs to drive a large load (programmable interconnection), so the last stage of inversion The inverter is usually made very large, coupled with the multi-stage cascaded CMOS transmission gates, the load of the inverter output by the SRAM is very large, which will greatly increase the delay of the circuit.
发明内容 Contents of the invention
本发明的目的在于提供一种能够降低查找表电路级数、减小关键路径延时、降低漏电电流,从而解决上升下降时间不对称等问题的基于FPGA的查找表电路。 The purpose of the present invention is to provide a FPGA-based look-up table circuit that can reduce the number of stages of the look-up table circuit, reduce the delay of the critical path, and reduce the leakage current, thereby solving problems such as rising and falling time asymmetry.
本发明提供的基于FPGA的查找表电路(即FPGA中可编程逻辑块(Configuration Logic Block,简称CLB)中的查找表电路),通过改进查找表电路的结构、采用低阈值管构成的CMOS传输管,并且优化MOS管尺寸,来降低查找表电路级数,减小关键路径延时,降低漏电电流,解决上升下降时间不对称等问题,使得FPGA中查找表电路能够支持更加高性能的数字电路设计和验证。 The FPGA-based look-up table circuit provided by the present invention (that is, the look-up table circuit in the programmable logic block (Configuration Logic Block, CLB for short) in the FPGA) improves the structure of the look-up table circuit and adopts a CMOS transmission tube composed of a low-threshold tube. , and optimize the size of the MOS tube to reduce the number of look-up table circuit stages, reduce the delay of the critical path, reduce the leakage current, and solve the problems of asymmetric rise and fall times, so that the look-up table circuit in the FPGA can support higher performance digital circuit design And verification. the
本发明设计的查找表电路,采用逻辑门单元和CMOS传输管混合设计。以4输入查找表为例,由一级反相器、一级缓冲器、两级CMOS低阈值传输管以及一个与非门组成。如图3所示,由两个反相器构成的缓冲器I16设置于查找表输出端Q前,一级反相器I0~I15,设置于查找表的数据存储单元SRAM的反相输出 ~后;两级CMOS低阈值传输管C0~C15和C16~C19分别设置于一级反相器I0~I15后和缓冲器I16前。一级与非门输出设置于CMOS低阈值传输管的控制端。 The look-up table circuit designed by the present invention adopts a hybrid design of logic gate units and CMOS transmission tubes. Taking the 4-input look-up table as an example, it consists of a first-level inverter, a first-level buffer, two-level CMOS low-threshold transmission transistors, and a NAND gate. As shown in Figure 3, the buffer I16 composed of two inverters is set before the output terminal Q of the look-up table, and the first-stage inverters I0~I15 are set at the inverting output of the data storage unit SRAM of the look-up table ~ rear; the two-stage CMOS low-threshold transmission tubes C0~C15 and C16~C19 are respectively arranged after the first-stage inverters I0~I15 and before the buffer I16. The output of the primary NAND gate is set at the control end of the CMOS low-threshold transmission tube.
设:P0、P1~P15代表16个SRAM编程点的存储值,但是编程点的值都是从SRAM的反相端输出端,即~;A1、A2、A3、A4代表查找表的4个函数输入端,A1B、A2B、A3B、A4B依次代表查找表的4个函数输入端A1、A2、A3、A4取反之后的信号,Q是查找表输出端;对输入A1~A4的译码采用两位译码的方式,即查找表的函数输入端A1、A2,以及取反之后的信号A1B和A2B的组合经过一个与门实现对第一级CMOS低阈值传输管电路C0~C15的控制,查找表的函数输入端A3、A4,以及取反之后的信号A3B和A4B的组合经过一个与门实现对第二级CMOS低阈值传输管电路C16~C19的控制;其中,CMOS低阈值传输管C0~C19是由低阈值NMOS管和PMOS并联而成,并且NMOS管和PMOS管尺寸相同。最后,SRAM存储的值经过反相端输出~,经过1级反相器I0~I15和1级缓冲器I16(缓冲器I16由2个反相器组成),2级CMOS低阈值传输管C0~C15、C16~C19,最终到达查找表输出端Q。 Suppose: P0, P1~P15 represent the storage values of 16 SRAM programming points, but the values of the programming points are all output from the inverting end of the SRAM, that is ~ ; A1, A2, A3, A4 represent the 4 function input terminals of the look-up table, A1B, A2B, A3B, A4B represent the signals after the inversion of the 4 function input terminals A1, A2, A3, A4 of the look-up table in turn, Q is The output terminal of the lookup table; the decoding of the input A1~A4 adopts a two-bit decoding method, that is, the function input terminals A1, A2 of the lookup table, and the combination of the signals A1B and A2B after inversion are realized through an AND gate. The control of the first-level CMOS low-threshold transmission tube circuit C0~C15, the combination of the function input terminals A3 and A4 of the look-up table, and the inverted signals A3B and A4B are realized through an AND gate to the second-level CMOS low-threshold transmission tube circuit Control of C16~C19; among them, CMOS low-threshold transmission tubes C0~C19 are formed by parallel connection of low-threshold NMOS tubes and PMOS tubes, and the sizes of NMOS tubes and PMOS tubes are the same. Finally, the value stored in SRAM is output through the inverting terminal ~ , through 1-stage inverters I0~I15 and 1-stage buffer I16 (buffer I16 is composed of 2 inverters), 2-stage CMOS low-threshold transmission tubes C0~C15, C16~C19, and finally reach the output of the lookup table Q.
在电路设计上考虑到了一种将本设计扩展为带控制功能的查找表电路的设计方法。当查找表电路中出现一个置位信号时,传统的方法如图5中在Q端加入一个与门E1实现置位功能,而本设计则是将图3中的一个反相器I15改为一个如图4中的与非门D1,将置位信号加入到与门的一个输入端。这样只要A4~A1输入为全1从而R1=1、R5=1选通C15和C16两个CMOS传输管,则置位信号SET即可对输出端Q进行置位了。本设计相比于图5的传统加入控制信号的方法减少了关键路径上一级与门的延时。 In the circuit design, a design method of expanding this design into a look-up table circuit with control function is considered. When a set signal appears in the look-up table circuit, the traditional method is to add an AND gate E1 at the Q terminal as shown in Figure 5 to realize the set function, but this design is to change an inverter I15 in Figure 3 into a As shown in the NAND gate D1 in Figure 4, the set signal is added to an input end of the AND gate. In this way, as long as the inputs of A4~A1 are all 1s so that R1=1 and R5=1 select the two CMOS transmission tubes C15 and C16, then the set signal SET can set the output terminal Q. Compared with the traditional method of adding control signals in Figure 5, this design reduces the delay of the first-level AND gate on the critical path.
设计的速度优化说明 Design speed optimization instructions
本设计的查找表电路中,对于速度优化的考虑有以下几个方面: In the look-up table circuit of this design, the following aspects are considered for speed optimization:
(1)在电路结构上,改变了传统的对4位输入按位译码的方式,本发明变为了对4位输入按两位译码的方式。具体来说,传统的译码方式是逐个根据A1到A4的0/1的值控制传输管的开关,总共需要进行4级传输管译码来完成相应的函数发生。而本发明则是同时考虑两位地址,用与非门进行一次初步译码,再将初步译码后的值来控制CMOS传输管,实现SRAM数据的选择,这时,数据只需要经过两级CMOS传输管即可输出。从而将关键路径上的传输管从4级降低为2级,这减小了关键路径延时,提高了查找表的速度。 (1) In terms of circuit structure, the traditional bit-by-bit decoding method for 4-bit input is changed, and the present invention changes to a two-bit decoding method for 4-bit input. Specifically, the traditional decoding method is to control the switches of the transmission tubes one by one according to the 0/1 values of A1 to A4, and a total of 4 stages of transmission tube decoding are required to complete the corresponding function generation. However, the present invention considers two addresses at the same time, uses the NAND gate to carry out a preliminary decoding, and then controls the CMOS transmission tube with the value after the preliminary decoding to realize the selection of SRAM data. At this time, the data only needs to go through two stages The CMOS transmission tube can be output. Thus, the transmission pipe on the critical path is reduced from 4 stages to 2 stages, which reduces the critical path delay and improves the speed of the look-up table. the
(2)在电路设计时,考虑到CMOS传输门在多级级联时驱动能力会存在很大的问题,从而影响到数据传输速度。所以需要在关键路径上插入了反相器以提高驱动能力,但是反相器是会改变信号极性的,所以必须成对插入。为了减小多级反相器所造成的延迟,本发明在SRAM存储点的输出,采用从反相端输出,即到输出。相反如果从SRAM存储点的正相端输出(P0到P15)的话,则数据传输路径上就需要4级反相器。通过从SRAM反相端输出这样的设计,可以减少一级数据传输路径的一级反相器,提高数据从存储单元到Q的延时,对查找表的速度做到一定的提高。 (2) When designing the circuit, it is considered that the driving capability of the CMOS transmission gates in multi-level cascading will have great problems, which will affect the data transmission speed. Therefore, it is necessary to insert an inverter on the critical path to improve the driving capability, but the inverter will change the polarity of the signal, so it must be inserted in pairs. In order to reduce the delay caused by the multi-stage inverter, the output of the storage point of the SRAM in the present invention is output from the inverting terminal, that is, arrive output. On the contrary, if it is output from the non-inverting terminal of the SRAM storage point (P0 to P15), then a 4-stage inverter is required on the data transmission path. Through the design of outputting from the inverting end of the SRAM, the first-level inverter of the first-level data transmission path can be reduced, the delay of data from the storage unit to Q can be improved, and the speed of the look-up table can be improved to a certain extent.
(3)在电路设计上,在考虑到反相器可以解决CMOS传输管驱动能力弱这个问题的同时,还有一个扩展应用,对比图4和图5。当查找表电路中出现一个置位信号时,如果将置位信号单独以一级与门/或门加入到Q端,这样会增加一级关键路径延时。本发明的考虑,若要将使能信号并入某一个反相器,那么会选择并入第一个反相器,因为,Q端的一级缓冲器由于考虑到后续电路可能有大的负载,那么尺寸会设计的比较大,所以并入最后一级缓冲器会造成面积的大大增加。而第一级反相器的负载很小,尺寸也就很小,那么将其做成一个与门或者或门将控制信号并入,不仅可以减小一级门级延迟,也可以做到面积只有少量的增加。只是当置位信号有效时,4输入端就应该为某个固定的值以保证置位信号传输到Q端。 (3) In terms of circuit design, while considering that the inverter can solve the problem of weak drive capability of the CMOS transmission tube, there is also an extended application, compare Figure 4 and Figure 5. When a set signal appears in the look-up table circuit, if the set signal is added to the Q terminal by a single-stage AND/OR gate, this will increase a stage of critical path delay. The present invention considers that if the enable signal is to be incorporated into a certain inverter, then the first inverter will be selected to be incorporated, because the primary buffer at the Q end may have a large load in consideration of the follow-up circuit, Then the size will be designed relatively large, so incorporating the last level of buffer will greatly increase the area. However, the load of the first-stage inverter is very small, and the size is also very small, so it can be made into an AND gate or an OR gate to incorporate the control signal, which can not only reduce the first-stage gate-level delay, but also achieve an area of only small increase. Only when the setting signal is valid, the 4 input terminal should be a certain fixed value to ensure that the setting signal is transmitted to the Q terminal. the
(4)在CMOS传输管的设计时,本发明采用低阈值管,这样数据传输延时可以做到一定的减小,但是对漏电的影响却是很小的,不会造成功耗的增加。 (4) In the design of the CMOS transmission tube, the present invention adopts a low-threshold tube, so that the data transmission delay can be reduced to a certain extent, but the impact on the leakage is very small, and the power consumption will not be increased.
设计的功耗和面积优化说明 Power and Area Optimization Notes for Designs
本设计的查找表电路中,对功耗和面积的优化的考虑有以下几个方面: In the look-up table circuit of this design, the considerations for the optimization of power consumption and area include the following aspects:
(1)在电路结构上,与图2对比,本发明选用CMOS传输管电路而不是NMOS传输管,避免了由NMOS传输管的阈值损失而造成的信号延时不对称的问题和漏电引起的功耗增加的问题。 (1) In terms of circuit structure, compared with Fig. 2, the present invention selects CMOS transmission tube circuit instead of NMOS transmission tube, avoiding the problem of signal delay asymmetry caused by the threshold value loss of NMOS transmission tube and power leakage caused by problem of increased consumption.
(2)在尺寸设计上,一般来说,CMOS传输管的PMOS尺寸会是NMOS管的2~3倍,以使得电路的上升和下降时间保持对称,但这样会大大地增加查找表的版图面积。由于Q端加入了一级缓冲器I16,如图3,我们可以不用保证电路的上升下降时间的对称问题,而把PMOS和NMOS的尺寸做到一样大。这样极大的减小了查找表的面积。 (2) In terms of size design, generally speaking, the PMOS size of the CMOS transmission tube will be 2 to 3 times that of the NMOS tube, so that the rise and fall times of the circuit remain symmetrical, but this will greatly increase the layout area of the lookup table . Since the first-level buffer I16 is added to the Q terminal, as shown in Figure 3, we can make the size of the PMOS and NMOS the same without ensuring the symmetry of the rise and fall times of the circuit. This greatly reduces the area of the lookup table.
技术效果technical effect
本发明通过改进查找表电路的结构、采用低阈值管构成的CMOS传输管并且优化MOS管尺寸的方法,设计出了一种高性能查找表电路。速度上,在65nm SMIC工艺下,该查找表电路的延时可以达到只有0.22ns;在250MHZ工作频率下,动态漏电流可以只有82.5uA。面积上,对晶体管尺寸的优化,使得PMOS管所占的面积缩小了30%到50%。 The invention designs a high-performance look-up table circuit by improving the structure of the look-up table circuit, adopting a CMOS transmission tube composed of low-threshold tubes and optimizing the size of the MOS tube. In terms of speed, under the 65nm SMIC process, the delay of the look-up table circuit can reach only 0.22ns; under the operating frequency of 250MHZ, the dynamic leakage current can be only 82.5uA. In terms of area, the optimization of transistor size reduces the area occupied by PMOS transistors by 30% to 50%.
附图说明 Description of drawings
图1 三输入查找表结构。 Figure 1 Three-input lookup table structure.
图2 基于CMOS传输管的查找表结构。 Figure 2 The look-up table structure based on CMOS transmission tube.
图3 本发明的查找表结构。 Fig. 3 Lookup table structure of the present invention.
图4 置位信号嵌入反相器的查找表结构。 Figure 4 The look-up table structure of the set signal embedded in the inverter.
图5 置位信号加入单独一级逻辑门的查找表结构。 Figure 5 The set signal is added to the look-up table structure of a single logic gate.
图6 SRAM存储单元结构。 Figure 6 SRAM memory cell structure.
具体实施方式 Detailed ways
以4输入查找表为例,如图3,通过按A1到A4四位地址的逻辑值来控制CMOS传输门的开关,使得SRAM端到Q端出现一条导通路径,从而Q端输出所需要实现的函数值。 Taking the 4-input lookup table as an example, as shown in Figure 3, the switch of the CMOS transmission gate is controlled by pressing the logic value of the four-bit address A1 to A4, so that a conduction path appears from the SRAM terminal to the Q terminal, so that the output of the Q terminal needs to be realized. function value.
原理上,16个SRAM编程点就构成了任意4输入组合逻辑的真值表。以查找表实现一个4输入异或逻辑为例,4个输入信息与16个编程点的存储信息如表1,当有效的A1到A4输入时,Q才输出对应的SRAM的存储点的值。 In principle, 16 SRAM programming points constitute the truth table of any 4-input combinatorial logic. Take the lookup table to implement a 4-input XOR logic as an example. The storage information of 4 input information and 16 programming points is shown in Table 1. When valid A1 to A4 are input, Q will output the value of the corresponding SRAM storage point.
FPGA中查找表的功能实现过程如下: The function realization process of the lookup table in FPGA is as follows:
首先,在FPGA下载位流的过程中,就会通过字线和位线对设计会使用到的查找表的这16个存储点进行写入,SRAM存储单元结构如图6。 First, in the process of FPGA downloading the bit stream, the 16 storage points of the look-up table used in the design will be written through word lines and bit lines. The structure of the SRAM storage unit is shown in Figure 6.
下载完成后,如图3,16个SRAM单元这时按位存储着待实现函数的真值表的值,SRAM单元的正相输出端是P0到P15,SRAM单元的反相输出端即是到。 After the download is complete, as shown in Figure 3, the 16 SRAM units store the value of the truth table of the function to be realized bit by bit at this time, the positive phase output terminals of the SRAM unit are P0 to P15, and the inverting output terminals of the SRAM unit are arrive .
这时,在A1~A4端加入不同的值,会导致打开不同的CMOS传输管,从而Q端将输出导通的CMOS管所在路径上的SRAM的值。例如图3中,当A1A2A3A4=0011时,R1=R2=R3=0,R4=1,这使得由R4控制的CMOS传输管打开,从而的值和的值可以传过第一级CMOS传输管。由于A3A4=11,所以R6=R7=R8=0,R5=1,这使得由R5控制的CMOS传输管打开,将传过第一级的的值传到最后两级反相器最终到达Q端输出,而由于R8=0,R8控制的CMOS传输管关闭,使得已经通过第一级传输管的的值不能到达Q端输出。这样就实现了一个查找表逻辑。 At this time, adding different values to terminals A1~A4 will cause different CMOS transmission transistors to be turned on, so that terminal Q will output the value of the SRAM on the path where the CMOS transistors that are turned on are located. For example, in Figure 3, when A1A2A3A4=0011, R1=R2=R3=0, R4=1, which makes the CMOS transmission tube controlled by R4 open, thus value and The value of can pass through the first-stage CMOS transmission tube. Since A3A4=11, R6=R7=R8=0, R5=1, which makes the CMOS transmission tube controlled by R5 open, which will pass through the first stage The value is transmitted to the last two stages of inverters and finally reaches the output of the Q terminal, and since R8=0, the CMOS transmission tube controlled by R8 is turned off, so that the first-stage transmission tube has passed The value of can not reach the Q terminal output. This implements a lookup table logic.
另外,如果电路中需要加入置位信号等扩展功能的逻辑,图5说明了在电路中加入置位功能的传统方式。而本发明的方法是,如图4,将数据通路上第一个反相器改为一个与非门。当置位信号有效(0有效)时,将查找表的4个输入A1到A4的值全置为1,则将置位信号所在的通路选通,数据输出端Q则被置为1。这样就实现了支持置位等扩展功能的查找表逻辑。表1为 4输入异或逻辑与编程点SRAM值。 In addition, if the circuit needs to add the logic of the set signal and other extended functions, Figure 5 illustrates the traditional way of adding the set function to the circuit. And the method of the present invention is, as shown in Figure 4, change the first inverter on the data path into a NAND gate. When the set signal is valid (0 is valid), the values of the four inputs A1 to A4 of the lookup table are all set to 1, then the channel where the set signal is located is selected, and the data output terminal Q is set to 1. This implements the lookup table logic that supports extended functions such as setting bits. Table 1 shows the 4-input XOR logic and programming point SRAM value.
表1Table 1
Claims (1)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310536697.XA CN103580678B (en) | 2013-11-04 | 2013-11-04 | A kind of high-performance lut circuits based on FGPA |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310536697.XA CN103580678B (en) | 2013-11-04 | 2013-11-04 | A kind of high-performance lut circuits based on FGPA |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103580678A true CN103580678A (en) | 2014-02-12 |
CN103580678B CN103580678B (en) | 2016-08-17 |
Family
ID=50051737
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310536697.XA Active CN103580678B (en) | 2013-11-04 | 2013-11-04 | A kind of high-performance lut circuits based on FGPA |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103580678B (en) |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105761746A (en) * | 2016-02-04 | 2016-07-13 | 北京时代民芯科技有限公司 | Read-in time sequence matching circuit of single-particle reinforced FPGA distributed RAM |
CN106357265A (en) * | 2016-09-19 | 2017-01-25 | 中国电子科技集团公司第五十八研究所 | Small-area high-speed six-input searching table structure |
CN106815381A (en) * | 2015-11-30 | 2017-06-09 | 中国科学院电子学研究所 | The mapping method of logical node in sparse look-up table and FPGA |
CN107346149A (en) * | 2016-05-04 | 2017-11-14 | 杭州海存信息技术有限公司 | Processor based on back side look-up table |
CN108346443A (en) * | 2018-02-09 | 2018-07-31 | 京微齐力(北京)科技有限公司 | The circuit of arbitrary 4 input logic function is realized in a kind of parallel control |
CN108370251A (en) * | 2016-01-13 | 2018-08-03 | 阿尔特拉公司 | Power gating lut circuits |
CN111600597A (en) * | 2020-06-19 | 2020-08-28 | 成都华微电子科技有限公司 | Ultra-low power consumption lookup table circuit |
CN111934670A (en) * | 2020-08-17 | 2020-11-13 | 电子科技大学 | FPGA (field programmable Gate array) framework of quasi-N lookup table |
CN112234959A (en) * | 2020-10-09 | 2021-01-15 | 成都华微电子科技有限公司 | FPGA high-performance interconnection circuit |
CN112733474A (en) * | 2020-12-15 | 2021-04-30 | 西安国微半导体有限公司 | Netlist-level circuit area optimization method based on AND gate inverter diagram and storage medium |
CN113971159A (en) * | 2021-10-28 | 2022-01-25 | 山东芯慧微电子科技有限公司 | Programmable logic block based on improved lookup table structure |
CN117634383A (en) * | 2023-12-26 | 2024-03-01 | 苏州异格技术有限公司 | Critical path delay optimization method, device, computer equipment and storage medium |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1751361A (en) * | 2003-02-19 | 2006-03-22 | 皇家飞利浦电子股份有限公司 | Electronic circuit with array of programmable logic cells |
US20060066345A1 (en) * | 2003-02-19 | 2006-03-30 | Katarzyna Leijten-Nowak | Electronic circuit with array of programmable logic cells |
CN101617301A (en) * | 2007-02-19 | 2009-12-30 | Nxp股份有限公司 | Integrated circuit and electron device |
CN101924550A (en) * | 2009-06-11 | 2010-12-22 | 复旦大学 | A look-up table using gain cell eDRAM |
-
2013
- 2013-11-04 CN CN201310536697.XA patent/CN103580678B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1751361A (en) * | 2003-02-19 | 2006-03-22 | 皇家飞利浦电子股份有限公司 | Electronic circuit with array of programmable logic cells |
US20060066345A1 (en) * | 2003-02-19 | 2006-03-30 | Katarzyna Leijten-Nowak | Electronic circuit with array of programmable logic cells |
CN101617301A (en) * | 2007-02-19 | 2009-12-30 | Nxp股份有限公司 | Integrated circuit and electron device |
CN101924550A (en) * | 2009-06-11 | 2010-12-22 | 复旦大学 | A look-up table using gain cell eDRAM |
Cited By (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106815381A (en) * | 2015-11-30 | 2017-06-09 | 中国科学院电子学研究所 | The mapping method of logical node in sparse look-up table and FPGA |
CN106815381B (en) * | 2015-11-30 | 2019-10-18 | 中国科学院电子学研究所 | Sparse Lookup Table and Mapping Method of Logical Nodes in FPGA |
CN108370251A (en) * | 2016-01-13 | 2018-08-03 | 阿尔特拉公司 | Power gating lut circuits |
CN105761746B (en) * | 2016-02-04 | 2018-09-11 | 北京时代民芯科技有限公司 | A kind of single-particle reinforces the write timing match circuit of FPGA distributions RAM |
CN105761746A (en) * | 2016-02-04 | 2016-07-13 | 北京时代民芯科技有限公司 | Read-in time sequence matching circuit of single-particle reinforced FPGA distributed RAM |
CN107346149A (en) * | 2016-05-04 | 2017-11-14 | 杭州海存信息技术有限公司 | Processor based on back side look-up table |
CN106357265A (en) * | 2016-09-19 | 2017-01-25 | 中国电子科技集团公司第五十八研究所 | Small-area high-speed six-input searching table structure |
CN108346443B (en) * | 2018-02-09 | 2020-11-24 | 京微齐力(北京)科技有限公司 | Circuit for realizing any 4-input logic function through parallel control |
CN108346443A (en) * | 2018-02-09 | 2018-07-31 | 京微齐力(北京)科技有限公司 | The circuit of arbitrary 4 input logic function is realized in a kind of parallel control |
CN111600597A (en) * | 2020-06-19 | 2020-08-28 | 成都华微电子科技有限公司 | Ultra-low power consumption lookup table circuit |
CN111934670A (en) * | 2020-08-17 | 2020-11-13 | 电子科技大学 | FPGA (field programmable Gate array) framework of quasi-N lookup table |
CN112234959A (en) * | 2020-10-09 | 2021-01-15 | 成都华微电子科技有限公司 | FPGA high-performance interconnection circuit |
CN112733474A (en) * | 2020-12-15 | 2021-04-30 | 西安国微半导体有限公司 | Netlist-level circuit area optimization method based on AND gate inverter diagram and storage medium |
CN112733474B (en) * | 2020-12-15 | 2023-12-22 | 西安国微半导体有限公司 | Netlist-level circuit area optimization method based on AND gate inverter diagram and storage medium |
CN113971159A (en) * | 2021-10-28 | 2022-01-25 | 山东芯慧微电子科技有限公司 | Programmable logic block based on improved lookup table structure |
CN113971159B (en) * | 2021-10-28 | 2024-02-20 | 山东芯慧微电子科技有限公司 | Programmable logic block based on improved lookup table structure |
CN117634383A (en) * | 2023-12-26 | 2024-03-01 | 苏州异格技术有限公司 | Critical path delay optimization method, device, computer equipment and storage medium |
CN117634383B (en) * | 2023-12-26 | 2024-06-07 | 苏州异格技术有限公司 | Critical path delay optimization method, device, computer equipment and storage medium |
Also Published As
Publication number | Publication date |
---|---|
CN103580678B (en) | 2016-08-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103580678B (en) | A kind of high-performance lut circuits based on FGPA | |
JP5932167B2 (en) | Hybrid ternary associative memory | |
KR100880867B1 (en) | Circuit for generating data bit inversion flag (DVI) | |
KR101651886B1 (en) | Sense amplifier including a level shifter | |
CN111600597A (en) | Ultra-low power consumption lookup table circuit | |
CN108347241B (en) | Structure of low-power-consumption multiplexer | |
CN111817710B (en) | Memristor-based hybrid logic exclusive nor circuit and exclusive nor calculation array | |
CN102386908B (en) | Heat insulation domino circuit and heat insulation domino ternary AND gate circuit | |
CN112712836B (en) | Write operation circuit, semiconductor memory, and write operation method | |
CN111221502B (en) | Generalized assembly line cell circuit of quantum cellular automaton | |
CN103631754B (en) | Programmable signal processing unit | |
CN106341104B (en) | Inversion clock generation circuit and register | |
CN102568581B (en) | A kind of laddering code translator being applicable to programmable storage | |
CN106505995B (en) | A Single-Rail Current-Mode One-Bit Full Adder Based on FinFET Devices | |
CN112564899B (en) | Double-track MTJ (magnetic tunnel junction) and CMOS (complementary metal oxide semiconductor) mixed lookup table circuit | |
CN112350715B (en) | Circuit structure of dynamic programmable arbiter for PUF chip | |
JP2006042308A (en) | Two-bit binary comparator and binary comparison device | |
CN105610427B (en) | A kind of programmable logic cells based on and-or inverter structure | |
JP6306846B2 (en) | Reconfigurable logical device | |
CN112712842B (en) | Read operation circuit, semiconductor memory, and read operation method | |
TWI799076B (en) | compound logic gate circuit | |
CN202617076U (en) | Early termination asynchronous comparator | |
CN103516635A (en) | Pre-driver and differential signal transmitter thereof | |
JP3923672B2 (en) | Computing unit | |
JP3209399B2 (en) | Gate array integrated circuit |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant |