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
上傳用戶：咔樂塢
偽隨機數生成器，Implementation of the Quasi-Random Number generator currently hardwired to no more than 52 dimensions
上傳時間： 2013-12-20
上傳用戶：teddysha
電路仿真程序 Classic Ladder is coded 100％ in C.It can be used for educational purposes or anything you want... The graphical user interface uses GTK. In the actual version, the following elements are implemented : * Booleans elements * Rising / falling edges * Timers * Monostables * Compare of arithmetic expressions
標簽： educational anything purposes Classic
上傳時間： 2014-01-13
上傳用戶：xg262122
This zip contains a simple paper of SPIHT generated streams run length encoded ... later i ll be posting the MATLAB source code also and also SPIHT with Arithmetic coding
標簽： generated contains encoded streams
上傳時間： 2013-12-01
上傳用戶：huangld
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
Coaxial feed structures are widely used in ultra-wide band antennas . This paper modeled the characteristic of the monopole antenna feeded by coaxial line by FDTD in the time-domiain,which showes that . Firstly, it introduced the theory of the arithmetic and the particularly realization in the calculation then it described the use in the time-domain finally it analysed several characteristics of the monopole antenna. The arithmetic used in the microstrip antenna is also a quick and economical way to design the antenna.
標簽： structures ultra-wide antennas Coaxial
上傳時間： 2016-06-28
上傳用戶：朗朗乾坤
密碼算法程序包miracl contains all the source code for the latest version of MIRACL: a Multiprecision Integer and Rational Arithmetic C/C++ library.
標簽： Multiprecision the contains version
上傳時間： 2016-07-08
上傳用戶：xinyuzhiqiwuwu
The GNU MP Bignum Library，非常好用的大數運算庫，GMP is a free library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and floating point numbers.
上傳時間： 2014-01-08
上傳用戶：a673761058
產生正常分布的sobol sequences，generating of normally distributed quasi uniform distributed: sobol sequences
上傳時間： 2016-11-14
上傳用戶：diets
The TMS320C54x, TMS320LC54x, and TMS320VC54x fixed-point, digital signal processor (DSP) families (hereafter referred to as the ’54x unless otherwise specified) are based on an advanced modified Harvard architecture that has one program memory bus and three data memory buses. These processors also provide an arithmetic logic unit (ALU) that has a high degree of parallelism, application-specific hardware logic, on-chip memory, and additional on-chip peripherals. These DSP families also provide a highly specialized instruction set, which is the basis of the operational flexibility and speed of these DSPs.
標簽： TMS 320 fixed-point processor
上傳時間： 2013-12-27
上傳用戶：宋桃子
<tfoot id="sccci"></tfoot>