- matlab-yycxjk c语言
- gaosi.经纬度与平面坐标高斯正反转换 经纬度与平面坐标高斯正反转换
- GPS.INS.and.integration Wiley global position system inertial navigation system and integration.equation of gps ins and some example of the combination
- DWT 水印源程序
- TrainLamp2013 1） PC软件系统架构：摄像机+USB图像采集卡+PC电脑+RS485模块 2） 嵌入式系统架构： 摄像机+嵌入式系统平台 3） 火车速度<=40KM/H 4） 实现轨道左侧的信号灯颜色检测
- MSP430无人机遥控器程序 该源程序采用MSP430G2553作为核心板
文件名称:turbo_sys_demo
-
所属分类：
- 标签属性：
- 上传时间：2012-09-04
-
文件大小：2.36kb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
This scr ipt 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 scr ipt 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.
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 scr ipt 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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
turbo_sys_demo.m
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。