Full support for extended regular expressions (those with intersection and complement); Support for some kinds of cycles in grammar; DFA-based operation; Unicode support; C++ only, requires a modern compiler; Lexical analyzers can be configured to get symbols from any input class (built-in support for std::istream, std::wistream and FILE *); Designed to work with Whale, but can work standalone or interface to other parsers.
標簽： intersection expressions complement for
上傳時間： 2013-12-11
上傳用戶：zhanditian
LL(1)文法判定(C#) SimpleLL1目錄下為源程序 EXE目錄下為編譯好的可執行文件 Product1.txt~Product4.txt為測試用產生式（可直接在程序中加載） symbols.txt為測試用符號集（可直接在程序中加載） 轉載或引用請注明出處:www.shootsoft.net
標簽： Product SimpleLL1 txt Symb
上傳時間： 2015-05-18
上傳用戶：ynzfm
The Reed-Somolon code is specified by the finite field, the length (length <= 2^m-1), the number of redundant symbols (length-k), and the initial zero of the code, init_zero, such that the zeros are: init_zero, init_zero+1, ..., init_zero+length-k-1
標簽： length the Reed-Somolon specified
上傳時間： 2014-07-31
上傳用戶：skfreeman
This project aim was to build wireless software modem for data communication between two computers using an acoustic interface in the voice frequency range (20Hz– 20,000Hz). The transmitting antenna is a speaker (frequency response of: 90Hz – 20,000Hz) and the receiving antenna is a microphone (frequency response of: 100Hz – 16,000Hz). The test files used as information files were text files. This goal was attained both in an incoherent scheme and in a coherent scheme. Build under Matlab code, our modem uses OFDM (orthogonal frequency division multiplexing) modulation, synchronization by LMS sequence, channel estimation (no equalizer) via pilot tones. The symbols are either PSK or ASK for a constellation size of 2 or 4. To optimize the probability of error, these symbols were mapped using Gray mapping. Report
標簽： communication computers software wireless
上傳時間： 2014-05-29
上傳用戶：wangdean1101
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
ofdm信道特性 Channel transmission simulator Channel transmission simulator ％ ％ inputs: ％ sig2 - noise variance ％ Mt - number of Tx antennas ％ Mr - number of Rx antennas ％ x - vector of complex input symbols (for MIMO, this is a matrix, where each column ％ is the value of the antenna outputs at a single time instance) ％ H - frequency selective channel - represented in block-Toeplitz form for MIMO transmission ％ N - number of symbols transmitted in OFDM frame ％ ％ outputs: ％ y - vector of channel outputs (matrix for MIMO again, just like x matrix) ％ create noise vector sequence (each row is a different antenna, each column is a ％ different time index) note: noise is spatially and temporally white
標簽： transmission simulator Channel inputs
上傳時間： 2016-07-22
上傳用戶：kelimu
Compression using lempel-ziv -for a dictionary size of 2k -provide dictionary Lempel ziv algorithm is a dictionary based algorithm that addresses byte sequences from former contents instead of the original data. This algorithm consists of a rule for parsing strings of symbols from a finite alphabet into substrings, whose lengths do not exceed a prescribed integer and a coding scheme which maps these substrings sequentially into uniquely decipherable code words of fixed length. The strings are selected so that they have nearly equal probability of occurrence. Frequently-occurring symbols are grouped into longer strings while occasional symbols appear in short strings.
標簽： dictionary Compression lempel-ziv provide
上傳時間： 2014-01-07
上傳用戶：我們的船長
) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
標簽： code Compression huffman provide
上傳時間： 2017-05-30
上傳用戶：yuchunhai1990
