DocumentCode
1724169
Title
Mapping multiplexers onto hard multipliers in FPGAs
Author
Jamieson, Peter ; Rose, Jonathan
Author_Institution
Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada
fYear
2005
Firstpage
323
Lastpage
326
Abstract
Modern FPGAs now contain a selection of "hard" digital structures such as memory blocks and multipliers (Altera, 2003, Xilinx, 2003, QuickLogic, 2003, Actel, Lattice, 2004) in addition to the usual "soft" programmable logic typically consisting of lookup tables (LUTs) and flip-flops. These hard structures are a major benefit (in area and speed) for those applications that need them, but are completely wasted if an application circuit docs not require them. Finding other ways to use these structures will benefit these applications. In this paper, the authors presented a technique to map multiplexers to unused hard multipliers on an FPGA. An RTL synthesis tool flow that implements this technique over a set of benchmarks was created. While some circuits see no reduction in LUT count at all, others show meaningful improvements ranging from 10% to 70%. On average across the whole set of circuits the technique achieves a 7.3% reduction on the number of LUTs used. In some cases, however, the operating frequency of the circuit is reduced significantly.
Keywords
field programmable gate arrays; flip-flops; logic design; multiplying circuits; field programmable gate arrays; flip-flop; hard digital structures; hard multipliers; lookup tables; memory blocks; multiplexer mapping; programmable logic; Circuits; Costs; Field programmable gate arrays; Flip-flops; Logic functions; Multiplexing; Programmable logic arrays; Programmable logic devices; Strontium; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
IEEE-NEWCAS Conference, 2005. The 3rd International
Print_ISBN
0-7803-8934-4
Type
conf
DOI
10.1109/NEWCAS.2005.1496692
Filename
1496692
Link To Document