0
Your cart

Your cart is empty

Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design

Buy Now

Tree-based Heterogeneous FPGA Architectures - Application Specific Exploration and Optimization (Paperback, 2012 ed.) Loot Price: R2,653
Discovery Miles 26 530
Tree-based Heterogeneous FPGA Architectures - Application Specific Exploration and Optimization (Paperback, 2012 ed.): Umer...

Tree-based Heterogeneous FPGA Architectures - Application Specific Exploration and Optimization (Paperback, 2012 ed.)

Umer Farooq, Zied Marrakchi, Habib Mehrez

 (sign in to rate)
Loot Price R2,653 Discovery Miles 26 530 | Repayment Terms: R249 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 working days

This book presents a new FPGA architecture known as tree-based FPGA architecture, due to its hierarchical nature. This type of architecture has been relatively unexplored despite their better performance and predictable routing behavior, as compared to mesh-based FPGA architectures. In this book, we explore and optimize the tree-based architecture and we evaluate it by comparing it to equivalent mesh-based FPGA architectures.

General

Imprint: Springer-Verlag New York
Country of origin: United States
Release date: June 2014
First published: 2012
Authors: Umer Farooq • Zied Marrakchi • Habib Mehrez
Dimensions: 235 x 155 x 11mm (L x W x T)
Format: Paperback
Pages: 188
Edition: 2012 ed.
ISBN-13: 978-1-4899-9612-1
Categories: Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > Circuits & components
Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > General
Promotions
LSN: 1-4899-9612-5
Barcode: 9781489996121

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners