Browse > Article

A Study on the Exclusive-OR-based Technology Mapping Method in FPGA  

Ko, Seok-Bum (Department of Electrical Engineering, University of Saskatchewan, Canada)
Abstract
In this paper, we propose an AND/XOR-based technology mapping method for field programmable gate arrays (FPGAs). Due to the fixed size of the programmable blocks in an FPGA, decomposing a circuit into sub-circuits with appropriate number of inputs can achieve excellent implementation efficiency. Specifically, the proposed technology mapping method is based on Davio expansion theorem to decompose a given Boolean circuit. The AND/XOR nature of the proposed method allows it to operate on XOR intensive circuits, such as error detecting/correcting, data encryption/decryption, and arithmetic circuits, efficiently. We conduct experiments using MCNC benchmark circuits. When using the proposed approach, the number of CLBs (configurable logic blocks) is reduced by 67.6% (compared to speed-optimized results) and 57.7% (compared to area-optimized results), total equivalent gate counts are reduced by 65.5 %, maximum combinational path delay is reduced by 56.7 %, and maximum net delay is reduced by 80.5 % compared to conventional methods.
Keywords
Parity Prediction Functions; Davio Expansion; AND/XOR Expressions; FPGA; Logic Synthesis; Technology Mapping;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Abramovici, C. Stroud, S. Wijesuriya, C. Hamilton, and V. Verma, 'Using Roving STARs for On-Line and Diagnosis of FPGAs in Fault-Tolerant Applications,' Proc. lTC, pp. 973-982, Oct. 1999
2 Xilinx Inc., http://www.xilinx.com
3 J. Cong and Y. -Yo Hwang, 'Boolean Matching for Complex PLBs in LUT-based FPGAs with Application to Architecture Evaluation,' Proc. ACM 6th Int'l Symposium on FPGA, pp. 27-34, Feb. 1998
4 M. Helliwell, and M. Perkowski, 'A Fast Algorithm to Minimize Multi-Output Mixed-Polarity Generalized Reed-Muller Forms,' Proc. ACM/IEEE Design Automation Conf., pp. 427-432, 1988
5 F. Hanchek and S. Dutt, 'Methodologies for Tolerating Logic and Interconnect Faults in FPGAs,' IEEE Trans. on Computers, Vol. 47, No. 1, pp. 15-33, Jan. 1998   DOI   ScienceOn
6 J. Cong and Y. Ding, 'Combinational Logic Synthesis for LUT Based Field Programmable Gate Arrays,' ACM Transactions on Design Automation of Electronic Systems, Vol. 1, No. 2, pp. 145-204, April 1996   DOI
7 J. C. Lo, M. Kitakami and E. Fujiwara, 'Reliable Logic Citcuits using Byte Error Control Codes,' Proc. Int'l Symposium on Defect and Fault Tolerance in VLSI Systems, pp. 286-294, October 1996
8 W. K. Huang, F. J. Meyer, X. Chen, and F. Lombardi, 'Testing Configurable LUT-Based FPGAs,' IEEE Trans. on VLSI Systems, Vol. 47, No.6, pp. 276-283, June 1998
9 S. B. Ko, T. Xia and J. C. Lo, 'Efficient Error Prediction in FPGA,' IEEE Int'l Symposium on Defect and Fault Tolerance in VLSI systems, pp. 176-181, Oct. 2001
10 N. A. Touba, and E. J. McCluskey, 'Logic Synthesis of Multilevel Citcuits with Concurrent Error Detection,' IEEE Transactions on Computer-Aided Design, Vol.16, No.7, pp. 783-789, Jul. 1997   DOI   ScienceOn
11 C. Bolchini, F. Salice and D. Sciuto, 'A Novel methodology for Designing TSC Networks based on the Parity Bit Code,' Proc. European Design & Test Conf., pp. 440-444, March 1997
12 T. Sasao and P. Besslich, 'On the complexity of MOD-2 Sum PLAs,' IEEE Transactions on Computers, Vol. 32, No.2, pp. 262-266, Feb. 1990
13 S. B. Ko and J. C. Lo, 'Efficient Decomposition Techniques for FPGAs,' Lecture Notes in Computer Science (IEEE International Conference on High Performance Computing), Vol. 552, pp. 630-639, December 2002, Springer-Verlag
14 S. Even, I. Kohavi and A. Paz, 'On minimal modulo-2 sums of products for switching functions,' IEEE Transactions on Electronic Computers, EC-16:671-674, Oct. 1967   DOI   ScienceOn
15 R. Cuddapah and M. Corba, Reconfigurable Logic for Fault Tolerance, Springer-Verlag, 1995
16 Xinlinx Inc., Xilinx Data Book: XC4000E and XC4000X Series, May 1999
17 T. Sasao, 'Logic Synthesis and Optimization,' Kluwer Academic Publishers 1998