Details

Advanced FPGA Design


Advanced FPGA Design

Architecture, Implementation, and Optimization
IEEE Press 1. Aufl.

von: Steve Kilts

124,99 €

Verlag: Wiley
Format: PDF
Veröffentl.: 18.06.2007
ISBN/EAN: 9780470127889
Sprache: englisch
Anzahl Seiten: 352

DRM-geschütztes eBook, Sie benötigen z.B. Adobe Digital Editions und eine Adobe ID zum Lesen.

Beschreibungen

This book provides the advanced issues of FPGA design as the underlying theme of the work. In practice, an engineer typically needs to be mentored for several years before these principles are appropriately utilized. The topics that will be discussed in this book are essential to designing FPGA's beyond moderate complexity. The goal of the book is to present practical design techniques that are otherwise only available through mentorship and real-world experience.
<p>Preface xiii</p> <p>Acknowledgments xv</p> <p><b>1. Architecting Speed 1</b></p> <p>1.1 High Throughput 2</p> <p>1.2 Low Latency 4</p> <p>1.3 Timing 6</p> <p>1.3.1 Add Register Layers 6</p> <p>1.3.2 Parallel Structures 8</p> <p>1.3.3 Flatten Logic Structures 10</p> <p>1.3.4 Register Balancing 12</p> <p>1.3.5 Reorder Paths 14</p> <p>1.4 Summary of Key Points 16</p> <p><b>2. Architecting Area 17</b></p> <p>2.1 Rolling Up the Pipeline 18</p> <p>2.2 Control-Based Logic Reuse 20</p> <p>2.3 Resource Sharing 23</p> <p>2.4 Impact of Reset on Area 25</p> <p>2.4.1 Resources Without Reset 25</p> <p>2.4.2 Resources Without Set 26</p> <p>2.4.3 Resources Without Asynchronous Reset 27</p> <p>2.4.4 Resetting RAM 29</p> <p>2.4.5 Utilizing Set/Reset Flip-Flop Pins 31</p> <p>2.5 Summary of Key Points 34</p> <p><b>3. Architecting Power 37</b></p> <p>3.1 Clock Control 38</p> <p>3.1.1 Clock Skew 39</p> <p>3.1.2 Managing Skew 40</p> <p>3.2 Input Control 42</p> <p>3.3 Reducing the Voltage Supply 44</p> <p>3.4 Dual-Edge Triggered Flip-Flops 44</p> <p>3.5 Modifying Terminations 45</p> <p>3.6 Summary of Key Points 46</p> <p><b>4. Example Design: The Advanced Encryption Standard 47</b></p> <p>4.1 AES Architectures 47</p> <p>4.1.1 One Stage for Sub-bytes 51</p> <p>4.1.2 Zero Stages for Shift Rows 51</p> <p>4.1.3 Two Pipeline Stages for Mix-Column 52</p> <p>4.1.4 One Stage for Add Round Key 52</p> <p>4.1.5 Compact Architecture 53</p> <p>4.1.6 Partially Pipelined Architecture 57</p> <p>4.1.7 Fully Pipelined Architecture 60</p> <p>4.2 Performance Versus Area 66</p> <p>4.3 Other Optimizations 67</p> <p><b>5. High-Level Design 69</b></p> <p>5.1 Abstract Design Techniques 69</p> <p>5.2 Graphical State Machines 70</p> <p>5.3 DSP Design 75</p> <p>5.4 Software/Hardware Codesign 80</p> <p>5.5 Summary of Key Points 81</p> <p><b>6. Clock Domains 83</b></p> <p>6.1 Crossing Clock Domains 84</p> <p>6.1.1 Metastability 86</p> <p>6.1.2 Solution 1: Phase Control 88</p> <p>6.1.3 Solution 2: Double Flopping 89</p> <p>6.1.4 Solution 3: FIFO Structure 92</p> <p>6.1.5 Partitioning Synchronizer Blocks 97</p> <p>6.2 Gated Clocks in ASIC Prototypes 97</p> <p>6.2.1 Clocks Module 98</p> <p>6.2.2 Gating Removal 99</p> <p>6.3 Summary of Key Points 100</p> <p><b>7. Example Design: I2S Versus SPDIF 101</b></p> <p>7.1 I2S 101</p> <p>7.1.1 Protocol 102</p> <p>7.1.2 Hardware Architecture 102</p> <p>7.1.3 Analysis 105</p> <p>7.2 SPDIF 107</p> <p>7.2.1 Protocol 107</p> <p>7.2.2 Hardware Architecture 108</p> <p>7.2.3 Analysis 114</p> <p><b>8. Implementing Math Functions 117</b></p> <p>8.1 Hardware Division 117</p> <p>8.1.1 Multiply and Shift 118</p> <p>8.1.2 Iterative Division 119</p> <p>8.1.3 The Goldschmidt Method 120</p> <p>8.2 Taylor and Maclaurin Series Expansion 122</p> <p>8.3 The CORDIC Algorithm 124</p> <p>8.4 Summary of Key Points 126</p> <p><b>9. Example Design: Floating-Point Unit 127</b></p> <p>9.1 Floating-Point Formats 127</p> <p>9.2 Pipelined Architecture 128</p> <p>9.2.1 Verilog Implementation 131</p> <p>9.2.2 Resources and Performance 137</p> <p><b>10. Reset Circuits 139</b></p> <p>10.1 Asynchronous Versus Synchronous 140</p> <p>10.1.1 Problems with Fully Asynchronous Resets 140</p> <p>10.1.2 Fully Synchronized Resets 142</p> <p>10.1.3 Asynchronous Assertion, Synchronous Deassertion 144</p> <p>10.2 Mixing Reset Types 145</p> <p>10.2.1 Nonresetable Flip-Flops 145</p> <p>10.2.2 Internally Generated Resets 146</p> <p>10.3 Multiple Clock Domains 148</p> <p>10.4 Summary of Key Points 149</p> <p><b>11. Advanced Simulation 151</b></p> <p>11.1 Testbench Architecture 152</p> <p>11.1.1 Testbench Components 152</p> <p>11.1.2 Testbench Flow 153</p> <p>11.1.2.1 Main Thread 153</p> <p>11.1.2.2 Clocks and Resets 154</p> <p>11.1.2.3 Test Cases 155</p> <p>11.2 System Stimulus 157</p> <p>11.2.1 MATLAB 157</p> <p>11.2.2 Bus-Functional Models 158</p> <p>11.3 Code Coverage 159</p> <p>11.4 Gate-Level Simulations 159</p> <p>11.5 Toggle Coverage 162</p> <p>11.6 Run-Time Traps 165</p> <p>11.6.1 Timescale 165</p> <p>11.6.2 Glitch Rejection 165</p> <p>11.6.3 Combinatorial Delay Modeling 166</p> <p>11.7 Summary of Key Points 169</p> <p><b>12. Coding for Synthesis 171</b></p> <p>12.1 Decision Trees 172</p> <p>12.1.1 Priority Versus Parallel 172</p> <p>12.1.2 Full Conditions 176</p> <p>12.1.3 Multiple Control Branches 179</p> <p>12.2 Traps 180</p> <p>12.2.1 Blocking Versus Nonblocking 180</p> <p>12.2.2 For-Loops 183</p> <p>12.2.3 Combinatorial Loops 185</p> <p>12.2.4 Inferred Latches 187</p> <p>12.3 Design Organization 188</p> <p>12.3.1 Partitioning 188</p> <p>12.3.1.1 Data Path Versus Control 188</p> <p>12.3.1.2 Clock and Reset Structures 189</p> <p>12.3.1.3 Multiple Instantiations 190</p> <p>12.3.2 Parameterization 191</p> <p>12.3.2.1 Definitions 191</p> <p>12.3.2.2 Parameters 192</p> <p>12.3.2.3 Parameters in Verilog-2001 194</p> <p>12.4 Summary of Key Points 195</p> <p><b>13. Example Design: The Secure Hash Algorithm 197</b></p> <p>13.1 SHA-1 Architecture 197</p> <p>13.2 Implementation Results 204</p> <p><b>14. Synthesis Optimization 205</b></p> <p>14.1 Speed Versus Area 206</p> <p>14.2 Resource Sharing 208</p> <p>14.3 Pipelining, Retiming, and Register Balancing 211</p> <p>14.3.1 The Effect of Reset on Register Balancing 213</p> <p>14.3.2 Resynchronization Registers 215</p> <p>14.4 FSM Compilation 216</p> <p>14.4.1 Removal of Unreachable States 219</p> <p>14.5 Black Boxes 220</p> <p>14.6 Physical Synthesis 223</p> <p>14.6.1 Forward Annotation Versus Back-Annotation 224</p> <p>14.6.2 Graph-Based Physical Synthesis 225</p> <p>14.7 Summary of Key Points 226</p> <p><b>15. Floorplanning 229</b></p> <p>15.1 Design Partitioning 229</p> <p>15.2 Critical-Path Floorplanning 232</p> <p>15.3 Floorplanning Dangers 233</p> <p>15.4 Optimal Floorplanning 234</p> <p>15.4.1 Data Path 234</p> <p>15.4.2 High Fan-Out 234</p> <p>15.4.3 Device Structure 235</p> <p>15.4.4 Reusability 238</p> <p>15.5 Reducing Power Dissipation 238</p> <p>15.6 Summary of Key Points 240</p> <p><b>16. Place and Route Optimization 241</b></p> <p>16.1 Optimal Constraints 241</p> <p>16.2 Relationship between Placement and Routing 244</p> <p>16.3 Logic Replication 246</p> <p>16.4 Optimization across Hierarchy 247</p> <p>16.5 I/O Registers 248</p> <p>16.6 Pack Factor 250</p> <p>16.7 Mapping Logic into RAM 251</p> <p>16.8 Register Ordering 251</p> <p>16.9 Placement Seed 252</p> <p>16.10 Guided Place and Route 254</p> <p>16.11 Summary of Key Points 254</p> <p><b>17. Example Design: Microprocessor 257</b></p> <p>17.1 SRC Architecture 257</p> <p>17.2 Synthesis Optimizations 259</p> <p>17.2.1 Speed Versus Area 260</p> <p>17.2.2 Pipelining 261</p> <p>17.2.3 Physical Synthesis 262</p> <p>17.3 Floorplan Optimizations 262</p> <p>17.3.1 Partitioned Floorplan 263</p> <p>17.3.2 Critical-Path Floorplan: Abstraction 1 264</p> <p>17.3.3 Critical-Path Floorplan: Abstraction 2 265</p> <p><b>18. Static Timing Analysis 269</b></p> <p>18.1 Standard Analysis 269</p> <p>18.2 Latches 273</p> <p>18.3 Asynchronous Circuits 276</p> <p>18.3.1 Combinatorial Feedback 277</p> <p>18.4 Summary of Key Points 278</p> <p><b>19. PCB Issues 279</b></p> <p>19.1 Power Supply 279</p> <p>19.1.1 Supply Requirements 279</p> <p>19.1.2 Regulation 283</p> <p>19.2 Decoupling Capacitors 283</p> <p>19.2.1 Concept 283</p> <p>19.2.2 Calculating Values 285</p> <p>19.2.3 Capacitor Placement 286</p> <p>19.3 Summary of Key Points 288</p> <p>Appendix A 289</p> <p>Appendix B 303</p> <p>Bibliography 319</p> <p>Index 321</p>
<b>"</b><i>Advanced FPGA Design</i> is an excellent and concise reference book that is suitable for engineers already familiar with the fundamentals of FPGA design. (<i>IEEE Signal Processing Magazine</i>, November 2008)
<b>Steve Kilts</b> is a cofounder and principal engineer at Spectrum Design Solutions, an engineering consulting firm based out of Minneapolis, Minnesota (www.spectrumdsi.com). Mr. Kilts and his team at Spectrum have successfully completed projects for clients ranging from Fortune 100 companies to small start-ups. His FPGA design experience is extensive and includes applications in audio, DSP, high-speed computing and bus architectures, IC testers, industrial automation and control, embedded microprocessors, PCI, medical system design, commercial aviation, and ASIC prototyping. Mr. Kilts has many years of experience making performance trade-offs for FPGA designs targeting high speed, area reduction, and low power. He holds a master of science degree in electrical engineering from the University of Minnesota.
<p><b>A practical FPGA reference that's like an on-call mentor for engineers and computer scientists</b></p> <p>Addressing advanced issues of FPGA (Field-Programmable Gate Array) design and implementation, <i>Advanced FPGA Design: Architecture, Implementation, and Optimization</i> accelerates the learning process for engineers and computer scientists. With an emphasis on real-world design and a logical, practical approach, it walks readers through specific challenges and significantly reduces the learning curve. Designed to enhance and supplement hands-on experience, this real-world reference includes:</p> <ul> <li> <p>Waveform diagrams and circuit diagrams illustrating each topic</p> </li> <li> <p>Examples that illustrate typical problems in Verilog</p> </li> <li> <p>Case studies that demonstrate real-world applications</p> </li> <li> <p>Chapter-end summaries that reiterate key points</p> </li> </ul> <p>Ideal for engineers and computer scientists who want to take their FPGA skills to the next level and for use as a hands-on reference, this is also an excellent textbook for senior or graduate-level students in electrical engineering or computer science.</p>

Diese Produkte könnten Sie auch interessieren:

Bandwidth Efficient Coding
Bandwidth Efficient Coding
von: John B. Anderson
EPUB ebook
114,99 €
Digital Communications with Emphasis on Data Modems
Digital Communications with Emphasis on Data Modems
von: Richard W. Middlestead
PDF ebook
171,99 €
Bandwidth Efficient Coding
Bandwidth Efficient Coding
von: John B. Anderson
PDF ebook
114,99 €