C#中实现最短路，该图算法描述的是这样的场景：图由节点和带有方向的边构成，每条边都有相应的权值，路径规划（最短路径）算法就是要找出从节点A到节点B的累积权值最小的路径。-achieve the most short-circuit, the algorithm described in the plan that is the scene : map with nodes and from the direction of the edges, and each side has a corre

max-log-map算法的C语言的实现，能计算出所需要的LLR，做出软判决和硬判决。,max-log-map algorithm for the realization of the C language, can be required to calculate LLR, make a hard decision and soft decision.

实现识别标识符的状态转换图算法。掌握识别标识符的状态转换图的理论知识和算法实现。-Identifier to achieve recognition of the state transition map algorithm. Master identifier to identify the state transition graph theoretical knowledge and algorithms to achieve.

课程设计两个程序：一：数据帧（程序每帧设置为400bit)在有扰信道传输时，采用Turbo码进行编译码。并仿真Log-MAP译码算法在不同迭代次数下的性能。 二：实现有扰信道中，不同信噪比下，采用MAP译码算法的Turbo码的性能。 以上各主程序均有做比较详细的程序注释 可直接运行turbo_main.m或LogMAP.m，稍等片刻即可观察到仿真结果 -two programs of Curriculum design : a: Data frames

turbo码的C语言描述，MAP算法-C language descr iption of turbo codes, MAP algorithm ....