Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems | 
| Authors: Jean-pierre Deschamps, Gery J.a. Bioul, Gustavo D. Sutter
Publisher: Wiley-Interscience
Category: Book
List Price: $132.50
Buy New: $83.52
You Save: $48.98 (37%)
New (19) Used (9) from $59.95
Avg. Customer Rating:  5 reviews
Sales Rank: 291594
Media: Hardcover
Number Of Items: 1
Pages: 576
Shipping Weight (lbs): 2
Dimensions (in): 9.3 x 6.2 x 1.3
ISBN: 0471687839
Dewey Decimal Number: 621.395
EAN: 9780471687832
ASIN: 0471687839
Publication Date: March 10, 2006
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Condition: New Book, Hardcover. Same Edition As Amazon's Description! Never Been Read! Buy Now!
|
| Also Available In:
|
| Similar Items:
|
| Editorial Reviews:
Product Description
A new approach to the study of arithmetic circuits
In Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems, the authors take a novel approach of presenting methods and examples for the synthesis of arithmetic circuits that better reflects the needs of today's computer system designers and engineers. Unlike other publications that limit discussion to arithmetic units for general-purpose computers, this text features a practical focus on embedded systems.
Following an introductory chapter, the publication is divided into two parts. The first part, Mathematical Aspects and Algorithms, includes mathematical background, number representation, addition and subtraction, multiplication, division, other arithmetic operations, and operations in finite fields. The second part, Synthesis of Arithmetic Circuits, includes hardware platforms, general principles of synthesis, adders and subtractors, multipliers, dividers, and other arithmetic primitives. In addition, the publication distinguishes itself with:
* A separate treatment of algorithms and circuits-a more useful presentation for both software and hardware implementations
* Complete executable and synthesizable VHDL models available on the book's companion Web site, allowing readers to generate synthesizable descriptions
* Proposed FPGA implementation examples, namely synthesizable low-level VHDL models for the Spartan II and Virtex families
* Two chapters dedicated to finite field operations
This publication is a must-have resource for students in computer science and embedded system designers, engineers, and researchers in the field of hardware and software computer system design and development.
An Instructor Support FTP site is available from the Wiley editorial department.
Download Description
A new approach to the study of arithmetic circuits In Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems, the authors take a novel approach of presenting methods and examples for the synthesis of arithmetic circuits that better reflects the needs of today's computer system designers and engineers. Unlike other publications that limit discussion to arithmetic units for general-purpose computers, this text features a practical focus on embedded systems. Following an introductory chapter, the publication is divided into two parts. The first part, Mathematical Aspects and Algorithms, includes mathematical background, number representation, addition and subtraction, multiplication, division, other arithmetic operations, and operations in finite fields. The second part, Synthesis of Arithmetic Circuits, includes hardware platforms, general principles of synthesis, adders and subtractors, multipliers, dividers, and other arithmetic primitives. In addition, the publication distinguishes itself with: A separate treatment of algorithms and circuits-a more useful presentation for both software and hardware implementations Complete executable and synthesizable VHDL models available on the book's companion Web site, allowing readers to generate synthesizable descriptions Proposed FPGA implementation examples, namely synthesizable low-level VHDL models for the Spartan II and Virtex families Two chapters dedicated to finite field operations This publication is a must-have resource for students in computer science and embedded system designers, engineers, and researchers in the field of hardware and software computer system design and development.
|
| Customer Reviews:
Beyond multiplication and MAC November 13, 2007
That's an exciting and useful book in all synthesis manner: almost no gate-level circuits inside, as in modern EDA tools it don't need to.
A lot of algorithms (eg. log, sin, sqr...) which is beyond fast adders or one-cycle multipliers that can be easily found in many DSP hardware books. In fact, we make and sells a DSP state-machine chips in almost a million pcs that certain arithmetic circuit blocks is inspired by the book.
 Meets many needs August 9, 2007
3 out of 4 found this review helpful
There's a lot to like here. It goes over all the low-level stuff you could hope for, including creative number system, carry-lookahead, Booth encodings, and SRT division. It addresses some of the needs of crypto people, with discussion of finite-field arithmetic. It even gives enough intro to residue number systems for the desperate developer to gain a toehold - 10,000 digit addition or subtraction can be done in a few-digit time, as long as the expense of getting into and out of RNS are amortized.
That's all good for someone who can't trust their synthesis tools for good carry chains, or for someone headed way into the weirdness. The ranges where I live get distressingly little attention. If you need a dot product of two vectors, this will do a great job on the multiply and add steps as long as you can work out all the pipelining implications for yourself, but those were never the problem - it's the parallelism (how many multiplies can you run? how deep is your adder tree? or do you have something better?). It's the memory bottleneck (what do you mean you read "a word" from memory? I want 100). It's the numbers that number-crunchers use, i.e. IEEE 754, which get a moment of mention at the beginning and at the end. Those start turning strange with NaNs, signed zeroes, and denorms, then go totally off the rails when things like Intel (not always IEEE) compliance arise from the deep.
This could be a good text for a mid-level practitioner or student, fluent with logic design but blissfully ignorant of numerical analysis. If that's your trajectory, you'll spend some amount of time where this book lives. Then you'll advance, and it will no longer serve you. That's not a criticism, since every level has its own needs, but the prospective buyer should weigh needs to be met against needs that this meets. Not all readers will find a match.
-- wiredweird
Innovative June 7, 2006
2 out of 2 found this review helpful
In the part dedicated to general algorithms, very interesting new presentations or generalizations, made this work attractive at the theoretical point of view. Extensions of booth algorithms and generalizations to base B operation make the work innovative at the mathematical point of view. At the implementation level there is very good and innovative ideas towards special applications in FPGA (mainly Xilinx oriented). It would have been desirable to cope with some other technology, but the book may be considered self containing anyway.
Innovative June 7, 2006
2 out of 2 found this review helpful
The presentation of arithmetic theory and applications is innovative. Some of the topics are inedited; they present new approaches for both algorithmic and implementation aspects. It is a very interesting reference book for what refer to computer arithmetic in general and special purpose arithmetic circuit in particular.
Original June 7, 2006
1 out of 2 found this review helpful
This book is quite original in its presentation. The selection of implementations is of interest.
The theoretical foundations are sound and presented in a well organized way.
The applications cope with the actual technology: especially in what concerns programmable devices.
It is a good book for advanced students and a must have tool for the professional designer.
|
|
|
