function[s] = qam16(d,fb,fc,fs,Ac)
% clear; d=randint(1,10,16);fb=500;fc=2000;Ac=1;fs=12000;
N=length(d);M=fs/fb;tb=1/fb;tc=1/fc;Nc=M*tc/tb;
for j = 1:N
if d(j)==0
for i = 1:M
s((j-1)*M+i)=sqrt(18)*Ac*cos(2*pi*(i-1)/Nc+3*pi/4);
end
elseif d(j)==1
for i = 1:M
s((j-1)*M+i)=sqrt(10)*Ac*cos(2*pi*(i-1)/Nc+2.8198);
end
elseif d(j)==2
for i = 1:M
s((j-1)*M+i)=sqrt(10)*Ac*cos(2*pi*(i-1)/Nc-2.8198);
end
elseif d(j)==3
for i = 1:M
s((j-1)*M+i)=sqrt(18)*Ac*cos(2*pi*(i-1)/Nc-3*pi/4);
end
elseif d(j)==4
for i = 1:M
s((j-1)*M+i)=sqrt(10)*Ac*cos(2*pi*(i-1)/Nc+1.8925);
end
elseif d(j)==5
for i = 1:M
s((j-1)*M+i)=sqrt(2)*Ac*cos(2*pi*(i-1)/Nc+3*pi/4);
end
elseif d(j)==6
for i = 1:M
s((j-1)*M+i)=sqrt(2)*Ac*cos(2*pi*(i-1)/Nc-3*pi/4);
end
elseif d(j)==7
for i = 1:M
s((j-1)*M+i)=sqrt(10)*Ac*cos(2*pi*(i-1)/Nc-1.8925);
end
elseif d(j)==8
for i = 1:M
s((j-1)*M+i)=sqrt(10)*Ac*cos(2*pi*(i-1)/Nc+1.2490);
end
elseif d(j)==9
for i = 1:M
s((j-1)*M+i)=sqrt(2)*Ac*cos(2*pi*(i-1)/Nc+pi/4);
end
elseif d(j)==10
for i = 1:M
s((j-1)*M+i)=sqrt(2)*Ac*cos(2*pi*(i-1)/Nc-pi/4);
end
elseif d(j)==11
for i = 1:M
s((j-1)*M+i)=sqrt(10)*Ac*cos(2*pi*(i-1)/Nc-1.2490);
end
elseif d(j)==12
for i = 1:M
s((j-1)*M+i)=sqrt(18)*Ac*cos(2*pi*(i-1)/Nc+pi/4);
end
elseif d(j)==13
for i = 1:M
s((j-1)*M+i)=sqrt(10)*Ac*cos(2*pi*(i-1)/Nc+0.3218);
end
elseif d(j)==14
for i = 1:M
s((j-1)*M+i)=sqrt(10)*Ac*cos(2*pi*(i-1)/Nc-0.3218);
end
else
for i = 1:M
s((j-1)*M+i)=sqrt(18)*Ac*cos(2*pi*(i-1)/Nc-pi/4);
end
end
end
16qam.rar_16QAM OFDM_16qam_16qam modulation_16qam-ofdm_OFDM 16QA
版权申诉
94 浏览量
2022-09-14
20:09:34
上传
评论
收藏 764B RAR 举报
Kinonoyomeo
- 粉丝: 76
- 资源: 1万+
最新资源
- python-leetcode面试题解之第198题打家劫舍-题解.zip
- python-leetcode面试题解之第191题位1的个数-题解.zip
- python-leetcode面试题解之第186题反转字符串中的单词II-题解.zip
- 一个基于python的web后端高性能开发框架,下载可用
- python-leetcode面试题解之第179题最大数-题解.zip
- python-leetcode面试题解之第170题两数之和III数据结构设计-题解.zip
- python-leetcode面试题解之第168题Excel表列名称-题解.zip
- python-leetcode面试题解之第167题两数之和II输入有序数组-题解.zip
- python-leetcode面试题解之第166题分数到小数-题解.zip
- python-leetcode面试题解之第165比较版本号-题解.zip
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈