Computes BER v EbNo curve for convolutional encoding / soft decision Viterbi decoding scheme assuming BPSK. Brute force Monte Carlo approach is unsatisfactory (takes too long) to find the BER curve. The computation uses a quasi-analytic (QA) technique that relies on the estimation (approximate one) of the information-bits Weight Enumerating Function (WEF) using A simulation of the convolutional encoder. Once the WEF is estimated, the analytic formula for the BER is used.
標(biāo)簽： convolutional Computes encoding decision
上傳時間： 2013-12-24
上傳用戶：咔樂塢
This program simulates the bit-error-rate (BER) performance of OSTBC with L=4 antennas over the frequency flat Rayleigh block fading channel The code is developed for real orthogonal design, code rate 1/2 modulation- 16 QAM with gray coding resulting in 2 bits/sec/Hz.
標(biāo)簽： bit-error-rate performance simulates the
上傳時間： 2014-01-13
上傳用戶：whenfly
NRF905驅(qū)動代碼 // The content of this struct is nRF905 s initialize data. // CH_NO=1 433MHZ Normal Opration,No Retrans RX,TX Address is 4 Bytes // RX TX Payload Width is 32 Bytes Disable Extern Clock Fosc=16MHZ // 8 bits CRC And enable
標(biāo)簽： initialize 905 content Normal
上傳時間： 2013-12-16
上傳用戶：lanjisu111
I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. having some data file consisted of 3 different symbols and their total number of occurence in that file s1(1000), s2(200), s3(30) so the total length of file is 1000+200+30=1230 bytes, it will be encoded assigning one bit to s1 and 2 bits to s2, s3 so the encoded length will be 1*1000+2*(200+30)=1460 bits=182 bytes). In the best case the file consisted of just one symbol will be encoded with compression ratio as 1:8. Huffman coding is used in image compression, however in JPEG2000 arithmetic codec is imployed.
標(biāo)簽： decompress algorithm compress Huffman
上傳時間： 2016-05-16
上傳用戶：aysyzxzm
As mentioned, most computers include a serial port. The only hardware setup required is connecting the serial cable to the serial port on the PC and the serial port on the instrument. The serial instrument may include some hardware drivers or software utilities for communication, and should include documentation on the baud rate, packet size, stop bits, and parity bits that the instrument will use. Additionally, check the National Instruments Instrument Driver Network to see if LabVIEW drivers already exist for yout instrument, as
標(biāo)簽： connecting mentioned computers hardware
上傳時間： 2016-05-27
上傳用戶：gououo
This file contains a C++Builder 4 project called SimplyChaos-X ver 3.1 (SCX31). SCX31 is an encryption tool. I designed it as my graduation paper work. SCX31 is a symmetric stream cipher built on chaos function, one time pad cipher and inspiration from Ground Effect (aviation). The key length can be up to 40 characters (320 bits).
標(biāo)簽： SimplyChaos-X SCX contains Builder
上傳時間： 2016-06-07
上傳用戶：nanshan
Digital Signature Algorithm (DSA)是Schnorr和ElGamal簽名算法的變種，被美國NIST作為DSS(DigitalSignature Standard)。算法中應(yīng)用了下述參數(shù)： p：L bits長的素?cái)?shù)。L是64的倍數(shù)，范圍是512到1024； q：p - 1的160bits的素因子； g：g = h^((p-1)/q) mod p，h滿足h < p - 1, h^((p-1)/q) mod p > 1； x：x < q，x為私鑰 ； y：y = g^x mod p ，( p, q, g, y )為公鑰； H( x )：One-Way Hash函數(shù)。DSS中選用SHA( Secure Hash Algorithm )。 p, q, g可由一組用戶共享，但在實(shí)際應(yīng)用中，使用公共模數(shù)可能會帶來一定的威脅。簽名及驗(yàn)證協(xié)議如下： 1. P產(chǎn)生隨機(jī)數(shù)k，k < q； 2. P計(jì)算 r = ( g^k mod p ) mod q s = ( k^(-1) (H(m) + xr)) mod q 簽名結(jié)果是( m, r, s )。 3. 驗(yàn)證時計(jì)算 w = s^(-1)mod q u1 = ( H( m ) * w ) mod q u2 = ( r * w ) mod q v = (( g^u1 * y^u2 ) mod p ) mod q 若v = r，則認(rèn)為簽名有效。 DSA是基于整數(shù)有限域離散對數(shù)難題的，其安全性與RSA相比差不多。DSA的一個重要特點(diǎn)是兩個素?cái)?shù)公開，這樣，當(dāng)使用別人的p和q時，即使不知道私鑰，你也能確認(rèn)它們是否是隨機(jī)產(chǎn)生的，還是作了手腳。RSA算法卻作不到。
標(biāo)簽： Algorithm Signature Digital Schnorr
上傳時間： 2014-01-01
上傳用戶：qq521
Flash中內(nèi)置了一個狀態(tài)寄存器（Status Register，SR）來指示Flash的當(dāng)前工作狀態(tài)和各種操作是否成功。要讀取SR的當(dāng)前值需要向CUI發(fā)送讀狀態(tài)寄存器命令（Read Status Register），命令碼為0x70，SR中的內(nèi)容將在DQ[7:0]上輸出。The Read Status Register （0x70）command causes subsequent reads to output data from the SR until another command is issued. The SR bits are output on DQ[7:0].
標(biāo)簽： Register Status Flash 內(nèi)置
上傳時間： 2016-08-12
上傳用戶：thesk123
這學(xué)期剛學(xué)密碼學(xué)，RSA算法相對簡單，于是寫了這個小軟件.開發(fā)環(huán)境:VC++6.0。 RSA的安全性依賴于大數(shù)分解。公鑰和私鑰都是兩個大素?cái)?shù)。據(jù)猜測，從一個密鑰和密文推斷出明文的難度等同于分解兩個大素?cái)?shù)的積。 數(shù)據(jù)加密算法RSA的關(guān)鍵在于大素?cái)?shù)的生成,本軟件采取數(shù)組形式解決大素?cái)?shù)的存儲和運(yùn)算問題,可生成超過1024位的十進(jìn)制數(shù)的大素?cái)?shù),以應(yīng)用于數(shù)據(jù)加密。 RSA的缺點(diǎn)主要有：產(chǎn)生密鑰很麻煩，受到素?cái)?shù)產(chǎn)生技術(shù)的限制，因而難以做到一次一密。分組長度太大，為保證安全性，n 至少也要 600 bits以上，使運(yùn)算代價很高，尤其是速度較慢，較對稱密碼算法慢幾個數(shù)量級；且隨著大數(shù)分解技術(shù)的發(fā)展，這個長度還在增加，不利于數(shù)據(jù)格式的標(biāo)準(zhǔn)化。 對于明文是字母、數(shù)字、符號、漢字的各種組合都能正確加密解密
標(biāo)簽： 密碼
上傳時間： 2016-08-14
上傳用戶：qq521
The acceptance and introduction of serial communication to more and more applications has led to requirements that the assignment of message identifiers to communication functions be standardized for certain applications. These applications can be realized with CAN more comfortably, if the address range that originally has been defined by 11 identifier bits is enlarged
標(biāo)簽： more communication introduction applications
上傳時間： 2014-01-04
上傳用戶：小草123
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
<li id="6oek0"></li>