crc任意位生成多項(xiàng)式 任意位運(yùn)算 自適應(yīng)算法 循環(huán)冗余校驗(yàn)碼(CRC，Cyclic Redundancy Code)是采用多項(xiàng)式的 編碼方式，這種方法把要發(fā)送的數(shù)據(jù)看成是一個(gè)多項(xiàng)式的系數(shù) ，數(shù)據(jù)為bn-1bn-2…b1b0 (其中為0或1)，則其對應(yīng)的多項(xiàng)式為： bn-1Xn-1+bn-2Xn-2+…+b１X+b０ 例如：數(shù)據(jù)“10010101”可以寫為多項(xiàng)式 X７+X４+X２+1。 循環(huán)冗余校驗(yàn)CRC 循環(huán)冗余校驗(yàn)方法的原理如下： (1) 設(shè)要發(fā)送的數(shù)據(jù)對應(yīng)的多項(xiàng)式為P(x)。 (2) 發(fā)送方和接收方約定一個(gè)生成多項(xiàng)式G(x)，設(shè)該生成多項(xiàng)式 的最高次冪為r。 (3) 在數(shù)據(jù)塊的末尾添加r個(gè)0，則其相對應(yīng)的多項(xiàng)式為M(x)=XrP(x) 。(左移r位) (4) 用M(x)除以G(x)，獲得商Q(x)和余式R(x)，則 M(x)=Q(x) ×G(x)+R(x)。 (5) 令T(x)=M(x)+R(x)，采用模2運(yùn)算，T(x)所對應(yīng)的數(shù)據(jù)是在原數(shù) 據(jù)塊的末尾加上余式所對應(yīng)的數(shù)據(jù)得到的。 (6) 發(fā)送T(x)所對應(yīng)的數(shù)據(jù)。 (7) 設(shè)接收端接收到的數(shù)據(jù)對應(yīng)的多項(xiàng)式為T’(x)，將T’(x)除以G(x) ，若余式為0，則認(rèn)為沒有錯(cuò)誤，否則認(rèn)為有錯(cuò)
標(biāo)簽： crc CRC 多項(xiàng)式 位運(yùn)算
上傳時(shí)間： 2014-01-16
上傳用戶：hphh
BG碼轉(zhuǎn)換程序是一個(gè)二進(jìn)制碼（Binary，簡稱 B碼）與格雷碼（Gray Code，簡稱G碼）相互轉(zhuǎn)換的軟件．
標(biāo)簽： Binary 轉(zhuǎn)換 程序 二進(jìn)制碼
上傳時(shí)間： 2014-12-19
上傳用戶：hgy9473
用VC制作一個(gè)商品交易管理系統(tǒng).部分代碼：“// 商品交易管理系統(tǒng)View.cpp #include “MyDlg1.h” void CMyView::OnRadiospxx() { // TODO: Add your control notification handler code here CMyDlg1 MyDlg1 MyDlg1.DoModal() } ”
標(biāo)簽： OnRadiospxx CMyView include MyDlg
上傳時(shí)間： 2013-12-16
上傳用戶：banyou
* first open client.cpp and search for that USER_MSG_INTERCEPT(TeamInfo) over it u add this Code: USER_MSG_INTERCEPT(Health) { BEGIN_READ(pbuf,iSize) me.iHealth = READ_BYTE() return USER_MSG_CALL(Health) } * then we search for int HookUserMsg (char *szMsgName, pfnUserMsgHook pfn) and add this Code: REDIRECT_MESSAGE( Health ) *k now we have the health registered and can read it out i stop this hear know cuz i must thanks panzer and w00t.nl that they helped me with it first time! *ok now we go to int HUD_Redraw (float x, int y) and packing this draw code in it Code:
標(biāo)簽： USER_MSG_INTERCEPT TeamInfo client search
上傳時(shí)間： 2016-01-22
上傳用戶：ynzfm
This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.
標(biāo)簽： code implementing directory algorithm
上傳時(shí)間： 2014-01-15
上傳用戶：woshini123456
DirectX not only provides fast access to the hardware and therefore incredibly speedy performance, but it also makes it much easier for hardware developers to produce new devices that work well in the Windows environment. The DirectX APIs take away the necessity of writing your own low-level, device-specific code to access hardware such as the display adapter and network card, making it much easier for you to write programs that take full advantage of the computer s multimedia capabilities.
標(biāo)簽： performance incredibly therefore hardware
上傳時(shí)間： 2016-02-16
上傳用戶：秦莞爾w
k-meansy算法源代碼。This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.
標(biāo)簽： code implementing directory algorithm
上傳時(shí)間： 2016-04-07
上傳用戶：shawvi
This code in this directory implements the binary hopfield network.Source code may be found in HOPNET.CPP. A sample training file is H7x8N4.trn. Sample test pattern files are: H7x8D4.TST, H5x8D7.TST,H5x8D7.TST and H5x8D9.TST, Output of the program goes to both the screen and a file, ARCHIVE.LST.
標(biāo)簽： code implements directory hopfield
上傳時(shí)間： 2013-12-27
上傳用戶：ruixue198909
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively. The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
標(biāo)簽： illustrates elimination Gaussian pivoting
上傳時(shí)間： 2016-11-09
上傳用戶：wang5829
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively. The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
標(biāo)簽： illustrates elimination Gaussian pivoting
上傳時(shí)間： 2014-01-21
上傳用戶：lxm
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
