實(shí)現(xiàn)8比特字節(jié)的RS糾錯編碼，可以指定極性校驗(yàn)字節(jié)數(shù)目，能產(chǎn)生的最大校驗(yàn)序列長度為255字節(jié)（含極性校驗(yàn)字節(jié)）.This is an implementation of a Reed-Solomon code with 8 bit bytes, and a configurable number of parity bytes. The maximum sequence length (codeword) that can be generated is 255 bytes, including parity bytes.
上傳時間： 2016-08-24
上傳用戶：思琦琦
1993 年兩位法國教授Berrou、Glavieux 和他們的緬甸籍博士生Thitimajshima 在ICC 會議上發(fā)表的Near Shannon limit error-correcting coding and decoding: Turbo codes”，
標(biāo)簽： error-correcting Thitimajshima Glavieux Shannon
上傳時間： 2016-12-06
上傳用戶：Avoid98
This package provides encoders and fast Viterbi decoders for the NASA standard rate 1/2 and rate 1/3 constraint length 7 convolutional codes.
標(biāo)簽： rate and encoders decoders
上傳時間： 2013-12-18
上傳用戶：彭玖華
44b0公版的測試程序， ******************************************************* * NAME : 44BINIT.S * * Version : 10.JAn.2003 * * Description: * * C start up codes * * Configure memory, Initialize ISR ,stacks * * Initialize C-variables * * Fill zeros into zero-initialized C-variables *
上傳時間： 2013-12-22
上傳用戶：teddysha
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標(biāo)簽： combinatorial assignment problem arises
上傳時間： 2014-01-19
上傳用戶：BIBI
3D FDTD 計算程序 ToyFDTD1 is a stripped-down, minimalist, 3-dimensional FDTD code that is published under the GNU General Public License. It is the first in the ToyFDTD series of codes, and it illustrates in heavily commented C and Fortran the basic tasks in implementing a simple 3D FDTD simulation.
標(biāo)簽： FDTD stripped-down dimensional minimalist
上傳時間： 2013-12-25
上傳用戶：fhzm5658
Create a Delaunay triangulation or Voronoi diagram by clicking points. Delaunay triangulations and Voronoi diagrams are among the most widely used data structures in the field of Computational Geometry. These are Java-oriented source codes.
標(biāo)簽： Delaunay triangulations triangulation clicking
上傳時間： 2013-11-25
上傳用戶：zhaiye
This is GPS Matlab findPreambles finds the first preamble occurrence in the bit stream of each channel. The preamble is verified by check of the spacing between preambles [6sec] and parity checking of the first two words in a subframe. At the same time function returns list of channels, that are in tracking state and with valid preambles in the nav data stream.
標(biāo)簽： findPreambles occurrence the preamble
上傳時間： 2013-12-23
上傳用戶：秦莞爾w
This is program with source code to convert ascii text files to the maxicode barcode standard. The input file consists of two columns. The first column represents a code and the second column is a string enclosed in quotes. The codes for the first column are as follows: PM, SM, CC, MO, SC, and PC.
標(biāo)簽： maxicode standard barcode convert
上傳時間： 2017-06-07
上傳用戶：ardager
matlab中使用LM訓(xùn)練方法計算XOR，3-bit Parity，regression等問題的收斂速度，比較其收斂率。
上傳時間： 2014-01-10
上傳用戶：zhengzg
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
