Abstract

The FPGA (Field-Programmable Gate Array) has recently become the popular hardware and so-called LUTs (Look up Tables) are the basic of the FPGAs logic. For example, n-LUT is the MOS pass transistors multiplexer 2n-1 which input data receive SRAM cells logic function configuration (user’s projects Truth Table). Address inputs of the LUT are the variables. Therefore, we get one n-arguments logic function for the actual FPGA configuration. To get m functions (even with the same n-arguments) we should take m LUT. Authors propose a novel Decoder n-LUT (n-DC LUT), which makes possible to get m functions with the same n-arguments, like in Program Logic Array (PLA) CPLD (Complex Programmable Logic Device). DC LUT activates one of the 2n product terms outputs. Combined with OR product terms we can get m functions with the same n-arguments. To do this option we can use, for example, FPGAs typical connections units. The restriction of Meade-Conway for the FPGAs allows n=3 in one tree. Two 3-LUTs with one 1-LUTs form 4-LUT. Modern Adaptive Logic Modules (ALM) have n=8, but not all possible functions are implemented. The article deals with the design and investigation of some variants 3-DC LUT: with pull up output resistors, with orthogonal output circuits, with orthogonal transistors for each pass transistor. Simulation confirms the feasibility of the proposed method and shows that DC LUT with orthogonal output circuits is better variant of the systems realization in terms of current consumption and time delay at large n. A further development of the ALM concept may be the introduction of adaptive DC LUT, which, by tuning, can calculate single LUT function or 2n decoder functions. The proposed elements allow to increase the functionality of the FPGAs.

Highlights

  • The article deals with the design and investigation of some variants 3-DC LOOK UP TABLE (LUT): with pull up output resistors, with orthogonal output circuits, with orthogonal transistors for each pass transistor

  • Simulation confirms the feasibility of the proposed method and shows that Decoder - Look up Tables (DC LUT) with orthogonal output circuits is better variant of the systems realization in terms of current consumption and time delay at large n

  • LOOK UP TABLE (LUT) is a simplest, elementary FPGAs Logic Unit [1]. This logic realization started from MUX and single output ROM universal logic modules direction, using Canonical Disjunctive Normal Form (CDNF) or Minterm Canonical Form (MCF)

Read more

Summary

MOTIVATION

LOOK UP TABLE (LUT) is a simplest, elementary FPGAs Logic Unit [1]. This logic realization started from MUX (multiplexor) and single output ROM (read only memory) universal logic modules direction, using Canonical Disjunctive Normal Form (CDNF) or Minterm Canonical Form (MCF). All n-LUTs produce only single logic function of n arguments in the canonical disjunctive normal form (CDNF) or minterm canonical form (MCF). ANALYSIS OF LUT / DC LUT COMPLEXITY IN TRANSISTORS The n-LUT’s complexity in amount of the transistors (taking into account SRAM cells for the functions configuration, not showed in Fig.1–3) is expression (10): Ln−LUT = (2n+1 − 2) + 8 2n + 4n + 2,. In Comparative curves of m function realization according to (19),(20),(21) in Mathcad shows Fig.11 It easy to see, that Ldco is better, than Ldcbcn (and L1, ). We get layout simulation in Microwind CAD [17] using accessible transistors model [18]

DC LUT LAYOUT SIMULATION
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call