This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseudo-random irregular low density parity check matrix is based on Radford M. Neal’s programs collection, which can be found in [1]. While Neal’s collection is well documented, in my opinion, C source codes are still overwhelming, especially if you are not knowledgeable in C language. My software is written for MATLAB, which is more readable than C. You may also want to refer to another MATLAB based LDPC source codes in [2], which has different flavor of code-writing style (in fact Arun has error in his log-likelihood decoder).
標(biāo)簽： LDPC introduction simulation software
上傳時(shí)間： 2014-01-14
上傳用戶(hù)：大融融rr
This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseudo-random irregular low density parity check matrix is based on Radford M. Neal’s programs collection, which can be found in [1]. While Neal’s collection is well documented, in my opinion, C source codes are still overwhelming, especially if you are not knowledgeable in C language. My software is written for MATLAB, which is more readable than C. You may also want to refer to another MATLAB based LDPC source codes in [2], which has different flavor of code-writing style (in fact Arun has error in his log-likelihood decoder).
標(biāo)簽： LDPC introduction simulation software
上傳時(shí)間： 2014-12-05
上傳用戶(hù)：change0329
一定要在TC下運(yùn)行，需要包括一些頭文件，如graphic.h 要求：畫(huà)一輛小車(chē)不停地水平從屏幕左邊運(yùn)動(dòng)到右邊，隨著每一遍運(yùn)動(dòng)，小車(chē)高度均勻下降，降到最低后返回最高處 相關(guān)函數(shù)：delay(),kbhit(),lineto(),moveto(),arc(),circle()等。
標(biāo)簽： 運(yùn)行
上傳時(shí)間： 2016-08-18
上傳用戶(hù)：彭玖華
The idea behind differential GPS is to remove as much errors as possible from the range measurements by establishing these errors at a reference site. In its most simple setup, a GPS receiver is located at a well surveyed position and its (pseudo) range measurements are compared with the actual calculated range from this receiver to the SV s. The differences between measured ranges and calculated ranges at the reference receiver are applied as corrections to the ranges measured by other receiver(s) close by.
標(biāo)簽： differential measurements possible behind
上傳時(shí)間： 2013-12-19
上傳用戶(hù)：zgu489
AMOP 0.3 is an Automatic Mock Object for C++. By using ABI and template techniques, it can simulate a pseudo-"Reflection" which is normally not support in C++ . The main differences between AMOP and other mock object library is that, users DO NOT need to implement the interface of the object which to mock...
標(biāo)簽： techniques Automatic template simulate
上傳時(shí)間： 2013-12-31
上傳用戶(hù)：rocwangdp
高級(jí)C語(yǔ)言源程序范例 Source Code from Que publications "Advanced C" Techniques and Aplications ISBN 0-88022-162-3 Advanced C Techniques and Applications QUE Unpack into a directory with the following structure root - Contents of this arc. root/bgs Contents of BGS.arc root/uis Contents of UIS.arc root/grfuser Contents og grfuser.arc
標(biāo)簽： publications Aplications Techniques Advanced
上傳時(shí)間： 2017-02-21
上傳用戶(hù)：c12228
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.
標(biāo)簽： branch-and-strategy Salesperson Traveling solution
上傳時(shí)間： 2013-12-29
上傳用戶(hù)：璇珠官人
Some thesis studies about wireless sensor network algorithms. Algorithms are considered and some pseudo codes are shown.
標(biāo)簽： Algorithms algorithms considered wireless
上傳時(shí)間： 2013-11-27
上傳用戶(hù)：luopoguixiong
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
標(biāo)簽： Implementation calculates algorithm Edmonds
上傳時(shí)間： 2014-01-04
上傳用戶(hù)：kiklkook
void DFS(MGraph G, int i) { int j; visited[i] = TRUE; printf("%c ", G.vexs[i]); for (j=0; j<G.numVertexes; ++j) { if (G.arc[i][j]!=INFINITY && !visited[j]) DFS(G, j); } }
標(biāo)簽： 多項(xiàng)式 代碼 計(jì)算
上傳時(shí)間： 2016-12-28
上傳用戶(hù)：chenyameng
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
