|
|||||||||||||||||||||||||||||||||||
|
2 Reviews
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
Most Helpful First | Newest First
|
|
1 of 1 people found the following review helpful:
5.0 out of 5 stars
Incredible resource,
By wiredweird "wiredweird" (Earth, or somewhere nearby) - See all my reviews (HALL OF FAME REVIEWER) (TOP 500 REVIEWER)
This review is from: Logic Synthesis for Field-Programmable Gate Arrays (The Springer International Series in Engineering and Computer Science) (Hardcover)
Gate array implementations differ from traditional logic design not just in scale, but in kind. A million- or billion-gate system is bigger than a student's 4-variable exercises in Karnaugh mapping, for sure. Logic implementation in terms of LUTs (as in Altera's and Xilinx's FPGAs) or muxes (as in Actel's) differs fundamentally from and-or-not logic, too. If you build tools that do LUT-level synthesis from behavioral specifications, you need this book.
This covers a wide range of advanced techniques needed for synthesis into current FPGAs. After a thorough introduction to FPGA basics, the authors start on logic optimization. The authors review traditional kinds of optimization, then move on to the different techniques that serve the different needs of designers with arbitrary N-input functions as their atoms. This includes not just optimizations for minimal area, but for minimal logic depth, too. Because of the intractability of the problems, the authors focus on heuristic algorithms. Quite a few are presented, often in terms of working tool implementations, and compared. Unlike other books that discuss only combinational synthesis, this includes a lengthy section on mapping sequential logic into specific technologies. This isn't a logic design text, it doesn't say anything about reducing a problem statement to gates and registers. Instead, it starts at that point and explores techniques for mapping clocked logic into the idiosyncracies of a specific logic fabric. Discussion uses Xilinx 3000-family CLBs for demonstration purposes. The analysis, however, can be applied to similar kind of cell with logic, latches, and internal return paths. The authors omit mention of carry chains and other irregularities, but give exhaustive coverage within the basic feature set. This is a text for the tool builder, not the logic designer. Despite the 1995 date of the edition reviewed here, the generality of the approaches keeps this relevant for even the newest offerings from Altera, Xilinx, and the rest. The authors say little about placement and routing, although they do address on-chip communication lines of various sorts. They omit the special needs of arithmetic synthesis, too, focussing instead on traditional kinds of combinational logic. These are editorial choices, though, not true weaknesses in this book. The modern tool builder will be aware of more recent and ongoing innovations in synthesis, especially when dealing with the varied, specialized resources on today's chips. But even the most advanced of today's synthesis experts need occasional review or reference, and tomorrow's experts have to start somewhere. If you participate in this specialized field, this book must be on your shelf. //wiredweird, reviewing the 1995 edition
1 of 2 people found the following review helpful:
4.0 out of 5 stars
Interrelated Information,
By Aman Rana (India) - See all my reviews
This review is from: Logic Synthesis for Field-Programmable Gate Arrays (The Springer International Series in Engineering and Computer Science) (Hardcover)
This book covers topics of Logic Synthesis in Interrelated manner,which gives u a feel of confidence for in depth knowledge of Logic Synthesis.
|
|
Most Helpful First | Newest First
|
|
Logic Synthesis for Field-Programmable Gate Arrays (The Springer International Series in Engineering and Computer Science) by Rajeev Murgai (Hardcover - July 31, 1995)
$167.00
In Stock | ||