Location:
Search - max map
Search list
Description: 包括turbo码编译码程序，译码算法包括sova及max-log-map算法，并有完整链路验证其性能。-including turbo coding - decoding procedures, SOVA including decoding algorithm and max-log-map algorithm, and link integrity test its performance.
Platform: |
Size: 13265 |
Author: tanbo |
Hits:
Description: 基于DSP平台实现turbo码Max_Log_MAP算法，基于标准C 语言研究
了Turbo 码Max - Log - MAP 译码算法的软件编程与实现,为了提高程序的运行效率,结合TMS320C6000 系列DSP 芯片
的结构与特点采用循环展开、数据的存取优化设计、算法改进等措施进行了代码优化,给出了测试结果，非常值得一看
Platform: |
Size: 313523 |
Author: ynhuyong |
Hits:
Description: This platform simulates the classical turbo encoding-decoding system, including Log-MAP algorithm and max-log-MAP algorithm.
Platform: |
Size: 8028 |
Author: chugs@sina.com |
Hits:
Description: 为每一个待译码bit计算其LLR 得到一个序列中的最大值无素. 计算外信息for each decoded bit
Platform: |
Size: 10222 |
Author: ludahaiii@sohu.com |
Hits:
Description: 包括turbo码编译码程序，译码算法包括sova及max-log-map算法，并有完整链路验证其性能。-including turbo coding- decoding procedures, SOVA including decoding algorithm and max-log-map algorithm, and link integrity test its performance.
Platform: |
Size: 13312 |
Author: tanbo |
Hits:
Description: 基于DSP平台实现turbo码Max_Log_MAP算法，基于标准C 语言研究
了Turbo 码Max - Log - MAP 译码算法的软件编程与实现,为了提高程序的运行效率,结合TMS320C6000 系列DSP 芯片
的结构与特点采用循环展开、数据的存取优化设计、算法改进等措施进行了代码优化,给出了测试结果，非常值得一看-DSP platform based on turbo code Max_Log_MAP algorithm, based on standard C language studied Turbo Code Max- Log- MAP decoding algorithm of the software programming and realize, in order to improve process efficiency, combined with TMS320C6000 DSP chip structure and characteristics of the use of cycle start the design of data access optimization, algorithms and other measures to improve the code optimization, are given the test results, very worth a visit
Platform: |
Size: 313344 |
Author: ynhuyong |
Hits:
Description: 这是一个利用MAX PULL 制作的VHDL的全加器的程序 如果有需要仿真图的 请叫站长联系我-This is a MAX PULL produced using the full adder VHDL process simulation map, if necessary please contact me call station
Platform: |
Size: 1024 |
Author: 郭明磊 |
Hits:
Description: 这是一个利用MAX PULL 制作的VHDL的四位全加器的程序 如果有需要仿真图的 请叫站长联系我-This is a MAX PULL using VHDL produced four full-adder process simulation map, if necessary please contact me call station
Platform: |
Size: 1024 |
Author: 郭明磊 |
Hits:
Description: Max Log MAP decoding
Platform: |
Size: 3072 |
Author: |
Hits:
Description: 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.
Platform: |
Size: 3072 |
Author: lituguang |
Hits:
Description: 利用J2ME复刻FC经典RPG游戏<<重装机兵>>,基本实现了
该游戏的所有功能,如碰撞探测,地图转换,NPC对话,商店处理,
事件处理,横版回合制战斗系统,随机遇敌,并根据原游戏的特色
加入了人,车两种战斗系统,以及人,车乘降的功能.-FC Xtreme use J2ME classic RPG game < < re-installed soldiers> > , basically all the features of the game, such as collision detection, map conversion, NPC dialogue, stores handling, event handling, cross-version of turn-based combat system, with the opportunities for the enemy, and in accordance with the characteristics of the original game by adding the people, two fighting vehicle system, as well as people, vehicles down by function.
Platform: |
Size: 265216 |
Author: 张钦 |
Hits:
Description: turbo码的map,log-map以及max-log-map的算法的c程序仿真-turbo code of the map, log-map and the max-log-map algorithm for c program simulation
Platform: |
Size: 5120 |
Author: 章剑 |
Hits:
Description: 简化MAX-LOG-MAP算法与LOG-MAP算法性能对比
MAX-LOG-MAP_1024_标准交织_1～3次迭代_grid
简化MAX-LOG-MAP算法与门限MAX-LOG-MAP算法性能对比_10次迭代640交织长度-Simplify the MAX-LOG-MAP algorithm and the LOG-MAP algorithm performance comparison MAX-LOG-MAP_1024_ standard cutting _1 ~ 3 iterations _grid simplify the MAX-LOG-MAP algorithm and the threshold MAX-LOG-MAP algorithm performance comparison _10 cutting length of 640 iterations
Platform: |
Size: 186368 |
Author: 方锐 |
Hits:
Description: 这是一个在MAX+plus上面的计数器仿真图，基于FPGA的仿真。-This is a counter above the MAX+ plus simulation map, FPGA-based simulation.
Platform: |
Size: 18432 |
Author: 王天刚 |
Hits:
Description: 这是一套完整的支持wimax 16e协议CTC的编译码程序，
主程序在demo.c
译码器：tcdecoder.c
编码器：tcencoder.c-/* This program simulates the classical turbo encoding-decoding system on PC.*/
/* It uses parallel concatenated convolutional codes described in Figure 2.9 in Chapter 2.*/
/* Two component RSC (Recursive Systematic Convolutional) encoders are used. */
/* First encoder is terminated with tails bits. (Info+ tail) bits are scrambled and */
/* passed to the second encoder, while second encoder is left open without tail bits. */
/* Random information bits are modulated into+1/-1, and transmitted through an AWGN channel.*/
/* Interleavers are randomly generated for each frame.*/
/* Log-MAP algorithm without quantization or approximation is used.*/
/* By making use of ln(e^x+e^y) = max (x,y)+ ln(1+e^(-abs(x-y))), */
/* the Log-MAP is simplified with a look-up table for the correction term.*/
/* When the approximation ln(e^x+e^y) = max (x,y) is, we have MAX-Log-MAP.*/
/* To set the number of iterations, change the globle variable "DECITER". To set the fr
Platform: |
Size: 26624 |
Author: bennytang |
Hits:
Description: turbo码的编解码程序，采用max-log-map算法，简单易用。程序采用QPSK调制，信道为AWGN-turbo code decoding process, using max-log-map algorithm, easy to use. Program uses QPSK modulation, AWGN channel is
Platform: |
Size: 4096 |
Author: 张佑昌 |
Hits:
Description: 合并 google map 卫星与普通地图-max google satelie and google road map
Platform: |
Size: 44032 |
Author: W |
Hits:
Description: 地图上色
#include <stdio.h>
#include <stdlib.h>
#define MAX 100
typedef struct{int code
int color
}Area /*区域结构*/
typedef struct{Area a[MAX]
int vn
int en
}Map /*地图结构*/
void CreateM(Map m)/*生成地图，并统一成一色*/
{int i
printf(“\nIntput vn en”)
scanf(" d d",&m.vn,&m.en)
for(i=0 i<m.vn i++)
{m.a[i].code=i
m.a[i].color=0
printf("\nInput an area s name")
gets(m.a[i].name)
}
}
-# Include color maps <stdio.h># Include <stdlib.h># Define MAX 100 typedef struct {int code int color } Area /* regional structure*/typedef struct {Area a [MAX] int vn int en } Map /* map structure*/void CreateM (Map m) /* generate a map, and unified into one color*/{int i printf (" \ nIntput vn en" ) scanf (" d d" , & m.vn, & m.en) for (i = 0 i <m.vn i++)
{m.a[i].code=i
m.a[i].color=0
printf("\nInput an area s name")
gets(m.a[i].name)
}
}
Platform: |
Size: 1024 |
Author: 王道 |
Hits:
Description: This script simulates the classical turbo encoding-decoding system.
It simulates parallel concatenated convolutional codes.
Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed.
First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to
the second encoder, while second encoder is left open without tail bits of itself.
Random information bits are modulated into +1/-1, and transmitted through a AWGN channel.
Interleavers are randomly generated for each frame.
Log-MAP algorithm without quantization or approximation is used.
By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))),
the Log-MAP can be simplified with a look-up table for the correction function.
If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP.- This script simulates the classical turbo encoding-decoding system.
It simulates parallel concatenated convolutional codes.
Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed.
First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to
the second encoder, while second encoder is left open without tail bits of itself.
Random information bits are modulated into +1/-1, and transmitted through a AWGN channel.
Interleavers are randomly generated for each frame.
Log-MAP algorithm without quantization or approximation is used.
By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))),
the Log-MAP can be simplified with a look-up table for the correction function.
If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP.
Platform: |
Size: 2048 |
Author: yk |
Hits:
Description: 3D MAX贴图更换，适用于3DMAX2009对虚拟现实贴图更换提供快捷修改-Change 3 d MAX map, suitable for 3 dmax2009 texture change of virtual reality for rapid change
Platform: |
Size: 5120 |
Author: 熊斯 |
Hits: