*嵌入式系統組織架構與設計1嵌入式系統組織架構與設計98.02.19*嵌入式系統組織架構與設計2課程大綱 n 第一章 嵌入式系統概述 n 第二章嵌入式系統作業環境與系統開發程 n 第三章嵌入式系統Xscale微架構之系統結構 n 第四章 Xscale指系統 n 第五章 XscalePXA270應用處器結構和使用方 法 u實作 PXA270結構與特性 時脈與電源管 系統整合單元 LCD控制 UART控制 USB控制 GPIO控制*嵌入式系統組織架構與設計3嵌入式系統組織架構與設計 第一章 嵌入式系統概述98.02.19*嵌入式系統組織架構與設計4第一章 課程大綱n 嵌入式系統概述 u嵌入式系統特性 u嵌入式系統體系架構 u嵌入式系統之發展 n 嵌入式系統軟體 uLinux作業系統 uWinCE作業系統 u嵌入式系統開發平臺 n 嵌入式系統硬體 uIntel Xscale SOC系 uIntel Xscale實驗平台*嵌入式系統組織架構與設計5前言n 碩大是美正好與IA( Information Appliance) 求小而美、小而省是背道而馳。 n 半導體電子發展趨勢是符合摩爾定律 n 資訊載具上之資訊軟體研發，具有身訂做之特 性，已從電腦中心設計(范紐曼結構)之時代轉向 以消費者中心(3C)的設計。 n 多產業標準並存之網架構以及互動性、相容性 高之系統軟體變成為研發廠商開發之首要目標： u節省人成本 u配合嵌入式系統多功能化 u求新、求變*嵌入式系統組織架構與設計6計算機科學(Computer Science)nComputer Science u電腦科學是一門包含各種各樣與計算和資訊處 理相關主題的系統學科，從抽象的演算法分析 、形式化語法等等，到更具體的主題如程式設 計語言、程式設計、軟體和硬體等。作為一門 學科，它與數學、電腦程式設計、軟體工程和 電腦工程有顯著的不同，卻通常被混淆，儘管 這些學科之間存在不同程度的交叉和覆蓋。 u中國算盤(abacus)，遠古就應用在計算上。資訊理論資訊理論*嵌入式系統組織架構與設計7計算機科學(Computer Science)nComputer science, or computing science uIt is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. Computation: It is a general term for any type of information processing that can be represented mathematically. Computation is a process following a well-defined model that is understood and can be expressed in an algorithm, protocol, network topology, etc.*嵌入式系統組織架構與設計8計算機科學(Computer Science)n Information: uGenerally speaking, the concept of information is closely related to notions of constraint, communication, control, data, form, instruction, knowledge, meaning, mental stimulus, pattern, perception, and representation.Information is the writing of knowldge of any subject. uInformation is the state of a system of interest. Message is the information materialized. The ASCII codes for the word “Wikipedia“ represented in binary, the numeral system most commonly used for encoding computer information.*嵌入式系統組織架構與設計9nInformation processing may more specifically be defined in terms by Claude E. Shannon as the conversion of latent information into manifest informationcitation needed. Latent and manifest information is defined through the terms of equivocation (remaining uncertainty, what value the sender has actually chosen), dissipation (uncertainty of the sender what the receiver has actually received) and transformation (saved effort of questioning - equivocation minus dissipation)citation needed. nPractical Information Processing can be described as a cycle, where data (which may have no inherent meaning to the observer) is converted into information (which does have meaning to the observer). This conversion takes one of three forms: nComputation utilizes mathematics (specifically arithmetics) to create the information from data. Example: a cash register (either mechanical or digital) uses addition to convert the individual item prices (data) into the total amount owed to the store (information). nTransduction is the conversion of one type of energy into another type. Example: A mechanical speaker converts an electric signal (data) into sound waves (information). nTranslation is the conversion of a string of symbols from one set into another. Example: a person fluent two languages could rewrite a document that is written in a language that the observer does not understand (data) into a language that the observer does understand (information). Note that translation is the only Information processing form that can not yet be performed purely by a machine. It requires an organic brain (some electronic computer programs can translate but in reality they are using complex programs, which actually rely solely on computation to complete the process). *嵌入式系統組織架構與設計10計算機科學(Computer Science)n計算機科學研究的課題： u電腦程式能做什麼和能做什麼（可計算性） u如何使程式高效的執特定任務（演算法和 複雜性論） u程式如何存取同型的資（資結構和資 庫） u程式如何顯得具有智慧（人工智慧）； u人如何與程式溝通（人機互動和人機界面）*嵌入式系統組織架構與設計11計算機科學(Computer Science)n 電腦(計算機)科學的大部分研究是基於“杜林機”(Turing Machine)和“馮范紐曼電腦”(John von Neumann ) 的，它們 是絕大多數實際機器的計算模型。 n 西元1937年，亞蘭杜林（Alan Turing）提出了Turing Machine的概念。 uTuring Machine Turing machines are extremely basic abstract symbol-manipulating devices which, despite their simplicity, can be adapted to simulate the logic of any computer that could possibly be constructed. Though they were intended to be technically feasible, Turing machines were not meant to be a practical computing technology, but a thought experiment about the limits of mechanical computation; thus they were not actually constructed. Studying their abstract properties yields many insights into computer science and complexity theory.*嵌入式系統組織架構與設計12計算機科學(Computer Science)n Turing Machine u艾倫杜林的“通用電腦器”(“universal computing machine”)是由他(1936-1937)為他的多用途單機器（電 腦器）模型命名，這模型可以“運行”任何任意（但well- formed）指令序列（稱為 “quintuples“）。這模型被一 些人例如Davis (2000) 認為是“存儲程式電腦”的原點。 u每台圖靈機從它的字母表得到字串計算一確定的固定 偏可計算函數。從外觀上它的行為就像一台使用固定 程式的電腦。儘管如此，我們可以把任何杜林機的動 作表格編碼到一條字串。*嵌入式系統組織架構與設計13計算機科學(Computer Science)n Vo