Details

Reversible and DNA Computing


Reversible and DNA Computing


1. Aufl.

von: Hafiz M. H. Babu

119,99 €

Verlag: Wiley
Format: PDF
Veröffentl.: 12.08.2020
ISBN/EAN: 9781119679363
Sprache: englisch
Anzahl Seiten: 432

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

Beschreibungen

<p><b>Master the subjects of reversible computing and DNA computing with this expert volume</b></p> <p><i>Reversible and DNA Computing</i> offers readers new ideas and technologies in the rapidly developing field of reversible computing. World-renowned researcher and author Hafiz Md. Hasan Babu shows readers the fundamental concepts and ideas necessary to understand reversible computing, including reversible circuits, reversible fault tolerant circuits, and reversible DNA circuits.</p> <p><i>Reversible and DNA Computing</i> contains a practical approach to understanding energy-efficient DNA computing. In addition to explaining the foundations of reversible circuits, the book covers topics including:</p> <ul> <li>Advanced logic design</li> <li>An introduction to the fundamentals of reversible computing</li> <li>Advanced reversible logic synthesis</li> <li>Reversible fault tolerance</li> <li>Fundamentals of DNA computing</li> <li>Reversible DNA logic synthesis</li> <li>DNA logic design</li> </ul> <p>This book is perfect for undergraduate and graduate students in the physical sciences and engineering, as well as those working in the field of quantum computing. It belongs on the bookshelves of anyone with even a passing interest in nanotechnology, energy-efficient computing, and DNA computing.</p>
<p>List of Figures xvii</p> <p>List of Tables xxix</p> <p>About the Author xxxi</p> <p>Preface xxxiii</p> <p>Acknowledgments xxxv</p> <p>Acronyms xxxvii</p> <p>Introduction xxxix</p> <p><b>Part I Reversible Circuits </b><b>1</b></p> <p>An Overview About Reversible Circuits 1</p> <p><b>1 Reversible Logic Synthesis </b><b>5</b></p> <p>1.1 Reversible Logic 5</p> <p>1.2 Reversible Function 5</p> <p>1.3 Reversible Logic Gate 6</p> <p>1.4 Garbage Outputs 6</p> <p>1.5 Constant Inputs 7</p> <p>1.6 Quantum Cost 7</p> <p>1.7 Delay 8</p> <p>1.8 Power 8</p> <p>1.9 Area 8</p> <p>1.10 Hardware Complexity 9</p> <p>1.11 Quantum Gate Calculation Complexity 9</p> <p>1.12 Fan-Out 10</p> <p>1.13 Self-Reversible 10</p> <p>1.14 Reversible Computation 10</p> <p>1.15 Area 11</p> <p>1.16 Design Constraints for Reversible Logic Circuits 11</p> <p>1.17 Quantum Analysis of Different Reversible Logic Gates 12</p> <p>1.17.1 Reversible NOT Gate (Feynman Gate) 12</p> <p>1.17.2 Toffoli Gate 12</p> <p>1.17.3 Fredkin Gate 13</p> <p>1.17.4 Peres Gate 13</p> <p>1.18 Summary 13</p> <p><b>2 Reversible Adder and Subtractor Circuits </b><b>15</b></p> <p>2.1 Reversible Multi-Operand <i>n</i>-Digit Decimal Adder 15</p> <p>2.1.1 Full Adder 15</p> <p>2.1.2 Carry Skip Adder 19</p> <p>2.1.2.1 Design of Carry Skip Adder 20</p> <p>2.1.3 Carry Look-Ahead Adder 24</p> <p>2.2 Reversible BCD Adders 26</p> <p>2.2.1 Design Procedure of the Reversible BCD Adder 27</p> <p>2.2.1.1 Properties of the Reversible BCD Adder 28</p> <p>2.2.2 Design Procedure of the Reversible Carry Skip BCD Adder 31</p> <p>2.2.2.1 Properties of the Reversible Carry Skip BCD Adder 32</p> <p>2.3 Reversible BCD Subtractor 34</p> <p>2.3.1 Carry Look-Ahead BCD Subtractor 36</p> <p>2.3.2 Carry Skip BCD Subtractor 36</p> <p>2.3.3 Design of Conventional Reversible BCD Subtractor 37</p> <p>2.3.3.1 Reversible Nine’s Complement 37</p> <p>2.3.3.2 Reversible BCD Subtractor 38</p> <p>2.3.3.3 Reversible Design of Carry Look-Ahead BCD Subtractor 40</p> <p>2.3.3.4 Reversible Design of Carry Skip BCD Subtractor 40</p> <p>2.4 Summary 41</p> <p><b>3 Reversible Multiplier Circuit </b><b>43</b></p> <p>3.1 Multiplication Using Booth’s Recoding 43</p> <p>3.2 Reversible Gates as Half Adders and Full Adders 44</p> <p>3.3 Some Signed Reversible Multipliers 45</p> <p>3.4 Design of Reversible Multiplier Circuit 45</p> <p>3.4.1 Some Quantum Gates 46</p> <p>3.4.2 Recoding Cell 46</p> <p>3.4.3 Partial Product Generation Circuit 49</p> <p>3.4.4 Multi-Operand Addition Circuit 52</p> <p>3.4.5 Calculation of Area and Power of <i>n </i>× <i>n </i>Multiplier Circuit 52</p> <p>3.5 Summary 64</p> <p><b>4 Reversible Division Circuit </b><b>67</b></p> <p>4.1 The Division Approaches 67</p> <p>4.1.1 Restoring Division 67</p> <p>4.1.2 Nonrestoring Division 67</p> <p>4.2 Components of Division Circuit 68</p> <p>4.2.1 Reversible MUX 68</p> <p>4.2.2 Reversible Register 68</p> <p>4.2.3 Reversible PIPO Left-Shift Register 68</p> <p>4.2.4 Reversible Parallel Adder 70</p> <p>4.3 The Design of Reversible Division Circuit 71</p> <p>4.4 Summary 74</p> <p><b>5 Reversible Binary Comparator </b><b>75</b></p> <p>5.1 Design of Reversible <i>n</i>-Bit Comparator 75</p> <p>5.1.1 BJS Gate 75</p> <p>5.1.2 Reversible 1<i>-</i>Bit Comparator Circuit 76</p> <p>5.1.3 Reversible MSB Comparator Circuit 77</p> <p>5.1.4 Reversible Single-Bit Greater or Equal Comparator Cell 78</p> <p>5.1.5 Reversible Single-Bit Less Than Comparator Cell 79</p> <p>5.1.6 Reversible 2-Bit Comparator Circuit 79</p> <p>5.1.7 Reversible <i>n</i>-Bit Comparator Circuit 79</p> <p>5.2 Summary 85</p> <p><b>6 Reversible Sequential Circuits </b><b>87</b></p> <p>6.1 An Example of Design Methodology 87</p> <p>6.2 The Design of Reversible Latches 89</p> <p>6.2.1 The SR Latch 89</p> <p>6.2.2 The D Latch 91</p> <p>6.2.2.1 The D Latch with Outputs <i>Q </i>and <i>Q </i>91</p> <p>6.2.2.2 The Negative Enable Reversible D Latch 92</p> <p>6.2.3 T Latch 93</p> <p>6.2.4 The JK Latch 93</p> <p>6.3 The Design of Reversible Master–Slave Flip-Flops 94</p> <p>6.4 The Design of Reversible Latch and the Master–Slave Flip-Flop with Asynchronous SET and RESET Capabilities 95</p> <p>6.5 Summary 97</p> <p><b>7 Reversible Counter, Decoder, and Encoder Circuits </b><b>99</b></p> <p>7.1 Synthesis of Reversible Counter 99</p> <p>7.1.1 Reversible T Flip-Flop 99</p> <p>7.1.2 Reversible Clocked T Flip-Flop 99</p> <p>7.1.3 Reversible Master–Slave T Flip-Flop 100</p> <p>7.1.4 Reversible Asynchronous Counter 101</p> <p>7.1.5 Reversible Synchronous Counter 102</p> <p>7.2 Reversible Decoder 103</p> <p>7.2.1 Reversible Encoder 104</p> <p>7.3 Summary 106</p> <p><b>8 Reversible Barrel Shifter and Shift Register </b><b>107</b></p> <p>8.1 Design Procedure of Reversible Bidirectional Barrel Shifter 107</p> <p>8.1.1 Reversible 3 × 3 Modified BJN Gate 108</p> <p>8.1.2 Reversible 2’s Complement Generator 109</p> <p>8.1.3 Reversible Swap Condition Generator 110</p> <p>8.1.4 Reversible Right Rotator 111</p> <p>8.1.4.1 (4, 3) Reversible Right Rotator 112</p> <p>8.1.4.2 Generalized Reversible Right Rotator 112</p> <p>8.1.5 Reversible Bidirectional Barrel Shifter 113</p> <p>8.2 Design Procedure of Reversible Shift Register 113</p> <p>8.2.1 Reversible Flip-Flop 113</p> <p>8.2.1.1 Reversible SISO Shift Register 114</p> <p>8.2.1.2 Reversible SIPO Shift Register 114</p> <p>8.2.1.3 Reversible PISO Shift Register 115</p> <p>8.2.1.4 Reversible PIPO Shift Register 115</p> <p>8.2.1.5 Reversible Universal Shift Register 118</p> <p>8.3 Summary 121</p> <p><b>9 Reversible Multiplexer and Demultiplexer with Other Logical Operations </b><b>123</b></p> <p>9.1 Reversible Logic Gates 123</p> <p>9.1.1 RG1 Gate 123</p> <p>9.1.2 RG2 Gate 123</p> <p>9.2 Designs of Reversible Multiplexer and Demultiplexer with Other Logical Operations 124</p> <p>9.2.1 The R-I Gate 124</p> <p>9.2.2 The R-II Gate 126</p> <p>9.3 Summary 128</p> <p><b>10 Reversible Programmable Logic Devices </b><b>129</b></p> <p>10.1 Reversible FPGA 129</p> <p>10.1.1 3 × 3 Reversible NH Gate 130</p> <p>10.1.2 4 × 4 Reversible BSP Gate 130</p> <p>10.1.3 4-to-1 Reversible Multiplexer 130</p> <p>10.1.4 Reversible D Latch 131</p> <p>10.1.5 Reversible Write-Enabled Master–Slave Flip-Flop 132</p> <p>10.1.6 Reversible RAM 132</p> <p>10.1.7 Design of Reversible FPGA 132</p> <p>10.2 Reversible PLA 134</p> <p>10.2.1 The Design Procedure 134</p> <p>10.2.1.1 Delay Calculation of a Reversible PLA 139</p> <p>10.2.1.2 Delay Calculation of AND Plane 139</p> <p>10.2.1.3 Delay Calculation of Ex-OR Plane 140</p> <p>10.2.1.4 Delay of Overall Design 140</p> <p>10.3 Summary 141</p> <p><b>11 Reversible RAM and Programmable ROM </b><b>143</b></p> <p>11.1 Reversible RAM 143</p> <p>11.1.1 3 × 3 Reversible FS Gate 143</p> <p>11.1.2 Reversible Decoder 144</p> <p>11.1.3 Reversible D Flip-Flop 145</p> <p>11.1.4 Reversible Write-Enabled Master–Slave D Flip-Flop 146</p> <p>11.1.5 Reversible Random Access Memory 146</p> <p>11.2 Reversible PROM 148</p> <p>11.2.1 Reversible Decoder 149</p> <p>11.2.2 Design of Reversible PROM 149</p> <p>11.3 Summary 154</p> <p><b>12 Reversible Arithmetic Logic Unit </b><b>155</b></p> <p>12.1 Design of ALU 155</p> <p>12.1.1 Conventional ALU 155</p> <p>12.1.2 The ALU Based on Reversible Logic 155</p> <p>12.1.2.1 The Reversible Function Generator 156</p> <p>12.1.2.2 The Reversible Control Unit 156</p> <p>12.2 Design of Reversible ALU 158</p> <p>12.3 Summary 159</p> <p><b>13 Reversible Control Unit </b><b>161</b></p> <p>13.1 An Example of Control Unit 161</p> <p>13.2 Different Components of a Control Unit 161</p> <p>13.2.1 Reversible HL Gate 161</p> <p>13.2.2 Reversible BJ Gate 162</p> <p>13.2.3 Reversible 2-to-4 Decoder 163</p> <p>13.2.4 Reversible 3-to-8 Decoder 165</p> <p>13.2.5 Reversible <i>n</i>-to-2<i>n </i>Decoder 165</p> <p>13.2.6 Reversible JK Flip-Flop 168</p> <p>13.2.7 Reversible Sequence Counter 168</p> <p>13.2.8 Reversible Instruction Register 168</p> <p>13.2.9 Control of Registers and Memory 169</p> <p>13.2.10 Construction Procedure and Complexities of the Control Unit 170</p> <p>13.3 Summary 172</p> <p><b>Part II Reversible Fault Tolerance </b><b>173</b></p> <p>An Overview About Fault-Tolerance and Testable Circuits 173</p> <p><b>14 Reversible Fault-Tolerant Adder Circuits </b><b>177</b></p> <p>14.1 Properties of Fault Tolerance 177</p> <p>14.1.1 Parity-Preserving Reversible Gates 178</p> <p>14.2 Reversible Parity-Preserving Adders 180</p> <p>14.2.1 Fault-Tolerant Full Adder 180</p> <p>14.2.2 Fault-Tolerant Carry Skip Adder 181</p> <p>14.2.3 Fault-Tolerant Carry Look-Ahead Adder 183</p> <p>14.2.4 Fault-Tolerant Ripple Carry Adder 184</p> <p>14.3 Summary 185</p> <p><b>15 Reversible Fault-Tolerant Multiplier Circuit </b><b>187</b></p> <p>15.1 Reversible Fault-Tolerant Multipliers 187</p> <p>15.1.1 Reversible Fault-Tolerant <i>n </i>× <i>n </i>Multiplier 187</p> <p>15.1.2 LMH Gate 188</p> <p>15.1.3 Partial Product Generation 188</p> <p>15.1.4 Multi-Operand Addition 190</p> <p>15.2 Summary 192</p> <p><b>16 Reversible Fault-Tolerant Division Circuit </b><b>193</b></p> <p>16.1 Preliminaries of Division Circuits 193</p> <p>16.1.1 Division Algorithms 193</p> <p>16.2 The Division Method 194</p> <p>16.2.1 Floating-Point Data and Rounding 195</p> <p>16.2.2 Correctly Rounded Division 195</p> <p>16.2.3 Correct Rounding from One-Sided Approximations 196</p> <p>16.2.4 The Algorithm for Division Operation 196</p> <p>16.3 Components of a Division Circuit 199</p> <p>16.3.1 Reversible Fault-Tolerant MUX 200</p> <p>16.3.2 Reversible Fault-Tolerant D Latch 200</p> <p>16.4 The Design of the Division Circuit 201</p> <p>16.4.1 Reversible Fault-Tolerant PIPO Left-Shift Register 201</p> <p>16.4.2 Reversible Fault-Tolerant Register 203</p> <p>16.4.3 Reversible Fault-Tolerant Rounding Register 204</p> <p>16.4.4 Reversible Fault-Tolerant Normalization Register 204</p> <p>16.4.5 Reversible Fault-Tolerant Parallel Adder 204</p> <p>16.4.6 The Reversible Fault-Tolerant Division Circuit 205</p> <p>16.5 Summary 210</p> <p><b>17 Reversible Fault-Tolerant Decoder Circuit </b><b>211</b></p> <p>17.1 Transistor Realization of Some Popular Reversible Gates 211</p> <p>17.1.1 Feynman Double Gate 211</p> <p>17.1.2 Fredkin Gate 211</p> <p>17.2 Reversible Fault-Tolerant Decoder 213</p> <p>17.3 Summary 219</p> <p><b>18 Reversible Fault-Tolerant Barrel Shifter </b><b>221</b></p> <p>18.1 Properties of Barrel Shifters 221</p> <p>18.2 Reversible Fault-Tolerant Unidirectional Logarithmic Rotators 222</p> <p>18.3 Fault-Tolerant Unidirectional Logarithmic Logical Shifters 224</p> <p>18.4 Summary 229</p> <p><b>19 Reversible Fault-Tolerant Programmable Logic Devices </b><b>231</b></p> <p>19.1 Reversible Fault-Tolerant Programmable Logic Array 231</p> <p>19.1.1 The Design of RFTPLA 232</p> <p>19.2 Reversible Fault-Tolerant Programmable Array Logic 235</p> <p>19.2.1 The Design of AND Plane of RFTPAL 236</p> <p>19.2.2 The Design of Ex-OR Plane of RFTPAL 238</p> <p>19.3 Reversible Fault-Tolerant LUT-Based FPGA 240</p> <p>19.3.1 Reversible Fault-Tolerant Gates 240</p> <p>19.3.2 Proof of Fault-Tolerance Properties of the MSH and MSB Gates 240</p> <p>19.3.3 Physical Implementation of the Gates 241</p> <p>19.3.4 Reversible Fault-Tolerant D Latch, Master–Slave Flip-Flop and 4 × 1 Multiplexer 242</p> <p>19.3.5 Reversible Fault-Tolerant <i>n</i>-Input Look-Up Table 244</p> <p>19.3.6 Reversible Fault-Tolerant CLB of FPGA 244</p> <p>19.4 Summary 246</p> <p><b>20 Reversible Fault-Tolerant Arithmetic Logic Unit </b><b>249</b></p> <p>20.1 Design of <i>n</i>-bit ALU 249</p> <p>20.1.1 A 4 × 4 Parity-Preserving Reversible Gate 249</p> <p>20.1.2 1-Bit ALU 251</p> <p>20.1.2.1 Group-1 PP Cell 251</p> <p>20.1.2.2 Group-2 PP Cell 252</p> <p>20.1.2.3 Group-3 PP Cell 253</p> <p>20.1.2.4 <i>n</i>-bit ALU 255</p> <p>20.2 Summary 259</p> <p><b>21 Online Testable Reversible Circuit Using NAND Blocks </b><b>261</b></p> <p>21.1 Testable Reversible Gates 261</p> <p>21.2 Two-Pair Rail Checker 265</p> <p>21.3 Synthesis of Reversible Logic Circuits 266</p> <p>21.4 Summary 268</p> <p><b>22 Reversible Online Testable Circuits </b><b>269</b></p> <p>22.1 Online Testability 269</p> <p>22.1.1 Online Testable Approach Using R1, R2, and R Gates 269</p> <p>22.1.2 Online Testable Approach Using Testable Reversible Cells (TRCs) 270</p> <p>22.1.3 Online Testable Circuit Using Online Testable Gate 271</p> <p>22.1.4 Online Testing of ESOP-Based Circuits 271</p> <p>22.1.5 Online Testing of General Toffoli Circuit 272</p> <p>22.2 The Design Approach 272</p> <p>22.2.1 The UFT Gate 272</p> <p>22.2.2 Analysis of the Online Testable Approach 276</p> <p>22.3 Summary 278</p> <p><b>23 Applications of Reversible Computing </b><b>279</b></p> <p>Why We Need to Use Reversible Circuits 280</p> <p>Applications of Reversible Computing 280</p> <p>23.1 Adiabatic Systems 281</p> <p>23.2 Quantum Computing 282</p> <p>23.3 Energy-Efficient Computing 283</p> <p>23.4 Switchable Program and Feedback Circuits 283</p> <p>23.5 Low-Power CMOS 284</p> <p>23.6 Digital Signal Processing (DSP) and Nano-Computing 284</p> <p><b>Part III DNA Computing </b><b>287</b></p> <p>An Overview About DNA Computing 287</p> <p><b>24 Background Studies About Deoxyribonucleic Acid </b><b>291</b></p> <p>24.1 Structure and Function of DNA 291</p> <p>24.2 DNA Computing 293</p> <p>24.2.1 Watson-Crick Complementary 294</p> <p>24.2.2 Adleman’s Breakthrough 294</p> <p>24.3 Relationship of Binary Logic with DNA 295</p> <p>24.4 Welfare of DNA Computing 295</p> <p>24.5 Summary 297</p> <p><b>25 A DNA-Based Approach to Microprocessor Design </b><b>299</b></p> <p>25.1 Basics of Microprocessor Design 299</p> <p>25.2 Characteristics and History of Microprocessors 300</p> <p>25.3 Methodology of Microprocessor Design 301</p> <p>25.4 Construction of Characteristic Tree 302</p> <p>25.5 Traversal of the Tree 302</p> <p>25.6 Encoding of the Traversed Path to the DNA Sequence 304</p> <p>25.6.1 Gene Pool 305</p> <p>25.6.2 Potency Factor 305</p> <p>25.7 Combination of DNA Sequences 305</p> <p>25.8 Decoding the Output String 306</p> <p>25.9 Processor Evaluation 307</p> <p>25.10 Post-Processing 307</p> <p>25.11 Gene Pool Update 309</p> <p>25.12 Summary 309</p> <p><b>26 DNA-Based Reversible Circuits </b><b>311</b></p> <p>26.1 DNA-Based Reversible Gates 311</p> <p>26.2 DNA-Based Reversible NOT Gate 311</p> <p>26.3 DNA-Based Reversible Ex-OR Gate 311</p> <p>26.4 DNA-Based Reversible AND Gate 312</p> <p>26.5 DNA-Based Reversible OR Gate 313</p> <p>26.6 DNA-Based Reversible Toffoli Gate 315</p> <p>26.6.1 Fan-out Technique of a DNA-Based Toffoli Gate 316</p> <p>26.6.2 DNA-Based Reversible NOT Operation 317</p> <p>26.6.3 DNA-Based Reversible AND Operation 317</p> <p>26.6.4 DNA-Based Reversible OR Operation 318</p> <p>26.6.5 DNA-Based Reversible Ex-OR Operation 318</p> <p>26.6.6 Properties of DNA-Based Reversible Toffoli Gate 319</p> <p>26.6.7 DNA-Based Reversible Fredkin Gates 319</p> <p>26.7 Realization of Reversible DNA-Based Composite Logic 321</p> <p>26.8 Summary 322</p> <p><b>27 Addition, Subtraction, and Comparator Using DNA </b><b>323</b></p> <p>27.1 DNA-Based Adder 323</p> <p>27.2 DNA-Based Addition/Subtraction Operations 325</p> <p>27.2.1 Addition and Subtraction Operations 325</p> <p>27.2.2 Procedures of DNA-Based Reversible Addition/ Subtraction Operations 325</p> <p>27.3 DNA-Based Comparator 329</p> <p>27.3.1 Sequence Design 330</p> <p>27.3.2 Estimation of Rate Constant 331</p> <p>27.4 Summary 331</p> <p><b>28 Reversible Shift and Multiplication Using DNA </b><b>333</b></p> <p>28.1 DNA-Based Reversible Shifter Circuit 333</p> <p>28.1.1 Procedures of DNA-Based Shifter Circuit 333</p> <p>28.2 DNA-Based Reversible Multiplication Operation 336</p> <p>28.3 Summary 339</p> <p><b>29 Reversible Multiplexer and ALU Using DNA </b><b>341</b></p> <p>29.1 DNA-Based Reversible Multiplexer 341</p> <p>29.1.1 The Working Procedures of DNA-Based Multiplexer Circuit 342</p> <p>29.2 DNA-Based Reversible Arithmetic Logic Unit 345</p> <p>29.2.1 Procedures of DNA-Based ALU 345</p> <p>29.2.2 Properties of the DNA-Based ALU 347</p> <p>29.3 Summary 349</p> <p><b>30 Reversible Flip-Flop Using DNA </b><b>351</b></p> <p>30.1 The Design of a DNA Fredkin Gate 351</p> <p>30.2 Simulating the Fredkin Gate by Sticking System 351</p> <p>30.2.1 Simulating the Fredkin Gate by Enzyme System 353</p> <p>30.3 Simulation of the Reversible D Latch Using DNA Fredkin Gate 355</p> <p>30.3.1 Simulation of the Reversible Sequential Circuit Using DNA Fredkin Gate 355</p> <p>30.4 DNA-Based Biochemistry Technology 356</p> <p>30.5 Summary 357</p> <p><b>31 Applications of DNA Computing </b><b>359</b></p> <p>31.1 Solving the Optimization and Scheduling Problems Like the Traveling Salesman Problem 360</p> <p>31.2 Parallel Computing 362</p> <p>31.3 Genetic Algorithm 363</p> <p>31.4 Neural System 363</p> <p>31.5 Fuzzy Logic Computation and Others 364</p> <p>31.6 Lift Management System 364</p> <p>31.7 DNA Chips 364</p> <p>31.8 Swarm Intelligence 365</p> <p>31.9 DNA and Cryptography Systems 365</p> <p>31.10 Monstrous Memory Capacity 366</p> <p>31.11 Low-Power Dissipation 367</p> <p>31.12 Summary 367</p> <p>Conclusion 369</p> <p>Copyright Permission of Third-Party Materials 371</p> <p>Bibliography 373</p> <p>Index 389</p>
<p><b>HAFIZ MD. HASAN BABU</b> is the Pro-Vice-Chancellor of National University in Bangladesh. He received his M.Sc degree in computer science and engineering from the Brno University of Technology in the Czech Republic in 1992. He has written over 100 research articles for reputable international journals.
<p><b>Master the subjects of reversible computing and DNA computing with this expert volume</b> <p><i>Reversible and DNA Computing</i> offers readers new ideas and technologies in the rapidly developing field of reversible computing. World-renowned researcher and author Hafiz Md. Hasan Babu shows readers the fundamental concepts and ideas necessary to understand reversible computing, including reversible circuits, reversible fault tolerant circuits, and reversible DNA circuits. <p><i>Reversible and DNA Computing</i> contains a practical approach to understanding energy-efficient DNA computing. In addition to explaining the foundations of reversible circuits, the book covers topics including: <ul> <li>Advanced logic design</li> <li>An introduction to the fundamentals of reversible computing</li> <li>Advanced reversible logic synthesis</li> <li>Reversible fault tolerance</li> <li>Fundamentals of DNA computing</li> <li>Reversible DNA logic synthesis</li> <li>DNA logic design</li> </ul> <p>This book is perfect for undergraduate and graduate students in the physical sciences and engineering, as well as those working in the field of quantum computing. It belongs on the bookshelves of anyone with even a passing interest in nanotechnology, energy-efficient computing, and DNA computing.

Diese Produkte könnten Sie auch interessieren:

Cognitive Analytics and Reinforcement Learning
Cognitive Analytics and Reinforcement Learning
von: Elakkiya R., Subramaniyaswamy V.
EPUB ebook
168,99 €
Computational Imaging for Scene Understanding
Computational Imaging for Scene Understanding
von: Takuya Funatomi, Takahiro Okabe
PDF ebook
142,99 €