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.
标签： 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.
标签： bit-error-rate performance simulates the
上传时间： 2014-01-13
上传用户：whenfly
NRF905驱动代码 // 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
标签： 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.
标签： 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
标签： 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).
标签： SimplyChaos-X SCX contains Builder
上传时间： 2016-06-07
上传用户：nanshan
Digital Signature Algorithm (DSA)是Schnorr和ElGamal签名算法的变种，被美国NIST作为DSS(DigitalSignature Standard)。算法中应用了下述参数： p：L bits长的素数。L是64的倍数，范围是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函数。DSS中选用SHA( Secure Hash Algorithm )。 p, q, g可由一组用户共享，但在实际应用中，使用公共模数可能会带来一定的威胁。签名及验证协议如下： 1. P产生随机数k，k < q； 2. P计算 r = ( g^k mod p ) mod q s = ( k^(-1) (H(m) + xr)) mod q 签名结果是( m, r, s )。 3. 验证时计算 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，则认为签名有效。 DSA是基于整数有限域离散对数难题的，其安全性与RSA相比差不多。DSA的一个重要特点是两个素数公开，这样，当使用别人的p和q时，即使不知道私钥，你也能确认它们是否是随机产生的，还是作了手脚。RSA算法却作不到。
标签： Algorithm Signature Digital Schnorr
上传时间： 2014-01-01
上传用户：qq521
Flash中内置了一个状态寄存器（Status Register，SR）来指示Flash的当前工作状态和各种操作是否成功。要读取SR的当前值需要向CUI发送读状态寄存器命令（Read Status Register），命令码为0x70，SR中的内容将在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].
上传时间： 2016-08-12
上传用户：thesk123
这学期刚学密码学，RSA算法相对简单，于是写了这个小软件.开发环境:VC++6.0。 RSA的安全性依赖于大数分解。公钥和私钥都是两个大素数。据猜测，从一个密钥和密文推断出明文的难度等同于分解两个大素数的积。 数据加密算法RSA的关键在于大素数的生成,本软件采取数组形式解决大素数的存储和运算问题,可生成超过1024位的十进制数的大素数,以应用于数据加密。 RSA的缺点主要有：产生密钥很麻烦，受到素数产生技术的限制，因而难以做到一次一密。分组长度太大，为保证安全性，n 至少也要 600 bits以上，使运算代价很高，尤其是速度较慢，较对称密码算法慢几个数量级；且随着大数分解技术的发展，这个长度还在增加，不利于数据格式的标准化。 对于明文是字母、数字、符号、汉字的各种组合都能正确加密解密
标签： 密码
上传时间： 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
标签： more communication introduction applications
上传时间： 2014-01-04
上传用户：小草123
