文件名称:turbo_sys_demo
介绍说明－－下载内容均来自于网络，请自行研究使用
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 fr a me.
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 fr a me.
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 fr a me.
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 fr a me.
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
codes
and
awgn
channel
turbo
AWGN
channel
encoders
max
log
map
turbo
codes
in
awgn
channel
turbo
max
log
map
codes
and
awgn
channel
turbo
AWGN
channel
encoders
max
log
map
turbo
codes
in
awgn
channel
turbo
max
log
map
(系统自动生成,下载前可以参看下载内容)
下载文件列表
turbo_sys_demo.m