Conference Paper

Computational field programmable architecture

Dept. of Electr. & Comput. Eng., Toronto Univ., Ont.
DOI: 10.1109/CICC.1998.694976 Conference: Custom Integrated Circuits Conference, 1998. Proceedings of the IEEE 1998
Source: IEEE Xplore

ABSTRACT This paper introduces a new field-programmable architecture that
is targeted at compute-intensive applications. These applications are
important because of their use in the expanding multi-media markets in
signal and data processing. We explain the design methodology, layout
and implementation of the new architecture. A synthesis method has also
been developed with which we have mapped several circuits to the new
architecture. In this paper, we show that the invented architecture is
more area-efficient than traditional FPGAs by a factor of more than 2.5
times

0 Bookmarks
 · 
59 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Resumo Este trabalho apresenta uma nova arquitetura de FPGA (BiFi-FPGA) com o objetivo de atender as funções de processamento digital de sinais e teste dos sistemas em silício. Além das vantagens de reconfigurabilidade de um FPGA, a arquitetura proposta tem a possibilidade de reuso de hardware para teste enquanto mantém o nível de desempenho requerido pelas aplicações correntes. Este artigo apresenta o modelo do FPGA proposto juntamente com resultados experimentais preliminares que mostram claramente as vantagens desta técnica de otimização.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The selective use of carry-save arithmetic, where appropriate, can accelerate a variety of arithmetic-dominated circuits. Carry-save arithmetic occurs naturally in a variety of DSP applications, and further opportunities to exploit it can be exposed through systematic data flow transformations that can be applied by a hardware compiler. Field-programmable gate arrays (FPGAs), however, are not particularly well suited to carry-save arithmetic. To address this concern, we introduce the ??field programmable counter array?? (FPCA), an accelerator for carry-save arithmetic intended for integration into an FPGA as an alternative to DSP blocks. In addition to multiplication and multiply accumulation, the FPCA can accelerate more general carry-save operations, such as multi-input addition (e.g., add k > 2 integers) and multipliers that have been fused with other adders. Our experiments show that the FPCA accelerates a wider variety of applications than DSP blocks and improves performance, area utilization, and energy consumption compared with soft FPGA logic.
    IEEE Transactions on Very Large Scale Integration (VLSI) Systems 05/2010; DOI:10.1109/TVLSI.2009.2014380 · 1.14 Impact Factor
  • Source