ITU-T G.729語(yǔ)音壓縮算法。 description: Fixed-point description of commendation G.729 with ANNEX B Coding of Speech at 8 kbit/s using Conjugate-Structure Algebraic-Code-Excited Linear-Prediction (CS-ACELP) with Voice Activity Decision(VAD), Discontinuous Transmission(DTX), and Comfort Noise Generation(CNG).
標(biāo)簽： description commendation Fixed-point 729
上傳時(shí)間： 2014-11-23
上傳用戶(hù)：thesk123
杭電 ACM 1002 I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
標(biāo)簽： integers problem calcul simple
上傳時(shí)間： 2014-01-12
上傳用戶(hù)：dave520l
Let the following relational tables be given: R = (A, B, C) and S = (D, E, F) where A, B, C, D, E, and F are the attributes (columns). Write the SQL statements that will express each of the queries given below:
標(biāo)簽： relational following tables given
上傳時(shí)間： 2014-01-14
上傳用戶(hù)：cx111111
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
標(biāo)簽： Subsequence sequence Problem Longest
上傳時(shí)間： 2016-12-08
上傳用戶(hù)：busterman
Data Structures and Algorithms with Object-Oriented Design Patterns in Java Bruno R. Preiss B.A.Sc., M.A.Sc., Ph.D., P.Eng. Associate Professor Department of Electrical and Computer Engineering University of Waterloo, Waterloo, Canada
標(biāo)簽： B.A.S R. Object-Oriented Algorithms
上傳時(shí)間： 2017-03-07
上傳用戶(hù)：z754970244
針對(duì)目前使用的RS232接口數(shù)字化B超鍵盤(pán)存在PC主機(jī)啟動(dòng)時(shí)不能設(shè)置BIOS，提出一種PS2鍵盤(pán)的設(shè)計(jì)方法。基于W78E052D單片機(jī)，采用8通道串行A/D轉(zhuǎn)換器設(shè)計(jì)了8個(gè)TGC電位器信息采集電路，電位器位置信息以鍵盤(pán)掃描碼序列形式發(fā)送，正交編碼器信號(hào)通過(guò)XC9536XL轉(zhuǎn)換為單片機(jī)可接收的中斷信號(hào)，軟件接收到中斷信息后等效處理成按鍵。結(jié)果表明，在滿(mǎn)足開(kāi)機(jī)可設(shè)置BIOS同時(shí)，又可實(shí)現(xiàn)超聲特有功能，不需要專(zhuān)門(mén)設(shè)計(jì)驅(qū)動(dòng)程序，接口簡(jiǎn)單，成本低。 Abstract: Aiming at the problem of the digital ultrasonic diagnostic imaging system keyboard with RS232 interface currently used couldn?蒺t set the BIOS when the PC boot， this paper proposed a design method of PS2 keyboards. Based on W78E052D microcontroller，designed eight TGC potentiometers information acquisition circuit with 8-channel serial A/D converter， potentiometer position information sent out with keyboard scan code sequentially.The control circuit based on XC9536 CPLD is used for converting the mechanical actions of the encoders into the signals that can be identified by the MCU， software received interrupt information and equivalently treatmented as key. The results show that the BIOS can be set to meet the boot， ultrasound specific functionality can be achieved at the same time， it does not require specially designed driver，the interface is simple and low cost.
標(biāo)簽： 單片機(jī) B超 數(shù)字化 鍵盤(pán)設(shè)計(jì)
上傳時(shí)間： 2013-10-10
上傳用戶(hù)：asdfasdfd
A Simple isochronous transfer. Reads 8051 ports A,B and C, and continuously sends a five byte packet over EP8IN:
標(biāo)簽： continuously isochronous and transfer
上傳時(shí)間： 2015-02-01
上傳用戶(hù)：ywqaxiwang
十部經(jīng)典算法合集 .chm Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni PREFACE CHAPTER 1: INTRODUCTION CHAPTER 2: ARRAYS CHAPTER 3: STACKS AND QUEUES CHAPTER 4: LINKED LISTS CHAPTER 5: TREES CHAPTER 6: GRAPHS CHAPTER 7: INTERNAL SORTING CHAPTER 8: EXTERNAL SORTING CHAPTER 9: SYMBOL TABLES CHAPTER 10: FILES APPENDIX A: SPARKS APPENDIX B: ETHICAL CODE IN INFORMATION PROCESSING APPENDIX C: ALGORITHM INDEX BY CHAPTER
標(biāo)簽： Fundamentals Structures Horowitz PREFACE
上傳時(shí)間： 2015-05-19
上傳用戶(hù)：維子哥哥
經(jīng)典英文原著圖書(shū)之a(chǎn) b c’s of science(簡(jiǎn)易科學(xué))，感覺(jué)不錯(cuò)，推薦一睹！
標(biāo)簽： science of 英文 圖書(shū)
上傳時(shí)間： 2014-01-12
上傳用戶(hù)：kelimu
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
標(biāo)簽： project implement developed Database
上傳時(shí)間： 2013-12-25
上傳用戶(hù)：semi1981
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
