Guest Editorial: Field-Programmable Technology

Lesley Shannon, Oliver Diessel, Neil W. Bergmann
<span title="2011-12-30">2011</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="" style="color: black;">Journal of Signal Processing Systems</a> </i> &nbsp;
Field-Programmable Technology (FPT) describes those electronic systems where the hardware as well as the software can be programmed on an application by application basis. Field Programmable Gate Arrays (FPGAs) represent the most common form of FPT, widely used in applications such as signal and image processing, telecommunications and computer networking. FPT continues to intrigue researchers; current research ranges from transistor-level programmable logic, through to high performance
more &raquo; ... ions, and encompasses the design methodologies and design tools needed for such systems. In "Reconfigurable Blocks Based on Balanced Ternary," Paul Beckett and Tayab Memon describe a new programmable logic block which takes advantage of some of the unique characteristics of Silicon-on-Insulator in order to deliver balanced ternary (−1,0,+1) logic functions and memory cells. In "Using Data Contention in Dual-ported Memories for Security Applications", Tim Güneysu investigates the problem of how to protect design IP in a technology where hardware programs are difficult to secure. His paper explores device-specific behaviour during write collisions in dual-port FPGA memories to support IP protection. For embedded systems that use floating point arithmetic, the choice has been fast hardware or slow software implementations. In "Improving Floating-Point Performance in Less Area: Fractured Floating Point Units (FFPUs)," Neil Hockert and Katherine Compton look at partial hardware support for floating point, which gives better performance than software floating point, and lower area than a full hardware unit. As logic circuits get larger, the time for physical design at logic level discourages broad exploration of high-level architectural design alternatives. In "Rapid Synthesis and Simulation of Computational Ciruits in an MPPA," David Grant, Graeme Smecher, Guy Lemieux and Rosemary Francis present a tool flow (RVETool) for rapidly compiling computational circuits into a Massively Parallel Processor Array. In "Automated Mapping of the MapReduce Pattern onto Parallel Computing Platforms," Qiang Lie, Tim Todman, Wayne Luk and George Constantinides explore using FPGAs effectively for large computational problems. Having identified that many applications use a "MapReduce" computational pattern, they develop a
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1007/s11265-011-0653-3</a> <a target="_blank" rel="external noopener" href="">fatcat:7vextmaqsfcuhjiwtais3nk35e</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>