ARM Assembly for Embedded Applications, 3rd Edition

Daniel W. Lewis

  • 出版商: CreateSpace Independ
  • 出版日期: 2017-09-07
  • 售價: $1,650
  • 貴賓價: 9.5$1,568
  • 語言: 英文
  • 頁數: 318
  • 裝訂: Paperback
  • ISBN: 1543908047
  • ISBN-13: 9781543908046
  • 相關分類: ARM嵌入式系統Assembly
  • 無法訂購


ARM Assembly for Embedded Applications is a text for a sophomore-level course in computer science, computer engineering, or electrical engineering that teaches students how to write functions in ARM assembly called by a C program. The C/Assembly interface (i.e., function call, parameter passing, return values, register conventions) is presented early so that students can write simple functions in assembly as soon as possible. The text then covers the details of arithmetic, bit manipulation, making decisions, loops, integer arithmetic, real arithmetic floating-point and fixed-point representations, inline coding and I/O programming. What’s new: This 3rd edition adds two new chapters. Chapter 11 is on multimedia processing, with several examples that use the saturating arithmetic and SIMD (Single Instruction Multiple Data) instructions of the ARM processor to implement fast routines for multimedia applications. Chapter 12 uses the SIMD instructions to implement functions for rational and complex arithmetic. The material on bit manipulation instructions has been updated with a discussion of how to use the basic operations of AND, OR and exclusive-OR as filters that pass a bit unmodified to the output, force it to either 0 or 1, or change it to the opposite of its previous value. New illustrations show how it is sometimes easier to translate for and while loops into assembly by first converting them into an arrangement of goto statements, statement labels, and an inverted test for completion. There are additional examples of how to implement multiplication and division by a constant more efficiently than using multiply and divide instructions, with a C program added to the textbook website that generates fast instruction sequences for division by a constant. New illustrations clarify the algorithm for multiplying fixed-point reals, and there is new material on instruction cycle counts, pipeline stalls, execution time measurement, memory-mapped I/O ports, data rates and synchronization.