资源简介
turbo码的exit图

代码片段和文件信息
% BCJR algorithm for a half-rate systematic recursive convolutional code
% having 1 memory element a generator polynomial of [10] and a feedback
% polynomial of [11]. For more information see Section 1.3.2.2 of Rob‘s
% thesis (http://eprints.ecs.soton.ac.uk/14980) or the BCJR paper
% (http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1055186).
% Copyright (C) 2008 Robert G. Maunder
% This program is free software: you can redistribute it and/or modify it
% under the terms of the GNU General Public License as published by the
% Free Software Foundation either version 3 of the License or (at your
% option) any later version.
% This program is distributed in the hope that it will be useful but
% WITHOUT ANY WARRANTY; without even the implied warranty of
% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
% Public License for more details.
% The GNU General Public License can be seen at http://www.gnu.org/licenses/.
function [aposteriori_uncoded_llrs aposteriori_encoded1_llrs aposteriori_encoded2_llrs] = bcjr_decoder(apriori_uncoded_llrs apriori_encoded1_llrs apriori_encoded2_llrs)
if(length(apriori_uncoded_llrs) ~= length(apriori_encoded1_llrs) || length(apriori_encoded1_llrs) ~= length(apriori_encoded2_llrs))
error(‘LLR sequences must have the same length‘);
end
% All calculations are performed in the logarithmic domain in order to
% avoid numerical issues. These occur in the normal domain because some of
% the confidences can get smaller than the smallest number the computer can
% store. See Section 1.3.2.4 of Rob‘s thesis for more information on this.
%
% A multiplication of two confidences is achieved using the addition of the
% corresponding log-confidences. If A = log(a) and B = log(b) then
% log(a*b) = A+B (Equation 1.17 in Rob‘s thesis).
%
% An addition of two confidences is achieved using the Jacobian logarithm
% of the corresponding log-confidences. The Jacobian logarithm is defined
% in the jac.m file. If A = log(a) and B = log(b) then
% log(a+b) = max(AB) + log(1+exp(-abs(A-B))) (Equation 1.19 in Rob‘s
% thesis).
% Matrix to describe the trellis
% Each row describes one transition in the trellis
% Each state is allocated an index 123... Note that this list starts
% from 1 rather than 0.
% FromState ToState UncodedBit Encoded1Bit Encoded2Bit
transitions = [1 1 0 0 0;
1 2 1 1 1;
2 1 1 1 0;
2 2 0 0 1];
% Find the largest state index in the transitions matrix
% In this example we have two states since the code has one memory element
state_count = max(max(transitions(:1))max(transitions(:2)));
% Calc
属性 大小 日期 时间 名称
----------- --------- ---------- ----- ----
文件 1146 2008-08-01 17:49 convolutional_encoder.m
文件 1005 2008-08-01 17:48 generate_llrs.m
文件 1898 2008-08-01 17:48 jac.m
文件 3308 2008-08-01 17:48 main_inner.m
文件 4641 2008-08-01 17:49 main_middle.m
文件 3725 2009-06-22 16:48 main_outer.m
文件 942 2008-08-01 17:48 measure_mutual_information_averaging.m
文件 5356 2008-08-01 17:48 measure_mutual_information_histogram.m
文件 8471 2008-08-01 17:48 bcjr_decoder.m
----------- --------- ---------- ----- ----
30492 9
- 上一篇:代数学引论聂灵沼 丁石孙课件
- 下一篇:螺线管磁场高精度计算方法
相关资源
- TurboMail 3.9.2 注册文件
- turbo码在高斯信道下和衰弱信道下结合
- turbo-jpeg
- turbo pmac2软件参考手册
- turbo c 2.0 64位操作系统也可使用
- Turbo PMAC(PMAC2)软件参考手册中文版
- libjpeg-turbo-1.2.1.tar.gz
- gambit turbo文件编写
- Turbo Photo 简体中文版V6.8原版注册成功
- Turbo C 2.0 实用大全
- Turbo码原理与应用技术
- libjpeg-turbo.rar
- Iterative Error Correction Turbo Low-Density P
- 编码理论 周武旸中国科学技术大学
- Turbo c 2.0 win7 64位完美运行,内置详细
- turbo码编码和解码原理
- Turbo slicer
-
LMMSE Turbo Equalization ba
sed on factor gr - Ansys Turbo Grid 12.0 教程
- Turbo码仿真资源
- 基于FPGA的Turbo码编译码器研究与实现
- 纠错码中turbo码的译码原理 MAP算法
- Visual C TurboC串口通信编程实践(第2版
- ansys turbogrid 使用手册
- turbogrid帮助文件
- turbo.zip turbo全套 吴雨霏理论代码 cc
- Turbo与LDPC编解码及其应用-肖扬
- turbo、LDPC标准编译码函数库。包含多
- TurboCMS内容管理系统
- Visual.Cpp.TurboC串口通信编程实践 (第
评论
共有 条评论