Description: 压缩文件中是Error Correction Coding - Mathematical Methods and Algorithms(Wiley 2005)作者:(Todd K. Moon
)的配套代码,是由C和matlab两种语言编写的-compressed files is Error Correction Coding- Mathemat da Methods and Algorithms (Wiley, 2005) Author : (Todd K. Moon) matching code from C and Matlab prepared in two languages Platform: |
Size: 11518976 |
Author:龙昊 |
Hits:
Description: LogMAP译码算法,可用于递归卷积编码和非递归卷积编码的译码，代码质量高，供参考-<1> Log MAP decoder for RSC and NSC convolutional codes
<2> Based on Lalit Bahl s original BCJR algorithm and its logarithmic version (Hanzo & Woodard).
<3> Test-bench code is also included. Platform: |
Size: 5120 |
Author:Leo Tsao |
Hits:
Description: 课程设计两个程序：一：数据帧（程序每帧设置为400bit)在有扰信道传输时，采用Turbo码进行编译码。并仿真Log-MAP译码算法在不同迭代次数下的性能。
二：实现有扰信道中，不同信噪比下，采用MAP译码算法的Turbo码的性能。
以上各主程序均有做比较详细的程序注释
可直接运行turbo_main.m或LogMAP.m，稍等片刻即可观察到仿真结果
-two programs of Curriculum design : a: Data frames (each frame is setted to 400bit per frame) ,under a interferent channel transmission uses Turbo codes and decodes. including simulation of Log-MAP decoding algorithm performance under different number of its iterations.
2: To achieve the simulate the performance of MAP decoding algorithm for Turbo code,with different SNR that is decided by interferent channel.
Above the main program have to do a more detailed program notes
Can be directly run turbo_main.m or LogMAP.m, wait a moment to the simulation results can be observed Platform: |
Size: 346112 |
Author:陈侯海 |
Hits:
Description: 本程序设计的是咬尾编码的turbo码，用matlab编写。咬尾turbo码也即不需要拖尾比特，使得前后两个状态相同，译码采用修正的MAP译码算法-This program is designed to encode the turbo tail biting code, written with matlab. Tail biting turbo code that is not trailing bits to make the same before and after the two states, decoding, MAP decoding algorithm using modified Platform: |
Size: 1024 |
Author:yangf |
Hits:
Description: Matlab simulation for drawing the BER plot of the LTE turbo code, using either the BCJR algorithm or the fully-parallel algorithm.
Copyright (C) 2013 Robert G. Maunder
The simulation can be started by running the main.m script. This can be modified to either the BCJR algorithm or the fully-parallel algorithm, as well as to the frame length N. As the simulation proceeds, it will gradually plot the BER that can be achieved using various number of decoding iterations, as selected in main.m. A greater number of decoding iterations will give a lower BER. The script main.m can also be modified to make the BER plots smoother and reach lower BERs, at the cost of making the simulation run slower.-Matlab simulation for drawing the BER plot of the LTE turbo code, using either the BCJR algorithm or the fully-parallel algorithm.
Copyright (C) 2013 Robert G. Maunder
The simulation can be started by running the main.m script. This can be modified to either the BCJR algorithm or the fully-parallel algorithm, as well as to the frame length N. As the simulation proceeds, it will gradually plot the BER that can be achieved using various number of decoding iterations, as selected in main.m. A greater number of decoding iterations will give a lower BER. The script main.m can also be modified to make the BER plots smoother and reach lower BERs, at the cost of making the simulation run slower. Platform: |
Size: 12288 |
Author:oudjani |
Hits:
Description: Matlab simulation for drawing the BER plot of the WiMAX turbo code, using either the BCJR algorithm or the fully-parallel algorithm.
Copyright (C) 2013 Robert G. Maunder
The simulation can be started by running the main.m script. This can be modified to either the BCJR algorithm or the fully-parallel algorithm, as well as to the frame length N. As the simulation proceeds, it will gradually plot the BER that can be achieved using various number of decoding iterations, as selected in main.m. A greater number of decoding iterations will give a lower BER. The script main.m can also be modified to make the BER plots smoother and reach lower BERs, at the cost of making the simulation run slower.-Matlab simulation for drawing the BER plot of the WiMAX turbo code, using either the BCJR algorithm or the fully-parallel algorithm.
Copyright (C) 2013 Robert G. Maunder
The simulation can be started by running the main.m script. This can be modified to either the BCJR algorithm or the fully-parallel algorithm, as well as to the frame length N. As the simulation proceeds, it will gradually plot the BER that can be achieved using various number of decoding iterations, as selected in main.m. A greater number of decoding iterations will give a lower BER. The script main.m can also be modified to make the BER plots smoother and reach lower BERs, at the cost of making the simulation run slower. Platform: |
Size: 13312 |
Author:oudjani |
Hits:
Search - Matlab code BCJR