| Improving synthesis of compressor trees on FPGAs via integer linear programming |
| Full text |
Pdf
(294 KB)
|
| Source
|
Design, Automation, and Test in Europe
archive
Proceedings of the conference on Design, automation and test in Europe
table of contents
Munich, Germany
SESSION: Arithmetic and logic processing
table of contents
Pages 1256-1261
Year of Publication: 2008
ISBN:978-3-9810801-3-1
|
|
Authors
|
|
Hadi Parandeh-Afshar
|
University of Tehran, Tehran, Iran and Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
|
|
Philip Brisk
|
Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
|
|
Paolo Ienne
|
Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 32, Citation Count: 2
|
|
|
ABSTRACT
Multi-input addition is an important operation for many DSP and video processing applications. On FPGAs, multi-input addition has traditionally been implemented using trees of carry-propagate adders. This approach has been used because the traditional lookup table (LUT) structure of FPGAs is not amenable to compressor trees, which are used to implement multi-input addition and parallel multiplication in ASIC technology. In prior work, we developed a greedy heuristic method to map compressor trees onto the general logic of an FPGA using a component called generalized parallel counter (GPC). Although this technique reduced the combinational delay of our circuits, when synthesized onto Altera Stratix-II FPGAs, by 27% on average; however, the area was increased by an average 11%. To further reduce the delay and limit the increase in area, we have developed a new solution to the mapping problem based on integer linear programming. This new approach reduced the delay of the compressor tree by 32% on average and reduced the area by 3% compared to an adder tree.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
S. Sriram, K. Brown, R. Defosseux, F. Moerman, O. Paviot, V. Sundararajan, and A. Gatherer, "A 64 channel programmable receiver chip for 3G wireless infrastructure," IEEE Custom Integrated Circuits Conf., San Jose, CA, USA, pp. 59--62, Sept. 18--21, 2005.
|
| |
3
|
C. Y. Chen, S-Y. Chien, Y-W. Huang, T-C. Chen, T-C. Wang, and L-G. Chen, "Analysis and architecture design of variable block-size motion estimation for H.264/AVC," IEEE Trans. Circuits and Systems-I, Vol. 53, No. 2, pp. 578--593, Feb., 2006.
|
| |
4
|
L. Dadda, "Some schemes for parallel multipliers," Alta Frequenza, Vol. 34, pp. 349--356, May, 1965.
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
 |
9
|
|
| |
10
|
|
| |
11
|
C. S. Wallace, "A suggestion for a fast multiplier," IEEE Trans. Electronic Computers, Vol. 13, pp. 14--17, Feb., 1964.
|
| |
12
|
|
| |
13
|
|
| |
14
|
Altera, Corp. "The Stratix II device handbook, vol. 1 and 2," available online from http://www.altera.com/.
|
| |
15
|
Xilinx Corp. "Virtex-4 user guide," available online from http://www.xilinx.com.
|
| |
16
|
Altera, Corp. "Stratix II vs. Virtex-4 performance comparison," available online from http://www.altera.com/.
|
CITED BY 2
|
|
Seyed Hosein Attarzadeh Niaki , Alessandro Cevrero , Philip Brisk , Chrysostomos Nicopoulos , Frank K. Gurkaynak , Yusuf Leblebici , Paolo Ienne, Design space exploration for field programmable compressor trees, Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems, October 19-24, 2008, Atlanta, GA, USA
|
|
|
Alessandro Cevrero , Panagiotis Athanasopoulos , Hadi Parandeh-Afshar , Ajay K. Verma , Hosein Seyed Attarzadeh Niaki , Chrysostomos Nicopoulos , Frank K. Gurkaynak , Philip Brisk , Yusuf Leblebici , Paolo Ienne, Field Programmable Compressor Trees: Acceleration of Multi-Input Addition on FPGAs, ACM Transactions on Reconfigurable Technology and Systems (TRETS), v.2 n.2, p.1-36, June 2009
|
|