Computational Number Theory and Digital Signal Processing
eBook - ePub

Computational Number Theory and Digital Signal Processing

Fast Algorithms and Error Control Techniques

  1. English
  2. ePUB (mobile friendly)
  3. Available on iOS & Android
eBook - ePub

Computational Number Theory and Digital Signal Processing

Fast Algorithms and Error Control Techniques

About this book

Military service involves exposure to multiple sources of chronic, acute, and potentially traumatic stress, especially during deployment and combat. Notoriously variable, the effects of stress can be subtle to severe, immediate or delayed, impairing individual and group readiness, operational performance, and—ultimately—survival. A comprehensive compilation on the state of the science, Biobehavioral Resilience to Stress identifies key factors and characteristics that are essential to a scientifically useful and behaviorally predictive understanding of resilience to stress.

Contributions from Uniquely Qualified Military and Civilian Experts

Initiated by the Military Operational Medicine Research Directorate of the US Army Medical Research and Material Command (USAMRMC), this seminal volume integrates recent research and experience from military and civilian experts in behavioral and social sciences, human performance, and physiology. Each chapter is grounded in vigorous research with emphasis on relevance to a variety of real-world operations and settings, including extreme environments encountered in modern war.

Logical Progression, Cross-Disciplinary Appeal

Organized into four sections, the text begins with a discussion of the relevant aspects of stress in the context of military life to offer civilian readers a window into contemporary military priorities. Later chapters consider biological, physiological, and genetic factors, psychosocial aspects of resilience, and "community capacity" variables that influence psychological responses to stressful events. This multidisciplinary effort concludes with an overview of emergent themes and related issues to advance the science of resilience toward predictive research, theory, and application for all those—military and civilian—who serve in the national defense.

Trusted byĀ 375,005 students

Access to over 1 million titles for a fair monthly price.

Study more efficiently using our study tools.

Table of contents

  1. Cover
  2. Half Title
  3. Title Page
  4. Copyright Page
  5. Table of Contents
  6. 1 Introduction
  7. 1.1 Outline
  8. 1.2 The Organization
  9. PART I: COMPUTATIONAL NUMBER THEORY
  10. 2 Computational Number Theory
  11. 2.1 Groups, Rings, and Fields
  12. 2.2 Elements of Number Theory
  13. 2.2.1 Integer Rings and Fields
  14. 2.3 Linear Congruences Over Z(M)
  15. 2.3.1 Linear Independence and Vector Spaces Over Z(M)
  16. 2.3.2 Orthogonality and Null Spaces Over Z(M)
  17. 2.3.3 Rank of Matrices Over Z(M)
  18. 2.4 The Chinese Remainder Theorem for Integers
  19. 2.5 Residue Number Systems
  20. 2.5.1 Other Residue Operations
  21. 2.6 The Problem of Error Control
  22. 2.7 Bibliography
  23. 3 Polynomial Algebra
  24. 3.1 Algebra of Polynomials Over a Field
  25. 3.2 Roots of a Polynomial
  26. 3.3 Polynomial Fields and Rings
  27. 3.4 The CRT for Polynomials
  28. 3.5 Polynomial Algebra Over a Ring
  29. 3.5.1 Roots of a Polynomial Over Z^M)
  30. 3.6 Computing Convolution Over a Field
  31. 3.6.1 Algorithms for Computing Convolutions Over a Field
  32. 3.7 On Factorization of (un — 1) Over Finite Fields
  33. 3.7.1 Factorization of (un — 1) Over GF(p)
  34. 3.7.2 Primitive Polynomial Over GF(p)
  35. 3.8 Convolution Algorithms Over Z(M) and NTTs
  36. 3.8.1 Mersenne and Fermat Number Transforms
  37. 3.9 The Problem of Error Control
  38. 3.10 Bibliography
  39. PART II: DIGITAL SIGNAL PROCESSING
  40. 4 New Algorithms Over Integer Rings
  41. 4.1 Monic Polynomial Factorization
  42. 4.1.1 Monic Polynomial Factorization Over Z(pα)
  43. 4.1.2 A Systematic Procedure
  44. 4.1.3 Monic Polynomial Factorization over Z(M)
  45. 4.2 The AIC Extension of the CRT
  46. 4.2.1 The AICE-CRT Reconstruction
  47. 4.2.2 AICE-CRT in the Matrix Form
  48. 4.3 Convolution Algorithms Over Z(M)
  49. 4.3.1 AICE-CRT Based Algorithms for Cyclic Convolution
  50. 4.3.2 AICE-CRT Based Algorithms for Acyclic Convolution
  51. 4.4 Computational Complexity Analysis
  52. 4.5 Bibliography
  53. 5 AICE-CRT: The Complex Case
  54. 5.1 Multilinear Forms Over Complex Integer Rings
  55. 5.1.1 Factorization of j2 + 1 Over GF(p)
  56. 5.1.2 Algorithms for Convolutions: Special Cases
  57. 5.2 Factorization Over a Complex Integer Ring
  58. 5.3 The AICE-CRT Over Complex Integer Rings
  59. 5.4 Algorithms for Convolution
  60. 5.4.1 Algorithms for Cyclic Convolution
  61. 5.4.2 Algorithms for Acyclic Convolution
  62. 5.5 Discussion
  63. 5.6 Bibliography
  64. 6 Fault Tolerance for Integer Sequences
  65. 6.1 Introduction and Mathematical Preliminaries
  66. 6.2 A Framework for Fault Tolerance
  67. 6.2.1 Fault Detection and Correction
  68. 6.2.2 Mathematical Structure of C Over Z(M)
  69. 6.2.3 Decoding Algorithms Over Z(M)
  70. 6.3 Coding Techniques Over Z(q)
  71. 6.3.1 Decoding Algorithms Over Z(q)
  72. 6.3.2 A Fast Algorithm For Decoding Over Z(q)
  73. 6.3.3 Some General Remarks
  74. 6.4 Examples and SFC-DFD Codes
  75. 6.5 NTT Based Cyclic Codes
  76. 6.6 Bibliography
  77. PART III: ERROR CONTROL TECHNIQUES IN RESIDUE NUMBER SYSTEMS
  78. 7 Fault Control in Residue Number Systems
  79. 7.1 Background and Terminology
  80. 7.2 A Coding Theory Framework for RRNS
  81. 7.2.1 Minimum Distance of RRNS
  82. 7.2.2 Error Detection and Correction in RRNS
  83. 7.2.3 Weight Distribution of the MDS-RRNS Code
  84. 7.3 Consistency Checking for RRNS
  85. 7.4 A Coding Theory Framework for RNS-PC
  86. 7.4.1 Error Detection and Correction in RNS-PC
  87. 7.5 Consistency Checking for RNS-PC
  88. 7.6 Bibliography
  89. 8 Single Error Correction in RNS
  90. 8.1 Single Error Correction in RRN
  91. 8.2 Computational Analysis and Examples
  92. 8.3 Single-Error Correction in RNS-PC
  93. 8.4 A Superfast Algorithm for RNS
  94. 8.4.1 A Superfast Algorithm for Single Error Correction
  95. 8.5 A Procedure for Single Error Correction
  96. 8.6 A Hardware Design for the Algorithms
  97. 8.6.1 A Hardware Design for the Fast Algorithm
  98. 8.6.2 A Hardware Design for the Superfast Algorithm
  99. 8.6.3 Comparison and Discussion
  100. 8.7 Bibliography
  101. 9 Multiple Error Control in RRNS
  102. 9.1 Errors and Consistency Checking
  103. 9.2 Single Error Correction: Continued
  104. 9.3 Double Error Correction
  105. 9.4 Single-Burst Error Correction
  106. 9.5 General Fault Detection and Correction
  107. 9.6 Extensions of Previous Algorithms
  108. 9.7 Computational Complexity Analysis
  109. 9.8 Bibliography
  110. 10 Erasure and Error Control in RRNS
  111. 10.1 Erasures in RRNS
  112. 10.2 Consistency Checking
  113. 10.3 Multiple-Erasure Correction
  114. 10.4 Erasure Correction and Error Detection
  115. 10.5 Error and Erasure Correction
  116. 10.6 Extensions of Previous Algorithms
  117. 10.7 Computational Complexity Analysis
  118. 10.8 Bibliography
  119. 11 Multiple Error Control in RNS-PC
  120. 11.1 Single Error Correction: Continued
  121. 11.2 Double Error Correction
  122. 11.3 Multiple Error Correction
  123. 11.4 Extensions of Previous Algorithms
  124. 11.5 Computational Complexity Analysis
  125. 11.6 Bibliography
  126. A Computational Complexity Analysis
  127. A.1 Yau and Liu [1973] algorithm
  128. A.2 Jenkins and Altman [1988] algorithm
  129. A.3 New algorithm
  130. B Complexity Analysis: Continued
  131. B.1 Extended Jenkins and Altman [1988] algorithm
  132. B.2 New algorithm
  133. Index

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn how to download books offline
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 990+ topics, we’ve got you covered! Learn about our mission
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more about Read Aloud
Yes! You can use the Perlego app on both iOS and Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app
Yes, you can access Computational Number Theory and Digital Signal Processing by Hari Krishna,Bal Krishna,Kuo-Yu Lin,Jenn-Dong Sun in PDF and/or ePUB format, as well as other popular books in Technology & Engineering & Counting & Numeration. We have over one million books available in our catalogue for you to explore.